%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : GRP041-2 : TPTP v5.0.0. Released v1.0.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art06.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 20:44:51 EST 2010 % Result : Unsatisfiable 0.14s % Output : Refutation 0.14s % 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/SystemOnTPTP30614/GRP/GRP041-2+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 = 10] [nf = 0] [nu = 0] [ut = 4] % Looking for a proof at depth = 2 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: ~equalish_2(a_0(),a_0()) % B5: ~product_3(x0,x1,x3) | ~product_3(x0,x1,x2) | equalish_2(x2,x3) % Unit Clauses: % -------------- % U2: < d0 v2 dv1 f0 c1 t3 td1 b > product_3(identity_0(),x0,x0) % U4: < d2 v2 dv2 f0 c1 t3 td1 > ~product_3(x0,x1,a_0()) % --------------- Start of Proof --------------- % Derivation of unit clause U2: % product_3(identity_0(),x0,x0) ....... U2 % Derivation of unit clause U4: % ~equalish_2(a_0(),a_0()) ....... B0 % ~product_3(x0,x1,x3) | ~product_3(x0,x1,x2) | equalish_2(x2,x3) ....... B5 % ~product_3(x0, x1, a_0()) | ~product_3(x0, x1, a_0()) ....... R1 [B0:L0, B5:L2] % ~product_3(x0, x1, a_0()) ....... R2 [R1:L1, R1:L0] % Derivation of the empty clause: % ~product_3(x0,x1,a_0()) ....... U4 % product_3(identity_0(),x0,x0) ....... U2 % [] ....... R1 [U4:L0, U2:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 12 % resolvents: 11 factors: 1 % Number of unit clauses generated: 1 % % unit clauses generated to total clauses generated: 8.33 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 4 [2] = 1 % Total = 5 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 1 [2] = 11 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] equalish_2 (+)0 (-)1 % [1] product_3 (+)3 (-)1 % ------------------ % Total: (+)3 (-)2 % Total number of unit clauses retained: 5 % Number of clauses skipped because of their length: 8 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 14 % Number of unification failures: 0 % Number of unit to unit unification failures: 1 % N literal unification failure due to lookup root_id table: 13 % N base clause resolution failure due to lookup table: 2 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 3 % N unit clauses dropped because they exceeded max values: 0 % N unit clauses dropped because too much nesting: 0 % 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: 5 % Max term depth in a unit clause: 2 % Number of states in UCFA table: 18 % Total number of terms of all unit clauses in table: 17 % Max allowed number of states in UCFA: 80000 % Ratio n states used/total allowed states: 0.00 % Ratio n states used/total unit clauses terms: 1.06 % Number of symbols (columns) in UCFA: 40 % Profile 2: Number of calls to: % ============================== % PTUnify() = 14 % ConstructUnitClause() = 1 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.00 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 0 secs % CPU time: 0.14 secs % %------------------------------------------------------------------------------