TSTP Solution File: GRP124-6.005 by CARINE---0.734

View Problem - Process Solution

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

% Computer : art04.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:01:02 EST 2010

% Result   : Timeout 300.04s
% 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/SystemOnTPTP2712/GRP/GRP124-6.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 = 132] [nf = 0] [nu = 0] [ut = 27]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 904] [nf = 14] [nu = 506] [ut = 148]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 1880] [nf = 292] [nu = 1012] [ut = 148]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 4976] [nf = 570] [nu = 2870] [ut = 148]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 8804] [nf = 1552] [nu = 4728] [ut = 148]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 16384] [nf = 2534] [nu = 8714] [ut = 148]
% Looking for a proof at depth = 7 ...
% 	t = 0 secs [nr = 23964] [nf = 3516] [nu = 12700] [ut = 148]
% Looking for a proof at depth = 8 ...
% 	t = 0 secs [nr = 31544] [nf = 4498] [nu = 16686] [ut = 148]
% Looking for a proof at depth = 9 ...
% 	t = 0 secs [nr = 39124] [nf = 5480] [nu = 20672] [ut = 148]
% Looking for a proof at depth = 10 ...
% 	t = 0 secs [nr = 46704] [nf = 6462] [nu = 24658] [ut = 148]
% Looking for a proof at depth = 11 ...
% 	t = 0 secs [nr = 54284] [nf = 7444] [nu = 28644] [ut = 148]
% Looking for a proof at depth = 12 ...
% 	t = 0 secs [nr = 61864] [nf = 8426] [nu = 32630] [ut = 148]
% Looking for a proof at depth = 13 ...
% 	t = 0 secs [nr = 69444] [nf = 9408] [nu = 36616] [ut = 148]
% Looking for a proof at depth = 14 ...
% 	t = 0 secs [nr = 77024] [nf = 10390] [nu = 40602] [ut = 148]
% Looking for a proof at depth = 15 ...
% 	t = 0 secs [nr = 84604] [nf = 11372] [nu = 44588] [ut = 148]
% Looking for a proof at depth = 16 ...
% 	t = 0 secs [nr = 92184] [nf = 12354] [nu = 48574] [ut = 148]
% Looking for a proof at depth = 17 ...
% 	t = 0 secs [nr = 99764] [nf = 13336] [nu = 52560] [ut = 148]
% Looking for a proof at depth = 18 ...
% 	t = 0 secs [nr = 107344] [nf = 14318] [nu = 56546] [ut = 148]
% Looking for a proof at depth = 19 ...
% 	t = 0 secs [nr = 114924] [nf = 15300] [nu = 60532] [ut = 148]
% Looking for a proof at depth = 20 ...
% 	t = 0 secs [nr = 122504] [nf = 16282] [nu = 64518] [ut = 148]
% Looking for a proof at depth = 21 ...
% 	t = 0 secs [nr = 130084] [nf = 17264] [nu = 68504] [ut = 148]
% Looking for a proof at depth = 22 ...
% 	t = 0 secs [nr = 137664] [nf = 18246] [nu = 72490] [ut = 148]
% Looking for a proof at depth = 23 ...
% 	t = 0 secs [nr = 145244] [nf = 19228] [nu = 76476] [ut = 148]
% Looking for a proof at depth = 24 ...
% 	t = 0 secs [nr = 152824] [nf = 20210] [nu = 80462] [ut = 148]
% Looking for a proof at depth = 25 ...
% 	t = 0 secs [nr = 160404] [nf = 21192] [nu = 84448] [ut = 148]
% Looking for a proof at depth = 26 ...
% 	t = 0 secs [nr = 167984] [nf = 22174] [nu = 88434] [ut = 148]
% Looking for a proof at depth = 27 ...
% 	t = 0 secs [nr = 175564] [nf = 23156] [nu = 92420] [ut = 148]
% Looking for a proof at depth = 28 ...
% 	t = 0 secs [nr = 183144] [nf = 24138] [nu = 96406] [ut = 148]
% Looking for a proof at depth = 29 ...
% 	t = 0 secs [nr = 190724] [nf = 25120] [nu = 100392] [ut = 148]
% Looking for a proof at depth = 30 ...
% 	t = 0 secs [nr = 198304] [nf = 26102] [nu = 104378] [ut = 148]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% 	t = 0 secs [nr = 198436] [nf = 26102] [nu = 104378] [ut = 148]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 199268] [nf = 26116] [nu = 104884] [ut = 148]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 200250] [nf = 26394] [nu = 105390] [ut = 148]
% Looking for a proof at depth = 4 ...
% 	t = 1 secs [nr = 205482] [nf = 26672] [nu = 108484] [ut = 148]
% Looking for a proof at depth = 5 ...
% 	t = 1 secs [nr = 212228] [nf = 29650] [nu = 111578] [ut = 148]
% Looking for a proof at depth = 6 ...
% 	t = 1 secs [nr = 300773] [nf = 33152] [nu = 155204] [ut = 158]
% Looking for a proof at depth = 7 ...
% 	t = 2 secs [nr = 692324] [nf = 38554] [nu = 311760] [ut = 158]
% Looking for a proo
% f at depth = 8 ...
% 	t = 293 secs [nr = 21874603] [nf = 43956] [nu = 6823132] [ut = 162]
% Looking for a proof at depth = 9 ...
% TIME IS UP!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 25465650
% 	resolvents: 25082721	factors: 382929
% Number of unit clauses generated: 7083838
% % unit clauses generated to total clauses generated: 27.82
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 27	[2] = 121	[6] = 10	[8] = 4		
% Total = 162
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 7083838	[2] = 8044325	[3] = 6168731	[4] = 3135637	[5] = 813143	[6] = 190646	
% [7] = 22519	[8] = 6811	
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] group_element_1	(+)5	(-)0
% [1] equalish_2		(+)5	(-)20
% [2] product1_3		(+)6	(-)60
% [3] product2_3		(+)6	(-)60
% 			------------------
% 		Total:	(+)22	(-)140
% Total number of unit clauses retained: 162
% Number of clauses skipped because of their length: 105266424
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 337371
% Number of successful unifications: 25465650
% Number of unification failures: 1372987624
% Number of unit to unit unification failures: 820
% N literal unification failure due to lookup root_id table: 10332144
% N base clause resolution failure due to lookup table: 3938315
% N UC-BCL resolution dropped due to lookup table: 125062101
% Max entries in substitution set: 15
% N unit clauses dropped because they exceeded max values: 6400313
% 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: 104
% Total number of terms of all unit clauses in table: 451
% 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.23
% Number of symbols (columns) in UCFA: 43
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 1398453274
% ConstructUnitClause() = 6400448
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 7.08 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: 84886
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
% 
%------------------------------------------------------------------------------