%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : SYN110-1 : TPTP v5.0.0. Released v1.1.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art03.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:33:07 EST 2010 % Result : Unsatisfiable 0.28s % Output : Refutation 0.28s % 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/SystemOnTPTP28611/SYN/SYN110-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 = 1 secs [nr = 830] [nf = 0] [nu = 404] [ut = 133] % Looking for a proof at depth = 2 ... % t = 1 secs [nr = 6509] [nf = 78] [nu = 2294] [ut = 241] % Looking for a proof at depth = 3 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: ~k2_2(c_0(),a_0()) % B1: m0_3(x0,d_0(),x1) % B19: n0_2(b_0(),a_0()) % B42: ~m0_3(x1,x2,x0) | m1_3(x0,x0,x0) % B44: ~m0_3(x1,x2,x0) | q1_3(x0,x0,x0) % B47: ~n0_2(x1,x0) | k1_1(x0) % B63: ~q1_3(x1,x0,x0) | k2_2(x0,x0) % B274: ~k1_1(x3) | ~k2_2(x3,x1) | ~m1_3(x2,x1,x0) | k2_2(x0,x1) % B312: ~q0_2(x0,x1) | ~m0_3(a_0(),x2,a_0()) | ~m1_3(x1,c_0(),x1) | m1_3(x0,a_0(),x1) % Unit Clauses: % -------------- % U26: < d0 v0 dv0 f0 c2 t2 td1 b > q0_2(d_0(),c_0()) % U39: < d1 v3 dv1 f0 c0 t3 td1 > m1_3(x0,x0,x0) % U40: < d1 v3 dv1 f0 c0 t3 td1 > q1_3(x0,x0,x0) % U73: < d1 v0 dv0 f0 c1 t1 td1 > k1_1(a_0()) % U104: < d1 v2 dv1 f0 c0 t2 td1 > k2_2(x0,x0) % U241: < d3 v1 dv1 f0 c2 t3 td1 > ~m1_3(x0,a_0(),c_0()) % U251: < d3 v0 dv0 f0 c3 t3 td1 > m1_3(d_0(),a_0(),c_0()) % --------------- Start of Proof --------------- % Derivation of unit clause U26: % q0_2(d_0(),c_0()) ....... U26 % Derivation of unit clause U39: % m0_3(x0,d_0(),x1) ....... B1 % ~m0_3(x1,x2,x0) | m1_3(x0,x0,x0) ....... B42 % m1_3(x0, x0, x0) ....... R1 [B1:L0, B42:L0] % Derivation of unit clause U40: % m0_3(x0,d_0(),x1) ....... B1 % ~m0_3(x1,x2,x0) | q1_3(x0,x0,x0) ....... B44 % q1_3(x0, x0, x0) ....... R1 [B1:L0, B44:L0] % Derivation of unit clause U73: % n0_2(b_0(),a_0()) ....... B19 % ~n0_2(x1,x0) | k1_1(x0) ....... B47 % k1_1(a_0()) ....... R1 [B19:L0, B47:L0] % Derivation of unit clause U104: % ~q1_3(x1,x0,x0) | k2_2(x0,x0) ....... B63 % q1_3(x0,x0,x0) ....... U40 % k2_2(x0, x0) ....... R1 [B63:L0, U40:L0] % Derivation of unit clause U241: % ~k2_2(c_0(),a_0()) ....... B0 % ~k1_1(x3) | ~k2_2(x3,x1) | ~m1_3(x2,x1,x0) | k2_2(x0,x1) ....... B274 % ~k1_1(x0) | ~k2_2(x0, a_0()) | ~m1_3(x1, a_0(), c_0()) ....... R1 [B0:L0, B274:L3] % k1_1(a_0()) ....... U73 % ~k2_2(a_0(), a_0()) | ~m1_3(x0, a_0(), c_0()) ....... R2 [R1:L0, U73:L0] % k2_2(x0,x0) ....... U104 % ~m1_3(x0, a_0(), c_0()) ....... R3 [R2:L0, U104:L0] % Derivation of unit clause U251: % m0_3(x0,d_0(),x1) ....... B1 % ~q0_2(x0,x1) | ~m0_3(a_0(),x2,a_0()) | ~m1_3(x1,c_0(),x1) | m1_3(x0,a_0(),x1) ....... B312 % ~q0_2(x0, x1) | ~m1_3(x1, c_0(), x1) | m1_3(x0, a_0(), x1) ....... R1 [B1:L0, B312:L1] % q0_2(d_0(),c_0()) ....... U26 % ~m1_3(c_0(), c_0(), c_0()) | m1_3(d_0(), a_0(), c_0()) ....... R2 [R1:L0, U26:L0] % m1_3(x0,x0,x0) ....... U39 % m1_3(d_0(), a_0(), c_0()) ....... R3 [R2:L0, U39:L0] % Derivation of the empty clause: % m1_3(d_0(),a_0(),c_0()) ....... U251 % ~m1_3(x0,a_0(),c_0()) ....... U241 % [] ....... R1 [U251:L0, U241:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 7302 % resolvents: 7213 factors: 89 % Number of unit clauses generated: 2510 % % unit clauses generated to total clauses generated: 34.37 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 39 [1] = 94 [2] = 108 [3] = 11 % Total = 252 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 2510 [2] = 3657 [3] = 1135 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] k0_1 (+)2 (-)0 % [1] k1_1 (+)5 (-)0 % [2] k4_1 (+)0 (-)0 % [3] k5_1 (+)0 (-)0 % [4] l0_1 (+)2 (-)0 % [5] l4_1 (+)6 (-)0 % [6] l5_1 (+)0 (-)0 % [7] m2_1 (+)2 (-)0 % [8] n2_1 (+)6 (-)0 % [9] n3_1 (+)6 (-)0 % [10] r0_1 (+)2 (-)0 % [11] r1_1 (+)0 (-)0 % [12] r2_1 (+)0 (-)0 % [13] r4_1 (+)0 (-)0 % [14] s0_1 (+)2 (-)0 % [15] s1_1 (+)5 (-)0 % [16] s2_1 (+)1 (-)0 % [17] s4_1 (+)0 (-)0 % [18] s5_1 (+)0 (-)0 % [19] k2_2 (+)6 (-)1 % [20] l1_2 (+)6 (-)0 % [21] l2_2 (+)2 (-)0 % [22] l3_2 (+)3 (-)0 % [23] m4_2 (+)0 (-)0 % [24] m5_2 (+)0 (-)0 % [25] n0_2 (+)8 (-)0 % [26] n4_2 (+)0 (-)0 % [27] n5_2 (+)0 (-)0 % [28] p0_2 (+)4 (-)0 % [29] q0_2 (+)8 (-)0 % [30] q3_2 (+)2 (-)0 % [31] q4_2 (+)0 (-)0 % [32] q5_2 (+)0 (-)0 % [33] r5_2 (+)0 (-)0 % [34] s3_2 (+)1 (-)0 % [35] k3_3 (+)7 (-)0 % [36] m0_3 (+)10 (-)0 % [37] m1_3 (+)25 (-)1 % [38] m3_3 (+)6 (-)0 % [39] n1_3 (+)21 (-)0 % [40] p1_3 (+)21 (-)0 % [41] p2_3 (+)14 (-)0 % [42] p3_3 (+)6 (-)0 % [43] p4_3 (+)6 (-)0 % [44] p5_3 (+)0 (-)0 % [45] q1_3 (+)32 (-)0 % [46] q2_3 (+)16 (-)0 % [47] r3_3 (+)7 (-)0 % ------------------ % Total: (+)250 (-)2 % Total number of unit clauses retained: 252 % Number of clauses skipped because of their length: 85221 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 108 % Number of successful unifications: 7312 % Number of unification failures: 3464 % Number of unit to unit unification failures: 30 % N literal unification failure due to lookup root_id table: 19695 % N base clause resolution failure due to lookup table: 103033 % N UC-BCL resolution dropped due to lookup table: 15 % Max entries in substitution set: 9 % N unit clauses dropped because they exceeded max values: 1714 % 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: 283 % Total number of terms of all unit clauses in table: 637 % 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: 0.44 % Number of symbols (columns) in UCFA: 87 % Profile 2: Number of calls to: % ============================== % PTUnify() = 10776 % ConstructUnitClause() = 1927 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.00 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 1 secs % CPU time: 0.28 secs % %------------------------------------------------------------------------------