TSTP Solution File: SWV009-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SWV009-1 : TPTP v5.0.0. Released v1.0.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art02.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 06:29:59 EST 2010
% Result : Unsatisfiable 0.15s
% Output : Refutation 0.15s
% 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/SystemOnTPTP15900/SWV/SWV009-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 = 1] [nf = 0] [nu = 1] [ut = 6]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 10] [nf = 0] [nu = 2] [ut = 6]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 99] [nf = 12] [nu = 13] [ut = 8]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 285] [nf = 28] [nu = 40] [ut = 10]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 483] [nf = 44] [nu = 67] [ut = 10]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 681] [nf = 60] [nu = 94] [ut = 10]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 879] [nf = 76] [nu = 121] [ut = 10]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 1077] [nf = 92] [nu = 148] [ut = 10]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 1275] [nf = 108] [nu = 175] [ut = 10]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 1473] [nf = 124] [nu = 202] [ut = 10]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 1671] [nf = 140] [nu = 229] [ut = 10]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 1869] [nf = 156] [nu = 256] [ut = 10]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 2067] [nf = 172] [nu = 283] [ut = 10]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 2265] [nf = 188] [nu = 310] [ut = 10]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 2463] [nf = 204] [nu = 337] [ut = 10]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 2661] [nf = 220] [nu = 364] [ut = 10]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 2859] [nf = 236] [nu = 391] [ut = 10]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 3057] [nf = 252] [nu = 418] [ut = 10]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 3255] [nf = 268] [nu = 445] [ut = 10]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 3453] [nf = 284] [nu = 472] [ut = 10]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 3651] [nf = 300] [nu = 499] [ut = 10]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 3849] [nf = 316] [nu = 526] [ut = 10]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 4047] [nf = 332] [nu = 553] [ut = 10]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 4245] [nf = 348] [nu = 580] [ut = 10]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 4443] [nf = 364] [nu = 607] [ut = 10]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 4641] [nf = 380] [nu = 634] [ut = 10]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 4839] [nf = 396] [nu = 661] [ut = 10]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 5037] [nf = 412] [nu = 688] [ut = 10]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 5235] [nf = 428] [nu = 715] [ut = 10]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 5433] [nf = 444] [nu = 742] [ut = 10]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 5436] [nf = 444] [nu = 745] [ut = 10]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 5447] [nf = 444] [nu = 748] [ut = 10]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 5546] [nf = 468] [nu = 759] [ut = 10]
% Looking for a proof at depth = 4 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: less_2(j_0(),i_0())
% B1: less_or_equal_2(m_0(),p_0())
% B2: less_or_equal_2(p_0(),q_0())
% B5: ~less_or_equal_2(x1,j_0()) | ~less_or_equal_2(x0,x1) | ~less_or_equal_2(m_0(),x0) | less_or_equal_2(a_1(x0),a_1(x1))
% B6: ~less_or_equal_2(x1,n_0()) | ~less_or_equal_2(x0,x1) | ~less_or_equal_2(i_0(),x0) | less_or_equal_2(a_1(x0),a_1(x1))
% B7: ~less_2(j_0(),x1) | ~less_2(x0,i_0()) | ~less_or_equal_2(x1,n_0()) | ~less_or_equal_2(m_0(),x0) | less_or_equal_2(a_1(x0),a_1(x1))
% Unit Clauses:
% --------------
% U2: < d0 v0 dv0 f0 c2 t2 td1 b nc > less_or_equal_2(p_0(),q_0())
% U3: < d0 v0 dv0 f0 c2 t2 td1 b nc > less_or_equal_2(q_0(),n_0())
% U4: < d0 v0 dv0 f2 c2 t4 td2 b nc > ~less_or_equal_2(a_1(p_0()),a_1(q_0()))
% U8: < d4 v0 dv0 f0 c2 t2 td1 > less_2(j_0(),q_0())
% U9: < d4 v0 dv0 f0 c2 t2 td1 > less_2(p_0(),i_0())
% U10: < d4 v0 dv0 f2 c2 t4 td2 > less_or_equal_2(a_1(p_0()),a_1(q_0()))
% --------------- Start of Proof ---------------
% Derivation of unit clause U2:
% less_or_equal_2(p_0(),q_0()) ....... U2
% Derivation of unit clause U3:
% less_or_equal_2(q_0(),n_0()) ....... U3
% Derivation of unit clause U4:
% ~less_or_equal_2(a_1(p_0()),a_1(q_0())) ....... U4
% Derivation of unit clause U8:
% less_or_equal_2(m_0(),p_0()) ....... B1
% ~less_or_equal_2(x1,j_0()) | ~less_or_equal_2(x0,x1) | ~less_or_equal_2(m_0(),x0) | less_or_equal_2(a_1(x0),a_1(x1)) ....... B5
% ~less_or_equal_2(x0, j_0()) | ~less_or_equal_2(p_0(), x0) | less_or_equal_2(a_1(p_0()), a_1(x0)) ....... R1 [B1:L0, B5:L2]
% less_or_equal_2(p_0(),q_0()) ....... U2
% ~less_or_equal_2(q_0(), j_0()) | less_or_equal_2(a_1(p_0()), a_1(q_0())) ....... R2 [R1:L1, U2:L0]
% less_2(x1,x0) | less_or_equal_2(x0,x1) ....... B4
% less_or_equal_2(a_1(p_0()), a_1(q_0())) | less_2(j_0(), q_0()) ....... R3 [R2:L0, B4:L1]
% ~less_or_equal_2(a_1(p_0()),a_1(q_0())) ....... U4
% less_2(j_0(), q_0()) ....... R4 [R3:L0, U4:L0]
% Derivation of unit clause U9:
% less_or_equal_2(p_0(),q_0()) ....... B2
% ~less_or_equal_2(x1,n_0()) | ~less_or_equal_2(x0,x1) | ~less_or_equal_2(i_0(),x0) | less_or_equal_2(a_1(x0),a_1(x1)) ....... B6
% ~less_or_equal_2(q_0(), n_0()) | ~less_or_equal_2(i_0(), p_0()) | less_or_equal_2(a_1(p_0()), a_1(q_0())) ....... R1 [B2:L0, B6:L1]
% less_or_equal_2(q_0(),n_0()) ....... U3
% ~less_or_equal_2(i_0(), p_0()) | less_or_equal_2(a_1(p_0()), a_1(q_0())) ....... R2 [R1:L0, U3:L0]
% less_2(x1,x0) | less_or_equal_2(x0,x1) ....... B4
% less_or_equal_2(a_1(p_0()), a_1(q_0())) | less_2(p_0(), i_0()) ....... R3 [R2:L0, B4:L1]
% ~less_or_equal_2(a_1(p_0()),a_1(q_0())) ....... U4
% less_2(p_0(), i_0()) ....... R4 [R3:L0, U4:L0]
% Derivation of unit clause U10:
% less_or_equal_2(m_0(),p_0()) ....... B1
% ~less_2(j_0(),x1) | ~less_2(x0,i_0()) | ~less_or_equal_2(x1,n_0()) | ~less_or_equal_2(m_0(),x0) | less_or_equal_2(a_1(x0),a_1(x1)) ....... B7
% ~less_2(j_0(), x0) | ~less_2(p_0(), i_0()) | ~less_or_equal_2(x0, n_0()) | less_or_equal_2(a_1(p_0()), a_1(x0)) ....... R1 [B1:L0, B7:L3]
% less_2(j_0(),q_0()) ....... U8
% ~less_2(p_0(), i_0()) | ~less_or_equal_2(q_0(), n_0()) | less_or_equal_2(a_1(p_0()), a_1(q_0())) ....... R2 [R1:L0, U8:L0]
% less_2(p_0(),i_0()) ....... U9
% ~less_or_equal_2(q_0(), n_0()) | less_or_equal_2(a_1(p_0()), a_1(q_0())) ....... R3 [R2:L0, U9:L0]
% less_or_equal_2(q_0(),n_0()) ....... U3
% less_or_equal_2(a_1(p_0()), a_1(q_0())) ....... R4 [R3:L0, U3:L0]
% Derivation of the empty clause:
% less_or_equal_2(a_1(p_0()),a_1(q_0())) ....... U10
% ~less_or_equal_2(a_1(p_0()),a_1(q_0())) ....... U4
% [] ....... R1 [U10:L0, U4:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 6084
% resolvents: 5616 factors: 468
% Number of unit clauses generated: 766
% % unit clauses generated to total clauses generated: 12.59
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 5 [1] = 1 [3] = 2
% [4] = 3
% Total = 11
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 766 [2] = 1567 [3] = 3441 [4] = 310
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] less_2 (+)4 (-)0
% [1] less_or_equal_2 (+)4 (-)3
% ------------------
% Total: (+)8 (-)3
% Total number of unit clauses retained: 11
% Number of clauses skipped because of their length: 300
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 2
% Number of successful unifications: 6096
% Number of unification failures: 8363
% Number of unit to unit unification failures: 9
% N literal unification failure due to lookup root_id table: 24595
% N base clause resolution failure due to lookup table: 5604
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 6
% N unit clauses dropped because they exceeded max values: 35
% 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: 4
% Max term depth in a unit clause: 2
% Number of states in UCFA table: 22
% Total number of terms of all unit clauses in table: 28
% 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.79
% Number of symbols (columns) in UCFA: 43
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 14459
% ConstructUnitClause() = 41
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.15 secs
%
%------------------------------------------------------------------------------