%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : SYN181-1 : TPTP v5.0.0. Released v1.1.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art04.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:40:15 EST 2010 % Result : Unsatisfiable 0.67s % Output : Refutation 0.67s % 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/SystemOnTPTP4130/SYN/SYN181-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 = 104391] [nf = 630] [nu = 37235] [ut = 430] % Looking for a proof at depth = 4 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: ~q4_2(d_0(),b_0()) % B1: m0_3(x0,d_0(),x1) % B2: p0_2(b_0(),x0) % B20: n0_2(c_0(),d_0()) % B39: ~p1_3(x1,x2,x0) | n2_1(x0) % B48: ~n0_2(x1,x0) | l1_2(x0,x0) % B52: ~l1_2(x1,x0) | p2_3(x0,x0,x0) % B57: ~p0_2(x1,x0) | p1_3(x0,x0,x0) % B72: ~p2_3(x1,x0,x0) | k3_3(x0,x0,x0) % B86: ~n2_1(x0) | m3_3(x0,x0,x0) % B270: ~k3_3(x2,x2,x0) | ~m3_3(x3,x4,x3) | ~q2_3(x3,x1,x0) | q4_2(x0,x1) % B275: ~r0_1(x3) | ~p0_2(x2,x0) | ~m0_3(x1,x0,x2) | l1_2(x0,x1) % Unit Clauses: % -------------- % U2: < d0 v1 dv1 f0 c1 t2 td1 b > p0_2(b_0(),x0) % U9: < d0 v0 dv0 f0 c1 t1 td1 b > r0_1(e_0()) % U44: < d1 v3 dv1 f0 c0 t3 td1 > p1_3(x0,x0,x0) % U76: < d1 v0 dv0 f0 c2 t2 td1 > l1_2(d_0(),d_0()) % U88: < d1 v1 dv1 f0 c0 t1 td1 > n2_1(x0) % U98: < d1 v0 dv0 f0 c3 t3 td1 > p2_3(d_0(),d_0(),d_0()) % U117: < d1 v0 dv0 f0 c3 t3 td1 > k3_3(d_0(),d_0(),d_0()) % U119: < d1 v3 dv1 f0 c0 t3 td1 > m3_3(x0,x0,x0) % U251: < d3 v1 dv1 f0 c1 t2 td1 > l1_2(d_0(),x0) % U430: < d4 v0 dv0 f0 c2 t2 td1 > ~l1_2(d_0(),b_0()) % --------------- Start of Proof --------------- % Derivation of unit clause U2: % p0_2(b_0(),x0) ....... U2 % Derivation of unit clause U9: % r0_1(e_0()) ....... U9 % 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 U76: % n0_2(c_0(),d_0()) ....... B20 % ~n0_2(x1,x0) | l1_2(x0,x0) ....... B48 % l1_2(d_0(), d_0()) ....... R1 [B20:L0, B48:L0] % Derivation of unit clause U88: % ~p1_3(x1,x2,x0) | n2_1(x0) ....... B39 % p1_3(x0,x0,x0) ....... U44 % n2_1(x0) ....... R1 [B39:L0, U44:L0] % Derivation of unit clause U98: % ~l1_2(x1,x0) | p2_3(x0,x0,x0) ....... B52 % l1_2(d_0(),d_0()) ....... U76 % p2_3(d_0(), d_0(), d_0()) ....... R1 [B52:L0, U76:L0] % Derivation of unit clause U117: % ~p2_3(x1,x0,x0) | k3_3(x0,x0,x0) ....... B72 % p2_3(d_0(),d_0(),d_0()) ....... U98 % k3_3(d_0(), d_0(), d_0()) ....... R1 [B72:L0, U98:L0] % Derivation of unit clause U119: % ~n2_1(x0) | m3_3(x0,x0,x0) ....... B86 % n2_1(x0) ....... U88 % m3_3(x0, x0, x0) ....... R1 [B86:L0, U88:L0] % Derivation of unit clause U251: % m0_3(x0,d_0(),x1) ....... B1 % ~r0_1(x3) | ~p0_2(x2,x0) | ~m0_3(x1,x0,x2) | l1_2(x0,x1) ....... B275 % ~r0_1(x0) | ~p0_2(x1, d_0()) | l1_2(d_0(), x2) ....... R1 [B1:L0, B275:L2] % r0_1(e_0()) ....... U9 % ~p0_2(x0, d_0()) | l1_2(d_0(), x1) ....... R2 [R1:L0, U9:L0] % p0_2(b_0(),x0) ....... U2 % l1_2(d_0(), x0) ....... R3 [R2:L0, U2:L0] % Derivation of unit clause U430: % ~q4_2(d_0(),b_0()) ....... B0 % ~k3_3(x2,x2,x0) | ~m3_3(x3,x4,x3) | ~q2_3(x3,x1,x0) | q4_2(x0,x1) ....... B270 % ~k3_3(x0, x0, d_0()) | ~m3_3(x1, x2, x1) | ~q2_3(x1, b_0(), d_0()) ....... R1 [B0:L0, B270:L3] % k3_3(d_0(),d_0(),d_0()) ....... U117 % ~m3_3(x0, x1, x0) | ~q2_3(x0, b_0(), d_0()) ....... R2 [R1:L0, U117:L0] % ~l1_2(x1,x0) | q2_3(x0,x0,x1) ....... B53 % ~m3_3(b_0(), x0, b_0()) | ~l1_2(d_0(), b_0()) ....... R3 [R2:L1, B53:L1] % m3_3(x0,x0,x0) ....... U119 % ~l1_2(d_0(), b_0()) ....... R4 [R3:L0, U119:L0] % Derivation of the empty clause: % ~l1_2(d_0(),b_0()) ....... U430 % l1_2(d_0(),x0) ....... U251 % [] ....... R1 [U430:L0, U251:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 105031 % resolvents: 104401 factors: 630 % Number of unit clauses generated: 37242 % % unit clauses generated to total clauses generated: 35.46 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 39 [1] = 94 [2] = 108 [3] = 189 % [4] = 1 % Total = 431 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 37242 [2] = 55210 [3] = 12579 % 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 (+)1 (-)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 (+)0 (-)0 % [13] r4_1 (+)6 (-)0 % [14] s0_1 (+)2 (-)0 % [15] s1_1 (+)5 (-)0 % [16] s2_1 (+)3 (-)0 % [17] s4_1 (+)5 (-)0 % [18] s5_1 (+)0 (-)0 % [19] k2_2 (+)6 (-)0 % [20] l1_2 (+)7 (-)1 % [21] l2_2 (+)14 (-)0 % [22] l3_2 (+)12 (-)0 % [23] m4_2 (+)0 (-)0 % [24] m5_2 (+)0 (-)0 % [25] n0_2 (+)8 (-)0 % [26] n4_2 (+)6 (-)0 % [27] n5_2 (+)6 (-)0 % [28] p0_2 (+)4 (-)0 % [29] q0_2 (+)8 (-)0 % [30] q3_2 (+)4 (-)0 % [31] q4_2 (+)0 (-)1 % [32] q5_2 (+)0 (-)0 % [33] r5_2 (+)0 (-)0 % [34] s3_2 (+)2 (-)0 % [35] k3_3 (+)30 (-)0 % [36] m0_3 (+)10 (-)0 % [37] m1_3 (+)35 (-)0 % [38] m3_3 (+)7 (-)0 % [39] n1_3 (+)32 (-)0 % [40] p1_3 (+)29 (-)0 % [41] p2_3 (+)32 (-)0 % [42] p3_3 (+)20 (-)0 % [43] p4_3 (+)10 (-)0 % [44] p5_3 (+)1 (-)0 % [45] q1_3 (+)42 (-)0 % [46] q2_3 (+)20 (-)6 % [47] r3_3 (+)14 (-)0 % ------------------ % Total: (+)423 (-)8 % Total number of unit clauses retained: 431 % Number of clauses skipped because of their length: 1460169 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 16891 % Number of successful unifications: 105044 % Number of unification failures: 132207 % Number of unit to unit unification failures: 125 % N literal unification failure due to lookup root_id table: 512513 % N base clause resolution failure due to lookup table: 1642039 % N UC-BCL resolution dropped due to lookup table: 398 % Max entries in substitution set: 9 % N unit clauses dropped because they exceeded max values: 34091 % 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: 399 % Total number of terms of all unit clauses in table: 1086 % 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.37 % Number of symbols (columns) in UCFA: 87 % Profile 2: Number of calls to: % ============================== % PTUnify() = 237251 % ConstructUnitClause() = 34483 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.05 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 1 secs % CPU time: 0.66 secs % %------------------------------------------------------------------------------