TSTP Solution File: SWV239-2 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SWV239-2 : TPTP v5.0.0. Released v3.2.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art09.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:32:08 EST 2010
% Result : Timeout 300.06s
% Output : None
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Command entered:
% /home/graph/tptp/Systems/CARINE---0.734/carine /tmp/SystemOnTPTP14263/SWV/SWV239-2+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 = 17] [nf = 0] [nu = 12] [ut = 11]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 63] [nf = 1] [nu = 42] [ut = 11]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 172] [nf = 4] [nu = 109] [ut = 12]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 412] [nf = 13] [nu = 253] [ut = 13]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 919] [nf = 36] [nu = 554] [ut = 14]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 1965] [nf = 89] [nu = 1172] [ut = 15]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 4094] [nf = 204] [nu = 2427] [ut = 16]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 8394] [nf = 445] [nu = 4959] [ut = 17]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 17041] [nf = 940] [nu = 10048] [ut = 18]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 34387] [nf = 1945] [nu = 20254] [ut = 19]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 69136] [nf = 3972] [nu = 40697] [ut = 19]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 138696] [nf = 8045] [nu = 81617] [ut = 19]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 277883] [nf = 16212] [nu = 163494] [ut = 19]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 556329] [nf = 32569] [nu = 327288] [ut = 19]
% Looking for a proof at depth = 15 ...
% t = 3 secs [nr = 1113298] [nf = 65308] [nu = 654919] [ut = 19]
% Looking for a proof at depth = 16 ...
% t = 6 secs [nr = 2227318] [nf = 130813] [nu = 1310227] [ut = 19]
% Looking for a proof at depth = 17 ...
% t = 12 secs [nr = 4455445] [nf = 261852] [nu = 2620892] [ut = 19]
% Looking for a proof at depth = 18 ...
% t = 24 secs [nr = 8911791] [nf = 523961] [nu = 5242274] [ut = 19]
% Looking for a proof at depth = 19 ...
% t = 48 secs [nr = 17824580] [nf = 1048212] [nu = 10485093] [ut = 19]
% Looking for a proof at depth = 20 ...
% t = 97 secs [nr = 35650260] [nf = 2096749] [nu = 20970789] [ut = 19]
% Looking for a proof at depth = 21 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% t = 122 secs [nr = 44822818] [nf = 2636483] [nu = 26366413] [ut = 19]
% Looking for a proof at depth = 2 ...
% t = 122 secs [nr = 44822864] [nf = 2636484] [nu = 26366443] [ut = 19]
% Looking for a proof at depth = 3 ...
% t = 122 secs [nr = 44822973] [nf = 2636487] [nu = 26366510] [ut = 19]
% Looking for a proof at depth = 4 ...
% t = 122 secs [nr = 44823213] [nf = 2636496] [nu = 26366654] [ut = 19]
% Looking for a proof at depth = 5 ...
% t = 122 secs [nr = 44823720] [nf = 2636519] [nu = 26366955] [ut = 19]
% Looking for a proof at depth = 6 ...
% t = 122 secs [nr = 44824766] [nf = 2636572] [nu = 26367573] [ut = 19]
% Looking for a proof at depth = 7 ...
% t = 122 secs [nr = 44826895] [nf = 2636687] [nu = 26368828] [ut = 19]
% Looking for a proof at depth = 8 ...
% t = 122 secs [nr = 44831195] [nf = 2636928] [nu = 26371360] [ut = 19]
% Looking for a proof at depth = 9 ...
% t = 122 secs [nr = 44839842] [nf = 2637423] [nu = 26376449] [ut = 19]
% Looking for a proof at depth = 10 ...
% t = 122 secs [nr = 44857188] [nf = 2638428] [nu = 26386655] [ut = 19]
% Looking for a proof at depth = 11 ...
% t = 122 secs [nr = 44891937] [nf = 2640455] [nu = 26407098] [ut = 19]
% Looking for a proof at depth = 12 ...
% t = 123 secs [nr = 44961497] [nf = 2644528] [nu = 26448018] [ut = 19]
% Looking for a proof at depth = 13 ...
% t = 123 secs [nr = 45100684] [nf = 2652695] [nu = 26529895] [ut = 19]
% Looking for a proof at depth = 14 ...
% t = 124 secs [nr = 45379130] [nf = 2669052] [nu = 26693689] [ut = 19]
% Looking for a proof at depth = 15 ...
% t = 125 secs [nr = 45936099] [nf = 2701791] [nu = 27021320] [ut = 19]
% Looking for a proof at depth = 16 ...
% t = 128 secs [nr = 47050119] [nf = 2767296] [nu = 27676628] [u
% t = 19]
% Looking for a proof at depth = 17 ...
% t = 134 secs [nr = 49278246] [nf = 2898335] [nu = 28987293] [ut = 19]
% Looking for a proof at depth = 18 ...
% t = 146 secs [nr = 53734592] [nf = 3160444] [nu = 31608675] [ut = 19]
% Looking for a proof at depth = 19 ...
% t = 170 secs [nr = 62647381] [nf = 3684695] [nu = 36851494] [ut = 19]
% Looking for a proof at depth = 20 ...
% t = 219 secs [nr = 80473061] [nf = 4733232] [nu = 47337190] [ut = 19]
% Looking for a proof at depth = 21 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 117541292
% resolvents: 111011565 factors: 6529727
% Number of unit clauses generated: 65301018
% % unit clauses generated to total clauses generated: 55.56
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 2 [1] = 9 [3] = 1
% [4] = 1 [5] = 1 [6] = 1 [7] = 1
% [8] = 1 [9] = 1 [10] = 1
% Total = 19
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 65301018 [2] = 52240274
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] c_in_3 (+)1 (-)8
% [1] c_lessequals_3 (+)9 (-)1
% ------------------
% Total: (+)10 (-)9
% Total number of unit clauses retained: 19
% Number of clauses skipped because of their length: 0
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 117541292
% Number of unification failures: 84889072
% Number of unit to unit unification failures: 17
% N literal unification failure due to lookup root_id table: 208957750
% N base clause resolution failure due to lookup table: 26119521
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 45
% N unit clauses dropped because they exceeded max values: 32650793
% N unit clauses dropped because too much nesting: 32647804
% 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: 26
% Max term depth in a unit clause: 10
% Number of states in UCFA table: 135
% Total number of terms of all unit clauses in table: 301
% Max allowed number of states in UCFA: 528000
% Ratio n states used/total allowed states: 0.00
% Ratio n states used/total unit clauses terms: 0.45
% Number of symbols (columns) in UCFA: 43
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 202430364
% ConstructUnitClause() = 32650810
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 61.01 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 391804
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------