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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CARINE---0.734
% Problem  : GRP123-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 : art02.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 20:51:51 EST 2010

% Result   : Timeout 300.03s
% 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/SystemOnTPTP9935/GRP/GRP123-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 = 1920] [nf = 292] [nu = 1052] [ut = 148]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 5376] [nf = 570] [nu = 3270] [ut = 148]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 9564] [nf = 2152] [nu = 5488] [ut = 148]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 19424] [nf = 3734] [nu = 11114] [ut = 148]
% Looking for a proof at depth = 7 ...
% 	t = 0 secs [nr = 29284] [nf = 5316] [nu = 16740] [ut = 148]
% Looking for a proof at depth = 8 ...
% 	t = 0 secs [nr = 39144] [nf = 6898] [nu = 22366] [ut = 148]
% Looking for a proof at depth = 9 ...
% 	t = 0 secs [nr = 49004] [nf = 8480] [nu = 27992] [ut = 148]
% Looking for a proof at depth = 10 ...
% 	t = 0 secs [nr = 58864] [nf = 10062] [nu = 33618] [ut = 148]
% Looking for a proof at depth = 11 ...
% 	t = 0 secs [nr = 68724] [nf = 11644] [nu = 39244] [ut = 148]
% Looking for a proof at depth = 12 ...
% 	t = 0 secs [nr = 78584] [nf = 13226] [nu = 44870] [ut = 148]
% Looking for a proof at depth = 13 ...
% 	t = 0 secs [nr = 88444] [nf = 14808] [nu = 50496] [ut = 148]
% Looking for a proof at depth = 14 ...
% 	t = 0 secs [nr = 98304] [nf = 16390] [nu = 56122] [ut = 148]
% Looking for a proof at depth = 15 ...
% 	t = 0 secs [nr = 108164] [nf = 17972] [nu = 61748] [ut = 148]
% Looking for a proof at depth = 16 ...
% 	t = 0 secs [nr = 118024] [nf = 19554] [nu = 67374] [ut = 148]
% Looking for a proof at depth = 17 ...
% 	t = 0 secs [nr = 127884] [nf = 21136] [nu = 73000] [ut = 148]
% Looking for a proof at depth = 18 ...
% 	t = 0 secs [nr = 137744] [nf = 22718] [nu = 78626] [ut = 148]
% Looking for a proof at depth = 19 ...
% 	t = 0 secs [nr = 147604] [nf = 24300] [nu = 84252] [ut = 148]
% Looking for a proof at depth = 20 ...
% 	t = 0 secs [nr = 157464] [nf = 25882] [nu = 89878] [ut = 148]
% Looking for a proof at depth = 21 ...
% 	t = 0 secs [nr = 167324] [nf = 27464] [nu = 95504] [ut = 148]
% Looking for a proof at depth = 22 ...
% 	t = 0 secs [nr = 177184] [nf = 29046] [nu = 101130] [ut = 148]
% Looking for a proof at depth = 23 ...
% 	t = 0 secs [nr = 187044] [nf = 30628] [nu = 106756] [ut = 148]
% Looking for a proof at depth = 24 ...
% 	t = 0 secs [nr = 196904] [nf = 32210] [nu = 112382] [ut = 148]
% Looking for a proof at depth = 25 ...
% 	t = 1 secs [nr = 206764] [nf = 33792] [nu = 118008] [ut = 148]
% Looking for a proof at depth = 26 ...
% 	t = 1 secs [nr = 216624] [nf = 35374] [nu = 123634] [ut = 148]
% Looking for a proof at depth = 27 ...
% 	t = 1 secs [nr = 226484] [nf = 36956] [nu = 129260] [ut = 148]
% Looking for a proof at depth = 28 ...
% 	t = 1 secs [nr = 236344] [nf = 38538] [nu = 134886] [ut = 148]
% Looking for a proof at depth = 29 ...
% 	t = 1 secs [nr = 246204] [nf = 40120] [nu = 140512] [ut = 148]
% Looking for a proof at depth = 30 ...
% 	t = 1 secs [nr = 256064] [nf = 41702] [nu = 146138] [ut = 148]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% 	t = 1 secs [nr = 256196] [nf = 41702] [nu = 146138] [ut = 148]
% Looking for a proof at depth = 2 ...
% 	t = 1 secs [nr = 257068] [nf = 41716] [nu = 146684] [ut = 148]
% Looking for a proof at depth = 3 ...
% 	t = 1 secs [nr = 258090] [nf = 41994] [nu = 147230] [ut = 148]
% Looking for a proof at depth = 4 ...
% 	t = 1 secs [nr = 263682] [nf = 42272] [nu = 150684] [ut = 148]
% Looking for a proof at depth = 5 ...
% 	t = 1 secs [nr = 270788] [nf = 46250] [nu = 154138] [ut = 148]
% Looking for a proof at depth = 6 ...
% 	t = 1 secs [nr = 369013] [nf = 51192] [nu = 203964] [ut = 158]
% Looking for a proof at depth = 7 ...
% 	t = 2 secs [nr = 780844] [nf = 58914] [nu = 374240] [ut = 158]
% Loo
% king for a proof at depth = 8 ...
% 	t = 294 secs [nr = 21984079] [nf = 66636] [nu = 6899332] [ut = 162]
% Looking for a proof at depth = 9 ...
% TIME IS UP!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 25229353
% 	resolvents: 24827434	factors: 401919
% Number of unit clauses generated: 7156066
% % unit clauses generated to total clauses generated: 28.36
% 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] = 7156066	[2] = 8085744	[3] = 5982282	[4] = 2999524	[5] = 793678	[6] = 184234	
% [7] = 21664	[8] = 6161	
% 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: 104977808
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 342759
% Number of successful unifications: 25229353
% Number of unification failures: 1370227202
% Number of unit to unit unification failures: 820
% N literal unification failure due to lookup root_id table: 10911545
% N base clause resolution failure due to lookup table: 4185073
% N UC-BCL resolution dropped due to lookup table: 124811451
% Max entries in substitution set: 15
% N unit clauses dropped because they exceeded max values: 6408033
% 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() = 1395456555
% ConstructUnitClause() = 6408168
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 6.87 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: 84098
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
% 
%------------------------------------------------------------------------------