%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : FLD033-3 : TPTP v5.0.0. Bugfixed v2.1.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art02.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:27 EST 2010 % Result : Unsatisfiable 0.44s % Output : Refutation 0.44s % 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/SystemOnTPTP29940/FLD/FLD033-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 = 1 secs [nr = 153] [nf = 0] [nu = 97] [ut = 61] % Looking for a proof at depth = 2 ... % t = 1 secs [nr = 158273] [nf = 84] [nu = 120659] [ut = 4024] % Looking for a proof at depth = 3 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: product_3(m_0(),a_0(),a_0()) % B1: ~sum_3(additive_identity_0(),a_0(),additive_identity_0()) % B2: ~product_3(multiplicative_identity_0(),m_0(),multiplicative_identity_0()) % B8: ~product_3(x1,x0,x2) | product_3(x0,x1,x2) % B21: ~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(x4,x5,x2) | ~product_3(x3,x5,x1) | ~product_3(x0,x3,x4) | product_3(x0,x1,x2) % Unit Clauses: % -------------- % U5: < d0 v0 dv0 f0 c1 t1 td1 b > defined_1(a_0()) % U10: < d1 v0 dv0 f0 c3 t3 td1 > ~product_3(m_0(),multiplicative_identity_0(),multiplicative_identity_0()) % U4051: < d3 v1 dv1 f0 c2 t3 td1 > ~product_3(a_0(),x0,multiplicative_identity_0()) % U4071: < d3 v0 dv0 f1 c3 t4 td2 > product_3(a_0(),multiplicative_inverse_1(a_0()),multiplicative_identity_0()) % --------------- Start of Proof --------------- % Derivation of unit clause U5: % defined_1(a_0()) ....... U5 % Derivation of unit clause U10: % ~product_3(multiplicative_identity_0(),m_0(),multiplicative_identity_0()) ....... B2 % ~product_3(x1,x0,x2) | product_3(x0,x1,x2) ....... B8 % ~product_3(m_0(), multiplicative_identity_0(), multiplicative_identity_0()) ....... R1 [B2:L0, B8:L1] % Derivation of unit clause U4051: % product_3(m_0(),a_0(),a_0()) ....... B0 % ~product_3(x4,x5,x2) | ~product_3(x3,x5,x1) | ~product_3(x0,x3,x4) | product_3(x0,x1,x2) ....... B23 % ~product_3(a_0(), x0, x1) | ~product_3(a_0(), x0, x2) | product_3(m_0(), x2, x1) ....... R1 [B0:L0, B23:L2] % ~product_3(a_0(), x0, x1) | product_3(m_0(), x1, x1) ....... R2 [R1:L1, R1:L0] % ~product_3(m_0(),multiplicative_identity_0(),multiplicative_identity_0()) ....... U10 % ~product_3(a_0(), x0, multiplicative_identity_0()) ....... R3 [R2:L1, U10:L0] % Derivation of unit clause U4071: % ~sum_3(additive_identity_0(),a_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()) ....... B21 % ~defined_1(a_0()) | product_3(multiplicative_inverse_1(a_0()), a_0(), multiplicative_identity_0()) ....... R1 [B1:L0, B21:L2] % ~product_3(x1,x0,x2) | product_3(x0,x1,x2) ....... B8 % ~defined_1(a_0()) | product_3(a_0(), multiplicative_inverse_1(a_0()), multiplicative_identity_0()) ....... R2 [R1:L1, B8:L0] % defined_1(a_0()) ....... U5 % product_3(a_0(), multiplicative_inverse_1(a_0()), multiplicative_identity_0()) ....... R3 [R2:L0, U5:L0] % Derivation of the empty clause: % product_3(a_0(),multiplicative_inverse_1(a_0()),multiplicative_identity_0()) ....... U4071 % ~product_3(a_0(),x0,multiplicative_identity_0()) ....... U4051 % [] ....... R1 [U4071:L0, U4051:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 159199 % resolvents: 159091 factors: 108 % Number of unit clauses generated: 120874 % % unit clauses generated to total clauses generated: 75.93 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 8 [1] = 53 [2] = 3963 [3] = 48 % Total = 4072 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 120874 [2] = 38232 [3] = 93 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] defined_1 (+)3733 (-)0 % [1] less_or_equal_2 (+)0 (-)0 % [2] product_3 (+)160 (-)3 % [3] sum_3 (+)173 (-)3 % ------------------ % Total: (+)4066 (-)6 % Total number of unit clauses retained: 4072 % Number of clauses skipped because of their length: 2198 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 159206 % Number of unification failures: 48635 % Number of unit to unit unification failures: 998 % N literal unification failure due to lookup root_id table: 2004 % N base clause resolution failure due to lookup table: 1274 % 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: 102127 % N unit clauses dropped because too much nesting: 46557 % 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: 3488 % Total number of terms of all unit clauses in table: 26218 % 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() = 207841 % ConstructUnitClause() = 106191 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.11 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 1 secs % CPU time: 0.44 secs % %------------------------------------------------------------------------------