%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : FLD021-1 : TPTP v5.0.0. Bugfixed v2.1.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art09.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:22:58 EST 2010 % Result : Unsatisfiable 0.18s % Output : Refutation 0.18s % 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/SystemOnTPTP23255/FLD/FLD021-1+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 = 218] [nf = 0] [nu = 145] [ut = 90] % 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(m_0(),additive_identity_0()) % B1: ~equalish_2(add_2(m_0(),a_0()),a_0()) % B4: defined_1(a_0()) % B10: ~defined_1(x0) | equalish_2(add_2(additive_identity_0(),x0),x0) % B14: ~equalish_2(x2,x1) | ~equalish_2(x0,x2) | equalish_2(x0,x1) % B16: ~defined_1(x1) | ~equalish_2(x0,x2) | equalish_2(add_2(x0,x1),add_2(x2,x1)) % Unit Clauses: % -------------- % U4: < d0 v0 dv0 f0 c1 t1 td1 b > defined_1(a_0()) % U21: < d1 v0 dv0 f1 c3 t4 td2 > equalish_2(add_2(additive_identity_0(),a_0()),a_0()) % U101: < d2 v0 dv0 f2 c4 t6 td2 > equalish_2(add_2(m_0(),a_0()),add_2(additive_identity_0(),a_0())) % U131: < d2 v0 dv0 f2 c4 t6 td2 > ~equalish_2(add_2(m_0(),a_0()),add_2(additive_identity_0(),a_0())) % --------------- Start of Proof --------------- % Derivation of unit clause U4: % defined_1(a_0()) ....... U4 % Derivation of unit clause U21: % defined_1(a_0()) ....... B4 % ~defined_1(x0) | equalish_2(add_2(additive_identity_0(),x0),x0) ....... B10 % equalish_2(add_2(additive_identity_0(), a_0()), a_0()) ....... R1 [B4:L0, B10:L0] % Derivation of unit clause U101: % equalish_2(m_0(),additive_identity_0()) ....... B0 % ~defined_1(x1) | ~equalish_2(x0,x2) | equalish_2(add_2(x0,x1),add_2(x2,x1)) ....... B16 % ~defined_1(x0) | equalish_2(add_2(m_0(), x0), add_2(additive_identity_0(), x0)) ....... R1 [B0:L0, B16:L1] % defined_1(a_0()) ....... U4 % equalish_2(add_2(m_0(), a_0()), add_2(additive_identity_0(), a_0())) ....... R2 [R1:L0, U4:L0] % Derivation of unit clause U131: % ~equalish_2(add_2(m_0(),a_0()),a_0()) ....... B1 % ~equalish_2(x2,x1) | ~equalish_2(x0,x2) | equalish_2(x0,x1) ....... B14 % ~equalish_2(x0, a_0()) | ~equalish_2(add_2(m_0(), a_0()), x0) ....... R1 [B1:L0, B14:L2] % equalish_2(add_2(additive_identity_0(),a_0()),a_0()) ....... U21 % ~equalish_2(add_2(m_0(), a_0()), add_2(additive_identity_0(), a_0())) ....... R2 [R1:L0, U21:L0] % Derivation of the empty clause: % ~equalish_2(add_2(m_0(),a_0()),add_2(additive_identity_0(),a_0())) ....... U131 % equalish_2(add_2(m_0(),a_0()),add_2(additive_identity_0(),a_0())) ....... U101 % [] ....... R1 [U131:L0, U101:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 293 % resolvents: 293 factors: 0 % Number of unit clauses generated: 202 % % unit clauses generated to total clauses generated: 68.94 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 7 [1] = 83 [2] = 42 % Total = 132 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 202 [2] = 91 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] defined_1 (+)20 (-)0 % [1] equalish_2 (+)106 (-)6 % [2] less_or_equal_2 (+)0 (-)0 % ------------------ % Total: (+)126 (-)6 % Total number of unit clauses retained: 132 % Number of clauses skipped because of their length: 182 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 298 % Number of unification failures: 169 % Number of unit to unit unification failures: 606 % N literal unification failure due to lookup root_id table: 237 % N base clause resolution failure due to lookup table: 112 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 4 % N unit clauses dropped because they exceeded max values: 75 % N unit clauses dropped because too much nesting: 28 % 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: 12 % Max term depth in a unit clause: 5 % Number of states in UCFA table: 349 % Total number of terms of all unit clauses in table: 792 % Max allowed number of states in UCFA: 144000 % Ratio n states used/total allowed states: 0.00 % Ratio n states used/total unit clauses terms: 0.44 % Number of symbols (columns) in UCFA: 45 % Profile 2: Number of calls to: % ============================== % PTUnify() = 467 % ConstructUnitClause() = 200 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.00 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 0 secs % CPU time: 0.18 secs % %------------------------------------------------------------------------------