%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : SYN009-4 : TPTP v5.0.0. Released v2.5.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 : Sun Nov 28 08:22:15 EST 2010 % Result : Unsatisfiable 0.15s % Output : Refutation 0.15s % 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/SystemOnTPTP30948/SYN/SYN009-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 = 0] [nf = 0] [nu = 0] [ut = 4] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 4] % Looking for a proof at depth = 3 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 4] % Looking for a proof at depth = 4 ... % t = 0 secs [nr = 742] [nf = 6] [nu = 36] [ut = 5] % Looking for a proof at depth = 5 ... % t = 0 secs [nr = 2576] [nf = 18] [nu = 291] [ut = 8] % Looking for a proof at depth = 6 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: s_1(a_0()) % B7: ~s_1(x2) | ~s_1(x1) | ~s_1(x0) | p_3(x0,x1,x2) | q_3(x0,x1,x2) | r_3(x0,x1,x2) % B8: ~s_1(x2) | ~s_1(x1) | ~s_1(x0) | m_3(x0,x1,x2) | n_3(x0,x1,x2) % Unit Clauses: % -------------- % U2: < d0 v0 dv0 f0 c1 t1 td1 b nc > s_1(c_0()) % U3: < d0 v0 dv0 f0 c3 t3 td1 b nc > ~n_3(c_0(),c_0(),c_0()) % U4: < d4 v0 dv0 f0 c3 t3 td1 > m_3(c_0(),c_0(),c_0()) % U5: < d5 v0 dv0 f0 c3 t3 td1 > ~p_3(c_0(),c_0(),c_0()) % U7: < d5 v0 dv0 f0 c3 t3 td1 > ~r_3(c_0(),c_0(),c_0()) % U8: < d6 v0 dv0 f0 c3 t3 td1 > ~m_3(c_0(),c_0(),c_0()) % --------------- Start of Proof --------------- % Derivation of unit clause U2: % s_1(c_0()) ....... U2 % Derivation of unit clause U3: % ~n_3(c_0(),c_0(),c_0()) ....... U3 % Derivation of unit clause U4: % ~s_1(x2) | ~s_1(x1) | ~s_1(x0) | m_3(x0,x1,x2) | n_3(x0,x1,x2) ....... B8 % ~s_1(x0) | ~s_1(x1) | m_3(x1, x0, x0) | n_3(x1, x0, x0) ....... R1 [B8:L0, B8:L1] % s_1(c_0()) ....... U2 % ~s_1(x0) | m_3(x0, c_0(), c_0()) | n_3(x0, c_0(), c_0()) ....... R2 [R1:L0, U2:L0] % s_1(c_0()) ....... U2 % m_3(c_0(), c_0(), c_0()) | n_3(c_0(), c_0(), c_0()) ....... R3 [R2:L0, U2:L0] % ~n_3(c_0(),c_0(),c_0()) ....... U3 % m_3(c_0(), c_0(), c_0()) ....... R4 [R3:L1, U3:L0] % Derivation of unit clause U5: % ~s_1(x2) | ~s_1(x1) | ~s_1(x0) | m_3(x0,x1,x2) | n_3(x0,x1,x2) ....... B8 % ~s_1(x0) | ~s_1(x1) | m_3(x1, x0, x0) | n_3(x1, x0, x0) ....... R1 [B8:L0, B8:L1] % s_1(c_0()) ....... U2 % ~s_1(x0) | m_3(x0, c_0(), c_0()) | n_3(x0, c_0(), c_0()) ....... R2 [R1:L0, U2:L0] % s_1(c_0()) ....... U2 % m_3(c_0(), c_0(), c_0()) | n_3(c_0(), c_0(), c_0()) ....... R3 [R2:L0, U2:L0] % ~m_3(x0,x1,x2) | ~p_3(x0,x1,x2) ....... B4 % n_3(c_0(), c_0(), c_0()) | ~p_3(c_0(), c_0(), c_0()) ....... R4 [R3:L0, B4:L0] % ~n_3(c_0(),c_0(),c_0()) ....... U3 % ~p_3(c_0(), c_0(), c_0()) ....... R5 [R4:L0, U3:L0] % Derivation of unit clause U7: % ~s_1(x2) | ~s_1(x1) | ~s_1(x0) | m_3(x0,x1,x2) | n_3(x0,x1,x2) ....... B8 % ~s_1(x0) | ~s_1(x1) | m_3(x1, x0, x0) | n_3(x1, x0, x0) ....... R1 [B8:L0, B8:L1] % s_1(c_0()) ....... U2 % ~s_1(x0) | m_3(x0, c_0(), c_0()) | n_3(x0, c_0(), c_0()) ....... R2 [R1:L0, U2:L0] % s_1(c_0()) ....... U2 % m_3(c_0(), c_0(), c_0()) | n_3(c_0(), c_0(), c_0()) ....... R3 [R2:L0, U2:L0] % ~m_3(x0,x1,x2) | ~r_3(x0,x1,x2) ....... B6 % n_3(c_0(), c_0(), c_0()) | ~r_3(c_0(), c_0(), c_0()) ....... R4 [R3:L0, B6:L0] % ~n_3(c_0(),c_0(),c_0()) ....... U3 % ~r_3(c_0(), c_0(), c_0()) ....... R5 [R4:L0, U3:L0] % Derivation of unit clause U8: % ~s_1(x2) | ~s_1(x1) | ~s_1(x0) | p_3(x0,x1,x2) | q_3(x0,x1,x2) | r_3(x0,x1,x2) ....... B7 % ~s_1(x0) | ~s_1(x1) | p_3(x1, x0, x0) | q_3(x1, x0, x0) | r_3(x1, x0, x0) ....... R1 [B7:L0, B7:L1] % s_1(c_0()) ....... U2 % ~s_1(x0) | p_3(x0, c_0(), c_0()) | q_3(x0, c_0(), c_0()) | r_3(x0, c_0(), c_0()) ....... R2 [R1:L0, U2:L0] % s_1(c_0()) ....... U2 % p_3(c_0(), c_0(), c_0()) | q_3(c_0(), c_0(), c_0()) | r_3(c_0(), c_0(), c_0()) ....... R3 [R2:L0, U2:L0] % ~p_3(c_0(),c_0(),c_0()) ....... U5 % q_3(c_0(), c_0(), c_0()) | r_3(c_0(), c_0(), c_0()) ....... R4 [R3:L0, U5:L0] % ~m_3(x0,x1,x2) | ~q_3(x0,x1,x2) ....... B5 % r_3(c_0(), c_0(), c_0()) | ~m_3(c_0(), c_0(), c_0()) ....... R5 [R4:L0, B5:L1] % ~r_3(c_0(),c_0(),c_0()) ....... U7 % ~m_3(c_0(), c_0(), c_0()) ....... R6 [R5:L0, U7:L0] % Derivation of the empty clause: % ~m_3(c_0(),c_0(),c_0()) ....... U8 % m_3(c_0(),c_0(),c_0()) ....... U4 % [] ....... R1 [U8:L0, U4:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 2735 % resolvents: 2668 factors: 67 % Number of unit clauses generated: 297 % % unit clauses generated to total clauses generated: 10.86 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 4 [4] = 1 [5] = 3 [6] = 1 % Total = 9 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 297 [2] = 1502 [3] = 849 [4] = 71 [5] = 16 % Average size of a generated clause: 3.0 % Number of unit clauses per predicate list: % ========================================== % [0] s_1 (+)3 (-)0 % [1] m_3 (+)1 (-)1 % [2] n_3 (+)0 (-)1 % [3] p_3 (+)0 (-)1 % [4] q_3 (+)0 (-)1 % [5] r_3 (+)0 (-)1 % ------------------ % Total: (+)4 (-)5 % Total number of unit clauses retained: 9 % Number of clauses skipped because of their length: 498 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 2755 % Number of unification failures: 1494 % Number of unit to unit unification failures: 0 % N literal unification failure due to lookup root_id table: 11886 % N base clause resolution failure due to lookup table: 2934 % 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: 248 % 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: 3 % Max term depth in a unit clause: 1 % Number of states in UCFA table: 22 % Total number of terms of all unit clauses in table: 21 % 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.05 % Number of symbols (columns) in UCFA: 43 % Profile 2: Number of calls to: % ============================== % PTUnify() = 4249 % ConstructUnitClause() = 253 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.00 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 0 secs % CPU time: 0.14 secs % %------------------------------------------------------------------------------