%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : PUZ032-1 : TPTP v5.0.0. Released v1.0.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art05.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 04:00:08 EST 2010 % Result : Unsatisfiable 0.38s % Output : Refutation 0.38s % 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/SystemOnTPTP23950/PUZ/PUZ032-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 = 26] [nf = 0] [nu = 3] [ut = 5] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 167] [nf = 6] [nu = 31] [ut = 13] % Looking for a proof at depth = 3 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: ~a_truth_1(truthteller_1(c_0())) % B3: a_truth_1(says_2(b_0(),says_2(a_0(),liar_1(a_0())))) % B4: a_truth_1(truthteller_1(x0)) | a_truth_1(liar_1(x0)) % B6: ~a_truth_1(x1) | ~a_truth_1(says_2(x0,x1)) | ~a_truth_1(liar_1(x0)) % B7: ~a_truth_1(says_2(x1,x0)) | ~a_truth_1(x0) | a_truth_1(truthteller_1(x1)) % B8: ~a_truth_1(says_2(x1,x0)) | a_truth_1(x0) | a_truth_1(liar_1(x1)) % B9: ~a_truth_1(says_2(x0,x1)) | ~a_truth_1(truthteller_1(x0)) | a_truth_1(x1) % Unit Clauses: % -------------- % U2: < d0 v0 dv0 f2 c2 t4 td3 b > a_truth_1(says_2(c_0(),liar_1(b_0()))) % U5: < d2 v0 dv0 f1 c1 t2 td2 > ~a_truth_1(liar_1(b_0())) % U11: < d2 v0 dv0 f2 c2 t4 td3 > a_truth_1(says_2(a_0(),liar_1(a_0()))) % U12: < d2 v0 dv0 f1 c1 t2 td2 > ~a_truth_1(liar_1(a_0())) % U21: < d3 v0 dv0 f1 c1 t2 td2 > a_truth_1(liar_1(a_0())) % --------------- Start of Proof --------------- % Derivation of unit clause U2: % a_truth_1(says_2(c_0(),liar_1(b_0()))) ....... U2 % Derivation of unit clause U5: % ~a_truth_1(truthteller_1(c_0())) ....... B0 % ~a_truth_1(says_2(x1,x0)) | ~a_truth_1(x0) | a_truth_1(truthteller_1(x1)) ....... B7 % ~a_truth_1(says_2(c_0(), x0)) | ~a_truth_1(x0) ....... R1 [B0:L0, B7:L2] % a_truth_1(says_2(c_0(),liar_1(b_0()))) ....... U2 % ~a_truth_1(liar_1(b_0())) ....... R2 [R1:L0, U2:L0] % Derivation of unit clause U11: % a_truth_1(says_2(b_0(),says_2(a_0(),liar_1(a_0())))) ....... B3 % ~a_truth_1(says_2(x1,x0)) | a_truth_1(x0) | a_truth_1(liar_1(x1)) ....... B8 % a_truth_1(says_2(a_0(), liar_1(a_0()))) | a_truth_1(liar_1(b_0())) ....... R1 [B3:L0, B8:L0] % ~a_truth_1(liar_1(b_0())) ....... U5 % a_truth_1(says_2(a_0(), liar_1(a_0()))) ....... R2 [R1:L1, U5:L0] % Derivation of unit clause U12: % ~a_truth_1(x1) | ~a_truth_1(says_2(x0,x1)) | ~a_truth_1(liar_1(x0)) ....... B6 % ~a_truth_1(liar_1(x0)) | ~a_truth_1(says_2(x0, liar_1(x0))) ....... R1 [B6:L0, B6:L2] % a_truth_1(says_2(a_0(),liar_1(a_0()))) ....... U11 % ~a_truth_1(liar_1(a_0())) ....... R2 [R1:L1, U11:L0] % Derivation of unit clause U21: % a_truth_1(truthteller_1(x0)) | a_truth_1(liar_1(x0)) ....... B4 % ~a_truth_1(says_2(x0,x1)) | ~a_truth_1(truthteller_1(x0)) | a_truth_1(x1) ....... B9 % a_truth_1(liar_1(x0)) | ~a_truth_1(says_2(x0, x1)) | a_truth_1(x1) ....... R1 [B4:L0, B9:L1] % ~a_truth_1(says_2(x0, liar_1(x0))) | a_truth_1(liar_1(x0)) ....... R2 [R1:L0, R1:L2] % a_truth_1(says_2(a_0(),liar_1(a_0()))) ....... U11 % a_truth_1(liar_1(a_0())) ....... R3 [R2:L0, U11:L0] % Derivation of the empty clause: % a_truth_1(liar_1(a_0())) ....... U21 % ~a_truth_1(liar_1(a_0())) ....... U12 % [] ....... R1 [U21:L0, U12:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 624 % resolvents: 583 factors: 41 % Number of unit clauses generated: 143 % % unit clauses generated to total clauses generated: 22.92 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 4 [1] = 1 [2] = 8 [3] = 9 % Total = 22 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 143 [2] = 322 [3] = 159 % Average size of a generated clause: 3.0 % Number of unit clauses per predicate list: % ========================================== % [0] a_truth_1 (+)9 (-)13 % ------------------ % Total: (+)9 (-)13 % Total number of unit clauses retained: 22 % Number of clauses skipped because of their length: 493 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 633 % Number of unification failures: 953 % Number of unit to unit unification failures: 111 % N literal unification failure due to lookup root_id table: 2086 % N base clause resolution failure due to lookup table: 166 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 4 % N unit clauses dropped because they exceeded max values: 88 % 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: 8 % Max term depth in a unit clause: 5 % Number of states in UCFA table: 35 % Total number of terms of all unit clauses in table: 80 % Max allowed number of states in UCFA: 528000 % Ratio n states used/total allowed states: 0.00 % Ratio n states used/total unit clauses terms: 0.44 % Number of symbols (columns) in UCFA: 42 % Profile 2: Number of calls to: % ============================== % PTUnify() = 1586 % ConstructUnitClause() = 106 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.00 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 0 secs % CPU time: 0.37 secs % %------------------------------------------------------------------------------