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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CARINE---0.734
% Problem  : SYN545-1 : TPTP v5.0.0. Released v2.1.0.
% Transfm  : add_equality
% Format   : carine
% Command  : carine %s t=%d xo=off uct=32000

% Computer : art01.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 10:18:22 EST 2010

% Result   : Timeout 300.06s
% 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/SystemOnTPTP24105/SYN/SYN545-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 = 1 secs [nr = 19] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 2 ...
% 	t = 1 secs [nr = 680] [nf = 16] [nu = 1] [ut = 1]
% Looking for a proof at depth = 3 ...
% 	t = 1 secs [nr = 1595] [nf = 35] [nu = 2] [ut = 1]
% Looking for a proof at depth = 4 ...
% 	t = 1 secs [nr = 4455] [nf = 164] [nu = 11] [ut = 1]
% Looking for a proof at depth = 5 ...
% 	t = 1 secs [nr = 8415] [nf = 402] [nu = 28] [ut = 1]
% Looking for a proof at depth = 6 ...
% 	t = 1 secs [nr = 12976] [nf = 709] [nu = 51] [ut = 1]
% Looking for a proof at depth = 7 ...
% 	t = 1 secs [nr = 18174] [nf = 1125] [nu = 81] [ut = 1]
% Looking for a proof at depth = 8 ...
% 	t = 1 secs [nr = 23879] [nf = 1618] [nu = 113] [ut = 1]
% Looking for a proof at depth = 9 ...
% 	t = 2 secs [nr = 30524] [nf = 2264] [nu = 158] [ut = 1]
% Looking for a proof at depth = 10 ...
% 	t = 2 secs [nr = 38067] [nf = 3089] [nu = 215] [ut = 1]
% Looking for a proof at depth = 11 ...
% 	t = 2 secs [nr = 46430] [nf = 4036] [nu = 278] [ut = 1]
% Looking for a proof at depth = 12 ...
% 	t = 2 secs [nr = 56164] [nf = 5236] [nu = 362] [ut = 1]
% Looking for a proof at depth = 13 ...
% 	t = 3 secs [nr = 67087] [nf = 6684] [nu = 467] [ut = 1]
% Looking for a proof at depth = 14 ...
% 	t = 3 secs [nr = 79902] [nf = 8442] [nu = 599] [ut = 1]
% Looking for a proof at depth = 15 ...
% 	t = 4 secs [nr = 95353] [nf = 10585] [nu = 756] [ut = 1]
% Looking for a proof at depth = 16 ...
% 	t = 5 secs [nr = 114655] [nf = 13305] [nu = 954] [ut = 1]
% Looking for a proof at depth = 17 ...
% 	t = 6 secs [nr = 139145] [nf = 16806] [nu = 1216] [ut = 1]
% Looking for a proof at depth = 18 ...
% 	t = 7 secs [nr = 170376] [nf = 21289] [nu = 1555] [ut = 1]
% Looking for a proof at depth = 19 ...
% 	t = 8 secs [nr = 210537] [nf = 27096] [nu = 1992] [ut = 1]
% Looking for a proof at depth = 20 ...
% 	t = 11 secs [nr = 263161] [nf = 34718] [nu = 2569] [ut = 1]
% Looking for a proof at depth = 21 ...
% 	t = 14 secs [nr = 333448] [nf = 45124] [nu = 3385] [ut = 1]
% Looking for a proof at depth = 22 ...
% 	t = 18 secs [nr = 425128] [nf = 59147] [nu = 4524] [ut = 1]
% Looking for a proof at depth = 23 ...
% 	t = 24 secs [nr = 542666] [nf = 77597] [nu = 6063] [ut = 1]
% Looking for a proof at depth = 24 ...
% 	t = 32 secs [nr = 690321] [nf = 101201] [nu = 8062] [ut = 1]
% Looking for a proof at depth = 25 ...
% 	t = 42 secs [nr = 872808] [nf = 130455] [nu = 10545] [ut = 1]
% Looking for a proof at depth = 26 ...
% 	t = 54 secs [nr = 1100756] [nf = 166998] [nu = 13651] [ut = 1]
% Looking for a proof at depth = 27 ...
% 	t = 71 secs [nr = 1386134] [nf = 212958] [nu = 17563] [ut = 1]
% Looking for a proof at depth = 28 ...
% 	t = 92 secs [nr = 1741355] [nf = 270295] [nu = 22452] [ut = 1]
% Looking for a proof at depth = 29 ...
% 	t = 118 secs [nr = 2181895] [nf = 341394] [nu = 28514] [ut = 1]
% Looking for a proof at depth = 30 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% 	t = 123 secs [nr = 2262553] [nf = 354458] [nu = 29603] [ut = 1]
% Looking for a proof at depth = 2 ...
% 	t = 123 secs [nr = 2263214] [nf = 354474] [nu = 29604] [ut = 1]
% Looking for a proof at depth = 3 ...
% 	t = 123 secs [nr = 2265267] [nf = 354608] [nu = 29605] [ut = 1]
% Looking for a proof at depth = 4 ...
% 	t = 123 secs [nr = 2278549] [nf = 355521] 
% [nu = 29614] [ut = 1]
% Looking for a proof at depth = 5 ...
% 	t = 124 secs [nr = 2336915] [nf = 361531] [nu = 29631] [ut = 1]
% Looking for a proof at depth = 6 ...
% 	t = 127 secs [nr = 2661285] [nf = 388420] [nu = 29660] [ut = 1]
% Looking for a proof at depth = 7 ...
% 	t = 145 secs [nr = 4732378] [nf = 583004] [nu = 29711] [ut = 1]
% Looking for a proof at depth = 8 ...
% 	t = 260 secs [nr = 18042453] [nf = 2056624] [nu = 29773] [ut = 1]
% Looking for a proof at depth = 9 ...
% TIME IS UP!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 25180863
% 	resolvents: 22732968	factors: 2447895
% Number of unit clauses generated: 29776
% % unit clauses generated to total clauses generated: 0.12
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [2] = 1		
% Total = 1
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 29776	[2] = 517990	[3] = 2279712	[4] = 1520045	[5] = 8158590	[6] = 8295790	
% [7] = 3874227	[8] = 459567	[9] = 41446	[10] = 1166	[11] = 598	[12] = 1170	
% [13] = 786	
% Average size of a generated clause: 6.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] c1_0		(+)0	(-)0
% [1] c2_0		(+)0	(-)0
% [2] c3_0		(+)0	(-)0
% [3] c4_0		(+)0	(-)0
% [4] c5_0		(+)0	(-)0
% [5] c6_0		(+)0	(-)0
% [6] c7_0		(+)0	(-)0
% [7] c8_0		(+)0	(-)0
% [8] ndr1_0		(+)1	(-)0
% [9] ssSkC0		(+)0	(-)0
% [10] ssSkC1		(+)0	(-)0
% [11] ssSkC10		(+)0	(-)0
% [12] ssSkC11		(+)0	(-)0
% [13] ssSkC12		(+)0	(-)0
% [14] ssSkC13		(+)0	(-)0
% [15] ssSkC14		(+)0	(-)0
% [16] ssSkC15		(+)0	(-)0
% [17] ssSkC16		(+)0	(-)0
% [18] ssSkC17		(+)0	(-)0
% [19] ssSkC18		(+)0	(-)0
% [20] ssSkC19		(+)0	(-)0
% [21] ssSkC2		(+)0	(-)0
% [22] ssSkC20		(+)0	(-)0
% [23] ssSkC21		(+)0	(-)0
% [24] ssSkC22		(+)0	(-)0
% [25] ssSkC23		(+)0	(-)0
% [26] ssSkC24		(+)0	(-)0
% [27] ssSkC25		(+)0	(-)0
% [28] ssSkC26		(+)0	(-)0
% [29] ssSkC27		(+)0	(-)0
% [30] ssSkC3		(+)0	(-)0
% [31] ssSkC4		(+)0	(-)0
% [32] ssSkC5		(+)0	(-)0
% [33] ssSkC6		(+)0	(-)0
% [34] ssSkC7		(+)0	(-)0
% [35] ssSkC8		(+)0	(-)0
% [36] ssSkC9		(+)0	(-)0
% [37] c1_1_1		(+)0	(-)0
% [38] c2_1_1		(+)0	(-)0
% [39] c3_1_1		(+)0	(-)0
% [40] c4_1_1		(+)0	(-)0
% [41] c5_1_1		(+)0	(-)0
% [42] c6_1_1		(+)0	(-)0
% [43] c7_1_1		(+)0	(-)0
% [44] c8_1_1		(+)0	(-)0
% [45] ndr1_1_1		(+)0	(-)0
% [46] ssSkP0_1		(+)0	(-)0
% [47] ssSkP10_1		(+)0	(-)0
% [48] ssSkP1_1		(+)0	(-)0
% [49] ssSkP2_1		(+)0	(-)0
% [50] ssSkP3_1		(+)0	(-)0
% [51] ssSkP4_1		(+)0	(-)0
% [52] ssSkP5_1		(+)0	(-)0
% [53] ssSkP6_1		(+)0	(-)0
% [54] ssSkP7_1		(+)0	(-)0
% [55] ssSkP8_1		(+)0	(-)0
% [56] ssSkP9_1		(+)0	(-)0
% [57] c1_2_2		(+)0	(-)0
% [58] c2_2_2		(+)0	(-)0
% [59] c3_2_2		(+)0	(-)0
% [60] c4_2_2		(+)0	(-)0
% [61] c5_2_2		(+)0	(-)0
% [62] c6_2_2		(+)0	(-)0
% [63] c7_2_2		(+)0	(-)0
% [64] c8_2_2		(+)0	(-)0
% 			------------------
% 		Total:	(+)1	(-)0
% Total number of unit clauses retained: 1
% Number of clauses skipped because of their length: 1218788821
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 915802630
% Number of successful unifications: 25180863
% Number of unification failures: 1284255
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 535793207
% N base clause resolution failure due to lookup table: 2678343636
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 5
% N unit clauses dropped because they exceeded max values: 6313
% 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: 250
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 26465118
% ConstructUnitClause() = 6314
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.02 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: 83936
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 304 secs
% CPU time: 300.00 secs
% 
%------------------------------------------------------------------------------