%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : ALG002-1 : TPTP v5.0.0. Released v1.0.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art07.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 17:00:51 EST 2010 % Result : Unsatisfiable 0.21s % Output : Refutation 0.21s % 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/SystemOnTPTP9702/ALG/ALG002-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 = 132] [nf = 0] [nu = 97] [ut = 44] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 2232] [nf = 18] [nu = 1686] [ut = 115] % Looking for a proof at depth = 3 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: ~greater_than_0_1(multiplicative_inverse_1(a_0())) % B1: product_3(x0,multiplicative_identity_0(),x0) % B2: greater_than_0_1(a_0()) % B3: ~product_3(multiplicative_identity_0(),multiplicative_identity_0(),additive_identity_0()) % B4: ~product_3(x0,x1,x2) | product_3(x1,x0,x2) % B5: ~product_3(x0,x1,x2) | product_3(x0,additive_inverse_1(x1),additive_inverse_1(x2)) % B8: ~greater_than_0_1(x0) | ~product_3(x0,x0,additive_identity_0()) % B9: ~greater_than_0_1(additive_inverse_1(x0)) | ~greater_than_0_1(x0) % B10: product_3(x0,multiplicative_inverse_1(x0),multiplicative_identity_0()) | product_3(x0,x0,additive_identity_0()) % B11: ~product_3(x0,x0,additive_identity_0()) | ~product_3(x0,x1,x2) | product_3(x2,x2,additive_identity_0()) % B12: greater_than_0_1(x0) | greater_than_0_1(additive_inverse_1(x0)) | product_3(x0,x0,additive_identity_0()) % B13: ~greater_than_0_1(x1) | ~greater_than_0_1(x0) | ~product_3(x0,x1,x2) | greater_than_0_1(x2) % Unit Clauses: % -------------- % U0: < d0 v0 dv0 f1 c1 t2 td2 b nc > ~greater_than_0_1(multiplicative_inverse_1(a_0())) % U5: < d1 v2 dv1 f2 c1 t5 td2 > product_3(x0,additive_inverse_1(multiplicative_identity_0()),additive_inverse_1(x0)) % U7: < d1 v0 dv0 f0 c3 t3 td1 > ~product_3(a_0(),a_0(),additive_identity_0()) % U8: < d1 v0 dv0 f1 c1 t2 td2 > ~greater_than_0_1(additive_inverse_1(a_0())) % U11: < d1 v2 dv1 f2 c1 t5 td2 > product_3(additive_inverse_1(multiplicative_identity_0()),x0,additive_inverse_1(x0)) % U39: < d1 v0 dv0 f1 c3 t4 td2 > product_3(a_0(),multiplicative_inverse_1(a_0()),multiplicative_identity_0()) % U66: < d2 v0 dv0 f3 c3 t6 td3 > product_3(additive_inverse_1(multiplicative_inverse_1(a_0())),a_0(),additive_inverse_1(multiplicative_identity_0())) % U81: < d2 v0 dv0 f1 c3 t4 td2 > product_3(multiplicative_inverse_1(a_0()),a_0(),multiplicative_identity_0()) % U117: < d3 v0 dv0 f1 c1 t2 td2 > ~greater_than_0_1(additive_inverse_1(multiplicative_identity_0())) % U118: < d3 v0 dv0 f2 c1 t3 td3 > ~greater_than_0_1(additive_inverse_1(multiplicative_inverse_1(a_0()))) % U124: < d3 v0 dv0 f2 c3 t5 td2 > ~product_3(multiplicative_inverse_1(a_0()),multiplicative_inverse_1(a_0()),additive_identity_0()) % U209: < d3 v0 dv0 f2 c1 t3 td3 > greater_than_0_1(additive_inverse_1(multiplicative_inverse_1(a_0()))) % --------------- Start of Proof --------------- % Derivation of unit clause U0: % ~greater_than_0_1(multiplicative_inverse_1(a_0())) ....... U0 % Derivation of unit clause U5: % product_3(x0,multiplicative_identity_0(),x0) ....... B1 % ~product_3(x0,x1,x2) | product_3(x0,additive_inverse_1(x1),additive_inverse_1(x2)) ....... B5 % product_3(x0, additive_inverse_1(multiplicative_identity_0()), additive_inverse_1(x0)) ....... R1 [B1:L0, B5:L0] % Derivation of unit clause U7: % greater_than_0_1(a_0()) ....... B2 % ~greater_than_0_1(x0) | ~product_3(x0,x0,additive_identity_0()) ....... B8 % ~product_3(a_0(), a_0(), additive_identity_0()) ....... R1 [B2:L0, B8:L0] % Derivation of unit clause U8: % greater_than_0_1(a_0()) ....... B2 % ~greater_than_0_1(additive_inverse_1(x0)) | ~greater_than_0_1(x0) ....... B9 % ~greater_than_0_1(additive_inverse_1(a_0())) ....... R1 [B2:L0, B9:L1] % Derivation of unit clause U11: % ~product_3(x0,x1,x2) | product_3(x1,x0,x2) ....... B4 % product_3(x0,additive_inverse_1(multiplicative_identity_0()),additive_inverse_1(x0)) ....... U5 % product_3(additive_inverse_1(multiplicative_identity_0()), x0, additive_inverse_1(x0)) ....... R1 [B4:L0, U5:L0] % Derivation of unit clause U39: % product_3(x0,multiplicative_inverse_1(x0),multiplicative_identity_0()) | product_3(x0,x0,additive_identity_0()) ....... B10 % ~product_3(a_0(),a_0(),additive_identity_0()) ....... U7 % product_3(a_0(), multiplicative_inverse_1(a_0()), multiplicative_identity_0()) ....... R1 [B10:L1, U7:L0] % Derivation of unit clause U66: % ~product_3(x0,x1,x2) | product_3(x1,x0,x2) ....... B4 % ~product_3(x0,x1,x2) | product_3(x0,additive_inverse_1(x1),additive_inverse_1(x2)) ....... B5 % product_3(additive_inverse_1(x0), x1, additive_inverse_1(x2)) | ~product_3(x1, x0, x2) ....... R1 [B4:L0, B5:L1] % product_3(a_0(),multiplicative_inverse_1(a_0()),multiplicative_identity_0()) ....... U39 % product_3(additive_inverse_1(multiplicative_inverse_1(a_0())), a_0(), additive_inverse_1(multiplicative_identity_0())) ....... R2 [R1:L1, U39:L0] % Derivation of unit clause U81: % ~product_3(x0,x1,x2) | product_3(x1,x0,x2) ....... B4 % product_3(x0,multiplicative_inverse_1(x0),multiplicative_identity_0()) | product_3(x0,x0,additive_identity_0()) ....... B10 % product_3(multiplicative_inverse_1(x0), x0, multiplicative_identity_0()) | product_3(x0, x0, additive_identity_0()) ....... R1 [B4:L0, B10:L0] % ~product_3(a_0(),a_0(),additive_identity_0()) ....... U7 % product_3(multiplicative_inverse_1(a_0()), a_0(), multiplicative_identity_0()) ....... R2 [R1:L1, U7:L0] % Derivation of unit clause U117: % greater_than_0_1(a_0()) ....... B2 % ~greater_than_0_1(x1) | ~greater_than_0_1(x0) | ~product_3(x0,x1,x2) | greater_than_0_1(x2) ....... B13 % ~greater_than_0_1(x0) | ~product_3(x0, a_0(), x1) | greater_than_0_1(x1) ....... R1 [B2:L0, B13:L0] % product_3(additive_inverse_1(multiplicative_identity_0()),x0,additive_inverse_1(x0)) ....... U11 % ~greater_than_0_1(additive_inverse_1(multiplicative_identity_0())) | greater_than_0_1(additive_inverse_1(a_0())) ....... R2 [R1:L1, U11:L0] % ~greater_than_0_1(additive_inverse_1(a_0())) ....... U8 % ~greater_than_0_1(additive_inverse_1(multiplicative_identity_0())) ....... R3 [R2:L1, U8:L0] % Derivation of unit clause U118: % greater_than_0_1(a_0()) ....... B2 % ~greater_than_0_1(x1) | ~greater_than_0_1(x0) | ~product_3(x0,x1,x2) | greater_than_0_1(x2) ....... B13 % ~greater_than_0_1(x0) | ~product_3(x0, a_0(), x1) | greater_than_0_1(x1) ....... R1 [B2:L0, B13:L0] % product_3(additive_inverse_1(multiplicative_inverse_1(a_0())),a_0(),additive_inverse_1(multiplicative_identity_0())) ....... U66 % ~greater_than_0_1(additive_inverse_1(multiplicative_inverse_1(a_0()))) | greater_than_0_1(additive_inverse_1(multiplicative_identity_0())) ....... R2 [R1:L1, U66:L0] % ~greater_than_0_1(additive_inverse_1(multiplicative_identity_0())) ....... U117 % ~greater_than_0_1(additive_inverse_1(multiplicative_inverse_1(a_0()))) ....... R3 [R2:L1, U117:L0] % Derivation of unit clause U124: % ~product_3(multiplicative_identity_0(),multiplicative_identity_0(),additive_identity_0()) ....... B3 % ~product_3(x0,x0,additive_identity_0()) | ~product_3(x0,x1,x2) | product_3(x2,x2,additive_identity_0()) ....... B11 % ~product_3(x0, x0, additive_identity_0()) | ~product_3(x0, x1, multiplicative_identity_0()) ....... R1 [B3:L0, B11:L2] % ~product_3(x0,x1,x2) | product_3(x1,x0,x2) ....... B4 % ~product_3(x0, x1, multiplicative_identity_0()) | ~product_3(x0, x0, additive_identity_0()) ....... R2 [R1:L0, B4:L1] % product_3(multiplicative_inverse_1(a_0()),a_0(),multiplicative_identity_0()) ....... U81 % ~product_3(multiplicative_inverse_1(a_0()), multiplicative_inverse_1(a_0()), additive_identity_0()) ....... R3 [R2:L0, U81:L0] % Derivation of unit clause U209: % ~product_3(x0,x1,x2) | product_3(x1,x0,x2) ....... B4 % greater_than_0_1(x0) | greater_than_0_1(additive_inverse_1(x0)) | product_3(x0,x0,additive_identity_0()) ....... B12 % product_3(x0, x0, additive_identity_0()) | greater_than_0_1(x0) | greater_than_0_1(additive_inverse_1(x0)) ....... R1 [B4:L0, B12:L2] % ~product_3(multiplicative_inverse_1(a_0()),multiplicative_inverse_1(a_0()),additive_identity_0()) ....... U124 % greater_than_0_1(multiplicative_inverse_1(a_0())) | greater_than_0_1(additive_inverse_1(multiplicative_inverse_1(a_0()))) ....... R2 [R1:L0, U124:L0] % ~greater_than_0_1(multiplicative_inverse_1(a_0())) ....... U0 % greater_than_0_1(additive_inverse_1(multiplicative_inverse_1(a_0()))) ....... R3 [R2:L0, U0:L0] % Derivation of the empty clause: % greater_than_0_1(additive_inverse_1(multiplicative_inverse_1(a_0()))) ....... U209 % ~greater_than_0_1(additive_inverse_1(multiplicative_inverse_1(a_0()))) ....... U118 % [] ....... R1 [U209:L0, U118:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 20378 % resolvents: 20312 factors: 66 % Number of unit clauses generated: 13447 % % unit clauses generated to total clauses generated: 65.99 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 4 [1] = 40 [2] = 71 [3] = 95 % Total = 210 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 13447 [2] = 6780 [3] = 151 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] greater_than_0_1 (+)6 (-)5 % [1] product_3 (+)156 (-)43 % ------------------ % Total: (+)162 (-)48 % Total number of unit clauses retained: 210 % Number of clauses skipped because of their length: 1637 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 20399 % Number of unification failures: 103857 % Number of unit to unit unification failures: 6736 % N literal unification failure due to lookup root_id table: 26052 % N base clause resolution failure due to lookup table: 1488 % N UC-BCL resolution dropped due to lookup table: 2969 % Max entries in substitution set: 9 % N unit clauses dropped because they exceeded max values: 11599 % N unit clauses dropped because too much nesting: 2960 % 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: 557 % Total number of terms of all unit clauses in table: 1409 % Max allowed number of states in UCFA: 80000 % Ratio n states used/total allowed states: 0.01 % Ratio n states used/total unit clauses terms: 0.40 % Number of symbols (columns) in UCFA: 41 % Profile 2: Number of calls to: % ============================== % PTUnify() = 124256 % ConstructUnitClause() = 11805 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.00 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 0 secs % CPU time: 0.21 secs % %------------------------------------------------------------------------------