%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : LCL192-1 : TPTP v5.0.0. Released v1.1.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art02.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:19:53 EST 2010 % Result : Unsatisfiable 0.49s % Output : Refutation 0.49s % 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/SystemOnTPTP4158/LCL/LCL192-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 = 4108] [nf = 1] [nu = 2349] [ut = 1419] % Looking for a proof at depth = 3 ... % t = 1 secs [nr = 15384] [nf = 4] [nu = 11605] [ut = 2454] % Looking for a proof at depth = 4 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: ~theorem_1(or_2(not_1(or_2(or_2(p_0(),q_0()),r_0())),or_2(p_0(),or_2(q_0(),r_0())))) % 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)))) % U4: < d0 v4 dv2 f4 c0 t8 td4 b > axiom_1(or_2(not_1(or_2(x0,x1)),or_2(x1,x0))) % U2099: < d3 v6 dv3 f6 c0 t12 td5 > theorem_1(or_2(not_1(or_2(x0,or_2(x1,x2))),or_2(x0,or_2(x2,x1)))) % U2486: < d4 v0 dv0 f6 c6 t12 td5 > ~theorem_1(or_2(not_1(or_2(p_0(),or_2(r_0(),q_0()))),or_2(p_0(),or_2(q_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 U4: % axiom_1(or_2(not_1(or_2(x0,x1)),or_2(x1,x0))) ....... U4 % Derivation of unit clause U2099: % ~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(x0,x1)),or_2(x1,x0))) ....... U4 % ~axiom_1(or_2(not_1(or_2(not_1(or_2(x0, x1)), or_2(x1, x0))), x2)) | theorem_1(x2) ....... R2 [R1:L0, U4:L0] % 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 % theorem_1(or_2(not_1(or_2(x0, or_2(x1, x2))), or_2(x0, or_2(x2, x1)))) ....... R3 [R2:L0, U2:L0] % Derivation of unit clause U2486: % ~theorem_1(or_2(not_1(or_2(or_2(p_0(),q_0()),r_0())),or_2(p_0(),or_2(q_0(),r_0())))) ....... B0 % ~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 % ~axiom_1(or_2(not_1(or_2(or_2(p_0(), q_0()), r_0())), x0)) | ~theorem_1(or_2(not_1(x0), or_2(p_0(), or_2(q_0(), r_0())))) ....... R1 [B0:L0, B7:L2] % ~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 % ~axiom_1(or_2(not_1(or_2(or_2(p_0(), q_0()), r_0())), x0)) | ~axiom_1(or_2(not_1(x0), x1)) | ~theorem_1(or_2(not_1(x1), or_2(p_0(), or_2(q_0(), r_0())))) ....... R2 [R1:L1, B7:L2] % axiom_1(or_2(not_1(or_2(x0,x1)),or_2(x1,x0))) ....... U4 % ~axiom_1(or_2(not_1(or_2(r_0(), or_2(p_0(), q_0()))), x0)) | ~theorem_1(or_2(not_1(x0), or_2(p_0(), or_2(q_0(), r_0())))) ....... R3 [R2:L0, U4:L0] % 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(p_0(), or_2(r_0(), q_0()))), or_2(p_0(), or_2(q_0(), r_0())))) ....... R4 [R3:L0, U1:L0] % Derivation of the empty clause: % ~theorem_1(or_2(not_1(or_2(p_0(),or_2(r_0(),q_0()))),or_2(p_0(),or_2(q_0(),r_0())))) ....... U2486 % theorem_1(or_2(not_1(or_2(x0,or_2(x1,x2))),or_2(x0,or_2(x2,x1)))) ....... U2099 % [] ....... R1 [U2486:L0, U2099:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 15495 % resolvents: 15490 factors: 5 % Number of unit clauses generated: 11704 % % unit clauses generated to total clauses generated: 75.53 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 6 [1] = 6 [2] = 1407 [3] = 1035 % [4] = 33 % Total = 2487 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 11704 [2] = 3758 [3] = 33 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] axiom_1 (+)5 (-)1056 % [1] theorem_1 (+)1269 (-)157 % ------------------ % Total: (+)1274 (-)1213 % Total number of unit clauses retained: 2487 % Number of clauses skipped because of their length: 476 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 15502 % Number of unification failures: 14692 % Number of unit to unit unification failures: 204506 % N literal unification failure due to lookup root_id table: 681 % N base clause resolution failure due to lookup table: 207 % N UC-BCL resolution dropped due to lookup table: 1163 % Max entries in substitution set: 10 % N unit clauses dropped because they exceeded max values: 3547 % 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: 11 % Number of states in UCFA table: 21163 % Total number of terms of all unit clauses in table: 62272 % 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.34 % Number of symbols (columns) in UCFA: 41 % Profile 2: Number of calls to: % ============================== % PTUnify() = 30194 % ConstructUnitClause() = 6028 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.02 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 1 secs % CPU time: 0.48 secs % %------------------------------------------------------------------------------