%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : FLD067-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 19:20:21 EST 2010 % Result : Unsatisfiable 1.68s % Output : Refutation 1.68s % 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/SystemOnTPTP28393/FLD/FLD067-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 = 154] [nf = 0] [nu = 96] [ut = 65] % Looking for a proof at depth = 2 ... % t = 1 secs [nr = 825877] [nf = 64] [nu = 616820] [ut = 23719] % Looking for a proof at depth = 3 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: less_or_equal_2(a_0(),b_0()) % B4: defined_1(a_0()) % B5: defined_1(b_0()) % B8: ~sum_3(x1,x0,x2) | sum_3(x0,x1,x2) % B11: ~defined_1(x0) | defined_1(additive_inverse_1(x0)) % B12: ~defined_1(x0) | sum_3(additive_inverse_1(x0),x0,additive_identity_0()) % B18: ~defined_1(x1) | ~defined_1(x0) | sum_3(x0,x1,add_2(x0,x1)) % B25: ~less_or_equal_2(x2,x3) | ~sum_3(x3,x4,x1) | ~sum_3(x2,x4,x0) | less_or_equal_2(x0,x1) % Unit Clauses: % -------------- % U1: < d0 v0 dv0 f2 c3 t5 td3 b nc > ~less_or_equal_2(additive_identity_0(),add_2(b_0(),additive_inverse_1(a_0()))) % U17: < d1 v0 dv0 f1 c1 t2 td2 > defined_1(additive_inverse_1(a_0())) % U18: < d1 v0 dv0 f1 c3 t4 td2 > sum_3(additive_inverse_1(a_0()),a_0(),additive_identity_0()) % U30: < d1 v0 dv0 f1 c3 t4 td2 > sum_3(a_0(),additive_inverse_1(a_0()),additive_identity_0()) % U20601: < d2 v0 dv0 f3 c4 t7 td3 > sum_3(b_0(),additive_inverse_1(a_0()),add_2(b_0(),additive_inverse_1(a_0()))) % U23728: < d3 v0 dv0 f2 c3 t5 td3 > less_or_equal_2(additive_identity_0(),add_2(b_0(),additive_inverse_1(a_0()))) % --------------- Start of Proof --------------- % Derivation of unit clause U1: % ~less_or_equal_2(additive_identity_0(),add_2(b_0(),additive_inverse_1(a_0()))) ....... U1 % Derivation of unit clause U17: % defined_1(a_0()) ....... B4 % ~defined_1(x0) | defined_1(additive_inverse_1(x0)) ....... B11 % defined_1(additive_inverse_1(a_0())) ....... R1 [B4:L0, B11:L0] % Derivation of unit clause U18: % 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 U30: % ~sum_3(x1,x0,x2) | sum_3(x0,x1,x2) ....... B8 % sum_3(additive_inverse_1(a_0()),a_0(),additive_identity_0()) ....... U18 % sum_3(a_0(), additive_inverse_1(a_0()), additive_identity_0()) ....... R1 [B8:L0, U18:L0] % Derivation of unit clause U20601: % defined_1(b_0()) ....... B5 % ~defined_1(x1) | ~defined_1(x0) | sum_3(x0,x1,add_2(x0,x1)) ....... B18 % ~defined_1(x0) | sum_3(b_0(), x0, add_2(b_0(), x0)) ....... R1 [B5:L0, B18:L1] % defined_1(additive_inverse_1(a_0())) ....... U17 % sum_3(b_0(), additive_inverse_1(a_0()), add_2(b_0(), additive_inverse_1(a_0()))) ....... R2 [R1:L0, U17:L0] % Derivation of unit clause U23728: % less_or_equal_2(a_0(),b_0()) ....... B0 % ~less_or_equal_2(x2,x3) | ~sum_3(x3,x4,x1) | ~sum_3(x2,x4,x0) | less_or_equal_2(x0,x1) ....... B25 % ~sum_3(b_0(), x0, x1) | ~sum_3(a_0(), x0, x2) | less_or_equal_2(x2, x1) ....... R1 [B0:L0, B25:L0] % sum_3(b_0(),additive_inverse_1(a_0()),add_2(b_0(),additive_inverse_1(a_0()))) ....... U20601 % ~sum_3(a_0(), additive_inverse_1(a_0()), x0) | less_or_equal_2(x0, add_2(b_0(), additive_inverse_1(a_0()))) ....... R2 [R1:L0, U20601:L0] % sum_3(a_0(),additive_inverse_1(a_0()),additive_identity_0()) ....... U30 % less_or_equal_2(additive_identity_0(), add_2(b_0(), additive_inverse_1(a_0()))) ....... R3 [R2:L0, U30:L0] % Derivation of the empty clause: % less_or_equal_2(additive_identity_0(),add_2(b_0(),additive_inverse_1(a_0()))) ....... U23728 % ~less_or_equal_2(additive_identity_0(),add_2(b_0(),additive_inverse_1(a_0()))) ....... U1 % [] ....... R1 [U23728:L0, U1:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 825998 % resolvents: 825926 factors: 72 % Number of unit clauses generated: 616831 % % unit clauses generated to total clauses generated: 74.68 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 7 [1] = 58 [2] = 23654 [3] = 10 % Total = 23729 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 616831 [2] = 209111 [3] = 56 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] defined_1 (+)20982 (-)0 % [1] less_or_equal_2 (+)11 (-)1 % [2] product_3 (+)1287 (-)0 % [3] sum_3 (+)1447 (-)1 % ------------------ % Total: (+)23727 (-)2 % Total number of unit clauses retained: 23729 % Number of clauses skipped because of their length: 792 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 826006 % Number of unification failures: 12216 % Number of unit to unit unification failures: 1457 % N literal unification failure due to lookup root_id table: 983 % N base clause resolution failure due to lookup table: 567 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 8 % N unit clauses dropped because they exceeded max values: 513741 % N unit clauses dropped because too much nesting: 225622 % 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: 11 % Max term depth in a unit clause: 5 % Number of states in UCFA table: 36620 % Total number of terms of all unit clauses in table: 203684 % Max allowed number of states in UCFA: 104000 % Ratio n states used/total allowed states: 0.35 % Ratio n states used/total unit clauses terms: 0.18 % Number of symbols (columns) in UCFA: 46 % Profile 2: Number of calls to: % ============================== % PTUnify() = 838222 % ConstructUnitClause() = 537463 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.66 secs % -------------------------------------------------------- % | | % Inferences per sec: 825998 % | | % -------------------------------------------------------- % Elapsed time: 1 secs % CPU time: 1.67 secs % %------------------------------------------------------------------------------