%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : SYN205-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:42:16 EST 2010 % Result : Unsatisfiable 124.93s % Output : Refutation 124.93s % 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/SystemOnTPTP30159/SYN/SYN205-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 ... % t = 1 secs [nr = 104331] [nf = 630] [nu = 37219] [ut = 426] % Looking for a proof at depth = 4 ... % t = 6 secs [nr = 1174063] [nf = 10799] [nu = 428815] [ut = 515] % Looking for a proof at depth = 5 ... % t = 66 secs [nr = 13687794] [nf = 135264] [nu = 4987968] [ut = 600] % Looking for a proof at depth = 6 ... % Entering time slice 2 % Updating parameters ... done. % Looking for a proof at depth = 1 ... % t = 124 secs [nr = 25331534] [nf = 247713] [nu = 8926416] [ut = 600] % Looking for a proof at depth = 2 ... % t = 124 secs [nr = 25338617] [nf = 247791] [nu = 8928922] [ut = 600] % Looking for a proof at depth = 3 ... % t = 124 secs [nr = 25452794] [nf = 248567] [nu = 8972974] [ut = 606] % Looking for a proof at depth = 4 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: ~s3_2(a_0(),d_0()) % B2: p0_2(b_0(),x0) % B6: k0_1(b_0()) % B7: l0_1(a_0()) % B19: n0_2(b_0(),a_0()) % B48: ~n0_2(x1,x0) | l1_2(x0,x0) % B53: ~l1_2(x1,x0) | q2_3(x0,x0,x1) % 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) % B200: ~k0_1(x1) | ~p1_3(x0,x0,x0) | q2_3(x0,x1,x1) % B229: ~s1_1(b_0()) | ~q2_3(b_0(),x0,b_0()) | s2_1(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: % -------------- % U1: < d0 v2 dv2 f0 c1 t3 td1 b > m0_3(x0,d_0(),x1) % 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) % U74: < d1 v0 dv0 f0 c2 t2 td1 > l1_2(a_0(),a_0()) % U102: < d1 v0 dv0 f0 c3 t3 td1 > q2_3(a_0(),a_0(),a_0()) % U172: < d2 v1 dv1 f0 c2 t3 td1 > q2_3(x0,b_0(),b_0()) % U241: < d3 v0 dv0 f0 c1 t1 td1 > ~s2_1(a_0()) % 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) % U406: < d3 v0 dv0 f0 c3 t3 td1 > ~q2_3(b_0(),a_0(),b_0()) % U735: < d4 v0 dv0 f0 c3 t3 td1 > q2_3(b_0(),a_0(),b_0()) % --------------- Start of Proof --------------- % Derivation of unit clause U1: % m0_3(x0,d_0(),x1) ....... U1 % 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 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 U102: % ~l1_2(x1,x0) | q2_3(x0,x0,x1) ....... B53 % l1_2(a_0(),a_0()) ....... U74 % q2_3(a_0(), a_0(), a_0()) ....... R1 [B53:L0, U74: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 U241: % ~s3_2(a_0(),d_0()) ....... B0 % ~s2_1(x0) | ~m0_3(x2,x3,x1) | ~q2_3(x2,x0,x2) | s3_2(x0,x1) ....... B281 % ~s2_1(a_0()) | ~m0_3(x0, x1, d_0()) | ~q2_3(x0, a_0(), x0) ....... R1 [B0:L0, B281:L3] % m0_3(x0,d_0(),x1) ....... U1 % ~s2_1(a_0()) | ~q2_3(x0, a_0(), x0) ....... R2 [R1:L1, U1:L0] % q2_3(a_0(),a_0(),a_0()) ....... U102 % ~s2_1(a_0()) ....... R3 [R2:L1, U102: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 U406: % ~p0_2(x0,x0) | s1_1(x0) ....... B81 % ~s1_1(b_0()) | ~q2_3(b_0(),x0,b_0()) | s2_1(x0) ....... B229 % ~p0_2(b_0(), b_0()) | ~q2_3(b_0(), x0, b_0()) | s2_1(x0) ....... R1 [B81:L1, B229:L0] % p0_2(b_0(),x0) ....... U2 % ~q2_3(b_0(), x0, b_0()) | s2_1(x0) ....... R2 [R1:L0, U2:L0] % ~s2_1(a_0()) ....... U241 % ~q2_3(b_0(), a_0(), b_0()) ....... R3 [R2:L1, U241:L0] % Derivation of unit clause U735: % ~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()) ....... U735 % ~q2_3(b_0(),a_0(),b_0()) ....... U406 % [] ....... R1 [U735:L0, U406:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 26439413 % resolvents: 26186424 factors: 252989 % Number of unit clauses generated: 9278759 % % unit clauses generated to total clauses generated: 35.09 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 39 [1] = 94 [2] = 108 [3] = 191 % [4] = 219 [5] = 85 % Total = 736 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 9278759 [2] = 13265697 [3] = 3888023 [4] = 6934 % 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 (-)0 % [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 (-)5 % Total number of unit clauses retained: 736 % Number of clauses skipped because of their length: 410361057 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 3270637 % Number of successful unifications: 26439434 % Number of unification failures: 49508217 % Number of unit to unit unification failures: 66 % N literal unification failure due to lookup root_id table: 183736385 % N base clause resolution failure due to lookup table: 608835618 % N UC-BCL resolution dropped due to lookup table: 102869 % Max entries in substitution set: 18 % N unit clauses dropped because they exceeded max values: 8428254 % 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: 489 % Total number of terms of all unit clauses in table: 1907 % 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() = 75947651 % ConstructUnitClause() = 8428951 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 9.02 secs % -------------------------------------------------------- % | | % Inferences per sec: 213221 % | | % -------------------------------------------------------- % Elapsed time: 128 secs % CPU time: 124.92 secs % %------------------------------------------------------------------------------