TSTP Solution File: GRP124-3.004 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : GRP124-3.004 : TPTP v5.0.0. Released v1.2.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sat Nov 27 20:58:28 EST 2010
% Result : Timeout 300.01s
% 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/SystemOnTPTP13346/GRP/GRP124-3.004+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 = 68] [nf = 0] [nu = 0] [ut = 32]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 364] [nf = 8] [nu = 160] [ut = 70]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 660] [nf = 16] [nu = 320] [ut = 70]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 1924] [nf = 48] [nu = 624] [ut = 70]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 3188] [nf = 80] [nu = 928] [ut = 70]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 4452] [nf = 112] [nu = 1232] [ut = 70]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 5716] [nf = 144] [nu = 1536] [ut = 70]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 6980] [nf = 176] [nu = 1840] [ut = 70]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 8244] [nf = 208] [nu = 2144] [ut = 70]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 9508] [nf = 240] [nu = 2448] [ut = 70]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 10772] [nf = 272] [nu = 2752] [ut = 70]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 12036] [nf = 304] [nu = 3056] [ut = 70]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 13300] [nf = 336] [nu = 3360] [ut = 70]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 14564] [nf = 368] [nu = 3664] [ut = 70]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 15828] [nf = 400] [nu = 3968] [ut = 70]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 17092] [nf = 432] [nu = 4272] [ut = 70]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 18356] [nf = 464] [nu = 4576] [ut = 70]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 19620] [nf = 496] [nu = 4880] [ut = 70]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 20884] [nf = 528] [nu = 5184] [ut = 70]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 22148] [nf = 560] [nu = 5488] [ut = 70]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 23412] [nf = 592] [nu = 5792] [ut = 70]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 24676] [nf = 624] [nu = 6096] [ut = 70]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 25940] [nf = 656] [nu = 6400] [ut = 70]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 27204] [nf = 688] [nu = 6704] [ut = 70]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 28468] [nf = 720] [nu = 7008] [ut = 70]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 29732] [nf = 752] [nu = 7312] [ut = 70]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 30996] [nf = 784] [nu = 7616] [ut = 70]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 32260] [nf = 816] [nu = 7920] [ut = 70]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 33524] [nf = 848] [nu = 8224] [ut = 70]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 34788] [nf = 880] [nu = 8528] [ut = 70]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 34856] [nf = 880] [nu = 8528] [ut = 70]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 35152] [nf = 888] [nu = 8688] [ut = 70]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 35474] [nf = 896] [nu = 8848] [ut = 70]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 37601] [nf = 1088] [nu = 9271] [ut = 76]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 51902] [nf = 1294] [nu = 11129] [ut = 86]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 91720] [nf = 1556] [nu = 18261] [ut = 87]
% Looking for a proof at depth = 7 ...
% t = 11 secs [nr = 1347832] [nf = 8022] [nu = 381025] [ut = 91]
% Looking for a proof at depth = 8 ...
% t = 36 secs [nr = 8651841] [nf = 1398572] [nu = 764861] [ut = 91]
% Looking for a proof at depth = 9 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 50784755
% resolvents: 49131409 factors: 1653346
% Number of unit clauses generated: 9282042
% % unit clauses generated to total clauses generated: 18.28
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 32 [2] = 38 [4] = 6 [5] = 10 [6] = 1 [7] = 4
% [9] = 1
% Total = 92
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 9282042 [2] = 18196331 [3] = 15372420 [4] = 6890318 [5] = 867084 [6] = 140815
% [7] = 35745
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] group_element_1 (+)4 (-)0
% [1] cycle_2 (+)2 (-)11
% [2] equalish_2 (+)6 (-)12
% [3] greater_2 (+)10 (-)2
% [4] next_2 (+)4 (-)0
% [5] product_3 (+)5 (-)36
% ------------------
% Total: (+)31 (-)61
% Total number of unit clauses retained: 92
% Number of clauses skipped because of their length: 189396814
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 1113219
% Number of successful unifications: 50784755
% Number of unification failures: 1197518258
% Number of unit to unit unification failures: 294
% N literal unification failure due to lookup root_id table: 6794619
% N base clause resolution failure due to lookup table: 5402032
% N UC-BCL resolution dropped due to lookup table: 52682304
% Max entries in substitution set: 12
% N unit clauses dropped because they exceeded max values: 8830784
% 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: 69
% Total number of terms of all unit clauses in table: 221
% 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.31
% Number of symbols (columns) in UCFA: 45
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 1248303013
% ConstructUnitClause() = 8830844
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 9.25 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 169283
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------