%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : FLD032-3 : TPTP v5.0.0. Bugfixed v2.1.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art03.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:32:03 EST 2010 % Result : Unsatisfiable 0.26s % Output : Refutation 0.26s % 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/SystemOnTPTP21842/FLD/FLD032-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 = 121] [nf = 0] [nu = 75] [ut = 47] % Looking for a proof at depth = 2 ... % t = 1 secs [nr = 57852] [nf = 80] [nu = 43193] [ut = 1625] % 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: product_3(multiplicative_identity_0(),multiplicative_inverse_1(a_0()),multiplicative_identity_0()) % B4: defined_1(multiplicative_identity_0()) % B9: ~defined_1(x0) | product_3(multiplicative_identity_0(),x0,x0) % B20: ~defined_1(x0) | product_3(multiplicative_inverse_1(x0),x0,multiplicative_identity_0()) | sum_3(additive_identity_0(),x0,additive_identity_0()) % B21: ~product_3(x3,x5,x2) | ~product_3(x4,x1,x5) | ~product_3(x3,x4,x0) | product_3(x0,x1,x2) % Unit Clauses: % -------------- % U2: < d0 v0 dv0 f0 c3 t3 td1 b nc > ~product_3(multiplicative_identity_0(),a_0(),multiplicative_identity_0()) % U5: < d0 v0 dv0 f0 c1 t1 td1 b > defined_1(a_0()) % U14: < d1 v0 dv0 f0 c3 t3 td1 > product_3(multiplicative_identity_0(),multiplicative_identity_0(),multiplicative_identity_0()) % U48: < d2 v0 dv0 f1 c3 t4 td2 > product_3(multiplicative_inverse_1(a_0()),a_0(),multiplicative_identity_0()) % U1746: < d3 v0 dv0 f0 c3 t3 td1 > product_3(multiplicative_identity_0(),a_0(),multiplicative_identity_0()) % --------------- Start of Proof --------------- % Derivation of unit clause U2: % ~product_3(multiplicative_identity_0(),a_0(),multiplicative_identity_0()) ....... U2 % Derivation of unit clause U5: % defined_1(a_0()) ....... U5 % Derivation of unit clause U14: % defined_1(multiplicative_identity_0()) ....... B4 % ~defined_1(x0) | product_3(multiplicative_identity_0(),x0,x0) ....... B9 % product_3(multiplicative_identity_0(), multiplicative_identity_0(), multiplicative_identity_0()) ....... R1 [B4:L0, B9:L0] % Derivation of unit clause U48: % ~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()) ....... B20 % ~defined_1(a_0()) | product_3(multiplicative_inverse_1(a_0()), a_0(), multiplicative_identity_0()) ....... R1 [B0:L0, B20:L2] % defined_1(a_0()) ....... U5 % product_3(multiplicative_inverse_1(a_0()), a_0(), multiplicative_identity_0()) ....... R2 [R1:L0, U5:L0] % Derivation of unit clause U1746: % product_3(multiplicative_identity_0(),multiplicative_inverse_1(a_0()),multiplicative_identity_0()) ....... B1 % ~product_3(x3,x5,x2) | ~product_3(x4,x1,x5) | ~product_3(x3,x4,x0) | product_3(x0,x1,x2) ....... B21 % ~product_3(multiplicative_identity_0(), x0, x1) | ~product_3(multiplicative_inverse_1(a_0()), x2, x0) | product_3(multiplicative_identity_0(), x2, x1) ....... R1 [B1:L0, B21:L2] % product_3(multiplicative_identity_0(),multiplicative_identity_0(),multiplicative_identity_0()) ....... U14 % ~product_3(multiplicative_inverse_1(a_0()), x0, multiplicative_identity_0()) | product_3(multiplicative_identity_0(), x0, multiplicative_identity_0()) ....... R2 [R1:L0, U14:L0] % product_3(multiplicative_inverse_1(a_0()),a_0(),multiplicative_identity_0()) ....... U48 % product_3(multiplicative_identity_0(), a_0(), multiplicative_identity_0()) ....... R3 [R2:L0, U48:L0] % Derivation of the empty clause: % product_3(multiplicative_identity_0(),a_0(),multiplicative_identity_0()) ....... U1746 % ~product_3(multiplicative_identity_0(),a_0(),multiplicative_identity_0()) ....... U2 % [] ....... R1 [U1746:L0, U2:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 59454 % resolvents: 59340 factors: 114 % Number of unit clauses generated: 43705 % % unit clauses generated to total clauses generated: 73.51 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 7 [1] = 40 [2] = 1578 [3] = 122 % Total = 1747 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 43705 [2] = 15659 [3] = 90 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] defined_1 (+)1440 (-)0 % [1] less_or_equal_2 (+)0 (-)0 % [2] product_3 (+)121 (-)9 % [3] sum_3 (+)110 (-)67 % ------------------ % Total: (+)1671 (-)76 % Total number of unit clauses retained: 1747 % Number of clauses skipped because of their length: 2782 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 59460 % Number of unification failures: 58102 % Number of unit to unit unification failures: 8450 % N literal unification failure due to lookup root_id table: 2458 % N base clause resolution failure due to lookup table: 1408 % 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: 36344 % N unit clauses dropped because too much nesting: 15922 % 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: 2174 % Total number of terms of all unit clauses in table: 10966 % Max allowed number of states in UCFA: 80000 % Ratio n states used/total allowed states: 0.03 % Ratio n states used/total unit clauses terms: 0.20 % Number of symbols (columns) in UCFA: 45 % Profile 2: Number of calls to: % ============================== % PTUnify() = 117562 % ConstructUnitClause() = 38084 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.02 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 1 secs % CPU time: 0.25 secs % %------------------------------------------------------------------------------