| 1 |
; COMMAND-LINE: --finite-model-find |
| 2 |
; COMMAND-LINE: --finite-model-find --sort-inference |
| 3 |
; EXPECT: sat |
| 4 |
;%-------------------------------------------------------------------------- |
| 5 |
;% File : ALG008-1 : TPTP v5.4.0. Released v2.2.0. |
| 6 |
;% Domain : General Algebra |
| 7 |
;% Problem : TC + right identity does not give RC. |
| 8 |
;% Version : [MP96] (equality) axioms : Especial. |
| 9 |
;% English : An algebra with a right identity satisfying the Thomsen |
| 10 |
;% Closure (RC) condition does not necessarily satisfy the |
| 11 |
;% Reidemeister Closure (RC) condition. |
| 12 |
|
| 13 |
;% Refs : [McC98] McCune (1998), Email to G. Sutcliffe |
| 14 |
;% : [MP96] McCune & Padmanabhan (1996), Automated Deduction in Eq |
| 15 |
;% Source : [McC98] |
| 16 |
;% Names : TC-3 [MP96] |
| 17 |
|
| 18 |
;% Status : Satisfiable |
| 19 |
;% Rating : 0.50 v5.4.0, 0.80 v5.3.0, 0.78 v5.2.0, 0.80 v5.0.0, 0.78 v4.1.0, 0.71 v4.0.1, 0.80 v4.0.0, 0.50 v3.7.0, 0.33 v3.4.0, 0.50 v3.3.0, 0.33 v3.2.0, 0.80 v3.1.0, 0.67 v2.7.0, 0.33 v2.6.0, 0.86 v2.5.0, 0.50 v2.4.0, 0.67 v2.3.0, 1.00 v2.2.1 |
| 20 |
;% Syntax : Number of clauses : 6 ( 0 non-Horn; 5 unit; 5 RR) |
| 21 |
;% Number of atoms : 10 ( 10 equality) |
| 22 |
;% Maximal clause size : 5 ( 2 average) |
| 23 |
;% Number of predicates : 1 ( 0 propositional; 2-2 arity) |
| 24 |
;% Number of functors : 9 ( 8 constant; 0-2 arity) |
| 25 |
;% Number of variables : 9 ( 0 singleton) |
| 26 |
;% Maximal term depth : 2 ( 2 average) |
| 27 |
;% SPC : CNF_SAT_RFO_EQU_NUE |
| 28 |
|
| 29 |
;% Comments : The smallest model has 3 elements. |
| 30 |
;%-------------------------------------------------------------------------- |
| 31 |
;%----Thomsen Closure (TC) condition: |
| 32 |
(set-logic UF) |
| 33 |
(set-info :status sat) |
| 34 |
(declare-sort sort__smt2 0) |
| 35 |
; functions |
| 36 |
(declare-fun multiply__smt2_2 ( sort__smt2 sort__smt2 ) sort__smt2) |
| 37 |
(declare-fun identity__smt2_0 ( ) sort__smt2) |
| 38 |
(declare-fun c4__smt2_0 ( ) sort__smt2) |
| 39 |
(declare-fun a__smt2_0 ( ) sort__smt2) |
| 40 |
(declare-fun c3__smt2_0 ( ) sort__smt2) |
| 41 |
(declare-fun b__smt2_0 ( ) sort__smt2) |
| 42 |
(declare-fun c2__smt2_0 ( ) sort__smt2) |
| 43 |
(declare-fun c1__smt2_0 ( ) sort__smt2) |
| 44 |
(declare-fun f__smt2_0 ( ) sort__smt2) |
| 45 |
; predicates |
| 46 |
|
| 47 |
; thomsen_closure axiom |
| 48 |
(assert (forall ((?V7 sort__smt2) (?V6 sort__smt2) (?W sort__smt2) (?V sort__smt2) (?U sort__smt2) (?Z sort__smt2) (?Y sort__smt2) (?X sort__smt2)) |
| 49 |
(or (not (= (multiply__smt2_2 ?X ?Y) ?Z)) |
| 50 |
(not (= (multiply__smt2_2 ?U ?V) ?Z)) |
| 51 |
(not (= (multiply__smt2_2 ?X ?W) ?V6)) |
| 52 |
(not (= (multiply__smt2_2 ?V7 ?V) ?V6)) |
| 53 |
(= (multiply__smt2_2 ?U ?W) (multiply__smt2_2 ?V7 ?Y)))) ) |
| 54 |
|
| 55 |
;%----Right identity: |
| 56 |
; right_identity axiom |
| 57 |
(assert (forall ((?X sort__smt2)) (= (multiply__smt2_2 ?X identity__smt2_0) ?X)) ) |
| 58 |
|
| 59 |
;%----Denial of Reidimeister Closure (RC) condidition. |
| 60 |
; prove_reidimeister1 negated_conjecture |
| 61 |
(assert (= (multiply__smt2_2 c4__smt2_0 a__smt2_0) (multiply__smt2_2 c3__smt2_0 b__smt2_0)) ) |
| 62 |
|
| 63 |
; prove_reidimeister2 negated_conjecture |
| 64 |
(assert (= (multiply__smt2_2 c2__smt2_0 a__smt2_0) (multiply__smt2_2 c1__smt2_0 b__smt2_0)) ) |
| 65 |
|
| 66 |
; prove_reidimeister3 negated_conjecture |
| 67 |
(assert (= (multiply__smt2_2 c4__smt2_0 f__smt2_0) (multiply__smt2_2 c3__smt2_0 identity__smt2_0)) ) |
| 68 |
|
| 69 |
; prove_reidimeister4 negated_conjecture |
| 70 |
(assert (not (= (multiply__smt2_2 c2__smt2_0 f__smt2_0) (multiply__smt2_2 c1__smt2_0 identity__smt2_0))) ) |
| 71 |
|
| 72 |
|
| 73 |
(check-sat) |