TSTP Solution File: GRP129-2.004 by CARINE---0.734

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CARINE---0.734
% Problem  : GRP129-2.004 : TPTP v5.0.0. Released v1.2.0.
% Transfm  : add_equality
% Format   : carine
% Command  : carine %s t=%d xo=off uct=32000

% Computer : art07.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 : Sat Nov 27 21:22:49 EST 2010

% Result   : Timeout 300.02s
% 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/SystemOnTPTP6285/GRP/GRP129-2.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 = 45] [nf = 0] [nu = 0] [ut = 25]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 141] [nf = 8] [nu = 6] [ut = 28]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 347] [nf = 314] [nu = 12] [ut = 28]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 709] [nf = 620] [nu = 18] [ut = 28]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 2015] [nf = 2382] [nu = 24] [ut = 28]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 3921] [nf = 4144] [nu = 30] [ut = 28]
% Looking for a proof at depth = 7 ...
% 	t = 0 secs [nr = 10083] [nf = 12282] [nu = 36] [ut = 28]
% Looking for a proof at depth = 8 ...
% 	t = 0 secs [nr = 18645] [nf = 20420] [nu = 42] [ut = 28]
% Looking for a proof at depth = 9 ...
% 	t = 0 secs [nr = 45335] [nf = 55646] [nu = 48] [ut = 28]
% Looking for a proof at depth = 10 ...
% 	t = 0 secs [nr = 81625] [nf = 90872] [nu = 54] [ut = 28]
% Looking for a proof at depth = 11 ...
% 	t = 1 secs [nr = 193595] [nf = 239010] [nu = 60] [ut = 28]
% Looking for a proof at depth = 12 ...
% 	t = 1 secs [nr = 343965] [nf = 387148] [nu = 66] [ut = 28]
% Looking for a proof at depth = 13 ...
% 	t = 3 secs [nr = 806175] [nf = 999366] [nu = 72] [ut = 28]
% Looking for a proof at depth = 14 ...
% 	t = 6 secs [nr = 1421985] [nf = 1611584] [nu = 78] [ut = 28]
% Looking for a proof at depth = 15 ...
% 	t = 14 secs [nr = 3310019] [nf = 4113962] [nu = 84] [ut = 28]
% Looking for a proof at depth = 16 ...
% 	t = 25 secs [nr = 5812453] [nf = 6616340] [nu = 90] [ut = 28]
% Looking for a proof at depth = 17 ...
% 	t = 58 secs [nr = 13471463] [nf = 16772430] [nu = 96] [ut = 28]
% Looking for a proof at depth = 18 ...
% 	t = 102 secs [nr = 23588073] [nf = 26928520] [nu = 102] [ut = 28]
% Looking for a proof at depth = 19 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% 	t = 123 secs [nr = 28389925] [nf = 33282241] [nu = 102] [ut = 28]
% Looking for a proof at depth = 2 ...
% 	t = 123 secs [nr = 28390024] [nf = 33282249] [nu = 108] [ut = 28]
% Looking for a proof at depth = 3 ...
% 	t = 123 secs [nr = 28390241] [nf = 33282579] [nu = 114] [ut = 28]
% Looking for a proof at depth = 4 ...
% 	t = 123 secs [nr = 28390849] [nf = 33282909] [nu = 120] [ut = 28]
% Looking for a proof at depth = 5 ...
% 	t = 123 secs [nr = 28393614] [nf = 33288523] [nu = 126] [ut = 28]
% Looking for a proof at depth = 6 ...
% 	t = 123 secs [nr = 28406375] [nf = 33294385] [nu = 132] [ut = 28]
% Looking for a proof at depth = 7 ...
% 	t = 123 secs [nr = 28534099] [nf = 33454659] [nu = 138] [ut = 28]
% Looking for a proof at depth = 8 ...
% 	t = 127 secs [nr = 30158857] [nf = 34006407] [nu = 144] [ut = 28]
% Looking for a proof at depth = 9 ...
% 	t = 211 secs [nr = 58373242] [nf = 40055291] [nu = 122550] [ut = 28]
% Looking for a proof at depth = 10 ...
% TIME IS UP!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 153232962
% 	resolvents: 91588815	factors: 61644147
% Number of unit clauses generated: 144510
% % unit clauses generated to total clauses generated: 0.09
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 25	[2] = 3		
% Total = 28
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 144510	[2] = 46165201	[3] = 42877200	[4] = 32794133	[5] = 20503804	[6] = 8980182	
% [7] = 1767932	
% Average size of a generated clause: 4.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] group_element_1	(+)4	(-)0
% [1] equalish_2		(+)0	(-)12
% [2] greater_2		(+)6	(-)0
% [3] next_2		(+)3	(-)0
% [4] product_3		(+)0	(-)3
% 			------------------
% 		Total:	(+)13	(-)15
% Total number of unit clauses retained: 28
% Number of clauses skipped because of their length: 315125612
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 2399870
% Number of successful unifications: 153232962
% Number of unification failures: 310313265
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 298987218
% N base clause resolution failure due to lookup table: 35032691
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 40
% N unit clauses dropped because they exceeded max values: 122409
% 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: 22
% Total number of terms of all unit clauses in table: 55
% 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.40
% Number of symbols (columns) in UCFA: 43
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 463546227
% ConstructUnitClause() = 122412
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.10 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: 510777
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
% 
%------------------------------------------------------------------------------