TSTP Solution File: SYN499-1 by CARINE---0.734

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CARINE---0.734
% Problem  : SYN499-1 : TPTP v5.0.0. Released v2.1.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 09:51:01 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/SystemOnTPTP11430/SYN/SYN499-1+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 = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 72] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 144] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 936] [nf = 36] [nu = 0] [ut = 0]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 4069] [nf = 396] [nu = 36] [ut = 1]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 7202] [nf = 756] [nu = 72] [ut = 1]
% Looking for a proof at depth = 7 ...
% 	t = 0 secs [nr = 10396] [nf = 1156] [nu = 108] [ut = 1]
% Looking for a proof at depth = 8 ...
% 	t = 0 secs [nr = 13590] [nf = 1556] [nu = 144] [ut = 1]
% Looking for a proof at depth = 9 ...
% 	t = 0 secs [nr = 16916] [nf = 2072] [nu = 180] [ut = 1]
% Looking for a proof at depth = 10 ...
% 	t = 1 secs [nr = 20242] [nf = 2588] [nu = 216] [ut = 1]
% Looking for a proof at depth = 11 ...
% 	t = 1 secs [nr = 23568] [nf = 3104] [nu = 252] [ut = 1]
% Looking for a proof at depth = 12 ...
% 	t = 1 secs [nr = 26894] [nf = 3620] [nu = 288] [ut = 1]
% Looking for a proof at depth = 13 ...
% 	t = 1 secs [nr = 30220] [nf = 4136] [nu = 324] [ut = 1]
% Looking for a proof at depth = 14 ...
% 	t = 1 secs [nr = 33546] [nf = 4652] [nu = 360] [ut = 1]
% Looking for a proof at depth = 15 ...
% 	t = 1 secs [nr = 36872] [nf = 5168] [nu = 396] [ut = 1]
% Looking for a proof at depth = 16 ...
% 	t = 1 secs [nr = 40198] [nf = 5684] [nu = 432] [ut = 1]
% Looking for a proof at depth = 17 ...
% 	t = 1 secs [nr = 43524] [nf = 6200] [nu = 468] [ut = 1]
% Looking for a proof at depth = 18 ...
% 	t = 1 secs [nr = 46850] [nf = 6716] [nu = 504] [ut = 1]
% Looking for a proof at depth = 19 ...
% 	t = 1 secs [nr = 50176] [nf = 7232] [nu = 540] [ut = 1]
% Looking for a proof at depth = 20 ...
% 	t = 1 secs [nr = 53502] [nf = 7748] [nu = 576] [ut = 1]
% Looking for a proof at depth = 21 ...
% 	t = 1 secs [nr = 56828] [nf = 8264] [nu = 612] [ut = 1]
% Looking for a proof at depth = 22 ...
% 	t = 1 secs [nr = 60154] [nf = 8780] [nu = 648] [ut = 1]
% Looking for a proof at depth = 23 ...
% 	t = 1 secs [nr = 63480] [nf = 9296] [nu = 684] [ut = 1]
% Looking for a proof at depth = 24 ...
% 	t = 1 secs [nr = 66806] [nf = 9812] [nu = 720] [ut = 1]
% Looking for a proof at depth = 25 ...
% 	t = 1 secs [nr = 70132] [nf = 10328] [nu = 756] [ut = 1]
% Looking for a proof at depth = 26 ...
% 	t = 1 secs [nr = 73458] [nf = 10844] [nu = 792] [ut = 1]
% Looking for a proof at depth = 27 ...
% 	t = 2 secs [nr = 76784] [nf = 11360] [nu = 828] [ut = 1]
% Looking for a proof at depth = 28 ...
% 	t = 2 secs [nr = 80110] [nf = 11876] [nu = 864] [ut = 1]
% Looking for a proof at depth = 29 ...
% 	t = 2 secs [nr = 83436] [nf = 12392] [nu = 900] [ut = 1]
% Looking for a proof at depth = 30 ...
% 	t = 2 secs [nr = 86762] [nf = 12908] [nu = 936] [ut = 1]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% 	t = 2 secs [nr = 86762] [nf = 12908] [nu = 936] [ut = 1]
% Looking for a proof at depth = 2 ...
% 	t = 2 secs [nr = 86834] [nf = 12908] [nu = 936] [ut = 1]
% Looking for a proof at depth = 3 ...
% 	t = 2 secs [nr = 86906] [nf = 12908] [nu = 936] [ut = 1]
% Looking for a proof at depth = 4 ...
% 	t = 2 secs [nr = 87770] [nf = 12946] [nu = 936] [ut = 1]
% Looking for a proof at depth = 5 ...
% 	t = 2 secs [nr = 95112] [nf = 13499] [nu = 972] [ut = 1]
% Looking for a proof at depth = 6 ...
% 	t = 2 secs [nr = 196635] [nf = 19652] [nu = 1008] [ut = 1]
% Looking for a proof at depth = 7 ...
% 	t = 6 secs [nr = 1227103] [nf = 95921] [nu = 1044] [ut = 1]
% Looking for a proof at depth = 8 ...
% 	t = 34 se
% cs [nr = 6481378] [nf = 666844] [nu = 1080] [ut = 1]
% Looking for a proof at depth = 9 ...
% 	t = 260 secs [nr = 30657592] [nf = 4571123] [nu = 1116] [ut = 1]
% Looking for a proof at depth = 10 ...
% TIME IS UP!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 40076886
% 	resolvents: 34749074	factors: 5327812
% Number of unit clauses generated: 1116
% % unit clauses generated to total clauses generated: 0.00
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [5] = 1		
% Total = 1
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 1116	[2] = 15954	[3] = 145391	[4] = 1040940	[5] = 8978970	[6] = 23020234	
% [7] = 6141190	[8] = 702994	[9] = 30097	
% Average size of a generated clause: 6.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] hskp0		(+)0	(-)0
% [1] hskp1		(+)0	(-)0
% [2] hskp10		(+)0	(-)0
% [3] hskp11		(+)0	(-)0
% [4] hskp12		(+)0	(-)0
% [5] hskp13		(+)0	(-)0
% [6] hskp14		(+)0	(-)0
% [7] hskp15		(+)0	(-)0
% [8] hskp16		(+)0	(-)0
% [9] hskp17		(+)0	(-)0
% [10] hskp18		(+)0	(-)0
% [11] hskp19		(+)0	(-)0
% [12] hskp2		(+)0	(-)0
% [13] hskp20		(+)0	(-)0
% [14] hskp21		(+)0	(-)0
% [15] hskp22		(+)0	(-)0
% [16] hskp23		(+)0	(-)0
% [17] hskp24		(+)0	(-)0
% [18] hskp25		(+)0	(-)0
% [19] hskp26		(+)0	(-)0
% [20] hskp27		(+)0	(-)0
% [21] hskp28		(+)0	(-)0
% [22] hskp29		(+)0	(-)0
% [23] hskp3		(+)0	(-)0
% [24] hskp30		(+)0	(-)0
% [25] hskp4		(+)0	(-)0
% [26] hskp5		(+)0	(-)0
% [27] hskp6		(+)0	(-)0
% [28] hskp7		(+)0	(-)0
% [29] hskp8		(+)0	(-)0
% [30] hskp9		(+)0	(-)0
% [31] ndr1_0		(+)1	(-)0
% [32] c0_1_1		(+)0	(-)0
% [33] c1_1_1		(+)0	(-)0
% [34] c2_1_1		(+)0	(-)0
% [35] c3_1_1		(+)0	(-)0
% 			------------------
% 		Total:	(+)1	(-)0
% Total number of unit clauses retained: 1
% Number of clauses skipped because of their length: 267379137
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 1426792262
% Number of successful unifications: 40076886
% Number of unification failures: 115520369
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 2147211615
% N base clause resolution failure due to lookup table: 3140177248
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 2
% N unit clauses dropped because they exceeded max values: 71
% 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: 0
% Max term depth in a unit clause: 0
% Number of states in UCFA table: 2
% Total number of terms of all unit clauses in table: 0
% 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: inf
% Number of symbols (columns) in UCFA: 101
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 155597255
% ConstructUnitClause() = 72
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: 133590
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 302 secs
% CPU time: 300.00 secs
% 
%------------------------------------------------------------------------------