%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : FLD030-4 : TPTP v5.0.0. Bugfixed v2.1.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 18:30:49 EST 2010 % Result : Unsatisfiable 1.46s % Output : Refutation 1.46s % 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/SystemOnTPTP20581/FLD/FLD030-4+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 = 214] [nf = 0] [nu = 141] [ut = 89] % Looking for a proof at depth = 2 ... % t = 2 secs [nr = 706954] [nf = 82] [nu = 555361] [ut = 15673] % 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(multiplicative_identity_0(),a_0(),d_0()) % B7: defined_1(c_0()) % B12: ~defined_1(x0) | product_3(multiplicative_identity_0(),x0,x0) % B24: ~product_3(x3,x5,x2) | ~product_3(x4,x1,x5) | ~product_3(x3,x4,x0) | product_3(x0,x1,x2) % Unit Clauses: % -------------- % U1: < d0 v0 dv0 f0 c3 t3 td1 b nc > product_3(a_0(),b_0(),c_0()) % U2: < d0 v0 dv0 f0 c3 t3 td1 b nc > ~product_3(d_0(),b_0(),c_0()) % U29: < d1 v0 dv0 f0 c3 t3 td1 > product_3(multiplicative_identity_0(),c_0(),c_0()) % U15695: < d3 v0 dv0 f0 c3 t3 td1 > product_3(d_0(),b_0(),c_0()) % --------------- Start of Proof --------------- % Derivation of unit clause U1: % product_3(a_0(),b_0(),c_0()) ....... U1 % Derivation of unit clause U2: % ~product_3(d_0(),b_0(),c_0()) ....... U2 % Derivation of unit clause U29: % defined_1(c_0()) ....... B7 % ~defined_1(x0) | product_3(multiplicative_identity_0(),x0,x0) ....... B12 % product_3(multiplicative_identity_0(), c_0(), c_0()) ....... R1 [B7:L0, B12:L0] % Derivation of unit clause U15695: % product_3(multiplicative_identity_0(),a_0(),d_0()) ....... B0 % ~product_3(x3,x5,x2) | ~product_3(x4,x1,x5) | ~product_3(x3,x4,x0) | product_3(x0,x1,x2) ....... B24 % ~product_3(multiplicative_identity_0(), x0, x1) | ~product_3(a_0(), x2, x0) | product_3(d_0(), x2, x1) ....... R1 [B0:L0, B24:L2] % product_3(multiplicative_identity_0(),c_0(),c_0()) ....... U29 % ~product_3(a_0(), x0, c_0()) | product_3(d_0(), x0, c_0()) ....... R2 [R1:L0, U29:L0] % product_3(a_0(),b_0(),c_0()) ....... U1 % product_3(d_0(), b_0(), c_0()) ....... R3 [R2:L0, U1:L0] % Derivation of the empty clause: % product_3(d_0(),b_0(),c_0()) ....... U15695 % ~product_3(d_0(),b_0(),c_0()) ....... U2 % [] ....... R1 [U15695:L0, U2:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 707599 % resolvents: 707513 factors: 86 % Number of unit clauses generated: 555429 % % unit clauses generated to total clauses generated: 78.49 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 10 [1] = 79 [2] = 15584 [3] = 23 % Total = 15696 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 555429 [2] = 152099 [3] = 71 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] defined_1 (+)15128 (-)0 % [1] less_or_equal_2 (+)0 (-)0 % [2] product_3 (+)242 (-)2 % [3] sum_3 (+)323 (-)1 % ------------------ % Total: (+)15693 (-)3 % Total number of unit clauses retained: 15696 % Number of clauses skipped because of their length: 2122 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 707603 % Number of unification failures: 38163 % Number of unit to unit unification failures: 805 % N literal unification failure due to lookup root_id table: 1933 % N base clause resolution failure due to lookup table: 1199 % 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: 479809 % N unit clauses dropped because too much nesting: 226075 % 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: 8336 % Total number of terms of all unit clauses in table: 104118 % Max allowed number of states in UCFA: 80000 % Ratio n states used/total allowed states: 0.10 % Ratio n states used/total unit clauses terms: 0.08 % Number of symbols (columns) in UCFA: 48 % Profile 2: Number of calls to: % ============================== % PTUnify() = 745766 % ConstructUnitClause() = 495495 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.55 secs % -------------------------------------------------------- % | | % Inferences per sec: 707599 % | | % -------------------------------------------------------- % Elapsed time: 2 secs % CPU time: 1.46 secs % %------------------------------------------------------------------------------