TSTP Solution File: NUM283-1.005 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : NUM283-1.005 : TPTP v5.0.0. Released v1.0.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art05.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 03:30:24 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/SystemOnTPTP21158/NUM/NUM283-1.005+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 = 20] [nf = 0] [nu = 13] [ut = 15]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 142] [nf = 0] [nu = 75] [ut = 31]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 473] [nf = 1] [nu = 258] [ut = 44]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 1500] [nf = 2] [nu = 795] [ut = 55]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 4530] [nf = 89] [nu = 2115] [ut = 56]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 14489] [nf = 339] [nu = 5987] [ut = 67]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 43876] [nf = 1276] [nu = 15505] [ut = 69]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 140505] [nf = 4082] [nu = 43427] [ut = 81]
% Looking for a proof at depth = 9 ...
% t = 3 secs [nr = 430338] [nf = 12915] [nu = 118346] [ut = 84]
% Looking for a proof at depth = 10 ...
% t = 13 secs [nr = 1680611] [nf = 42301] [nu = 422812] [ut = 108]
% Looking for a proof at depth = 11 ...
% t = 44 secs [nr = 5394733] [nf = 130581] [nu = 1292334] [ut = 110]
% Looking for a proof at depth = 12 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% t = 122 secs [nr = 14450360] [nf = 322409] [nu = 3390355] [ut = 110]
% Looking for a proof at depth = 2 ...
% t = 122 secs [nr = 14450583] [nf = 322409] [nu = 3390448] [ut = 110]
% Looking for a proof at depth = 3 ...
% t = 122 secs [nr = 14451062] [nf = 322412] [nu = 3390696] [ut = 110]
% Looking for a proof at depth = 4 ...
% t = 122 secs [nr = 14456444] [nf = 322415] [nu = 3392529] [ut = 110]
% Looking for a proof at depth = 5 ...
% t = 123 secs [nr = 14477681] [nf = 323986] [nu = 3398064] [ut = 110]
% Looking for a proof at depth = 6 ...
% t = 123 secs [nr = 14608029] [nf = 327273] [nu = 3428521] [ut = 110]
% Looking for a proof at depth = 7 ...
% t = 127 secs [nr = 15164214] [nf = 361071] [nu = 3534994] [ut = 110]
% Looking for a proof at depth = 8 ...
% t = 150 secs [nr = 18050492] [nf = 458129] [nu = 4073752] [ut = 110]
% Looking for a proof at depth = 9 ...
% t = 246 secs [nr = 30600145] [nf = 1070267] [nu = 6145124] [ut = 110]
% Looking for a proof at depth = 10 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 38855526
% resolvents: 37587236 factors: 1268290
% Number of unit clauses generated: 7453126
% % unit clauses generated to total clauses generated: 19.18
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 4 [1] = 11 [2] = 16 [3] = 13
% [4] = 11 [5] = 1 [6] = 11 [7] = 2
% [8] = 12 [9] = 3 [10] = 24 [11] = 2
% Total = 110
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 7453126 [2] = 18890862 [3] = 10954205 [4] = 1557333
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] factorial_2 (+)4 (-)19
% [1] product_3 (+)29 (-)25
% [2] sum_3 (+)12 (-)21
% ------------------
% Total: (+)45 (-)65
% Total number of unit clauses retained: 110
% Number of clauses skipped because of their length: 29759996
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 38855526
% Number of unification failures: 588468202
% Number of unit to unit unification failures: 1053
% N literal unification failure due to lookup root_id table: 71657109
% N base clause resolution failure due to lookup table: 11461740
% N UC-BCL resolution dropped due to lookup table: 9967
% Max entries in substitution set: 36
% N unit clauses dropped because they exceeded max values: 5310981
% N unit clauses dropped because too much nesting: 4228577
% 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: 12
% Number of states in UCFA table: 447
% Total number of terms of all unit clauses in table: 1342
% 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.33
% Number of symbols (columns) in UCFA: 39
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 627323728
% ConstructUnitClause() = 5311087
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 8.76 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 129518
% | |
% --------------------------------------------------------
% Elapsed time: 304 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------