%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : FLD022-3 : TPTP v5.0.0. Bugfixed v2.1.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art04.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 18:23:32 EST 2010 % Result : Unsatisfiable 1.46s % Output : Refutation 1.46s % 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/SystemOnTPTP18310/FLD/FLD022-3+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 = 215] [nf = 0] [nu = 141] [ut = 89] % Looking for a proof at depth = 2 ... % t = 1 secs [nr = 706959] [nf = 82] [nu = 555361] [ut = 15673] % Looking for a proof at depth = 3 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: sum_3(a_0(),c_0(),u_0()) % B1: sum_3(b_0(),c_0(),u_0()) % B2: ~sum_3(additive_identity_0(),a_0(),b_0()) % B6: defined_1(b_0()) % B7: defined_1(c_0()) % B11: ~sum_3(x1,x0,x2) | sum_3(x0,x1,x2) % B13: ~defined_1(x0) | sum_3(additive_identity_0(),x0,x0) % B15: ~defined_1(x0) | sum_3(additive_inverse_1(x0),x0,additive_identity_0()) % B26: ~sum_3(x3,x5,x2) | ~sum_3(x4,x1,x5) | ~sum_3(x3,x4,x0) | sum_3(x0,x1,x2) % B27: ~sum_3(x4,x5,x2) | ~sum_3(x3,x5,x1) | ~sum_3(x0,x3,x4) | sum_3(x0,x1,x2) % Unit Clauses: % -------------- % U12: < d1 v0 dv0 f0 c3 t3 td1 > ~sum_3(a_0(),additive_identity_0(),b_0()) % U26: < d1 v0 dv0 f0 c3 t3 td1 > sum_3(additive_identity_0(),b_0(),b_0()) % U32: < d1 v0 dv0 f1 c3 t4 td2 > sum_3(additive_inverse_1(c_0()),c_0(),additive_identity_0()) % U47: < d1 v0 dv0 f0 c3 t3 td1 > sum_3(b_0(),additive_identity_0(),b_0()) % U50: < d1 v0 dv0 f1 c3 t4 td2 > sum_3(c_0(),additive_inverse_1(c_0()),additive_identity_0()) % U15721: < d3 v0 dv0 f1 c3 t4 td2 > ~sum_3(u_0(),additive_inverse_1(c_0()),b_0()) % U15743: < d3 v0 dv0 f1 c3 t4 td2 > sum_3(u_0(),additive_inverse_1(c_0()),b_0()) % --------------- Start of Proof --------------- % Derivation of unit clause U12: % ~sum_3(additive_identity_0(),a_0(),b_0()) ....... B2 % ~sum_3(x1,x0,x2) | sum_3(x0,x1,x2) ....... B11 % ~sum_3(a_0(), additive_identity_0(), b_0()) ....... R1 [B2:L0, B11:L1] % Derivation of unit clause U26: % defined_1(b_0()) ....... B6 % ~defined_1(x0) | sum_3(additive_identity_0(),x0,x0) ....... B13 % sum_3(additive_identity_0(), b_0(), b_0()) ....... R1 [B6:L0, B13:L0] % Derivation of unit clause U32: % defined_1(c_0()) ....... B7 % ~defined_1(x0) | sum_3(additive_inverse_1(x0),x0,additive_identity_0()) ....... B15 % sum_3(additive_inverse_1(c_0()), c_0(), additive_identity_0()) ....... R1 [B7:L0, B15:L0] % Derivation of unit clause U47: % ~sum_3(x1,x0,x2) | sum_3(x0,x1,x2) ....... B11 % sum_3(additive_identity_0(),b_0(),b_0()) ....... U26 % sum_3(b_0(), additive_identity_0(), b_0()) ....... R1 [B11:L0, U26:L0] % Derivation of unit clause U50: % ~sum_3(x1,x0,x2) | sum_3(x0,x1,x2) ....... B11 % sum_3(additive_inverse_1(c_0()),c_0(),additive_identity_0()) ....... U32 % sum_3(c_0(), additive_inverse_1(c_0()), additive_identity_0()) ....... R1 [B11:L0, U32:L0] % Derivation of unit clause U15721: % sum_3(a_0(),c_0(),u_0()) ....... B0 % ~sum_3(x4,x5,x2) | ~sum_3(x3,x5,x1) | ~sum_3(x0,x3,x4) | sum_3(x0,x1,x2) ....... B27 % ~sum_3(u_0(), x0, x1) | ~sum_3(c_0(), x0, x2) | sum_3(a_0(), x2, x1) ....... R1 [B0:L0, B27:L2] % sum_3(c_0(),additive_inverse_1(c_0()),additive_identity_0()) ....... U50 % ~sum_3(u_0(), additive_inverse_1(c_0()), x0) | sum_3(a_0(), additive_identity_0(), x0) ....... R2 [R1:L1, U50:L0] % ~sum_3(a_0(),additive_identity_0(),b_0()) ....... U12 % ~sum_3(u_0(), additive_inverse_1(c_0()), b_0()) ....... R3 [R2:L1, U12:L0] % Derivation of unit clause U15743: % sum_3(b_0(),c_0(),u_0()) ....... B1 % ~sum_3(x3,x5,x2) | ~sum_3(x4,x1,x5) | ~sum_3(x3,x4,x0) | sum_3(x0,x1,x2) ....... B26 % ~sum_3(b_0(), x0, x1) | ~sum_3(c_0(), x2, x0) | sum_3(u_0(), x2, x1) ....... R1 [B1:L0, B26:L2] % sum_3(b_0(),additive_identity_0(),b_0()) ....... U47 % ~sum_3(c_0(), x0, additive_identity_0()) | sum_3(u_0(), x0, b_0()) ....... R2 [R1:L0, U47:L0] % sum_3(c_0(),additive_inverse_1(c_0()),additive_identity_0()) ....... U50 % sum_3(u_0(), additive_inverse_1(c_0()), b_0()) ....... R3 [R2:L0, U50:L0] % Derivation of the empty clause: % sum_3(u_0(),additive_inverse_1(c_0()),b_0()) ....... U15743 % ~sum_3(u_0(),additive_inverse_1(c_0()),b_0()) ....... U15721 % [] ....... R1 [U15743:L0, U15721:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 708204 % resolvents: 708106 factors: 98 % Number of unit clauses generated: 555603 % % unit clauses generated to total clauses generated: 78.45 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 10 [1] = 79 [2] = 15584 [3] = 71 % Total = 15744 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 555603 [2] = 152483 [3] = 118 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] defined_1 (+)15128 (-)0 % [1] less_or_equal_2 (+)0 (-)0 % [2] product_3 (+)215 (-)0 % [3] sum_3 (+)397 (-)4 % ------------------ % Total: (+)15740 (-)4 % Total number of unit clauses retained: 15744 % Number of clauses skipped because of their length: 3417 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 708215 % Number of unification failures: 99277 % Number of unit to unit unification failures: 1587 % N literal unification failure due to lookup root_id table: 4007 % N base clause resolution failure due to lookup table: 1554 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 9 % N unit clauses dropped because they exceeded max values: 479934 % N unit clauses dropped because too much nesting: 226075 % 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: 8 % Max term depth in a unit clause: 4 % Number of states in UCFA table: 8443 % Total number of terms of all unit clauses in table: 104411 % Max allowed number of states in UCFA: 80000 % Ratio n states used/total allowed states: 0.11 % Ratio n states used/total unit clauses terms: 0.08 % Number of symbols (columns) in UCFA: 48 % Profile 2: Number of calls to: % ============================== % PTUnify() = 807492 % ConstructUnitClause() = 495668 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.50 secs % -------------------------------------------------------- % | | % Inferences per sec: 708204 % | | % -------------------------------------------------------- % Elapsed time: 1 secs % CPU time: 1.46 secs % %------------------------------------------------------------------------------