TSTP Solution File: SYN155-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN155-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:37:43 EST 2010
% Result : Unsatisfiable 0.33s
% Output : Refutation 0.33s
% 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/SystemOnTPTP3490/SYN/SYN155-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 = 832] [nf = 0] [nu = 404] [ut = 133]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 6524] [nf = 78] [nu = 2298] [ut = 243]
% Looking for a proof at depth = 3 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: ~n4_2(x0,a_0())
% B2: p0_2(b_0(),x0)
% B9: r0_1(e_0())
% B13: n0_2(d_0(),e_0())
% B16: n0_2(e_0(),e_0())
% B20: n0_2(c_0(),d_0())
% B39: ~p1_3(x1,x2,x0) | n2_1(x0)
% B40: ~p2_3(x1,x2,x0) | n3_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)
% B86: ~n2_1(x0) | m3_3(x0,x0,x0)
% B162: ~n0_2(x2,x0) | ~q2_3(x2,x0,x1) | q3_2(x0,x1)
% B196: ~k4_1(x1) | ~m3_3(x0,x0,x0) | n4_2(x0,x0)
% B275: ~r0_1(x3) | ~p0_2(x2,x0) | ~m0_3(x1,x0,x2) | l1_2(x0,x1)
% B340: ~n3_1(e_0()) | ~n0_2(c_0(),d_0()) | ~q3_2(e_0(),b_0()) | k4_1(c_0())
% Unit Clauses:
% --------------
% U23: < d0 v0 dv0 f0 c2 t2 td1 b > p0_2(c_0(),b_0())
% U34: < d0 v0 dv0 f0 c3 t3 td1 b > m0_3(e_0(),b_0(),c_0())
% U44: < d1 v3 dv1 f0 c0 t3 td1 > p1_3(x0,x0,x0)
% U66: < d1 v0 dv0 f0 c2 t2 td1 > l1_2(e_0(),e_0())
% U88: < d1 v1 dv1 f0 c0 t1 td1 > n2_1(x0)
% U119: < d1 v3 dv1 f0 c0 t3 td1 > m3_3(x0,x0,x0)
% U133: < d2 v1 dv1 f0 c0 t1 td1 > ~k4_1(x0)
% U217: < d2 v0 dv0 f0 c1 t1 td1 > n3_1(e_0())
% U328: < d3 v0 dv0 f0 c2 t2 td1 > l1_2(b_0(),e_0())
% U342: < d3 v0 dv0 f0 c2 t2 td1 > q3_2(e_0(),b_0())
% U364: < d3 v0 dv0 f0 c1 t1 td1 > k4_1(c_0())
% --------------- Start of Proof ---------------
% Derivation of unit clause U23:
% p0_2(c_0(),b_0()) ....... U23
% Derivation of unit clause U34:
% m0_3(e_0(),b_0(),c_0()) ....... U34
% 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 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 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 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 U133:
% ~n4_2(x0,a_0()) ....... B0
% ~k4_1(x1) | ~m3_3(x0,x0,x0) | n4_2(x0,x0) ....... B196
% ~k4_1(x0) | ~m3_3(a_0(), a_0(), a_0()) ....... R1 [B0:L0, B196:L2]
% m3_3(x0,x0,x0) ....... U119
% ~k4_1(x0) ....... R2 [R1:L1, U119:L0]
% Derivation of unit clause U217:
% ~p2_3(x1,x2,x0) | n3_1(x0) ....... B40
% ~l1_2(x1,x0) | p2_3(x0,x0,x0) ....... B52
% n3_1(x0) | ~l1_2(x1, x0) ....... R1 [B40:L0, B52:L1]
% l1_2(e_0(),e_0()) ....... U66
% n3_1(e_0()) ....... R2 [R1:L1, U66:L0]
% Derivation of unit clause U328:
% r0_1(e_0()) ....... B9
% ~r0_1(x3) | ~p0_2(x2,x0) | ~m0_3(x1,x0,x2) | l1_2(x0,x1) ....... B275
% ~p0_2(x0, x1) | ~m0_3(x2, x1, x0) | l1_2(x1, x2) ....... R1 [B9:L0, B275:L0]
% p0_2(c_0(),b_0()) ....... U23
% ~m0_3(x0, b_0(), c_0()) | l1_2(b_0(), x0) ....... R2 [R1:L0, U23:L0]
% m0_3(e_0(),b_0(),c_0()) ....... U34
% l1_2(b_0(), e_0()) ....... R3 [R2:L0, U34:L0]
% Derivation of unit clause U342:
% n0_2(e_0(),e_0()) ....... B16
% ~n0_2(x2,x0) | ~q2_3(x2,x0,x1) | q3_2(x0,x1) ....... B162
% ~q2_3(e_0(), e_0(), x0) | q3_2(e_0(), x0) ....... R1 [B16:L0, B162:L0]
% ~l1_2(x1,x0) | q2_3(x0,x0,x1) ....... B53
% q3_2(e_0(), x0) | ~l1_2(x0, e_0()) ....... R2 [R1:L0, B53:L1]
% l1_2(b_0(),e_0()) ....... U328
% q3_2(e_0(), b_0()) ....... R3 [R2:L1, U328:L0]
% Derivation of unit clause U364:
% n0_2(c_0(),d_0()) ....... B20
% ~n3_1(e_0()) | ~n0_2(c_0(),d_0()) | ~q3_2(e_0(),b_0()) | k4_1(c_0()) ....... B340
% ~n3_1(e_0()) | ~q3_2(e_0(), b_0()) | k4_1(c_0()) ....... R1 [B20:L0, B340:L1]
% n3_1(e_0()) ....... U217
% ~q3_2(e_0(), b_0()) | k4_1(c_0()) ....... R2 [R1:L0, U217:L0]
% q3_2(e_0(),b_0()) ....... U342
% k4_1(c_0()) ....... R3 [R2:L0, U342:L0]
% Derivation of the empty clause:
% k4_1(c_0()) ....... U364
% ~k4_1(x0) ....... U133
% [] ....... R1 [U364:L0, U133:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 18199
% resolvents: 18007 factors: 192
% Number of unit clauses generated: 6271
% % unit clauses generated to total clauses generated: 34.46
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 39 [1] = 94 [2] = 110 [3] = 122
% Total = 365
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 6271 [2] = 9139 [3] = 2789
% 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 (-)1
% [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 (+)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 (+)1 (-)0
% [17] s4_1 (+)0 (-)0
% [18] s5_1 (+)0 (-)0
% [19] k2_2 (+)6 (-)0
% [20] l1_2 (+)7 (-)0
% [21] l2_2 (+)14 (-)0
% [22] l3_2 (+)10 (-)0
% [23] m4_2 (+)0 (-)0
% [24] m5_2 (+)0 (-)0
% [25] n0_2 (+)8 (-)0
% [26] n4_2 (+)0 (-)2
% [27] n5_2 (+)1 (-)0
% [28] p0_2 (+)4 (-)0
% [29] q0_2 (+)8 (-)0
% [30] q3_2 (+)4 (-)0
% [31] q4_2 (+)0 (-)0
% [32] q5_2 (+)0 (-)0
% [33] r5_2 (+)0 (-)0
% [34] s3_2 (+)1 (-)0
% [35] k3_3 (+)24 (-)0
% [36] m0_3 (+)10 (-)0
% [37] m1_3 (+)31 (-)0
% [38] m3_3 (+)6 (-)0
% [39] n1_3 (+)32 (-)0
% [40] p1_3 (+)29 (-)0
% [41] p2_3 (+)28 (-)0
% [42] p3_3 (+)6 (-)0
% [43] p4_3 (+)9 (-)0
% [44] p5_3 (+)0 (-)0
% [45] q1_3 (+)42 (-)0
% [46] q2_3 (+)20 (-)0
% [47] r3_3 (+)11 (-)0
% ------------------
% Total: (+)362 (-)3
% Total number of unit clauses retained: 365
% Number of clauses skipped because of their length: 279348
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 2340
% Number of successful unifications: 18216
% Number of unification failures: 14463
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 75419
% N base clause resolution failure due to lookup table: 295471
% N UC-BCL resolution dropped due to lookup table: 19
% Max entries in substitution set: 9
% N unit clauses dropped because they exceeded max values: 4898
% 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: 349
% Total number of terms of all unit clauses in table: 926
% 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.38
% Number of symbols (columns) in UCFA: 87
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 32679
% ConstructUnitClause() = 5224
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.33 secs
%
%------------------------------------------------------------------------------