%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : PUZ027-1 : TPTP v5.0.0. Released v1.0.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art03.cs.miami.edu % Model : i686 i686 % CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz % Memory : 2018MB % OS : Linux 2.6.26.8-57.fc8 % CPULimit : 300s % DateTime : Sun Nov 28 03:57:36 EST 2010 % Result : Unsatisfiable 0.17s % Output : Refutation 0.17s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % Command entered: % /home/graph/tptp/Systems/CARINE---0.734/carine /tmp/SystemOnTPTP22167/PUZ/PUZ027-1+noeq.car t=300 xo=off uct=32000 % CARINE version 0.734 (Dec 2003) % Initializing tables ... done. % Parsing ................................ done. % Calculating time slices ... done. % Building Lookup Tables ... done. % Looking for a proof at depth = 1 ... % t = 0 secs [nr = 23] [nf = 0] [nu = 3] [ut = 5] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 119] [nf = 9] [nu = 8] [ut = 5] % Looking for a proof at depth = 3 ... % t = 0 secs [nr = 478] [nf = 39] [nu = 19] [ut = 6] % Looking for a proof at depth = 4 ... % t = 0 secs [nr = 1811] [nf = 175] [nu = 57] [ut = 7] % Looking for a proof at depth = 5 ... % t = 0 secs [nr = 6953] [nf = 694] [nu = 231] [ut = 13] % Looking for a proof at depth = 6 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: ~answer_1(x0) % B2: a_truth_1(says_2(a_0(),lower_2(a_0(),b_0()))) % B3: a_truth_1(says_2(b_0(),not_lower_2(a_0(),b_0()))) % B11: ~a_truth_1(x1) | ~a_truth_1(says_2(x0,x1)) | ~a_truth_1(liar_1(x0)) % B12: ~a_truth_1(says_2(x0,x1)) | ~a_truth_1(truthteller_1(x0)) | a_truth_1(x1) % B17: ~a_truth_1(truthteller_1(b_0())) | ~a_truth_1(liar_1(a_0())) | answer_1(a_liar_b_truthteller_0()) % B18: ~a_truth_1(truthteller_1(b_0())) | ~a_truth_1(normal_1(a_0())) | answer_1(a_normal_b_truthteller_0()) % B22: ~a_truth_1(normal_1(b_0())) | ~a_truth_1(truthteller_1(a_0())) | answer_1(a_truthteller_b_normal_0()) % Unit Clauses: % -------------- % U0: < d0 v1 dv1 f0 c0 t1 td1 b nc > ~answer_1(x0) % U5: < d3 v0 dv0 f1 c1 t2 td2 > ~a_truth_1(truthteller_1(a_0())) % U6: < d4 v0 dv0 f1 c1 t2 td2 > ~a_truth_1(liar_1(b_0())) % U13: < d6 v0 dv0 f1 c1 t2 td2 > ~a_truth_1(liar_1(a_0())) % U16: < d6 v0 dv0 f1 c1 t2 td2 > a_truth_1(normal_1(b_0())) % U17: < d6 v0 dv0 f1 c1 t2 td2 > ~a_truth_1(normal_1(a_0())) % U29: < d6 v0 dv0 f0 c1 t1 td1 > answer_1(a_liar_b_normal_0()) % --------------- Start of Proof --------------- % Derivation of unit clause U0: % ~answer_1(x0) ....... U0 % Derivation of unit clause U5: % a_truth_1(says_2(a_0(),lower_2(a_0(),b_0()))) ....... B2 % ~a_truth_1(says_2(x0,x1)) | ~a_truth_1(truthteller_1(x0)) | a_truth_1(x1) ....... B12 % ~a_truth_1(truthteller_1(a_0())) | a_truth_1(lower_2(a_0(), b_0())) ....... R1 [B2:L0, B12:L0] % ~a_truth_1(truthteller_1(x0)) | ~a_truth_1(lower_2(x0,x1)) ....... B4 % ~a_truth_1(truthteller_1(a_0())) | ~a_truth_1(truthteller_1(a_0())) ....... R2 [R1:L1, B4:L1] % ~a_truth_1(truthteller_1(a_0())) ....... R3 [R2:L0, R2:L1] % Derivation of unit clause U6: % a_truth_1(says_2(b_0(),not_lower_2(a_0(),b_0()))) ....... B3 % ~a_truth_1(x1) | ~a_truth_1(says_2(x0,x1)) | ~a_truth_1(liar_1(x0)) ....... B11 % ~a_truth_1(not_lower_2(a_0(), b_0())) | ~a_truth_1(liar_1(b_0())) ....... R1 [B3:L0, B11:L1] % a_truth_1(not_lower_2(x0,x1)) | a_truth_1(lower_2(x0,x1)) ....... B6 % ~a_truth_1(liar_1(b_0())) | a_truth_1(lower_2(a_0(), b_0())) ....... R2 [R1:L0, B6:L0] % ~a_truth_1(liar_1(x1)) | ~a_truth_1(lower_2(x0,x1)) ....... B5 % ~a_truth_1(liar_1(b_0())) | ~a_truth_1(liar_1(b_0())) ....... R3 [R2:L1, B5:L1] % ~a_truth_1(liar_1(b_0())) ....... R4 [R3:L0, R3:L1] % Derivation of unit clause U13: % ~answer_1(x0) ....... B0 % ~a_truth_1(truthteller_1(b_0())) | ~a_truth_1(liar_1(a_0())) | answer_1(a_liar_b_truthteller_0()) ....... B17 % ~a_truth_1(truthteller_1(b_0())) | ~a_truth_1(liar_1(a_0())) ....... R1 [B0:L0, B17:L2] % a_truth_1(truthteller_1(x0)) | a_truth_1(liar_1(x0)) | a_truth_1(normal_1(x0)) ....... B15 % ~a_truth_1(liar_1(a_0())) | a_truth_1(liar_1(b_0())) | a_truth_1(normal_1(b_0())) ....... R2 [R1:L0, B15:L0] % ~a_truth_1(liar_1(b_0())) ....... U6 % ~a_truth_1(liar_1(a_0())) | a_truth_1(normal_1(b_0())) ....... R3 [R2:L1, U6:L0] % ~a_truth_1(normal_1(b_0())) | ~a_truth_1(liar_1(a_0())) | answer_1(a_liar_b_normal_0()) ....... B23 % ~a_truth_1(liar_1(a_0())) | ~a_truth_1(liar_1(a_0())) | answer_1(a_liar_b_normal_0()) ....... R4 [R3:L1, B23:L0] % ~a_truth_1(liar_1(a_0())) | answer_1(a_liar_b_normal_0()) ....... R5 [R4:L0, R4:L1] % ~answer_1(x0) ....... U0 % ~a_truth_1(liar_1(a_0())) ....... R6 [R5:L1, U0:L0] % Derivation of unit clause U16: % ~answer_1(x0) ....... B0 % ~a_truth_1(truthteller_1(b_0())) | ~a_truth_1(normal_1(a_0())) | answer_1(a_normal_b_truthteller_0()) ....... B18 % ~a_truth_1(truthteller_1(b_0())) | ~a_truth_1(normal_1(a_0())) ....... R1 [B0:L0, B18:L2] % a_truth_1(truthteller_1(x0)) | a_truth_1(liar_1(x0)) | a_truth_1(normal_1(x0)) ....... B15 % ~a_truth_1(normal_1(a_0())) | a_truth_1(liar_1(b_0())) | a_truth_1(normal_1(b_0())) ....... R2 [R1:L0, B15:L0] % ~a_truth_1(liar_1(b_0())) ....... U6 % ~a_truth_1(normal_1(a_0())) | a_truth_1(normal_1(b_0())) ....... R3 [R2:L1, U6:L0] % a_truth_1(truthteller_1(x0)) | a_truth_1(liar_1(x0)) | a_truth_1(normal_1(x0)) ....... B15 % a_truth_1(normal_1(b_0())) | a_truth_1(truthteller_1(a_0())) | a_truth_1(liar_1(a_0())) ....... R4 [R3:L0, B15:L2] % ~a_truth_1(truthteller_1(a_0())) ....... U5 % a_truth_1(normal_1(b_0())) | a_truth_1(liar_1(a_0())) ....... R5 [R4:L1, U5:L0] % ~a_truth_1(liar_1(a_0())) ....... U13 % a_truth_1(normal_1(b_0())) ....... R6 [R5:L1, U13:L0] % Derivation of unit clause U17: % ~answer_1(x0) ....... B0 % ~a_truth_1(truthteller_1(b_0())) | ~a_truth_1(normal_1(a_0())) | answer_1(a_normal_b_truthteller_0()) ....... B18 % ~a_truth_1(truthteller_1(b_0())) | ~a_truth_1(normal_1(a_0())) ....... R1 [B0:L0, B18:L2] % a_truth_1(truthteller_1(x0)) | a_truth_1(liar_1(x0)) | a_truth_1(normal_1(x0)) ....... B15 % ~a_truth_1(normal_1(a_0())) | a_truth_1(liar_1(b_0())) | a_truth_1(normal_1(b_0())) ....... R2 [R1:L0, B15:L0] % ~a_truth_1(liar_1(b_0())) ....... U6 % ~a_truth_1(normal_1(a_0())) | a_truth_1(normal_1(b_0())) ....... R3 [R2:L1, U6:L0] % ~a_truth_1(normal_1(b_0())) | ~a_truth_1(normal_1(a_0())) | answer_1(a_and_b_normal_0()) ....... B24 % ~a_truth_1(normal_1(a_0())) | ~a_truth_1(normal_1(a_0())) | answer_1(a_and_b_normal_0()) ....... R4 [R3:L1, B24:L0] % ~a_truth_1(normal_1(a_0())) | answer_1(a_and_b_normal_0()) ....... R5 [R4:L0, R4:L1] % ~answer_1(x0) ....... U0 % ~a_truth_1(normal_1(a_0())) ....... R6 [R5:L1, U0:L0] % Derivation of unit clause U29: % ~answer_1(x0) ....... B0 % ~a_truth_1(normal_1(b_0())) | ~a_truth_1(truthteller_1(a_0())) | answer_1(a_truthteller_b_normal_0()) ....... B22 % ~a_truth_1(normal_1(b_0())) | ~a_truth_1(truthteller_1(a_0())) ....... R1 [B0:L0, B22:L2] % a_truth_1(truthteller_1(x0)) | a_truth_1(liar_1(x0)) | a_truth_1(normal_1(x0)) ....... B15 % ~a_truth_1(normal_1(b_0())) | a_truth_1(liar_1(a_0())) | a_truth_1(normal_1(a_0())) ....... R2 [R1:L1, B15:L0] % a_truth_1(normal_1(b_0())) ....... U16 % a_truth_1(liar_1(a_0())) | a_truth_1(normal_1(a_0())) ....... R3 [R2:L0, U16:L0] % ~a_truth_1(normal_1(b_0())) | ~a_truth_1(liar_1(a_0())) | answer_1(a_liar_b_normal_0()) ....... B23 % a_truth_1(normal_1(a_0())) | ~a_truth_1(normal_1(b_0())) | answer_1(a_liar_b_normal_0()) ....... R4 [R3:L0, B23:L1] % ~a_truth_1(normal_1(a_0())) ....... U17 % ~a_truth_1(normal_1(b_0())) | answer_1(a_liar_b_normal_0()) ....... R5 [R4:L0, U17:L0] % a_truth_1(normal_1(b_0())) ....... U16 % answer_1(a_liar_b_normal_0()) ....... R6 [R5:L0, U16:L0] % Derivation of the empty clause: % answer_1(a_liar_b_normal_0()) ....... U29 % ~answer_1(x0) ....... U0 % [] ....... R1 [U29:L0, U0:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 10207 % resolvents: 9310 factors: 897 % Number of unit clauses generated: 402 % % unit clauses generated to total clauses generated: 3.94 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 4 [1] = 1 [3] = 1 % [4] = 1 [5] = 6 [6] = 17 % Total = 30 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 402 [2] = 4007 [3] = 5798 % Average size of a generated clause: 3.0 % Number of unit clauses per predicate list: % ========================================== % [0] a_truth_1 (+)8 (-)20 % [1] answer_1 (+)1 (-)1 % ------------------ % Total: (+)9 (-)21 % Total number of unit clauses retained: 30 % Number of clauses skipped because of their length: 23433 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 4677 % Number of successful unifications: 10238 % Number of unification failures: 5588 % Number of unit to unit unification failures: 160 % N literal unification failure due to lookup root_id table: 99507 % N base clause resolution failure due to lookup table: 40730 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 10 % N unit clauses dropped because they exceeded max values: 241 % N unit clauses dropped because too much nesting: 0 % N unit clauses not constrcuted because table was full: 0 % N unit clauses dropped because UCFA table was full: 0 % Max number of terms in a unit clause: 7 % Max term depth in a unit clause: 4 % Number of states in UCFA table: 42 % Total number of terms of all unit clauses in table: 105 % Max allowed number of states in UCFA: 72000 % Ratio n states used/total allowed states: 0.00 % Ratio n states used/total unit clauses terms: 0.40 % Number of symbols (columns) in UCFA: 53 % Profile 2: Number of calls to: % ============================== % PTUnify() = 15826 % ConstructUnitClause() = 267 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.00 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 0 secs % CPU time: 0.17 secs % %------------------------------------------------------------------------------