TSTP Solution File: SYN190-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN190-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:56 EST 2010
% Result : Unsatisfiable 0.97s
% Output : Refutation 0.97s
% 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/SystemOnTPTP4258/SYN/SYN190-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 = 831] [nf = 0] [nu = 404] [ut = 133]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 6513] [nf = 78] [nu = 2294] [ut = 241]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 104336] [nf = 630] [nu = 37214] [ut = 425]
% Looking for a proof at depth = 4 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: ~r3_3(a_0(),x0,d_0())
% B1: m0_3(x0,d_0(),x1)
% B2: p0_2(b_0(),x0)
% B3: q0_2(x0,d_0())
% B7: l0_1(a_0())
% B11: s0_1(d_0())
% B13: n0_2(d_0(),e_0())
% B19: n0_2(b_0(),a_0())
% B20: n0_2(c_0(),d_0())
% B44: ~m0_3(x1,x2,x0) | q1_3(x0,x0,x0)
% B46: ~p2_3(x0,x2,x1) | r3_3(x0,x1,x0)
% B48: ~n0_2(x1,x0) | l1_2(x0,x0)
% B52: ~l1_2(x1,x0) | p2_3(x0,x0,x0)
% B81: ~p0_2(x0,x0) | s1_1(x0)
% B140: ~s0_1(x0) | ~l1_2(x1,x2) | m2_1(x0)
% B141: ~s1_1(x2) | ~q0_2(x0,x1) | s1_1(x0)
% B219: ~l0_1(x0) | ~r1_1(x0) | r2_1(x0)
% B280: ~s1_1(x1) | ~n0_2(x0,x3) | ~p2_3(x2,x1,x3) | k3_3(x0,x1,x0)
% B282: ~m2_1(x1) | ~m3_3(x2,b_0(),x0) | ~r3_3(x1,x3,x3) | r3_3(x0,x0,x1)
% B323: ~s0_1(d_0()) | ~q0_2(x0,x1) | ~q1_3(d_0(),x1,d_0()) | r1_1(x0)
% Unit Clauses:
% --------------
% 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)
% U47: < d1 v0 dv0 f0 c1 t1 td1 > s1_1(b_0())
% 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())
% U76: < d1 v0 dv0 f0 c2 t2 td1 > l1_2(d_0(),d_0())
% U97: < d1 v0 dv0 f0 c3 t3 td1 > p2_3(a_0(),a_0(),a_0())
% U157: < d2 v1 dv1 f0 c0 t1 td1 > s1_1(x0)
% U192: < d2 v0 dv0 f0 c1 t1 td1 > m2_1(d_0())
% U231: < d2 v0 dv0 f0 c3 t3 td1 > r3_3(d_0(),d_0(),d_0())
% U241: < d3 v1 dv1 f0 c2 t3 td1 > ~m3_3(x0,b_0(),a_0())
% U282: < d3 v1 dv1 f0 c0 t1 td1 > r1_1(x0)
% U358: < d3 v0 dv0 f0 c3 t3 td1 > k3_3(b_0(),a_0(),b_0())
% U449: < d4 v0 dv0 f0 c3 t3 td1 > m3_3(b_0(),b_0(),a_0())
% --------------- Start of Proof ---------------
% 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 U47:
% p0_2(b_0(),x0) ....... B2
% ~p0_2(x0,x0) | s1_1(x0) ....... B81
% s1_1(b_0()) ....... R1 [B2:L0, B81: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 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 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 U157:
% q0_2(x0,d_0()) ....... B3
% ~s1_1(x2) | ~q0_2(x0,x1) | s1_1(x0) ....... B141
% ~s1_1(x0) | s1_1(x1) ....... R1 [B3:L0, B141:L1]
% s1_1(b_0()) ....... U47
% s1_1(x0) ....... R2 [R1:L0, U47:L0]
% Derivation of unit clause U192:
% s0_1(d_0()) ....... B11
% ~s0_1(x0) | ~l1_2(x1,x2) | m2_1(x0) ....... B140
% ~l1_2(x0, x1) | m2_1(d_0()) ....... R1 [B11:L0, B140:L0]
% l1_2(e_0(),e_0()) ....... U66
% m2_1(d_0()) ....... R2 [R1:L0, U66:L0]
% Derivation of unit clause U231:
% ~p2_3(x0,x2,x1) | r3_3(x0,x1,x0) ....... B46
% ~l1_2(x1,x0) | p2_3(x0,x0,x0) ....... B52
% r3_3(x0, x0, x0) | ~l1_2(x1, x0) ....... R1 [B46:L0, B52:L1]
% l1_2(d_0(),d_0()) ....... U76
% r3_3(d_0(), d_0(), d_0()) ....... R2 [R1:L1, U76:L0]
% Derivation of unit clause U241:
% ~r3_3(a_0(),x0,d_0()) ....... B0
% ~m2_1(x1) | ~m3_3(x2,b_0(),x0) | ~r3_3(x1,x3,x3) | r3_3(x0,x0,x1) ....... B282
% ~m2_1(d_0()) | ~m3_3(x0, b_0(), a_0()) | ~r3_3(d_0(), x1, x1) ....... R1 [B0:L0, B282:L3]
% m2_1(d_0()) ....... U192
% ~m3_3(x0, b_0(), a_0()) | ~r3_3(d_0(), x1, x1) ....... R2 [R1:L0, U192:L0]
% r3_3(d_0(),d_0(),d_0()) ....... U231
% ~m3_3(x0, b_0(), a_0()) ....... R3 [R2:L1, U231:L0]
% Derivation of unit clause U282:
% 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 U358:
% n0_2(b_0(),a_0()) ....... B19
% ~s1_1(x1) | ~n0_2(x0,x3) | ~p2_3(x2,x1,x3) | k3_3(x0,x1,x0) ....... B280
% ~s1_1(x0) | ~p2_3(x1, x0, a_0()) | k3_3(b_0(), x0, b_0()) ....... R1 [B19:L0, B280:L1]
% s1_1(x0) ....... U157
% ~p2_3(x0, x1, a_0()) | k3_3(b_0(), x1, b_0()) ....... R2 [R1:L0, U157:L0]
% p2_3(a_0(),a_0(),a_0()) ....... U97
% k3_3(b_0(), a_0(), b_0()) ....... R3 [R2:L0, U97:L0]
% Derivation of unit clause U449:
% l0_1(a_0()) ....... B7
% ~l0_1(x0) | ~r1_1(x0) | r2_1(x0) ....... B219
% ~r1_1(a_0()) | r2_1(a_0()) ....... R1 [B7:L0, B219:L0]
% ~r2_1(x1) | ~k3_3(x0,x1,x0) | m3_3(x0,x0,x1) ....... B208
% ~r1_1(a_0()) | ~k3_3(x0, a_0(), x0) | m3_3(x0, x0, a_0()) ....... R2 [R1:L1, B208:L0]
% r1_1(x0) ....... U282
% ~k3_3(x0, a_0(), x0) | m3_3(x0, x0, a_0()) ....... R3 [R2:L0, U282:L0]
% k3_3(b_0(),a_0(),b_0()) ....... U358
% m3_3(b_0(), b_0(), a_0()) ....... R4 [R3:L0, U358:L0]
% Derivation of the empty clause:
% m3_3(b_0(),b_0(),a_0()) ....... U449
% ~m3_3(x0,b_0(),a_0()) ....... U241
% [] ....... R1 [U449:L0, U241:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 167326
% resolvents: 166218 factors: 1108
% Number of unit clauses generated: 57321
% % unit clauses generated to total clauses generated: 34.26
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 39 [1] = 94 [2] = 108 [3] = 184
% [4] = 25
% Total = 450
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 57321 [2] = 87846 [3] = 22159
% 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 (-)1
% [20] l1_2 (+)7 (-)0
% [21] l2_2 (+)14 (-)1
% [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 (-)0
% [32] q5_2 (+)0 (-)0
% [33] r5_2 (+)0 (-)0
% [34] s3_2 (+)4 (-)0
% [35] k3_3 (+)30 (-)0
% [36] m0_3 (+)10 (-)0
% [37] m1_3 (+)37 (-)0
% [38] m3_3 (+)11 (-)1
% [39] n1_3 (+)32 (-)0
% [40] p1_3 (+)36 (-)0
% [41] p2_3 (+)33 (-)0
% [42] p3_3 (+)24 (-)0
% [43] p4_3 (+)10 (-)0
% [44] p5_3 (+)1 (-)0
% [45] q1_3 (+)42 (-)0
% [46] q2_3 (+)21 (-)0
% [47] r3_3 (+)16 (-)1
% ------------------
% Total: (+)446 (-)4
% Total number of unit clauses retained: 450
% Number of clauses skipped because of their length: 2474678
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 28501
% Number of successful unifications: 167351
% Number of unification failures: 231221
% Number of unit to unit unification failures: 46
% N literal unification failure due to lookup root_id table: 921090
% N base clause resolution failure due to lookup table: 3033086
% N UC-BCL resolution dropped due to lookup table: 740
% Max entries in substitution set: 12
% N unit clauses dropped because they exceeded max values: 52035
% 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: 400
% Total number of terms of all unit clauses in table: 1141
% 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.35
% Number of symbols (columns) in UCFA: 87
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 398572
% ConstructUnitClause() = 52446
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.07 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 1 secs
% CPU time: 0.97 secs
%
%------------------------------------------------------------------------------