%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : FLD027-3 : TPTP v5.0.0. Bugfixed v2.1.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art09.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:28:27 EST 2010 % Result : Unsatisfiable 0.52s % Output : Refutation 0.52s % 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/SystemOnTPTP23949/FLD/FLD027-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 = 159] [nf = 0] [nu = 100] [ut = 63] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 165182] [nf = 86] [nu = 125994] [ut = 4205] % 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(additive_identity_0(),a_0(),additive_identity_0()) % B1: ~sum_3(additive_identity_0(),b_0(),additive_identity_0()) % B2: product_3(multiplicative_identity_0(),multiplicative_inverse_1(a_0()),multiplicative_inverse_1(b_0())) % B3: ~product_3(multiplicative_identity_0(),a_0(),b_0()) % B7: defined_1(b_0()) % B9: ~product_3(x1,x0,x2) | product_3(x0,x1,x2) % B11: ~defined_1(x0) | product_3(multiplicative_identity_0(),x0,x0) % B22: ~defined_1(x0) | product_3(multiplicative_inverse_1(x0),x0,multiplicative_identity_0()) | sum_3(additive_identity_0(),x0,additive_identity_0()) % B23: ~product_3(x3,x5,x2) | ~product_3(x4,x1,x5) | ~product_3(x3,x4,x0) | product_3(x0,x1,x2) % Unit Clauses: % -------------- % U6: < d0 v0 dv0 f0 c1 t1 td1 b > defined_1(a_0()) % U7: < d0 v0 dv0 f0 c1 t1 td1 b > defined_1(b_0()) % U25: < d1 v0 dv0 f0 c3 t3 td1 > product_3(multiplicative_identity_0(),b_0(),b_0()) % U31: < d1 v0 dv0 f0 c3 t3 td1 > product_3(b_0(),multiplicative_identity_0(),b_0()) % U64: < d2 v0 dv0 f1 c3 t4 td2 > product_3(multiplicative_inverse_1(a_0()),a_0(),multiplicative_identity_0()) % U4295: < d3 v0 dv0 f1 c3 t4 td2 > product_3(b_0(),multiplicative_inverse_1(b_0()),multiplicative_identity_0()) % U4387: < d3 v0 dv0 f1 c3 t4 td2 > product_3(b_0(),multiplicative_inverse_1(a_0()),multiplicative_identity_0()) % U4420: < d3 v0 dv0 f1 c3 t4 td2 > ~product_3(b_0(),multiplicative_inverse_1(a_0()),multiplicative_identity_0()) % --------------- Start of Proof --------------- % Derivation of unit clause U6: % defined_1(a_0()) ....... U6 % Derivation of unit clause U7: % defined_1(b_0()) ....... U7 % Derivation of unit clause U25: % defined_1(b_0()) ....... B7 % ~defined_1(x0) | product_3(multiplicative_identity_0(),x0,x0) ....... B11 % product_3(multiplicative_identity_0(), b_0(), b_0()) ....... R1 [B7:L0, B11:L0] % Derivation of unit clause U31: % ~product_3(x1,x0,x2) | product_3(x0,x1,x2) ....... B9 % product_3(multiplicative_identity_0(),b_0(),b_0()) ....... U25 % product_3(b_0(), multiplicative_identity_0(), b_0()) ....... R1 [B9:L0, U25:L0] % Derivation of unit clause U64: % ~sum_3(additive_identity_0(),a_0(),additive_identity_0()) ....... B0 % ~defined_1(x0) | product_3(multiplicative_inverse_1(x0),x0,multiplicative_identity_0()) | sum_3(additive_identity_0(),x0,additive_identity_0()) ....... B22 % ~defined_1(a_0()) | product_3(multiplicative_inverse_1(a_0()), a_0(), multiplicative_identity_0()) ....... R1 [B0:L0, B22:L2] % defined_1(a_0()) ....... U6 % product_3(multiplicative_inverse_1(a_0()), a_0(), multiplicative_identity_0()) ....... R2 [R1:L0, U6:L0] % Derivation of unit clause U4295: % ~sum_3(additive_identity_0(),b_0(),additive_identity_0()) ....... B1 % ~defined_1(x0) | product_3(multiplicative_inverse_1(x0),x0,multiplicative_identity_0()) | sum_3(additive_identity_0(),x0,additive_identity_0()) ....... B22 % ~defined_1(b_0()) | product_3(multiplicative_inverse_1(b_0()), b_0(), multiplicative_identity_0()) ....... R1 [B1:L0, B22:L2] % ~product_3(x1,x0,x2) | product_3(x0,x1,x2) ....... B9 % ~defined_1(b_0()) | product_3(b_0(), multiplicative_inverse_1(b_0()), multiplicative_identity_0()) ....... R2 [R1:L1, B9:L0] % defined_1(b_0()) ....... U7 % product_3(b_0(), multiplicative_inverse_1(b_0()), multiplicative_identity_0()) ....... R3 [R2:L0, U7:L0] % Derivation of unit clause U4387: % product_3(multiplicative_identity_0(),multiplicative_inverse_1(a_0()),multiplicative_inverse_1(b_0())) ....... B2 % ~product_3(x3,x5,x2) | ~product_3(x4,x1,x5) | ~product_3(x3,x4,x0) | product_3(x0,x1,x2) ....... B23 % ~product_3(x0, multiplicative_inverse_1(b_0()), x1) | ~product_3(x0, multiplicative_identity_0(), x2) | product_3(x2, multiplicative_inverse_1(a_0()), x1) ....... R1 [B2:L0, B23:L1] % product_3(b_0(),multiplicative_inverse_1(b_0()),multiplicative_identity_0()) ....... U4295 % ~product_3(b_0(), multiplicative_identity_0(), x0) | product_3(x0, multiplicative_inverse_1(a_0()), multiplicative_identity_0()) ....... R2 [R1:L0, U4295:L0] % product_3(b_0(),multiplicative_identity_0(),b_0()) ....... U31 % product_3(b_0(), multiplicative_inverse_1(a_0()), multiplicative_identity_0()) ....... R3 [R2:L0, U31:L0] % Derivation of unit clause U4420: % ~product_3(multiplicative_identity_0(),a_0(),b_0()) ....... B3 % ~product_3(x3,x5,x2) | ~product_3(x4,x1,x5) | ~product_3(x3,x4,x0) | product_3(x0,x1,x2) ....... B23 % ~product_3(x0, x1, b_0()) | ~product_3(x2, a_0(), x1) | ~product_3(x0, x2, multiplicative_identity_0()) ....... R1 [B3:L0, B23:L3] % product_3(b_0(),multiplicative_identity_0(),b_0()) ....... U31 % ~product_3(x0, a_0(), multiplicative_identity_0()) | ~product_3(b_0(), x0, multiplicative_identity_0()) ....... R2 [R1:L0, U31:L0] % product_3(multiplicative_inverse_1(a_0()),a_0(),multiplicative_identity_0()) ....... U64 % ~product_3(b_0(), multiplicative_inverse_1(a_0()), multiplicative_identity_0()) ....... R3 [R2:L0, U64:L0] % Derivation of the empty clause: % ~product_3(b_0(),multiplicative_inverse_1(a_0()),multiplicative_identity_0()) ....... U4420 % product_3(b_0(),multiplicative_inverse_1(a_0()),multiplicative_identity_0()) ....... U4387 % [] ....... R1 [U4420:L0, U4387:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 168996 % resolvents: 168844 factors: 152 % Number of unit clauses generated: 126990 % % unit clauses generated to total clauses generated: 75.14 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 9 [1] = 54 [2] = 4142 [3] = 216 % Total = 4421 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 126990 [2] = 41860 [3] = 146 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] defined_1 (+)3890 (-)0 % [1] less_or_equal_2 (+)0 (-)0 % [2] product_3 (+)168 (-)5 % [3] sum_3 (+)187 (-)171 % ------------------ % Total: (+)4245 (-)176 % Total number of unit clauses retained: 4421 % Number of clauses skipped because of their length: 6725 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 169009 % Number of unification failures: 274009 % Number of unit to unit unification failures: 32786 % N literal unification failure due to lookup root_id table: 5519 % N base clause resolution failure due to lookup table: 3144 % 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: 107258 % N unit clauses dropped because too much nesting: 48652 % 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: 3913 % Total number of terms of all unit clauses in table: 28253 % Max allowed number of states in UCFA: 80000 % Ratio n states used/total allowed states: 0.05 % Ratio n states used/total unit clauses terms: 0.14 % Number of symbols (columns) in UCFA: 46 % Profile 2: Number of calls to: % ============================== % PTUnify() = 443018 % ConstructUnitClause() = 111670 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.10 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 0 secs % CPU time: 0.52 secs % %------------------------------------------------------------------------------