%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : LCL362-1 : TPTP v5.0.0. Released v2.3.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art11.cs.miami.edu % Model : i686 i686 % CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz % Memory : 2006MB % OS : Linux 2.6.31.5-127.fc12.i686.PAE % CPULimit : 300s % DateTime : Sun Nov 28 01:01:25 EST 2010 % Result : Unsatisfiable 0.40s % Output : Refutation 0.40s % 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/SystemOnTPTP4747/LCL/LCL362-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 = 7] [nf = 0] [nu = 0] [ut = 4] % Looking for a proof at depth = 2 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: ~is_a_theorem_1(implies_2(implies_2(x_0(),implies_2(implies_2(not_1(y_0()),y_0()),y_0())),implies_2(implies_2(not_1(y_0()),y_0()),y_0()))) % B1: is_a_theorem_1(implies_2(implies_2(x0,x1),implies_2(implies_2(x1,x2),implies_2(x0,x2)))) % B2: is_a_theorem_1(implies_2(x0,implies_2(not_1(x0),x1))) % B4: ~is_a_theorem_1(x0) | ~is_a_theorem_1(implies_2(x0,x1)) | is_a_theorem_1(x1) % Unit Clauses: % -------------- % U3: < d0 v3 dv1 f3 c0 t6 td4 b > is_a_theorem_1(implies_2(implies_2(not_1(x0),x0),x0)) % U6: < d2 v3 dv1 f12 c7 t22 td7 > ~is_a_theorem_1(implies_2(implies_2(implies_2(not_1(x0),x0),x0),implies_2(implies_2(x_0(),implies_2(implies_2(not_1(y_0()),y_0()),y_0())),implies_2(implies_2(not_1(y_0()),y_0()),y_0())))) % U250: < d2 v0 dv0 f13 c10 t23 td7 > ~is_a_theorem_1(implies_2(implies_2(x_0(),implies_2(implies_2(not_1(y_0()),y_0()),y_0())),implies_2(not_1(implies_2(implies_2(not_1(y_0()),y_0()),y_0())),implies_2(implies_2(not_1(y_0()),y_0()),y_0())))) % U252: < d2 v0 dv0 f5 c4 t9 td6 > ~is_a_theorem_1(implies_2(not_1(implies_2(implies_2(not_1(y_0()),y_0()),y_0())),x_0())) % U638: < d2 v4 dv2 f5 c0 t9 td6 > is_a_theorem_1(implies_2(not_1(implies_2(implies_2(not_1(x0),x0),x0)),x1)) % --------------- Start of Proof --------------- % Derivation of unit clause U3: % is_a_theorem_1(implies_2(implies_2(not_1(x0),x0),x0)) ....... U3 % Derivation of unit clause U6: % ~is_a_theorem_1(implies_2(implies_2(x_0(),implies_2(implies_2(not_1(y_0()),y_0()),y_0())),implies_2(implies_2(not_1(y_0()),y_0()),y_0()))) ....... B0 % ~is_a_theorem_1(x0) | ~is_a_theorem_1(implies_2(x0,x1)) | is_a_theorem_1(x1) ....... B4 % ~is_a_theorem_1(x0) | ~is_a_theorem_1(implies_2(x0, implies_2(implies_2(x_0(), implies_2(implies_2(not_1(y_0()), y_0()), y_0())), implies_2(implies_2(not_1(y_0()), y_0()), y_0())))) ....... R1 [B0:L0, B4:L2] % is_a_theorem_1(implies_2(implies_2(not_1(x0),x0),x0)) ....... U3 % ~is_a_theorem_1(implies_2(implies_2(implies_2(not_1(x0), x0), x0), implies_2(implies_2(x_0(), implies_2(implies_2(not_1(y_0()), y_0()), y_0())), implies_2(implies_2(not_1(y_0()), y_0()), y_0())))) ....... R2 [R1:L0, U3:L0] % Derivation of unit clause U250: % is_a_theorem_1(implies_2(implies_2(x0,x1),implies_2(implies_2(x1,x2),implies_2(x0,x2)))) ....... B1 % ~is_a_theorem_1(x0) | ~is_a_theorem_1(implies_2(x0,x1)) | is_a_theorem_1(x1) ....... B4 % ~is_a_theorem_1(implies_2(x0, x1)) | is_a_theorem_1(implies_2(implies_2(x1, x2), implies_2(x0, x2))) ....... R1 [B1:L0, B4:L1] % ~is_a_theorem_1(implies_2(implies_2(implies_2(not_1(x0),x0),x0),implies_2(implies_2(x_0(),implies_2(implies_2(not_1(y_0()),y_0()),y_0())),implies_2(implies_2(not_1(y_0()),y_0()),y_0())))) ....... U6 % ~is_a_theorem_1(implies_2(implies_2(x_0(), implies_2(implies_2(not_1(y_0()), y_0()), y_0())), implies_2(not_1(implies_2(implies_2(not_1(y_0()), y_0()), y_0())), implies_2(implies_2(not_1(y_0()), y_0()), y_0())))) ....... R2 [R1:L1, U6:L0] % Derivation of unit clause U252: % is_a_theorem_1(implies_2(implies_2(x0,x1),implies_2(implies_2(x1,x2),implies_2(x0,x2)))) ....... B1 % ~is_a_theorem_1(x0) | ~is_a_theorem_1(implies_2(x0,x1)) | is_a_theorem_1(x1) ....... B4 % ~is_a_theorem_1(implies_2(x0, x1)) | is_a_theorem_1(implies_2(implies_2(x1, x2), implies_2(x0, x2))) ....... R1 [B1:L0, B4:L1] % ~is_a_theorem_1(implies_2(implies_2(x_0(),implies_2(implies_2(not_1(y_0()),y_0()),y_0())),implies_2(not_1(implies_2(implies_2(not_1(y_0()),y_0()),y_0())),implies_2(implies_2(not_1(y_0()),y_0()),y_0())))) ....... U250 % ~is_a_theorem_1(implies_2(not_1(implies_2(implies_2(not_1(y_0()), y_0()), y_0())), x_0())) ....... R2 [R1:L1, U250:L0] % Derivation of unit clause U638: % is_a_theorem_1(implies_2(x0,implies_2(not_1(x0),x1))) ....... B2 % ~is_a_theorem_1(x0) | ~is_a_theorem_1(implies_2(x0,x1)) | is_a_theorem_1(x1) ....... B4 % ~is_a_theorem_1(x0) | is_a_theorem_1(implies_2(not_1(x0), x1)) ....... R1 [B2:L0, B4:L1] % is_a_theorem_1(implies_2(implies_2(not_1(x0),x0),x0)) ....... U3 % is_a_theorem_1(implies_2(not_1(implies_2(implies_2(not_1(x0), x0), x0)), x1)) ....... R2 [R1:L0, U3:L0] % Derivation of the empty clause: % is_a_theorem_1(implies_2(not_1(implies_2(implies_2(not_1(x0),x0),x0)),x1)) ....... U638 % ~is_a_theorem_1(implies_2(not_1(implies_2(implies_2(not_1(y_0()),y_0()),y_0())),x_0())) ....... U252 % [] ....... R1 [U638:L0, U252:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 784 % resolvents: 784 factors: 0 % Number of unit clauses generated: 772 % % unit clauses generated to total clauses generated: 98.47 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 4 [2] = 635 % Total = 639 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 772 [2] = 12 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] is_a_theorem_1 (+)574 (-)65 % ------------------ % Total: (+)574 (-)65 % Total number of unit clauses retained: 639 % Number of clauses skipped because of their length: 4 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 792 % Number of unification failures: 227 % Number of unit to unit unification failures: 37263 % N literal unification failure due to lookup root_id table: 8 % 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: 11 % N unit clauses dropped because they exceeded max values: 137 % N unit clauses dropped because too much nesting: 69 % 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: 12 % Number of states in UCFA table: 9127 % Total number of terms of all unit clauses in table: 21488 % 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.42 % Number of symbols (columns) in UCFA: 39 % Profile 2: Number of calls to: % ============================== % PTUnify() = 1019 % ConstructUnitClause() = 772 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.01 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 1 secs % CPU time: 0.39 secs % %------------------------------------------------------------------------------