TSTP Solution File: SWV001-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SWV001-1 : TPTP v5.0.0. Released v1.0.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art03.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:26 EST 2010
% Result : Unsatisfiable 0.63s
% Output : Refutation 0.63s
% 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/SystemOnTPTP9523/SWV/SWV001-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 = 9] [nf = 2] [nu = 2] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 96] [nf = 20] [nu = 13] [ut = 3]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 533] [nf = 118] [nu = 64] [ut = 3]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 3351] [nf = 624] [nu = 383] [ut = 3]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 18818] [nf = 3702] [nu = 2104] [ut = 3]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 244373] [nf = 32829] [nu = 35201] [ut = 9]
% Looking for a proof at depth = 7 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: q1_3(a_0(),b_0(),c_0())
% B1: ~less_or_equalish_2(x0,a_0()) | ~less_or_equalish_2(b_0(),x0) | ~less_or_equalish_2(a_0(),x0) | ~q4_3(a_0(),b_0(),x0)
% B2: ~less_or_equalish_2(x0,b_0()) | ~less_or_equalish_2(b_0(),x0) | ~less_or_equalish_2(a_0(),x0) | ~q4_3(a_0(),b_0(),x0)
% B3: less_or_equalish_2(x0,x0)
% B8: ~equalish_2(x0,x1) | ~less_or_equalish_2(x0,x2) | less_or_equalish_2(x1,x2)
% B13: ~less_or_equalish_2(x1,x0) | ~less_or_equalish_2(x0,x1) | equalish_2(x0,x1)
% Unit Clauses:
% --------------
% U0: < d0 v0 dv0 f0 c3 t3 td1 b nc > q1_3(a_0(),b_0(),c_0())
% U1: < d0 v2 dv1 f0 c0 t2 td1 b > less_or_equalish_2(x0,x0)
% U2: < d2 v2 dv1 f0 c0 t2 td1 > equalish_2(x0,x0)
% U3: < d6 v0 dv0 f0 c2 t2 td1 > ~less_or_equalish_2(a_0(),b_0())
% U6: < d6 v0 dv0 f0 c3 t3 td1 > q3_3(a_0(),b_0(),c_0())
% U9: < d7 v0 dv0 f0 c2 t2 td1 > less_or_equalish_2(a_0(),b_0())
% --------------- Start of Proof ---------------
% Derivation of unit clause U0:
% q1_3(a_0(),b_0(),c_0()) ....... U0
% Derivation of unit clause U1:
% less_or_equalish_2(x0,x0) ....... U1
% Derivation of unit clause U2:
% less_or_equalish_2(x0,x0) ....... B3
% ~less_or_equalish_2(x1,x0) | ~less_or_equalish_2(x0,x1) | equalish_2(x0,x1) ....... B13
% ~less_or_equalish_2(x0, x0) | equalish_2(x0, x0) ....... R1 [B3:L0, B13:L0]
% less_or_equalish_2(x0,x0) ....... U1
% equalish_2(x0, x0) ....... R2 [R1:L0, U1:L0]
% Derivation of unit clause U3:
% ~less_or_equalish_2(x0,b_0()) | ~less_or_equalish_2(b_0(),x0) | ~less_or_equalish_2(a_0(),x0) | ~q4_3(a_0(),b_0(),x0) ....... B2
% ~less_or_equalish_2(b_0(), b_0()) | ~less_or_equalish_2(a_0(), b_0()) | ~q4_3(a_0(), b_0(), b_0()) ....... R1 [B2:L0, B2:L1]
% less_or_equalish_2(x0,x0) ....... U1
% ~less_or_equalish_2(a_0(), b_0()) | ~q4_3(a_0(), b_0(), b_0()) ....... R2 [R1:L0, U1:L0]
% ~q2_3(x0,x1,x2) | q4_3(x0,x1,x1) ....... B4
% ~less_or_equalish_2(a_0(), b_0()) | ~q2_3(a_0(), b_0(), x0) ....... R3 [R2:L1, B4:L1]
% ~less_or_equalish_2(x0,x1) | ~q1_3(x0,x1,x2) | q2_3(x0,x1,x2) ....... B11
% ~less_or_equalish_2(a_0(), b_0()) | ~less_or_equalish_2(a_0(), b_0()) | ~q1_3(a_0(), b_0(), x0) ....... R4 [R3:L1, B11:L2]
% ~less_or_equalish_2(a_0(), b_0()) | ~q1_3(a_0(), b_0(), x0) ....... R5 [R4:L0, R4:L1]
% q1_3(a_0(),b_0(),c_0()) ....... U0
% ~less_or_equalish_2(a_0(), b_0()) ....... R6 [R5:L1, U0:L0]
% Derivation of unit clause U6:
% less_or_equalish_2(x0,x0) ....... B3
% ~equalish_2(x0,x1) | ~less_or_equalish_2(x0,x2) | less_or_equalish_2(x1,x2) ....... B8
% ~equalish_2(x0, x1) | less_or_equalish_2(x1, x0) ....... R1 [B3:L0, B8:L1]
% ~less_or_equalish_2(x1,x2) | ~less_or_equalish_2(x0,x1) | less_or_equalish_2(x0,x2) ....... B10
% ~equalish_2(x0, x1) | ~less_or_equalish_2(x2, x1) | less_or_equalish_2(x2, x0) ....... R2 [R1:L1, B10:L0]
% equalish_2(x0,x0) ....... U2
% ~less_or_equalish_2(x0, x1) | less_or_equalish_2(x0, x1) ....... R3 [R2:L0, U2:L0]
% ~q1_3(x0,x1,x2) | less_or_equalish_2(x0,x1) | q3_3(x0,x1,x2) ....... B12
% less_or_equalish_2(x0, x1) | ~q1_3(x0, x1, x2) | q3_3(x0, x1, x2) ....... R4 [R3:L0, B12:L1]
% ~less_or_equalish_2(a_0(),b_0()) ....... U3
% ~q1_3(a_0(), b_0(), x0) | q3_3(a_0(), b_0(), x0) ....... R5 [R4:L0, U3:L0]
% q1_3(a_0(),b_0(),c_0()) ....... U0
% q3_3(a_0(), b_0(), c_0()) ....... R6 [R5:L0, U0:L0]
% Derivation of unit clause U9:
% ~less_or_equalish_2(x0,a_0()) | ~less_or_equalish_2(b_0(),x0) | ~less_or_equalish_2(a_0(),x0) | ~q4_3(a_0(),b_0(),x0) ....... B1
% ~less_or_equalish_2(a_0(), a_0()) | ~less_or_equalish_2(b_0(), a_0()) | ~q4_3(a_0(), b_0(), a_0()) ....... R1 [B1:L0, B1:L2]
% less_or_equalish_2(x0,x0) ....... U1
% ~less_or_equalish_2(b_0(), a_0()) | ~q4_3(a_0(), b_0(), a_0()) ....... R2 [R1:L0, U1:L0]
% ~q3_3(x0,x1,x2) | q4_3(x0,x1,x0) ....... B5
% ~less_or_equalish_2(b_0(), a_0()) | ~q3_3(a_0(), b_0(), x0) ....... R3 [R2:L1, B5:L1]
% less_or_equalish_2(x0,x1) | less_or_equalish_2(x1,x0) ....... B7
% ~q3_3(a_0(), b_0(), x0) | less_or_equalish_2(a_0(), b_0()) ....... R4 [R3:L0, B7:L0]
% ~equalish_2(x0,x1) | ~less_or_equalish_2(x0,x2) | less_or_equalish_2(x1,x2) ....... B8
% ~q3_3(a_0(), b_0(), x0) | ~equalish_2(a_0(), x1) | less_or_equalish_2(x1, b_0()) ....... R5 [R4:L1, B8:L1]
% q3_3(a_0(),b_0(),c_0()) ....... U6
% ~equalish_2(a_0(), x0) | less_or_equalish_2(x0, b_0()) ....... R6 [R5:L0, U6:L0]
% equalish_2(x0,x0) ....... U2
% less_or_equalish_2(a_0(), b_0()) ....... R7 [R6:L0, U2:L0]
% Derivation of the empty clause:
% less_or_equalish_2(a_0(),b_0()) ....... U9
% ~less_or_equalish_2(a_0(),b_0()) ....... U3
% [] ....... R1 [U9:L0, U3:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 291929
% resolvents: 258775 factors: 33154
% Number of unit clauses generated: 36378
% % unit clauses generated to total clauses generated: 12.46
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 2 [2] = 1 [6] = 6 [7] = 1
% Total = 10
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 36378 [2] = 142845 [3] = 112706
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] equalish_2 (+)1 (-)2
% [1] less_or_equalish_2 (+)3 (-)1
% [2] q1_3 (+)1 (-)0
% [3] q2_3 (+)0 (-)0
% [4] q3_3 (+)1 (-)0
% [5] q4_3 (+)1 (-)0
% ------------------
% Total: (+)7 (-)3
% Total number of unit clauses retained: 10
% Number of clauses skipped because of their length: 362284
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 19394
% Number of successful unifications: 291950
% Number of unification failures: 128521
% Number of unit to unit unification failures: 4
% N literal unification failure due to lookup root_id table: 470292
% N base clause resolution failure due to lookup table: 355199
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 16
% N unit clauses dropped because they exceeded max values: 30134
% 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: 23
% Total number of terms of all unit clauses in table: 23
% 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: 1.00
% Number of symbols (columns) in UCFA: 43
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 420471
% ConstructUnitClause() = 30142
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.03 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 1 secs
% CPU time: 0.63 secs
%
%------------------------------------------------------------------------------