%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : LCL010-1 : TPTP v5.0.0. Released v1.0.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art09.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 : Sat Nov 27 23:16:39 EST 2010 % Result : Unsatisfiable 0.55s % Output : Refutation 0.55s % 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/SystemOnTPTP25751/LCL/LCL010-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 = 1 secs [nr = 3] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 2 ... % t = 1 secs [nr = 141] [nf = 0] [nu = 53] [ut = 45] % Looking for a proof at depth = 3 ... % t = 1 secs [nr = 340] [nf = 5] [nu = 159] [ut = 45] % Looking for a proof at depth = 4 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: ~is_a_theorem_1(equivalent_2(equivalent_2(a_0(),b_0()),equivalent_2(equivalent_2(c_0(),b_0()),equivalent_2(a_0(),c_0())))) % B1: is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x0,x2),equivalent_2(x2,x1)))) % B2: ~is_a_theorem_1(x0) | ~is_a_theorem_1(equivalent_2(x0,x1)) | is_a_theorem_1(x1) % Unit Clauses: % -------------- % U1: < d0 v6 dv3 f5 c0 t11 td4 b > is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x0,x2),equivalent_2(x2,x1)))) % U2: < d2 v6 dv3 f11 c6 t23 td5 > ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x0,x2),equivalent_2(x2,x1))),equivalent_2(equivalent_2(a_0(),b_0()),equivalent_2(equivalent_2(c_0(),b_0()),equivalent_2(a_0(),c_0()))))) % U3: < d2 v8 dv4 f7 c0 t15 td5 > is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0,x1),x2),equivalent_2(x2,equivalent_2(equivalent_2(x0,x3),equivalent_2(x3,x1))))) % U9: < d2 v12 dv6 f17 c6 t35 td6 > ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x0,x2),equivalent_2(x2,x1))),equivalent_2(equivalent_2(equivalent_2(x3,x4),equivalent_2(equivalent_2(x3,x5),equivalent_2(x5,x4))),equivalent_2(equivalent_2(a_0(),b_0()),equivalent_2(equivalent_2(c_0(),b_0()),equivalent_2(a_0(),c_0())))))) % U10: < d2 v18 dv9 f23 c6 t47 td7 > ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x0,x2),equivalent_2(x2,x1))),equivalent_2(equivalent_2(equivalent_2(x3,x4),equivalent_2(equivalent_2(x3,x5),equivalent_2(x5,x4))),equivalent_2(equivalent_2(equivalent_2(x6,x7),equivalent_2(equivalent_2(x6,x8),equivalent_2(x8,x7))),equivalent_2(equivalent_2(a_0(),b_0()),equivalent_2(equivalent_2(c_0(),b_0()),equivalent_2(a_0(),c_0()))))))) % U43: < d2 v10 dv5 f15 c6 t31 td6 > ~is_a_theorem_1(equivalent_2(equivalent_2(x0,equivalent_2(x1,equivalent_2(x0,x1))),equivalent_2(equivalent_2(equivalent_2(x2,x3),equivalent_2(equivalent_2(x2,x4),equivalent_2(x4,x3))),equivalent_2(equivalent_2(a_0(),b_0()),equivalent_2(equivalent_2(c_0(),b_0()),equivalent_2(a_0(),c_0())))))) % U1598: < d4 v10 dv5 f9 c0 t19 td5 > is_a_theorem_1(equivalent_2(equivalent_2(x0,equivalent_2(equivalent_2(x1,x2),equivalent_2(x2,x3))),equivalent_2(equivalent_2(equivalent_2(x1,x3),x4),equivalent_2(x4,x0)))) % U1615: < d4 v10 dv5 f9 c0 t19 td6 > is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0,equivalent_2(x1,x2)),x3),equivalent_2(x3,equivalent_2(equivalent_2(x4,x2),equivalent_2(x0,equivalent_2(x4,x1)))))) % --------------- Start of Proof --------------- % Derivation of unit clause U1: % is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x0,x2),equivalent_2(x2,x1)))) ....... U1 % Derivation of unit clause U2: % ~is_a_theorem_1(equivalent_2(equivalent_2(a_0(),b_0()),equivalent_2(equivalent_2(c_0(),b_0()),equivalent_2(a_0(),c_0())))) ....... B0 % ~is_a_theorem_1(x0) | ~is_a_theorem_1(equivalent_2(x0,x1)) | is_a_theorem_1(x1) ....... B2 % ~is_a_theorem_1(x0) | ~is_a_theorem_1(equivalent_2(x0, equivalent_2(equivalent_2(a_0(), b_0()), equivalent_2(equivalent_2(c_0(), b_0()), equivalent_2(a_0(), c_0()))))) ....... R1 [B0:L0, B2:L2] % is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x0,x2),equivalent_2(x2,x1)))) ....... U1 % ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0, x1), equivalent_2(equivalent_2(x0, x2), equivalent_2(x2, x1))), equivalent_2(equivalent_2(a_0(), b_0()), equivalent_2(equivalent_2(c_0(), b_0()), equivalent_2(a_0(), c_0()))))) ....... R2 [R1:L0, U1:L0] % Derivation of unit clause U3: % is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x0,x2),equivalent_2(x2,x1)))) ....... B1 % ~is_a_theorem_1(x0) | ~is_a_theorem_1(equivalent_2(x0,x1)) | is_a_theorem_1(x1) ....... B2 % ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0, x1), equivalent_2(equivalent_2(x0, x2), equivalent_2(x2, x1))), x3)) | is_a_theorem_1(x3) ....... R1 [B1:L0, B2:L0] % is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x0,x2),equivalent_2(x2,x1)))) ....... U1 % is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0, x1), x2), equivalent_2(x2, equivalent_2(equivalent_2(x0, x3), equivalent_2(x3, x1))))) ....... R2 [R1:L0, U1:L0] % Derivation of unit clause U9: % is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x0,x2),equivalent_2(x2,x1)))) ....... B1 % ~is_a_theorem_1(x0) | ~is_a_theorem_1(equivalent_2(x0,x1)) | is_a_theorem_1(x1) ....... B2 % ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0, x1), equivalent_2(equivalent_2(x0, x2), equivalent_2(x2, x1))), x3)) | is_a_theorem_1(x3) ....... R1 [B1:L0, B2:L0] % ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x0,x2),equivalent_2(x2,x1))),equivalent_2(equivalent_2(a_0(),b_0()),equivalent_2(equivalent_2(c_0(),b_0()),equivalent_2(a_0(),c_0()))))) ....... U2 % ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0, x1), equivalent_2(equivalent_2(x0, x2), equivalent_2(x2, x1))), equivalent_2(equivalent_2(equivalent_2(x3, x4), equivalent_2(equivalent_2(x3, x5), equivalent_2(x5, x4))), equivalent_2(equivalent_2(a_0(), b_0()), equivalent_2(equivalent_2(c_0(), b_0()), equivalent_2(a_0(), c_0())))))) ....... R2 [R1:L1, U2:L0] % Derivation of unit clause U10: % is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x0,x2),equivalent_2(x2,x1)))) ....... B1 % ~is_a_theorem_1(x0) | ~is_a_theorem_1(equivalent_2(x0,x1)) | is_a_theorem_1(x1) ....... B2 % ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0, x1), equivalent_2(equivalent_2(x0, x2), equivalent_2(x2, x1))), x3)) | is_a_theorem_1(x3) ....... R1 [B1:L0, B2:L0] % ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x0,x2),equivalent_2(x2,x1))),equivalent_2(equivalent_2(equivalent_2(x3,x4),equivalent_2(equivalent_2(x3,x5),equivalent_2(x5,x4))),equivalent_2(equivalent_2(a_0(),b_0()),equivalent_2(equivalent_2(c_0(),b_0()),equivalent_2(a_0(),c_0())))))) ....... U9 % ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0, x1), equivalent_2(equivalent_2(x0, x2), equivalent_2(x2, x1))), equivalent_2(equivalent_2(equivalent_2(x3, x4), equivalent_2(equivalent_2(x3, x5), equivalent_2(x5, x4))), equivalent_2(equivalent_2(equivalent_2(x6, x7), equivalent_2(equivalent_2(x6, x8), equivalent_2(x8, x7))), equivalent_2(equivalent_2(a_0(), b_0()), equivalent_2(equivalent_2(c_0(), b_0()), equivalent_2(a_0(), c_0()))))))) ....... R2 [R1:L1, U9:L0] % Derivation of unit clause U43: % is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x0,x2),equivalent_2(x2,x1)))) ....... B1 % ~is_a_theorem_1(x0) | ~is_a_theorem_1(equivalent_2(x0,x1)) | is_a_theorem_1(x1) ....... B2 % ~is_a_theorem_1(equivalent_2(x0, x1)) | is_a_theorem_1(equivalent_2(equivalent_2(x0, x2), equivalent_2(x2, x1))) ....... R1 [B1:L0, B2:L1] % ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x0,x2),equivalent_2(x2,x1))),equivalent_2(equivalent_2(equivalent_2(x3,x4),equivalent_2(equivalent_2(x3,x5),equivalent_2(x5,x4))),equivalent_2(equivalent_2(equivalent_2(x6,x7),equivalent_2(equivalent_2(x6,x8),equivalent_2(x8,x7))),equivalent_2(equivalent_2(a_0(),b_0()),equivalent_2(equivalent_2(c_0(),b_0()),equivalent_2(a_0(),c_0()))))))) ....... U10 % ~is_a_theorem_1(equivalent_2(equivalent_2(x0, equivalent_2(x1, equivalent_2(x0, x1))), equivalent_2(equivalent_2(equivalent_2(x2, x3), equivalent_2(equivalent_2(x2, x4), equivalent_2(x4, x3))), equivalent_2(equivalent_2(a_0(), b_0()), equivalent_2(equivalent_2(c_0(), b_0()), equivalent_2(a_0(), c_0())))))) ....... R2 [R1:L1, U10:L0] % Derivation of unit clause U1598: % is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x0,x2),equivalent_2(x2,x1)))) ....... B1 % ~is_a_theorem_1(x0) | ~is_a_theorem_1(equivalent_2(x0,x1)) | is_a_theorem_1(x1) ....... B2 % ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0, x1), equivalent_2(equivalent_2(x0, x2), equivalent_2(x2, x1))), x3)) | is_a_theorem_1(x3) ....... R1 [B1:L0, B2:L0] % ~is_a_theorem_1(x0) | ~is_a_theorem_1(equivalent_2(x0,x1)) | is_a_theorem_1(x1) ....... B2 % ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0, x1), equivalent_2(equivalent_2(x0, x2), equivalent_2(x2, x1))), x3)) | ~is_a_theorem_1(equivalent_2(x3, x4)) | is_a_theorem_1(x4) ....... R2 [R1:L1, B2:L0] % is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x0,x2),equivalent_2(x2,x1)))) ....... U1 % ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(equivalent_2(x0, x1), x2), equivalent_2(x2, equivalent_2(equivalent_2(x0, x3), equivalent_2(x3, x1)))), x4)) | is_a_theorem_1(x4) ....... R3 [R2:L0, U1:L0] % is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0,x1),x2),equivalent_2(x2,equivalent_2(equivalent_2(x0,x3),equivalent_2(x3,x1))))) ....... U3 % is_a_theorem_1(equivalent_2(equivalent_2(x0, equivalent_2(equivalent_2(x1, x2), equivalent_2(x2, x3))), equivalent_2(equivalent_2(equivalent_2(x1, x3), x4), equivalent_2(x4, x0)))) ....... R4 [R3:L0, U3:L0] % Derivation of unit clause U1615: % is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x0,x2),equivalent_2(x2,x1)))) ....... B1 % ~is_a_theorem_1(x0) | ~is_a_theorem_1(equivalent_2(x0,x1)) | is_a_theorem_1(x1) ....... B2 % ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0, x1), equivalent_2(equivalent_2(x0, x2), equivalent_2(x2, x1))), x3)) | is_a_theorem_1(x3) ....... R1 [B1:L0, B2:L0] % ~is_a_theorem_1(x0) | ~is_a_theorem_1(equivalent_2(x0,x1)) | is_a_theorem_1(x1) ....... B2 % ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0, x1), equivalent_2(equivalent_2(x0, x2), equivalent_2(x2, x1))), x3)) | ~is_a_theorem_1(equivalent_2(x3, x4)) | is_a_theorem_1(x4) ....... R2 [R1:L1, B2:L0] % is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x0,x2),equivalent_2(x2,x1)))) ....... U1 % ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(equivalent_2(x0, x1), x2), equivalent_2(x2, equivalent_2(equivalent_2(x0, x3), equivalent_2(x3, x1)))), x4)) | is_a_theorem_1(x4) ....... R3 [R2:L0, U1:L0] % is_a_theorem_1(equivalent_2(equivalent_2(x0,equivalent_2(equivalent_2(x1,x2),equivalent_2(x2,x3))),equivalent_2(equivalent_2(equivalent_2(x1,x3),x4),equivalent_2(x4,x0)))) ....... U1598 % is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0, equivalent_2(x1, x2)), x3), equivalent_2(x3, equivalent_2(equivalent_2(x4, x2), equivalent_2(x0, equivalent_2(x4, x1)))))) ....... R4 [R3:L0, U1598:L0] % Derivation of the empty clause: % is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0,equivalent_2(x1,x2)),x3),equivalent_2(x3,equivalent_2(equivalent_2(x4,x2),equivalent_2(x0,equivalent_2(x4,x1)))))) ....... U1615 % ~is_a_theorem_1(equivalent_2(equivalent_2(x0,equivalent_2(x1,equivalent_2(x0,x1))),equivalent_2(equivalent_2(equivalent_2(x2,x3),equivalent_2(equivalent_2(x2,x4),equivalent_2(x4,x3))),equivalent_2(equivalent_2(a_0(),b_0()),equivalent_2(equivalent_2(c_0(),b_0()),equivalent_2(a_0(),c_0())))))) ....... U43 % [] ....... R1 [U1615:L0, U43:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 6363 % resolvents: 6354 factors: 9 % Number of unit clauses generated: 6015 % % unit clauses generated to total clauses generated: 94.53 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 2 [2] = 43 [4] = 1571 % Total = 1616 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 6015 [2] = 337 [3] = 11 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] is_a_theorem_1 (+)56 (-)1560 % ------------------ % Total: (+)56 (-)1560 % Total number of unit clauses retained: 1616 % Number of clauses skipped because of their length: 167 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 6381 % Number of unification failures: 9082 % Number of unit to unit unification failures: 85806 % N literal unification failure due to lookup root_id table: 26 % N base clause resolution failure due to lookup table: 0 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 15 % N unit clauses dropped because they exceeded max values: 2773 % N unit clauses dropped because too much nesting: 1559 % 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: 63 % Max term depth in a unit clause: 10 % Number of states in UCFA table: 34957 % Total number of terms of all unit clauses in table: 73420 % Max allowed number of states in UCFA: 528000 % Ratio n states used/total allowed states: 0.07 % Ratio n states used/total unit clauses terms: 0.48 % Number of symbols (columns) in UCFA: 39 % Profile 2: Number of calls to: % ============================== % PTUnify() = 15463 % ConstructUnitClause() = 4387 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.00 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 1 secs % CPU time: 0.54 secs % %------------------------------------------------------------------------------