%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : FLD028-3 : TPTP v5.0.0. Bugfixed v2.1.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art11.cs.miami.edu % Model : i686 i686 % CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz % Memory : 2006MB % OS : Linux 2.6.31.5-127.fc12.i686.PAE % CPULimit : 300s % DateTime : Sat Nov 27 18:30:30 EST 2010 % Result : Unsatisfiable 1.54s % Output : Refutation 1.54s % 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/SystemOnTPTP18110/FLD/FLD028-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 = 220] [nf = 0] [nu = 144] [ut = 91] % Looking for a proof at depth = 2 ... % t = 2 secs [nr = 723227] [nf = 90] [nu = 568340] [ut = 16034] % 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(a_0(),u_0(),b_0()) % B1: product_3(a_0(),v_0(),b_0()) % B2: ~sum_3(additive_identity_0(),a_0(),additive_identity_0()) % B9: defined_1(v_0()) % B13: ~defined_1(x0) | product_3(multiplicative_identity_0(),x0,x0) % B24: ~defined_1(x0) | product_3(multiplicative_inverse_1(x0),x0,multiplicative_identity_0()) | sum_3(additive_identity_0(),x0,additive_identity_0()) % B25: ~product_3(x3,x5,x2) | ~product_3(x4,x1,x5) | ~product_3(x3,x4,x0) | product_3(x0,x1,x2) % B26: ~product_3(x4,x5,x2) | ~product_3(x3,x5,x1) | ~product_3(x0,x3,x4) | product_3(x0,x1,x2) % Unit Clauses: % -------------- % U3: < d0 v0 dv0 f0 c3 t3 td1 b nc > ~product_3(multiplicative_identity_0(),u_0(),v_0()) % U6: < d0 v0 dv0 f0 c1 t1 td1 b > defined_1(a_0()) % U35: < d1 v0 dv0 f0 c3 t3 td1 > product_3(multiplicative_identity_0(),v_0(),v_0()) % U92: < d2 v0 dv0 f1 c3 t4 td2 > product_3(multiplicative_inverse_1(a_0()),a_0(),multiplicative_identity_0()) % U16047: < d3 v0 dv0 f1 c3 t4 td2 > ~product_3(multiplicative_inverse_1(a_0()),b_0(),v_0()) % U16108: < d3 v0 dv0 f1 c3 t4 td2 > product_3(multiplicative_inverse_1(a_0()),b_0(),v_0()) % --------------- Start of Proof --------------- % Derivation of unit clause U3: % ~product_3(multiplicative_identity_0(),u_0(),v_0()) ....... U3 % Derivation of unit clause U6: % defined_1(a_0()) ....... U6 % Derivation of unit clause U35: % defined_1(v_0()) ....... B9 % ~defined_1(x0) | product_3(multiplicative_identity_0(),x0,x0) ....... B13 % product_3(multiplicative_identity_0(), v_0(), v_0()) ....... R1 [B9:L0, B13:L0] % Derivation of unit clause U92: % ~sum_3(additive_identity_0(),a_0(),additive_identity_0()) ....... B2 % ~defined_1(x0) | product_3(multiplicative_inverse_1(x0),x0,multiplicative_identity_0()) | sum_3(additive_identity_0(),x0,additive_identity_0()) ....... B24 % ~defined_1(a_0()) | product_3(multiplicative_inverse_1(a_0()), a_0(), multiplicative_identity_0()) ....... R1 [B2:L0, B24: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 U16047: % product_3(a_0(),u_0(),b_0()) ....... B0 % ~product_3(x3,x5,x2) | ~product_3(x4,x1,x5) | ~product_3(x3,x4,x0) | product_3(x0,x1,x2) ....... B25 % ~product_3(x0, b_0(), x1) | ~product_3(x0, a_0(), x2) | product_3(x2, u_0(), x1) ....... R1 [B0:L0, B25:L1] % product_3(multiplicative_inverse_1(a_0()),a_0(),multiplicative_identity_0()) ....... U92 % ~product_3(multiplicative_inverse_1(a_0()), b_0(), x0) | product_3(multiplicative_identity_0(), u_0(), x0) ....... R2 [R1:L1, U92:L0] % ~product_3(multiplicative_identity_0(),u_0(),v_0()) ....... U3 % ~product_3(multiplicative_inverse_1(a_0()), b_0(), v_0()) ....... R3 [R2:L1, U3:L0] % Derivation of unit clause U16108: % product_3(a_0(),v_0(),b_0()) ....... B1 % ~product_3(x4,x5,x2) | ~product_3(x3,x5,x1) | ~product_3(x0,x3,x4) | product_3(x0,x1,x2) ....... B26 % ~product_3(x0, v_0(), x1) | ~product_3(x2, a_0(), x0) | product_3(x2, b_0(), x1) ....... R1 [B1:L0, B26:L1] % product_3(multiplicative_identity_0(),v_0(),v_0()) ....... U35 % ~product_3(x0, a_0(), multiplicative_identity_0()) | product_3(x0, b_0(), v_0()) ....... R2 [R1:L0, U35:L0] % product_3(multiplicative_inverse_1(a_0()),a_0(),multiplicative_identity_0()) ....... U92 % product_3(multiplicative_inverse_1(a_0()), b_0(), v_0()) ....... R3 [R2:L0, U92:L0] % Derivation of the empty clause: % product_3(multiplicative_inverse_1(a_0()),b_0(),v_0()) ....... U16108 % ~product_3(multiplicative_inverse_1(a_0()),b_0(),v_0()) ....... U16047 % [] ....... R1 [U16108:L0, U16047:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 724820 % resolvents: 724708 factors: 112 % Number of unit clauses generated: 568622 % % unit clauses generated to total clauses generated: 78.45 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 11 [1] = 80 [2] = 15943 [3] = 75 % Total = 16109 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 568622 [2] = 156084 [3] = 114 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] defined_1 (+)15456 (-)0 % [1] less_or_equal_2 (+)0 (-)0 % [2] product_3 (+)307 (-)4 % [3] sum_3 (+)339 (-)3 % ------------------ % Total: (+)16102 (-)7 % Total number of unit clauses retained: 16109 % Number of clauses skipped because of their length: 3931 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 724829 % Number of unification failures: 110288 % Number of unit to unit unification failures: 2243 % N literal unification failure due to lookup root_id table: 3167 % N base clause resolution failure due to lookup table: 2158 % 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: 491260 % N unit clauses dropped because too much nesting: 231454 % 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: 8794 % Total number of terms of all unit clauses in table: 106554 % Max allowed number of states in UCFA: 80000 % Ratio n states used/total allowed states: 0.11 % Ratio n states used/total unit clauses terms: 0.08 % Number of symbols (columns) in UCFA: 48 % Profile 2: Number of calls to: % ============================== % PTUnify() = 835117 % ConstructUnitClause() = 507358 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.60 secs % -------------------------------------------------------- % | | % Inferences per sec: 724820 % | | % -------------------------------------------------------- % Elapsed time: 2 secs % CPU time: 1.54 secs % %------------------------------------------------------------------------------