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

View Problem - Process Solution 
%------------------------------------------------------------------------------
% File     : CARINE---0.734
% Problem  : GRP124-1.005 : TPTP v5.0.0. Released v1.2.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 : Sat Nov 27 20:56:18 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/SystemOnTPTP6780/GRP/GRP124-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 = 66] [nf = 0] [nu = 0] [ut = 26]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 450] [nf = 6] [nu = 252] [ut = 87]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 834] [nf = 12] [nu = 504] [ut = 87]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 2586] [nf = 42] [nu = 900] [ut = 87]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 4338] [nf = 72] [nu = 1296] [ut = 87]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 6090] [nf = 102] [nu = 1692] [ut = 87]
% Looking for a proof at depth = 7 ...
% 	t = 0 secs [nr = 7842] [nf = 132] [nu = 2088] [ut = 87]
% Looking for a proof at depth = 8 ...
% 	t = 0 secs [nr = 9594] [nf = 162] [nu = 2484] [ut = 87]
% Looking for a proof at depth = 9 ...
% 	t = 0 secs [nr = 11346] [nf = 192] [nu = 2880] [ut = 87]
% Looking for a proof at depth = 10 ...
% 	t = 0 secs [nr = 13098] [nf = 222] [nu = 3276] [ut = 87]
% Looking for a proof at depth = 11 ...
% 	t = 0 secs [nr = 14850] [nf = 252] [nu = 3672] [ut = 87]
% Looking for a proof at depth = 12 ...
% 	t = 0 secs [nr = 16602] [nf = 282] [nu = 4068] [ut = 87]
% Looking for a proof at depth = 13 ...
% 	t = 0 secs [nr = 18354] [nf = 312] [nu = 4464] [ut = 87]
% Looking for a proof at depth = 14 ...
% 	t = 0 secs [nr = 20106] [nf = 342] [nu = 4860] [ut = 87]
% Looking for a proof at depth = 15 ...
% 	t = 0 secs [nr = 21858] [nf = 372] [nu = 5256] [ut = 87]
% Looking for a proof at depth = 16 ...
% 	t = 0 secs [nr = 23610] [nf = 402] [nu = 5652] [ut = 87]
% Looking for a proof at depth = 17 ...
% 	t = 0 secs [nr = 25362] [nf = 432] [nu = 6048] [ut = 87]
% Looking for a proof at depth = 18 ...
% 	t = 0 secs [nr = 27114] [nf = 462] [nu = 6444] [ut = 87]
% Looking for a proof at depth = 19 ...
% 	t = 0 secs [nr = 28866] [nf = 492] [nu = 6840] [ut = 87]
% Looking for a proof at depth = 20 ...
% 	t = 0 secs [nr = 30618] [nf = 522] [nu = 7236] [ut = 87]
% Looking for a proof at depth = 21 ...
% 	t = 0 secs [nr = 32370] [nf = 552] [nu = 7632] [ut = 87]
% Looking for a proof at depth = 22 ...
% 	t = 0 secs [nr = 34122] [nf = 582] [nu = 8028] [ut = 87]
% Looking for a proof at depth = 23 ...
% 	t = 0 secs [nr = 35874] [nf = 612] [nu = 8424] [ut = 87]
% Looking for a proof at depth = 24 ...
% 	t = 0 secs [nr = 37626] [nf = 642] [nu = 8820] [ut = 87]
% Looking for a proof at depth = 25 ...
% 	t = 0 secs [nr = 39378] [nf = 672] [nu = 9216] [ut = 87]
% Looking for a proof at depth = 26 ...
% 	t = 0 secs [nr = 41130] [nf = 702] [nu = 9612] [ut = 87]
% Looking for a proof at depth = 27 ...
% 	t = 0 secs [nr = 42882] [nf = 732] [nu = 10008] [ut = 87]
% Looking for a proof at depth = 28 ...
% 	t = 0 secs [nr = 44634] [nf = 762] [nu = 10404] [ut = 87]
% Looking for a proof at depth = 29 ...
% 	t = 0 secs [nr = 46386] [nf = 792] [nu = 10800] [ut = 87]
% Looking for a proof at depth = 30 ...
% 	t = 0 secs [nr = 48138] [nf = 822] [nu = 11196] [ut = 87]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% 	t = 0 secs [nr = 48204] [nf = 822] [nu = 11196] [ut = 87]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 48588] [nf = 828] [nu = 11448] [ut = 87]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 48972] [nf = 834] [nu = 11700] [ut = 87]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 50724] [nf = 864] [nu = 12096] [ut = 87]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 52486] [nf = 894] [nu = 12492] [ut = 87]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 61592] [nf = 926] [nu = 15438] [ut = 92]
% Looking for a proof at depth = 7 ...
% 	t = 1 secs [nr = 137476] [nf = 1018] [nu = 22974] [ut = 92]
% Looking for a proof at depth = 8 ...
% 	t = 131 secs [nr = 9721812] [nf = 1110] [nu = 2942958] [ut = 96]
% Looking for a proof at depth = 9 ...
% TIME IS UP!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 60483134
% 	resolvents: 52712851	factors: 7770283
% Number of unit clauses generated: 5328234
% % unit clauses generated to total clauses generated: 8.81
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 26	[2] = 61	[6] = 5		[8] = 4		
% Total = 96
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 5328234	[2] = 9498620	[3] = 24691265	[4] = 20153427	[5] = 504639	[6] = 150023	
% [7] = 98732	[8] = 58194	
% Average size of a generated clause: 4.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] group_element_1	(+)5	(-)0
% [1] equalish_2		(+)5	(-)20
% [2] product_3		(+)6	(-)60
% 			------------------
% 		Total:	(+)16	(-)80
% Total number of unit clauses retained: 96
% Number of clauses skipped because of their length: 63757889
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 3157014
% Number of successful unifications: 60483134
% Number of unification failures: 1149264112
% Number of unit to unit unification failures: 460
% N literal unification failure due to lookup root_id table: 27615912
% N base clause resolution failure due to lookup table: 11982165
% N UC-BCL resolution dropped due to lookup table: 88181830
% Max entries in substitution set: 11
% N unit clauses dropped because they exceeded max values: 2915570
% 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: 60
% Total number of terms of all unit clauses in table: 253
% 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.24
% Number of symbols (columns) in UCFA: 42
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 1209747246
% ConstructUnitClause() = 2915640
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 2.83 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: 201610
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
% 
%------------------------------------------------------------------------------