%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : SYN140-1 : TPTP v5.0.0. Released v1.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 : Sun Nov 28 08:35:49 EST 2010 % Result : Unsatisfiable 124.95s % Output : Refutation 124.95s % 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/SystemOnTPTP417/SYN/SYN140-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 = 831] [nf = 0] [nu = 404] [ut = 133] % Looking for a proof at depth = 2 ... % t = 1 secs [nr = 6512] [nf = 78] [nu = 2294] [ut = 241] % Looking for a proof at depth = 3 ... % t = 1 secs [nr = 104344] [nf = 630] [nu = 37217] [ut = 425] % Looking for a proof at depth = 4 ... % t = 6 secs [nr = 1174305] [nf = 10800] [nu = 428889] [ut = 517] % Looking for a proof at depth = 5 ... % t = 66 secs [nr = 13691688] [nf = 135279] [nu = 4989767] [ut = 602] % Looking for a proof at depth = 6 ... % Entering time slice 2 % Updating parameters ... done. % Looking for a proof at depth = 1 ... % t = 123 secs [nr = 25396427] [nf = 248244] [nu = 8952485] [ut = 602] % Looking for a proof at depth = 2 ... % t = 123 secs [nr = 25403526] [nf = 248322] [nu = 8955005] [ut = 602] % Looking for a proof at depth = 3 ... % t = 124 secs [nr = 25517763] [nf = 249098] [nu = 8999087] [ut = 608] % Looking for a proof at depth = 4 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: ~m4_2(b_0(),x0) % B1: m0_3(x0,d_0(),x1) % B2: p0_2(b_0(),x0) % B3: q0_2(x0,d_0()) % B6: k0_1(b_0()) % B7: l0_1(a_0()) % B13: n0_2(d_0(),e_0()) % B19: n0_2(b_0(),a_0()) % B48: ~n0_2(x1,x0) | l1_2(x0,x0) % B55: ~n0_2(x1,x0) | p1_3(x0,x0,x0) % B57: ~p0_2(x1,x0) | p1_3(x0,x0,x0) % B81: ~p0_2(x0,x0) | s1_1(x0) % B141: ~s1_1(x2) | ~q0_2(x0,x1) | s1_1(x0) % B147: ~l2_2(x2,x1) | ~s3_2(a_0(),x0) | m4_2(x0,x1) % B200: ~k0_1(x1) | ~p1_3(x0,x0,x0) | q2_3(x0,x1,x1) % B276: ~s1_1(x2) | ~p0_2(x1,x1) | ~m0_3(x3,x2,x0) | l2_2(x0,x0) % B281: ~s2_1(x0) | ~m0_3(x2,x3,x1) | ~q2_3(x2,x0,x2) | s3_2(x0,x1) % B296: ~l0_1(x2) | ~l1_2(x2,x0) | ~n1_3(x0,x1,x0) | n1_3(x0,x1,x1) % B314: ~n1_3(x1,x0,x2) | ~p1_3(x0,x0,x2) | ~q2_3(x1,x2,x0) | q2_3(x0,x1,x0) % B320: ~l0_1(x0) | ~s0_1(b_0()) | ~p0_2(b_0(),x1) | n1_3(x0,x1,x0) % Unit Clauses: % -------------- % U2: < d0 v1 dv1 f0 c1 t2 td1 b > p0_2(b_0(),x0) % U7: < d0 v0 dv0 f0 c1 t1 td1 b > l0_1(a_0()) % U12: < d0 v0 dv0 f0 c1 t1 td1 b > s0_1(b_0()) % U14: < d0 v0 dv0 f0 c2 t2 td1 b > n0_2(d_0(),b_0()) % U44: < d1 v3 dv1 f0 c0 t3 td1 > p1_3(x0,x0,x0) % U47: < d1 v0 dv0 f0 c1 t1 td1 > s1_1(b_0()) % U66: < d1 v0 dv0 f0 c2 t2 td1 > l1_2(e_0(),e_0()) % U74: < d1 v0 dv0 f0 c2 t2 td1 > l1_2(a_0(),a_0()) % U157: < d2 v1 dv1 f0 c0 t1 td1 > s1_1(x0) % U172: < d2 v1 dv1 f0 c2 t3 td1 > q2_3(x0,b_0(),b_0()) % U247: < d3 v2 dv1 f0 c0 t2 td1 > l2_2(x0,x0) % U276: < d3 v1 dv1 f0 c2 t3 td1 > n1_3(a_0(),x0,a_0()) % U305: < d3 v2 dv1 f0 c1 t3 td1 > n1_3(a_0(),x0,x0) % U425: < d4 v0 dv0 f0 c2 t2 td1 > ~s3_2(a_0(),b_0()) % U435: < d4 v0 dv0 f0 c1 t1 td1 > ~s2_1(a_0()) % U438: < d4 v0 dv0 f0 c3 t3 td1 > ~q2_3(b_0(),a_0(),b_0()) % U737: < d4 v0 dv0 f0 c3 t3 td1 > q2_3(b_0(),a_0(),b_0()) % --------------- Start of Proof --------------- % Derivation of unit clause U2: % p0_2(b_0(),x0) ....... U2 % Derivation of unit clause U7: % l0_1(a_0()) ....... U7 % Derivation of unit clause U12: % s0_1(b_0()) ....... U12 % Derivation of unit clause U14: % n0_2(d_0(),b_0()) ....... U14 % Derivation of unit clause U44: % p0_2(b_0(),x0) ....... B2 % ~p0_2(x1,x0) | p1_3(x0,x0,x0) ....... B57 % p1_3(x0, x0, x0) ....... R1 [B2:L0, B57:L0] % Derivation of unit clause U47: % p0_2(b_0(),x0) ....... B2 % ~p0_2(x0,x0) | s1_1(x0) ....... B81 % s1_1(b_0()) ....... R1 [B2:L0, B81:L0] % Derivation of unit clause U66: % n0_2(d_0(),e_0()) ....... B13 % ~n0_2(x1,x0) | l1_2(x0,x0) ....... B48 % l1_2(e_0(), e_0()) ....... R1 [B13:L0, B48:L0] % Derivation of unit clause U74: % n0_2(b_0(),a_0()) ....... B19 % ~n0_2(x1,x0) | l1_2(x0,x0) ....... B48 % l1_2(a_0(), a_0()) ....... R1 [B19:L0, B48:L0] % Derivation of unit clause U157: % q0_2(x0,d_0()) ....... B3 % ~s1_1(x2) | ~q0_2(x0,x1) | s1_1(x0) ....... B141 % ~s1_1(x0) | s1_1(x1) ....... R1 [B3:L0, B141:L1] % s1_1(b_0()) ....... U47 % s1_1(x0) ....... R2 [R1:L0, U47:L0] % Derivation of unit clause U172: % k0_1(b_0()) ....... B6 % ~k0_1(x1) | ~p1_3(x0,x0,x0) | q2_3(x0,x1,x1) ....... B200 % ~p1_3(x0, x0, x0) | q2_3(x0, b_0(), b_0()) ....... R1 [B6:L0, B200:L0] % p1_3(x0,x0,x0) ....... U44 % q2_3(x0, b_0(), b_0()) ....... R2 [R1:L0, U44:L0] % Derivation of unit clause U247: % m0_3(x0,d_0(),x1) ....... B1 % ~s1_1(x2) | ~p0_2(x1,x1) | ~m0_3(x3,x2,x0) | l2_2(x0,x0) ....... B276 % ~s1_1(d_0()) | ~p0_2(x0, x0) | l2_2(x1, x1) ....... R1 [B1:L0, B276:L2] % s1_1(x0) ....... U157 % ~p0_2(x0, x0) | l2_2(x1, x1) ....... R2 [R1:L0, U157:L0] % p0_2(b_0(),x0) ....... U2 % l2_2(x0, x0) ....... R3 [R2:L0, U2:L0] % Derivation of unit clause U276: % p0_2(b_0(),x0) ....... B2 % ~l0_1(x0) | ~s0_1(b_0()) | ~p0_2(b_0(),x1) | n1_3(x0,x1,x0) ....... B320 % ~l0_1(x0) | ~s0_1(b_0()) | n1_3(x0, x1, x0) ....... R1 [B2:L0, B320:L2] % l0_1(a_0()) ....... U7 % ~s0_1(b_0()) | n1_3(a_0(), x0, a_0()) ....... R2 [R1:L0, U7:L0] % s0_1(b_0()) ....... U12 % n1_3(a_0(), x0, a_0()) ....... R3 [R2:L0, U12:L0] % Derivation of unit clause U305: % l0_1(a_0()) ....... B7 % ~l0_1(x2) | ~l1_2(x2,x0) | ~n1_3(x0,x1,x0) | n1_3(x0,x1,x1) ....... B296 % ~l1_2(a_0(), x0) | ~n1_3(x0, x1, x0) | n1_3(x0, x1, x1) ....... R1 [B7:L0, B296:L0] % l1_2(a_0(),a_0()) ....... U74 % ~n1_3(a_0(), x0, a_0()) | n1_3(a_0(), x0, x0) ....... R2 [R1:L0, U74:L0] % n1_3(a_0(),x0,a_0()) ....... U276 % n1_3(a_0(), x0, x0) ....... R3 [R2:L0, U276:L0] % Derivation of unit clause U425: % ~m4_2(b_0(),x0) ....... B0 % ~l2_2(x2,x1) | ~s3_2(a_0(),x0) | m4_2(x0,x1) ....... B147 % ~l2_2(x0, x1) | ~s3_2(a_0(), b_0()) ....... R1 [B0:L0, B147:L2] % ~l1_2(e_0(),e_0()) | ~l2_2(c_0(),c_0()) | l2_2(c_0(),c_0()) ....... B256 % ~s3_2(a_0(), b_0()) | ~l1_2(e_0(), e_0()) | ~l2_2(c_0(), c_0()) ....... R2 [R1:L0, B256:L2] % l1_2(e_0(),e_0()) ....... U66 % ~s3_2(a_0(), b_0()) | ~l2_2(c_0(), c_0()) ....... R3 [R2:L1, U66:L0] % l2_2(x0,x0) ....... U247 % ~s3_2(a_0(), b_0()) ....... R4 [R3:L1, U247:L0] % Derivation of unit clause U435: % m0_3(x0,d_0(),x1) ....... B1 % ~s2_1(x0) | ~m0_3(x2,x3,x1) | ~q2_3(x2,x0,x2) | s3_2(x0,x1) ....... B281 % ~s2_1(x0) | ~q2_3(x1, x0, x1) | s3_2(x0, x2) ....... R1 [B1:L0, B281:L1] % ~s3_2(a_0(),b_0()) ....... U425 % ~s2_1(a_0()) | ~q2_3(x0, a_0(), x0) ....... R2 [R1:L2, U425:L0] % ~l1_2(x1,x0) | q2_3(x0,x0,x1) ....... B53 % ~s2_1(a_0()) | ~l1_2(a_0(), a_0()) ....... R3 [R2:L1, B53:L1] % l1_2(a_0(),a_0()) ....... U74 % ~s2_1(a_0()) ....... R4 [R3:L1, U74:L0] % Derivation of unit clause U438: % q0_2(x0,d_0()) ....... B3 % ~s1_1(x2) | ~q0_2(x0,x1) | s1_1(x0) ....... B141 % ~s1_1(x0) | s1_1(x1) ....... R1 [B3:L0, B141:L1] % ~s1_1(b_0()) | ~q2_3(b_0(),x0,b_0()) | s2_1(x0) ....... B229 % ~s1_1(x0) | ~q2_3(b_0(), x1, b_0()) | s2_1(x1) ....... R2 [R1:L1, B229:L0] % s1_1(b_0()) ....... U47 % ~q2_3(b_0(), x0, b_0()) | s2_1(x0) ....... R3 [R2:L0, U47:L0] % ~s2_1(a_0()) ....... U435 % ~q2_3(b_0(), a_0(), b_0()) ....... R4 [R3:L1, U435:L0] % Derivation of unit clause U737: % ~n0_2(x1,x0) | p1_3(x0,x0,x0) ....... B55 % ~n1_3(x1,x0,x2) | ~p1_3(x0,x0,x2) | ~q2_3(x1,x2,x0) | q2_3(x0,x1,x0) ....... B314 % ~n0_2(x0, x1) | ~n1_3(x2, x1, x1) | ~q2_3(x2, x1, x1) | q2_3(x1, x2, x1) ....... R1 [B55:L1, B314:L1] % n0_2(d_0(),b_0()) ....... U14 % ~n1_3(x0, b_0(), b_0()) | ~q2_3(x0, b_0(), b_0()) | q2_3(b_0(), x0, b_0()) ....... R2 [R1:L0, U14:L0] % n1_3(a_0(),x0,x0) ....... U305 % ~q2_3(a_0(), b_0(), b_0()) | q2_3(b_0(), a_0(), b_0()) ....... R3 [R2:L0, U305:L0] % q2_3(x0,b_0(),b_0()) ....... U172 % q2_3(b_0(), a_0(), b_0()) ....... R4 [R3:L0, U172:L0] % Derivation of the empty clause: % q2_3(b_0(),a_0(),b_0()) ....... U737 % ~q2_3(b_0(),a_0(),b_0()) ....... U438 % [] ....... R1 [U737:L0, U438:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 26505215 % resolvents: 26251694 factors: 253521 % Number of unit clauses generated: 9304981 % % unit clauses generated to total clauses generated: 35.11 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 39 [1] = 94 [2] = 108 [3] = 190 % [4] = 222 [5] = 85 % Total = 738 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 9304981 [2] = 13296260 [3] = 3897026 [4] = 6948 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] k0_1 (+)2 (-)1 % [1] k1_1 (+)5 (-)0 % [2] k4_1 (+)2 (-)0 % [3] k5_1 (+)6 (-)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 (+)5 (-)0 % [12] r2_1 (+)2 (-)0 % [13] r4_1 (+)6 (-)0 % [14] s0_1 (+)2 (-)0 % [15] s1_1 (+)5 (-)0 % [16] s2_1 (+)4 (-)1 % [17] s4_1 (+)5 (-)0 % [18] s5_1 (+)6 (-)0 % [19] k2_2 (+)20 (-)0 % [20] l1_2 (+)7 (-)1 % [21] l2_2 (+)14 (-)0 % [22] l3_2 (+)14 (-)0 % [23] m4_2 (+)0 (-)2 % [24] m5_2 (+)0 (-)0 % [25] n0_2 (+)8 (-)0 % [26] n4_2 (+)24 (-)0 % [27] n5_2 (+)6 (-)0 % [28] p0_2 (+)4 (-)0 % [29] q0_2 (+)8 (-)0 % [30] q3_2 (+)7 (-)0 % [31] q4_2 (+)22 (-)0 % [32] q5_2 (+)0 (-)0 % [33] r5_2 (+)0 (-)0 % [34] s3_2 (+)13 (-)1 % [35] k3_3 (+)49 (-)0 % [36] m0_3 (+)10 (-)0 % [37] m1_3 (+)39 (-)0 % [38] m3_3 (+)38 (-)0 % [39] n1_3 (+)35 (-)0 % [40] p1_3 (+)40 (-)0 % [41] p2_3 (+)46 (-)0 % [42] p3_3 (+)50 (-)0 % [43] p4_3 (+)37 (-)0 % [44] p5_3 (+)30 (-)0 % [45] q1_3 (+)53 (-)0 % [46] q2_3 (+)41 (-)1 % [47] r3_3 (+)42 (-)0 % ------------------ % Total: (+)731 (-)7 % Total number of unit clauses retained: 738 % Number of clauses skipped because of their length: 411424255 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 3277133 % Number of successful unifications: 26505248 % Number of unification failures: 49660317 % Number of unit to unit unification failures: 66 % N literal unification failure due to lookup root_id table: 184146481 % N base clause resolution failure due to lookup table: 610535177 % N UC-BCL resolution dropped due to lookup table: 108339 % Max entries in substitution set: 18 % N unit clauses dropped because they exceeded max values: 8451535 % 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: 491 % Total number of terms of all unit clauses in table: 1911 % Max allowed number of states in UCFA: 80000 % Ratio n states used/total allowed states: 0.01 % Ratio n states used/total unit clauses terms: 0.26 % Number of symbols (columns) in UCFA: 87 % Profile 2: Number of calls to: % ============================== % PTUnify() = 76165565 % ConstructUnitClause() = 8452234 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 9.18 secs % -------------------------------------------------------- % | | % Inferences per sec: 213752 % | | % -------------------------------------------------------- % Elapsed time: 127 secs % CPU time: 124.92 secs % %------------------------------------------------------------------------------