TSTP Solution File: SYN180-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN180-1 : TPTP v5.0.0. Released v1.1.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art01.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:08 EST 2010
% Result : Unsatisfiable 121.56s
% Output : Refutation 121.56s
% 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/SystemOnTPTP14610/SYN/SYN180-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 = 830] [nf = 0] [nu = 404] [ut = 133]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 6509] [nf = 78] [nu = 2294] [ut = 241]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 104397] [nf = 630] [nu = 37235] [ut = 430]
% Looking for a proof at depth = 4 ...
% t = 5 secs [nr = 1175387] [nf = 10803] [nu = 429283] [ut = 521]
% Looking for a proof at depth = 5 ...
% t = 66 secs [nr = 13687842] [nf = 135203] [nu = 4982380] [ut = 606]
% 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 = 25165798] [nf = 245949] [nu = 8871263] [ut = 606]
% Looking for a proof at depth = 2 ...
% t = 123 secs [nr = 25172880] [nf = 246027] [nu = 8873771] [ut = 606]
% Looking for a proof at depth = 3 ...
% t = 123 secs [nr = 25287115] [nf = 246803] [nu = 8917807] [ut = 612]
% 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(a_0(),e_0())
% B1: m0_3(x0,d_0(),x1)
% B2: p0_2(b_0(),x0)
% B3: q0_2(x0,d_0())
% B13: n0_2(d_0(),e_0())
% B19: n0_2(b_0(),a_0())
% B39: ~p1_3(x1,x2,x0) | n2_1(x0)
% B44: ~m0_3(x1,x2,x0) | q1_3(x0,x0,x0)
% B48: ~n0_2(x1,x0) | l1_2(x0,x0)
% B52: ~l1_2(x1,x0) | p2_3(x0,x0,x0)
% B53: ~l1_2(x1,x0) | q2_3(x0,x0,x1)
% 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)
% B323: ~s0_1(d_0()) | ~q0_2(x0,x1) | ~q1_3(d_0(),x1,d_0()) | r1_1(x0)
% B351: ~k0_1(x1) | ~r1_1(x1) | ~m0_3(x2,x3,x0) | ~q2_3(x1,x1,x1) | q2_3(x0,x1,x0)
% Unit Clauses:
% --------------
% U5: < d0 v0 dv0 f0 c1 t1 td1 b > k0_1(e_0())
% U11: < d0 v0 dv0 f0 c1 t1 td1 b > s0_1(d_0())
% U40: < d1 v3 dv1 f0 c0 t3 td1 > q1_3(x0,x0,x0)
% 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())
% U74: < d1 v0 dv0 f0 c2 t2 td1 > l1_2(a_0(),a_0())
% U88: < d1 v1 dv1 f0 c0 t1 td1 > n2_1(x0)
% U97: < d1 v0 dv0 f0 c3 t3 td1 > p2_3(a_0(),a_0(),a_0())
% U99: < d1 v0 dv0 f0 c3 t3 td1 > q2_3(e_0(),e_0(),e_0())
% U116: < d1 v0 dv0 f0 c3 t3 td1 > k3_3(a_0(),a_0(),a_0())
% U119: < d1 v3 dv1 f0 c0 t3 td1 > m3_3(x0,x0,x0)
% U241: < d3 v1 dv1 f0 c2 t3 td1 > ~q2_3(x0,e_0(),a_0())
% U287: < d3 v1 dv1 f0 c0 t1 td1 > r1_1(x0)
% U612: < d4 v2 dv1 f0 c1 t3 td1 > q2_3(x0,e_0(),x0)
% --------------- Start of Proof ---------------
% Derivation of unit clause U5:
% k0_1(e_0()) ....... U5
% Derivation of unit clause U11:
% s0_1(d_0()) ....... U11
% Derivation of unit clause U40:
% 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 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 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 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 U97:
% ~l1_2(x1,x0) | p2_3(x0,x0,x0) ....... B52
% l1_2(a_0(),a_0()) ....... U74
% p2_3(a_0(), a_0(), a_0()) ....... R1 [B52:L0, U74:L0]
% Derivation of unit clause U99:
% ~l1_2(x1,x0) | q2_3(x0,x0,x1) ....... B53
% l1_2(e_0(),e_0()) ....... U66
% q2_3(e_0(), e_0(), e_0()) ....... R1 [B53:L0, U66:L0]
% Derivation of unit clause U116:
% ~p2_3(x1,x0,x0) | k3_3(x0,x0,x0) ....... B72
% p2_3(a_0(),a_0(),a_0()) ....... U97
% k3_3(a_0(), a_0(), a_0()) ....... R1 [B72:L0, U97: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 U241:
% ~q4_2(a_0(),e_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, a_0()) | ~m3_3(x1, x2, x1) | ~q2_3(x1, e_0(), a_0()) ....... R1 [B0:L0, B270:L3]
% k3_3(a_0(),a_0(),a_0()) ....... U116
% ~m3_3(x0, x1, x0) | ~q2_3(x0, e_0(), a_0()) ....... R2 [R1:L0, U116:L0]
% m3_3(x0,x0,x0) ....... U119
% ~q2_3(x0, e_0(), a_0()) ....... R3 [R2:L0, U119:L0]
% Derivation of unit clause U287:
% q0_2(x0,d_0()) ....... B3
% ~s0_1(d_0()) | ~q0_2(x0,x1) | ~q1_3(d_0(),x1,d_0()) | r1_1(x0) ....... B323
% ~s0_1(d_0()) | ~q1_3(d_0(), d_0(), d_0()) | r1_1(x0) ....... R1 [B3:L0, B323:L1]
% s0_1(d_0()) ....... U11
% ~q1_3(d_0(), d_0(), d_0()) | r1_1(x0) ....... R2 [R1:L0, U11:L0]
% q1_3(x0,x0,x0) ....... U40
% r1_1(x0) ....... R3 [R2:L0, U40:L0]
% Derivation of unit clause U612:
% m0_3(x0,d_0(),x1) ....... B1
% ~k0_1(x1) | ~r1_1(x1) | ~m0_3(x2,x3,x0) | ~q2_3(x1,x1,x1) | q2_3(x0,x1,x0) ....... B351
% ~k0_1(x0) | ~r1_1(x0) | ~q2_3(x0, x0, x0) | q2_3(x1, x0, x1) ....... R1 [B1:L0, B351:L2]
% k0_1(e_0()) ....... U5
% ~r1_1(e_0()) | ~q2_3(e_0(), e_0(), e_0()) | q2_3(x0, e_0(), x0) ....... R2 [R1:L0, U5:L0]
% r1_1(x0) ....... U287
% ~q2_3(e_0(), e_0(), e_0()) | q2_3(x0, e_0(), x0) ....... R3 [R2:L0, U287:L0]
% q2_3(e_0(),e_0(),e_0()) ....... U99
% q2_3(x0, e_0(), x0) ....... R4 [R3:L0, U99:L0]
% Derivation of the empty clause:
% q2_3(x0,e_0(),x0) ....... U612
% ~q2_3(x0,e_0(),a_0()) ....... U241
% [] ....... R1 [U612:L0, U241:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 25546855
% resolvents: 25299921 factors: 246934
% Number of unit clauses generated: 8921966
% % unit clauses generated to total clauses generated: 34.92
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 39 [1] = 94 [2] = 108 [3] = 195
% [4] = 92 [5] = 85
% Total = 613
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 8921966 [2] = 12839989 [3] = 3783396 [4] = 1504
% 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 (+)2 (-)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 (+)6 (-)0
% [19] k2_2 (+)6 (-)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 (+)6 (-)0
% [31] q4_2 (+)0 (-)1
% [32] q5_2 (+)0 (-)0
% [33] r5_2 (+)0 (-)0
% [34] s3_2 (+)9 (-)0
% [35] k3_3 (+)43 (-)0
% [36] m0_3 (+)10 (-)1
% [37] m1_3 (+)39 (-)0
% [38] m3_3 (+)21 (-)0
% [39] n1_3 (+)35 (-)0
% [40] p1_3 (+)40 (-)0
% [41] p2_3 (+)38 (-)0
% [42] p3_3 (+)34 (-)0
% [43] p4_3 (+)29 (-)0
% [44] p5_3 (+)30 (-)0
% [45] q1_3 (+)51 (-)0
% [46] q2_3 (+)31 (-)6
% [47] r3_3 (+)25 (-)0
% ------------------
% Total: (+)604 (-)9
% Total number of unit clauses retained: 613
% Number of clauses skipped because of their length: 395902721
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 3170825
% Number of successful unifications: 25546874
% Number of unification failures: 49443603
% Number of unit to unit unification failures: 197
% N literal unification failure due to lookup root_id table: 178654548
% N base clause resolution failure due to lookup table: 592431155
% N UC-BCL resolution dropped due to lookup table: 113013
% Max entries in substitution set: 18
% N unit clauses dropped because they exceeded max values: 8097852
% 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: 461
% Total number of terms of all unit clauses in table: 1587
% 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.29
% Number of symbols (columns) in UCFA: 87
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 74990477
% ConstructUnitClause() = 8098426
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 9.06 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 211131
% | |
% --------------------------------------------------------
% Elapsed time: 123 secs
% CPU time: 121.55 secs
%
%------------------------------------------------------------------------------