TSTP Solution File: SYN273-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN273-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:48:07 EST 2010
% Result : Unsatisfiable 124.20s
% Output : Refutation 124.20s
% 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/SystemOnTPTP2523/SYN/SYN273-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 = 0 secs [nr = 833] [nf = 0] [nu = 407] [ut = 135]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 6515] [nf = 78] [nu = 2301] [ut = 243]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 104422] [nf = 630] [nu = 37281] [ut = 434]
% Looking for a proof at depth = 4 ...
% t = 5 secs [nr = 1174692] [nf = 10797] [nu = 429128] [ut = 527]
% Looking for a proof at depth = 5 ...
% t = 66 secs [nr = 13692235] [nf = 135259] [nu = 4989726] [ut = 615]
% Looking for a proof at depth = 6 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% t = 122 secs [nr = 25127247] [nf = 245603] [nu = 8872358] [ut = 615]
% Looking for a proof at depth = 2 ...
% t = 122 secs [nr = 25134344] [nf = 245681] [nu = 8874871] [ut = 615]
% Looking for a proof at depth = 3 ...
% t = 123 secs [nr = 25248691] [nf = 246457] [nu = 8919041] [ut = 624]
% Looking for a proof at depth = 4 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: ~p4_3(e_0(),c_0(),e_0())
% B1: m0_3(x0,d_0(),x1)
% B5: k0_1(e_0())
% B44: ~m0_3(x1,x2,x0) | q1_3(x0,x0,x0)
% B47: ~n0_2(x1,x0) | k1_1(x0)
% B51: ~k2_2(x1,x0) | k3_3(x0,x0,x1)
% B63: ~q1_3(x1,x0,x0) | k2_2(x0,x0)
% B64: ~k3_3(x0,x0,x1) | p4_3(x0,x1,x0)
% B179: ~k0_1(x1) | ~l0_1(x0) | m1_3(x0,x1,x0)
% B274: ~k1_1(x3) | ~k2_2(x3,x1) | ~m1_3(x2,x1,x0) | k2_2(x0,x1)
% Unit Clauses:
% --------------
% U8: < d0 v0 dv0 f0 c1 t1 td1 b > l0_1(c_0())
% U13: < d0 v0 dv0 f0 c2 t2 td1 b > n0_2(d_0(),e_0())
% U39: < d1 v0 dv0 f0 c3 t3 td1 > ~k3_3(e_0(),e_0(),c_0())
% U41: < d1 v3 dv1 f0 c0 t3 td1 > q1_3(x0,x0,x0)
% U95: < d1 v0 dv0 f0 c2 t2 td1 > ~k2_2(c_0(),e_0())
% U106: < d1 v2 dv1 f0 c0 t2 td1 > k2_2(x0,x0)
% U163: < d2 v0 dv0 f0 c3 t3 td1 > m1_3(c_0(),e_0(),c_0())
% U674: < d4 v0 dv0 f0 c2 t2 td1 > k2_2(c_0(),e_0())
% --------------- Start of Proof ---------------
% Derivation of unit clause U8:
% l0_1(c_0()) ....... U8
% Derivation of unit clause U13:
% n0_2(d_0(),e_0()) ....... U13
% Derivation of unit clause U39:
% ~p4_3(e_0(),c_0(),e_0()) ....... B0
% ~k3_3(x0,x0,x1) | p4_3(x0,x1,x0) ....... B64
% ~k3_3(e_0(), e_0(), c_0()) ....... R1 [B0:L0, B64:L1]
% Derivation of unit clause U41:
% 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 U95:
% ~k2_2(x1,x0) | k3_3(x0,x0,x1) ....... B51
% ~k3_3(e_0(),e_0(),c_0()) ....... U39
% ~k2_2(c_0(), e_0()) ....... R1 [B51:L1, U39:L0]
% Derivation of unit clause U106:
% ~q1_3(x1,x0,x0) | k2_2(x0,x0) ....... B63
% q1_3(x0,x0,x0) ....... U41
% k2_2(x0, x0) ....... R1 [B63:L0, U41:L0]
% Derivation of unit clause U163:
% k0_1(e_0()) ....... B5
% ~k0_1(x1) | ~l0_1(x0) | m1_3(x0,x1,x0) ....... B179
% ~l0_1(x0) | m1_3(x0, e_0(), x0) ....... R1 [B5:L0, B179:L0]
% l0_1(c_0()) ....... U8
% m1_3(c_0(), e_0(), c_0()) ....... R2 [R1:L0, U8:L0]
% Derivation of unit clause U674:
% ~n0_2(x1,x0) | k1_1(x0) ....... B47
% ~k1_1(x3) | ~k2_2(x3,x1) | ~m1_3(x2,x1,x0) | k2_2(x0,x1) ....... B274
% ~n0_2(x0, x1) | ~k2_2(x1, x2) | ~m1_3(x3, x2, x4) | k2_2(x4, x2) ....... R1 [B47:L1, B274:L0]
% n0_2(d_0(),e_0()) ....... U13
% ~k2_2(e_0(), x0) | ~m1_3(x1, x0, x2) | k2_2(x2, x0) ....... R2 [R1:L0, U13:L0]
% k2_2(x0,x0) ....... U106
% ~m1_3(x0, e_0(), x1) | k2_2(x1, e_0()) ....... R3 [R2:L0, U106:L0]
% m1_3(c_0(),e_0(),c_0()) ....... U163
% k2_2(c_0(), e_0()) ....... R4 [R3:L0, U163:L0]
% Derivation of the empty clause:
% k2_2(c_0(),e_0()) ....... U674
% ~k2_2(c_0(),e_0()) ....... U95
% [] ....... R1 [U674:L0, U95:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 26085143
% resolvents: 25834812 factors: 250331
% Number of unit clauses generated: 9162715
% % unit clauses generated to total clauses generated: 35.13
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 39 [1] = 96 [2] = 108 [3] = 200
% [4] = 144 [5] = 88
% Total = 675
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 9162715 [2] = 13073551 [3] = 3842734 [4] = 6143
% 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 (+)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 (-)1
% [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 (-)1
% [15] s1_1 (+)5 (-)0
% [16] s2_1 (+)4 (-)0
% [17] s4_1 (+)5 (-)0
% [18] s5_1 (+)6 (-)0
% [19] k2_2 (+)9 (-)6
% [20] l1_2 (+)7 (-)0
% [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 (+)0 (-)0
% [32] q5_2 (+)0 (-)0
% [33] r5_2 (+)0 (-)0
% [34] s3_2 (+)12 (-)0
% [35] k3_3 (+)43 (-)3
% [36] m0_3 (+)10 (-)4
% [37] m1_3 (+)39 (-)1
% [38] m3_3 (+)38 (-)0
% [39] n1_3 (+)35 (-)0
% [40] p1_3 (+)40 (-)4
% [41] p2_3 (+)38 (-)0
% [42] p3_3 (+)34 (-)0
% [43] p4_3 (+)29 (-)1
% [44] p5_3 (+)30 (-)0
% [45] q1_3 (+)53 (-)0
% [46] q2_3 (+)37 (-)0
% [47] r3_3 (+)41 (-)0
% ------------------
% Total: (+)654 (-)21
% Total number of unit clauses retained: 675
% Number of clauses skipped because of their length: 404621225
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 3231016
% Number of successful unifications: 26085153
% Number of unification failures: 51219090
% Number of unit to unit unification failures: 449
% N literal unification failure due to lookup root_id table: 181620233
% N base clause resolution failure due to lookup table: 601661445
% N UC-BCL resolution dropped due to lookup table: 143579
% Max entries in substitution set: 18
% N unit clauses dropped because they exceeded max values: 8319265
% 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: 494
% Total number of terms of all unit clauses in table: 1754
% 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.28
% Number of symbols (columns) in UCFA: 87
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 77304243
% ConstructUnitClause() = 8319901
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 8.86 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 210364
% | |
% --------------------------------------------------------
% Elapsed time: 126 secs
% CPU time: 124.19 secs
%
%------------------------------------------------------------------------------