%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : LCL194-1 : TPTP v5.0.0. Released v1.1.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art06.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 00:20:21 EST 2010 % Result : Unsatisfiable 0.56s % Output : Refutation 0.56s % 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/SystemOnTPTP25869/LCL/LCL194-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 = 18] [nf = 0] [nu = 10] [ut = 12] % Looking for a proof at depth = 2 ... % t = 1 secs [nr = 4769] [nf = 1] [nu = 2829] [ut = 1573] % Looking for a proof at depth = 3 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: ~theorem_1(or_2(not_1(or_2(not_1(q_0()),r_0())),or_2(not_1(or_2(q_0(),p_0())),or_2(p_0(),r_0())))) % B4: axiom_1(or_2(not_1(or_2(x0,x1)),or_2(x1,x0))) % B6: ~axiom_1(x0) | theorem_1(x0) % B7: ~axiom_1(or_2(not_1(x0),x2)) | ~theorem_1(or_2(not_1(x2),x1)) | theorem_1(or_2(not_1(x0),x1)) % B8: ~axiom_1(or_2(not_1(x1),x0)) | ~theorem_1(x1) | theorem_1(x0) % Unit Clauses: % -------------- % U1: < d0 v6 dv3 f6 c0 t12 td5 b > axiom_1(or_2(not_1(or_2(x0,or_2(x1,x2))),or_2(x1,or_2(x0,x2)))) % U2: < d0 v6 dv3 f8 c0 t14 td5 b > axiom_1(or_2(not_1(or_2(not_1(x0),x1)),or_2(not_1(or_2(x2,x0)),or_2(x2,x1)))) % U19: < d2 v0 dv0 f8 c6 t14 td6 > ~theorem_1(or_2(not_1(or_2(q_0(),p_0())),or_2(not_1(or_2(not_1(q_0()),r_0())),or_2(p_0(),r_0())))) % U373: < d2 v0 dv0 f8 c6 t14 td6 > ~theorem_1(or_2(not_1(or_2(p_0(),q_0())),or_2(not_1(or_2(not_1(q_0()),r_0())),or_2(p_0(),r_0())))) % U2523: < d3 v6 dv3 f18 c6 t30 td7 > ~axiom_1(or_2(not_1(or_2(not_1(or_2(not_1(x0),x1)),or_2(not_1(or_2(x2,x0)),or_2(x2,x1)))),or_2(not_1(or_2(p_0(),q_0())),or_2(not_1(or_2(not_1(q_0()),r_0())),or_2(p_0(),r_0()))))) % --------------- Start of Proof --------------- % Derivation of unit clause U1: % axiom_1(or_2(not_1(or_2(x0,or_2(x1,x2))),or_2(x1,or_2(x0,x2)))) ....... U1 % Derivation of unit clause U2: % axiom_1(or_2(not_1(or_2(not_1(x0),x1)),or_2(not_1(or_2(x2,x0)),or_2(x2,x1)))) ....... U2 % Derivation of unit clause U19: % ~theorem_1(or_2(not_1(or_2(not_1(q_0()),r_0())),or_2(not_1(or_2(q_0(),p_0())),or_2(p_0(),r_0())))) ....... B0 % ~axiom_1(or_2(not_1(x1),x0)) | ~theorem_1(x1) | theorem_1(x0) ....... B8 % ~axiom_1(or_2(not_1(x0), or_2(not_1(or_2(not_1(q_0()), r_0())), or_2(not_1(or_2(q_0(), p_0())), or_2(p_0(), r_0()))))) | ~theorem_1(x0) ....... R1 [B0:L0, B8:L2] % axiom_1(or_2(not_1(or_2(x0,or_2(x1,x2))),or_2(x1,or_2(x0,x2)))) ....... U1 % ~theorem_1(or_2(not_1(or_2(q_0(), p_0())), or_2(not_1(or_2(not_1(q_0()), r_0())), or_2(p_0(), r_0())))) ....... R2 [R1:L0, U1:L0] % Derivation of unit clause U373: % axiom_1(or_2(not_1(or_2(x0,x1)),or_2(x1,x0))) ....... B4 % ~axiom_1(or_2(not_1(x0),x2)) | ~theorem_1(or_2(not_1(x2),x1)) | theorem_1(or_2(not_1(x0),x1)) ....... B7 % ~theorem_1(or_2(not_1(or_2(x0, x1)), x2)) | theorem_1(or_2(not_1(or_2(x1, x0)), x2)) ....... R1 [B4:L0, B7:L0] % ~theorem_1(or_2(not_1(or_2(q_0(),p_0())),or_2(not_1(or_2(not_1(q_0()),r_0())),or_2(p_0(),r_0())))) ....... U19 % ~theorem_1(or_2(not_1(or_2(p_0(), q_0())), or_2(not_1(or_2(not_1(q_0()), r_0())), or_2(p_0(), r_0())))) ....... R2 [R1:L1, U19:L0] % Derivation of unit clause U2523: % ~axiom_1(x0) | theorem_1(x0) ....... B6 % ~axiom_1(or_2(not_1(x1),x0)) | ~theorem_1(x1) | theorem_1(x0) ....... B8 % ~axiom_1(x0) | ~axiom_1(or_2(not_1(x0), x1)) | theorem_1(x1) ....... R1 [B6:L1, B8:L1] % axiom_1(or_2(not_1(or_2(not_1(x0),x1)),or_2(not_1(or_2(x2,x0)),or_2(x2,x1)))) ....... U2 % ~axiom_1(or_2(not_1(or_2(not_1(or_2(not_1(x0), x1)), or_2(not_1(or_2(x2, x0)), or_2(x2, x1)))), x3)) | theorem_1(x3) ....... R2 [R1:L0, U2:L0] % ~theorem_1(or_2(not_1(or_2(p_0(),q_0())),or_2(not_1(or_2(not_1(q_0()),r_0())),or_2(p_0(),r_0())))) ....... U373 % ~axiom_1(or_2(not_1(or_2(not_1(or_2(not_1(x0), x1)), or_2(not_1(or_2(x2, x0)), or_2(x2, x1)))), or_2(not_1(or_2(p_0(), q_0())), or_2(not_1(or_2(not_1(q_0()), r_0())), or_2(p_0(), r_0()))))) ....... R3 [R2:L1, U373:L0] % Derivation of the empty clause: % ~axiom_1(or_2(not_1(or_2(not_1(or_2(not_1(x0),x1)),or_2(not_1(or_2(x2,x0)),or_2(x2,x1)))),or_2(not_1(or_2(p_0(),q_0())),or_2(not_1(or_2(not_1(q_0()),r_0())),or_2(p_0(),r_0()))))) ....... U2523 % axiom_1(or_2(not_1(or_2(x0,or_2(x1,x2))),or_2(x1,or_2(x0,x2)))) ....... U1 % [] ....... R1 [U2523:L0, U1:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 13593 % resolvents: 13589 factors: 4 % Number of unit clauses generated: 11519 % % unit clauses generated to total clauses generated: 84.74 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 6 [1] = 6 [2] = 1561 [3] = 951 % Total = 2524 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 11519 [2] = 2042 [3] = 32 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] axiom_1 (+)5 (-)950 % [1] theorem_1 (+)1261 (-)308 % ------------------ % Total: (+)1266 (-)1258 % Total number of unit clauses retained: 2524 % Number of clauses skipped because of their length: 232 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 13600 % Number of unification failures: 12156 % Number of unit to unit unification failures: 393133 % N literal unification failure due to lookup root_id table: 396 % N base clause resolution failure due to lookup table: 89 % N UC-BCL resolution dropped due to lookup table: 1117 % Max entries in substitution set: 7 % N unit clauses dropped because they exceeded max values: 2568 % N unit clauses dropped because too much nesting: 144 % 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: 11 % Number of states in UCFA table: 19777 % Total number of terms of all unit clauses in table: 61093 % Max allowed number of states in UCFA: 528000 % Ratio n states used/total allowed states: 0.04 % Ratio n states used/total unit clauses terms: 0.32 % Number of symbols (columns) in UCFA: 41 % Profile 2: Number of calls to: % ============================== % PTUnify() = 25756 % ConstructUnitClause() = 5086 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.03 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 1 secs % CPU time: 0.55 secs % %------------------------------------------------------------------------------