%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : LCL023-1 : TPTP v5.0.0. Released v1.0.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art01.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:21:48 EST 2010 % Result : Unsatisfiable 0.39s % Output : Refutation 0.39s % 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/SystemOnTPTP8419/LCL/LCL023-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 = 90] [nf = 0] [nu = 37] [ut = 32] % Looking for a proof at depth = 3 ... % t = 1 secs [nr = 224] [nf = 5] [nu = 113] [ut = 32] % 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(),equivalent_2(b_0(),c_0())),equivalent_2(equivalent_2(a_0(),b_0()),c_0()))) % B1: is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x2,x1),equivalent_2(x0,x2)))) % 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(x2,x1),equivalent_2(x0,x2)))) % U3: < d2 v8 dv4 f7 c0 t15 td5 > is_a_theorem_1(equivalent_2(equivalent_2(x0,equivalent_2(equivalent_2(x1,x2),equivalent_2(x3,x1))),equivalent_2(equivalent_2(x3,x2),x0))) % U4: < d2 v4 dv2 f3 c0 t7 td3 > is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(x0,x1))) % U9: < d2 v6 dv3 f5 c0 t11 td4 > is_a_theorem_1(equivalent_2(equivalent_2(x0,equivalent_2(x1,x2)),equivalent_2(equivalent_2(x1,x2),x0))) % U11: < d2 v8 dv4 f7 c0 t15 td5 > is_a_theorem_1(equivalent_2(equivalent_2(x0,equivalent_2(equivalent_2(x1,x2),x3)),equivalent_2(equivalent_2(x3,equivalent_2(x1,x2)),x0))) % U80: < d4 v6 dv3 f11 c6 t23 td5 > ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x2,x1),equivalent_2(x0,x2))),equivalent_2(equivalent_2(equivalent_2(a_0(),b_0()),c_0()),equivalent_2(equivalent_2(b_0(),c_0()),a_0())))) % U546: < d4 v8 dv4 f7 c0 t15 td5 > is_a_theorem_1(equivalent_2(equivalent_2(x0,equivalent_2(x1,x2)),equivalent_2(x0,equivalent_2(equivalent_2(x3,x2),equivalent_2(x1,x3))))) % U554: < d4 v10 dv5 f9 c0 t19 td5 > is_a_theorem_1(equivalent_2(equivalent_2(x0,equivalent_2(equivalent_2(x1,x2),equivalent_2(x3,x1))),equivalent_2(equivalent_2(x4,x0),equivalent_2(equivalent_2(x3,x2),x4)))) % U561: < d4 v10 dv5 f9 c0 t19 td6 > is_a_theorem_1(equivalent_2(equivalent_2(x0,equivalent_2(equivalent_2(x1,x2),equivalent_2(equivalent_2(x3,x4),equivalent_2(x2,x3)))),equivalent_2(equivalent_2(x1,x4),x0))) % --------------- Start of Proof --------------- % Derivation of unit clause U1: % is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x2,x1),equivalent_2(x0,x2)))) ....... U1 % Derivation of unit clause U3: % is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x2,x1),equivalent_2(x0,x2)))) ....... 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(x2, x1), equivalent_2(x0, x2))), 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(x2,x1),equivalent_2(x0,x2)))) ....... U1 % is_a_theorem_1(equivalent_2(equivalent_2(x0, equivalent_2(equivalent_2(x1, x2), equivalent_2(x3, x1))), equivalent_2(equivalent_2(x3, x2), x0))) ....... R2 [R1:L0, U1:L0] % Derivation of unit clause U4: % is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x2,x1),equivalent_2(x0,x2)))) ....... 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(x2, x1), equivalent_2(x0, x2))), x3)) | is_a_theorem_1(x3) ....... R1 [B1:L0, B2:L0] % is_a_theorem_1(equivalent_2(equivalent_2(x0,equivalent_2(equivalent_2(x1,x2),equivalent_2(x3,x1))),equivalent_2(equivalent_2(x3,x2),x0))) ....... U3 % is_a_theorem_1(equivalent_2(equivalent_2(x0, x1), equivalent_2(x0, x1))) ....... R2 [R1:L0, U3:L0] % Derivation of unit clause U9: % is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x2,x1),equivalent_2(x0,x2)))) ....... 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(x2, x1), equivalent_2(x0, x2))) ....... R1 [B1:L0, B2:L1] % is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(x0,x1))) ....... U4 % is_a_theorem_1(equivalent_2(equivalent_2(x0, equivalent_2(x1, x2)), equivalent_2(equivalent_2(x1, x2), x0))) ....... R2 [R1:L0, U4:L0] % Derivation of unit clause U11: % is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x2,x1),equivalent_2(x0,x2)))) ....... 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(x2, x1), equivalent_2(x0, x2))) ....... R1 [B1:L0, B2:L1] % is_a_theorem_1(equivalent_2(equivalent_2(x0,equivalent_2(x1,x2)),equivalent_2(equivalent_2(x1,x2),x0))) ....... U9 % is_a_theorem_1(equivalent_2(equivalent_2(x0, equivalent_2(equivalent_2(x1, x2), x3)), equivalent_2(equivalent_2(x3, equivalent_2(x1, x2)), x0))) ....... R2 [R1:L0, U9:L0] % Derivation of unit clause U80: % ~is_a_theorem_1(equivalent_2(equivalent_2(a_0(),equivalent_2(b_0(),c_0())),equivalent_2(equivalent_2(a_0(),b_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(), equivalent_2(b_0(), c_0())), equivalent_2(equivalent_2(a_0(), b_0()), c_0())))) ....... R1 [B0:L0, B2:L2] % ~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, equivalent_2(equivalent_2(a_0(), equivalent_2(b_0(), c_0())), equivalent_2(equivalent_2(a_0(), b_0()), c_0())))) | ~is_a_theorem_1(x1) | ~is_a_theorem_1(equivalent_2(x1, x0)) ....... R2 [R1:L0, B2:L2] % is_a_theorem_1(equivalent_2(equivalent_2(x0,equivalent_2(equivalent_2(x1,x2),x3)),equivalent_2(equivalent_2(x3,equivalent_2(x1,x2)),x0))) ....... U11 % ~is_a_theorem_1(x0) | ~is_a_theorem_1(equivalent_2(x0, equivalent_2(equivalent_2(equivalent_2(a_0(), b_0()), c_0()), equivalent_2(equivalent_2(b_0(), c_0()), a_0())))) ....... R3 [R2:L0, U11:L0] % is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x2,x1),equivalent_2(x0,x2)))) ....... U1 % ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0, x1), equivalent_2(equivalent_2(x2, x1), equivalent_2(x0, x2))), equivalent_2(equivalent_2(equivalent_2(a_0(), b_0()), c_0()), equivalent_2(equivalent_2(b_0(), c_0()), a_0())))) ....... R4 [R3:L0, U1:L0] % Derivation of unit clause U546: % is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x2,x1),equivalent_2(x0,x2)))) ....... 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(x2, x1), equivalent_2(x0, x2))), 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(x2, x1), equivalent_2(x0, x2))), 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(x2,x1),equivalent_2(x0,x2)))) ....... U1 % ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0, equivalent_2(equivalent_2(x1, x2), equivalent_2(x3, x1))), equivalent_2(equivalent_2(x3, x2), x0)), 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),x3)),equivalent_2(equivalent_2(x3,equivalent_2(x1,x2)),x0))) ....... U11 % is_a_theorem_1(equivalent_2(equivalent_2(x0, equivalent_2(x1, x2)), equivalent_2(x0, equivalent_2(equivalent_2(x3, x2), equivalent_2(x1, x3))))) ....... R4 [R3:L0, U11:L0] % Derivation of unit clause U554: % is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x2,x1),equivalent_2(x0,x2)))) ....... 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(x2, x1), equivalent_2(x0, x2))), 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(x2, x1), equivalent_2(x0, x2))), 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(x2,x1),equivalent_2(x0,x2)))) ....... U1 % ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0, equivalent_2(equivalent_2(x1, x2), equivalent_2(x3, x1))), equivalent_2(equivalent_2(x3, x2), x0)), x4)) | is_a_theorem_1(x4) ....... R3 [R2:L0, U1:L0] % is_a_theorem_1(equivalent_2(equivalent_2(x0,equivalent_2(x1,x2)),equivalent_2(x0,equivalent_2(equivalent_2(x3,x2),equivalent_2(x1,x3))))) ....... U546 % is_a_theorem_1(equivalent_2(equivalent_2(x0, equivalent_2(equivalent_2(x1, x2), equivalent_2(x3, x1))), equivalent_2(equivalent_2(x4, x0), equivalent_2(equivalent_2(x3, x2), x4)))) ....... R4 [R3:L0, U546:L0] % Derivation of unit clause U561: % is_a_theorem_1(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x2,x1),equivalent_2(x0,x2)))) ....... 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(x2, x1), equivalent_2(x0, x2))), 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(x2, x1), equivalent_2(x0, x2))), 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(x2,x1),equivalent_2(x0,x2)))) ....... U1 % ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0, equivalent_2(equivalent_2(x1, x2), equivalent_2(x3, x1))), equivalent_2(equivalent_2(x3, x2), x0)), 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(x3,x1))),equivalent_2(equivalent_2(x4,x0),equivalent_2(equivalent_2(x3,x2),x4)))) ....... U554 % is_a_theorem_1(equivalent_2(equivalent_2(x0, equivalent_2(equivalent_2(x1, x2), equivalent_2(equivalent_2(x3, x4), equivalent_2(x2, x3)))), equivalent_2(equivalent_2(x1, x4), x0))) ....... R4 [R3:L0, U554:L0] % Derivation of the empty clause: % is_a_theorem_1(equivalent_2(equivalent_2(x0,equivalent_2(equivalent_2(x1,x2),equivalent_2(equivalent_2(x3,x4),equivalent_2(x2,x3)))),equivalent_2(equivalent_2(x1,x4),x0))) ....... U561 % ~is_a_theorem_1(equivalent_2(equivalent_2(equivalent_2(x0,x1),equivalent_2(equivalent_2(x2,x1),equivalent_2(x0,x2))),equivalent_2(equivalent_2(equivalent_2(a_0(),b_0()),c_0()),equivalent_2(equivalent_2(b_0(),c_0()),a_0())))) ....... U80 % [] ....... R1 [U561:L0, U80:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 2289 % resolvents: 2280 factors: 9 % Number of unit clauses generated: 2084 % % unit clauses generated to total clauses generated: 91.04 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 2 [2] = 30 [4] = 530 % Total = 562 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 2084 [2] = 194 [3] = 11 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] is_a_theorem_1 (+)35 (-)527 % ------------------ % Total: (+)35 (-)527 % Total number of unit clauses retained: 562 % Number of clauses skipped because of their length: 94 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 2313 % Number of unification failures: 1691 % Number of unit to unit unification failures: 17983 % 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: 902 % N unit clauses dropped because too much nesting: 266 % 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: 8689 % Total number of terms of all unit clauses in table: 20986 % Max allowed number of states in UCFA: 528000 % Ratio n states used/total allowed states: 0.02 % Ratio n states used/total unit clauses terms: 0.41 % Number of symbols (columns) in UCFA: 39 % Profile 2: Number of calls to: % ============================== % PTUnify() = 4004 % ConstructUnitClause() = 1462 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.00 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 1 secs % CPU time: 0.38 secs % %------------------------------------------------------------------------------