%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : FLD024-3 : TPTP v5.0.0. Bugfixed v2.1.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art05.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:25:12 EST 2010 % Result : Unsatisfiable 0.41s % Output : Refutation 0.41s % 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/SystemOnTPTP23542/FLD/FLD024-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 = 148] [nf = 0] [nu = 94] [ut = 59] % Looking for a proof at depth = 2 ... % t = 1 secs [nr = 151368] [nf = 70] [nu = 115324] [ut = 3843] % 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(b_0(),additive_inverse_1(a_0()),additive_identity_0()) % B4: defined_1(a_0()) % B5: defined_1(b_0()) % B8: ~sum_3(x1,x0,x2) | sum_3(x0,x1,x2) % B10: ~defined_1(x0) | sum_3(additive_identity_0(),x0,x0) % B12: ~defined_1(x0) | sum_3(additive_inverse_1(x0),x0,additive_identity_0()) % B23: ~sum_3(x3,x5,x2) | ~sum_3(x4,x1,x5) | ~sum_3(x3,x4,x0) | sum_3(x0,x1,x2) % Unit Clauses: % -------------- % U1: < d0 v0 dv0 f0 c3 t3 td1 b nc > ~sum_3(additive_identity_0(),a_0(),b_0()) % U20: < d1 v0 dv0 f1 c3 t4 td2 > sum_3(additive_inverse_1(a_0()),a_0(),additive_identity_0()) % U22: < d1 v0 dv0 f0 c3 t3 td1 > sum_3(additive_identity_0(),b_0(),b_0()) % U33: < d1 v0 dv0 f0 c3 t3 td1 > sum_3(b_0(),additive_identity_0(),b_0()) % U3862: < d3 v0 dv0 f0 c3 t3 td1 > sum_3(additive_identity_0(),a_0(),b_0()) % --------------- Start of Proof --------------- % Derivation of unit clause U1: % ~sum_3(additive_identity_0(),a_0(),b_0()) ....... U1 % Derivation of unit clause U20: % defined_1(a_0()) ....... B4 % ~defined_1(x0) | sum_3(additive_inverse_1(x0),x0,additive_identity_0()) ....... B12 % sum_3(additive_inverse_1(a_0()), a_0(), additive_identity_0()) ....... R1 [B4:L0, B12:L0] % Derivation of unit clause U22: % defined_1(b_0()) ....... B5 % ~defined_1(x0) | sum_3(additive_identity_0(),x0,x0) ....... B10 % sum_3(additive_identity_0(), b_0(), b_0()) ....... R1 [B5:L0, B10:L0] % Derivation of unit clause U33: % ~sum_3(x1,x0,x2) | sum_3(x0,x1,x2) ....... B8 % sum_3(additive_identity_0(),b_0(),b_0()) ....... U22 % sum_3(b_0(), additive_identity_0(), b_0()) ....... R1 [B8:L0, U22:L0] % Derivation of unit clause U3862: % sum_3(b_0(),additive_inverse_1(a_0()),additive_identity_0()) ....... B0 % ~sum_3(x3,x5,x2) | ~sum_3(x4,x1,x5) | ~sum_3(x3,x4,x0) | sum_3(x0,x1,x2) ....... B23 % ~sum_3(b_0(), x0, x1) | ~sum_3(additive_inverse_1(a_0()), x2, x0) | sum_3(additive_identity_0(), x2, x1) ....... R1 [B0:L0, B23:L2] % sum_3(b_0(),additive_identity_0(),b_0()) ....... U33 % ~sum_3(additive_inverse_1(a_0()), x0, additive_identity_0()) | sum_3(additive_identity_0(), x0, b_0()) ....... R2 [R1:L0, U33:L0] % sum_3(additive_inverse_1(a_0()),a_0(),additive_identity_0()) ....... U20 % sum_3(additive_identity_0(), a_0(), b_0()) ....... R3 [R2:L0, U20:L0] % Derivation of the empty clause: % sum_3(additive_identity_0(),a_0(),b_0()) ....... U3862 % ~sum_3(additive_identity_0(),a_0(),b_0()) ....... U1 % [] ....... R1 [U3862:L0, U1:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 151765 % resolvents: 151691 factors: 74 % Number of unit clauses generated: 115382 % % unit clauses generated to total clauses generated: 76.03 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 7 [1] = 52 [2] = 3784 [3] = 20 % Total = 3863 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 115382 [2] = 36321 [3] = 62 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] defined_1 (+)3576 (-)0 % [1] less_or_equal_2 (+)0 (-)0 % [2] product_3 (+)103 (-)0 % [3] sum_3 (+)181 (-)3 % ------------------ % Total: (+)3860 (-)3 % Total number of unit clauses retained: 3863 % Number of clauses skipped because of their length: 1332 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 151771 % Number of unification failures: 15235 % Number of unit to unit unification failures: 540 % N literal unification failure due to lookup root_id table: 1560 % N base clause resolution failure due to lookup table: 703 % 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: 97479 % N unit clauses dropped because too much nesting: 44462 % 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: 3226 % Total number of terms of all unit clauses in table: 25018 % Max allowed number of states in UCFA: 80000 % Ratio n states used/total allowed states: 0.04 % Ratio n states used/total unit clauses terms: 0.13 % Number of symbols (columns) in UCFA: 46 % Profile 2: Number of calls to: % ============================== % PTUnify() = 167006 % ConstructUnitClause() = 101335 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.12 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 1 secs % CPU time: 0.41 secs % %------------------------------------------------------------------------------