TSTP Solution File: SET863-2 by CARINE---0.734

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CARINE---0.734
% Problem  : SET863-2 : TPTP v5.0.0. Released v3.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 : Sun Nov 28 05:52:00 EST 2010

% Result   : Timeout 300.05s
% 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/SystemOnTPTP10558/SET/SET863-2+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 = 8] [nf = 0] [nu = 0] [ut = 6]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 49] [nf = 3] [nu = 6] [ut = 8]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 325] [nf = 16] [nu = 69] [ut = 14]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 1288] [nf = 90] [nu = 273] [ut = 14]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 5241] [nf = 514] [nu = 980] [ut = 14]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 21495] [nf = 1603] [nu = 3546] [ut = 14]
% Looking for a proof at depth = 7 ...
% 	t = 1 secs [nr = 81777] [nf = 6534] [nu = 12926] [ut = 14]
% Looking for a proof at depth = 8 ...
% 	t = 1 secs [nr = 305404] [nf = 23134] [nu = 45988] [ut = 14]
% Looking for a proof at depth = 9 ...
% 	t = 4 secs [nr = 1150549] [nf = 79606] [nu = 166133] [ut = 14]
% Looking for a proof at depth = 10 ...
% 	t = 12 secs [nr = 4296937] [nf = 281644] [nu = 608041] [ut = 14]
% Looking for a proof at depth = 11 ...
% 	t = 45 secs [nr = 15776504] [nf = 1011558] [nu = 2206250] [ut = 14]
% Looking for a proof at depth = 12 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% 	t = 122 secs [nr = 42732901] [nf = 2630718] [nu = 5725211] [ut = 14]
% Looking for a proof at depth = 2 ...
% 	t = 122 secs [nr = 42732955] [nf = 2630721] [nu = 5725225] [ut = 14]
% Looking for a proof at depth = 3 ...
% 	t = 122 secs [nr = 42733233] [nf = 2630736] [nu = 5725288] [ut = 14]
% Looking for a proof at depth = 4 ...
% 	t = 122 secs [nr = 42735271] [nf = 2630857] [nu = 5725748] [ut = 14]
% Looking for a proof at depth = 5 ...
% 	t = 122 secs [nr = 42750254] [nf = 2632113] [nu = 5728325] [ut = 14]
% Looking for a proof at depth = 6 ...
% 	t = 122 secs [nr = 42859655] [nf = 2639625] [nu = 5744981] [ut = 14]
% Looking for a proof at depth = 7 ...
% 	t = 125 secs [nr = 43732296] [nf = 2725038] [nu = 5854927] [ut = 14]
% Looking for a proof at depth = 8 ...
% 	t = 143 secs [nr = 50930303] [nf = 3368624] [nu = 6637805] [ut = 14]
% Looking for a proof at depth = 9 ...
% TIME IS UP!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 120384940
% 	resolvents: 110770096	factors: 9614844
% Number of unit clauses generated: 12282925
% % unit clauses generated to total clauses generated: 10.20
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 6		[2] = 2		[3] = 6		
% Total = 14
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 12282925	[2] = 56129164	[3] = 43789449	[4] = 7515315	[5] = 653011	[6] = 15064	
% [7] = 12	
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] c_in_3		(+)6	(-)4
% [1] c_lessequals_3	(+)2	(-)2
% 			------------------
% 		Total:	(+)8	(-)6
% Total number of unit clauses retained: 14
% Number of clauses skipped because of their length: 65805908
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 0
% Number of successful unifications: 120384940
% Number of unification failures: 300173260
% Number of unit to unit unification failures: 28
% N literal unification failure due to lookup root_id table: 345913264
% N base clause resolution failure due to lookup table: 64807251
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 37
% N unit clauses dropped because they exceeded max values: 9817422
% 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: 8
% Max term depth in a unit clause: 3
% Number of states in UCFA table: 63
% Total number of terms of all unit clauses in table: 73
% Max allowed number of states in UCFA: 528000
% Ratio n states used/total allowed states: 0.00
% Ratio n states used/total unit clauses terms: 0.86
% Number of symbols (columns) in UCFA: 51
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 420558200
% ConstructUnitClause() = 9817430
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 13.99 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: 401283
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
% 
%------------------------------------------------------------------------------