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

View Problem - Process Solution

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

% Computer : art03.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:03:29 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/SystemOnTPTP5029/SYN/SYN522-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 = 19] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 111] [nf = 4] [nu = 1] [ut = 2]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 222] [nf = 8] [nu = 2] [ut = 2]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 601] [nf = 35] [nu = 5] [ut = 2]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 988] [nf = 62] [nu = 8] [ut = 2]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 1379] [nf = 89] [nu = 11] [ut = 2]
% Looking for a proof at depth = 7 ...
% 	t = 0 secs [nr = 1779] [nf = 118] [nu = 14] [ut = 2]
% Looking for a proof at depth = 8 ...
% 	t = 0 secs [nr = 2206] [nf = 157] [nu = 17] [ut = 2]
% Looking for a proof at depth = 9 ...
% 	t = 0 secs [nr = 2633] [nf = 196] [nu = 20] [ut = 2]
% Looking for a proof at depth = 10 ...
% 	t = 0 secs [nr = 3063] [nf = 237] [nu = 23] [ut = 2]
% Looking for a proof at depth = 11 ...
% 	t = 0 secs [nr = 3493] [nf = 278] [nu = 26] [ut = 2]
% Looking for a proof at depth = 12 ...
% 	t = 0 secs [nr = 3923] [nf = 319] [nu = 29] [ut = 2]
% Looking for a proof at depth = 13 ...
% 	t = 0 secs [nr = 4353] [nf = 360] [nu = 32] [ut = 2]
% Looking for a proof at depth = 14 ...
% 	t = 0 secs [nr = 4783] [nf = 401] [nu = 35] [ut = 2]
% Looking for a proof at depth = 15 ...
% 	t = 0 secs [nr = 5213] [nf = 442] [nu = 38] [ut = 2]
% Looking for a proof at depth = 16 ...
% 	t = 0 secs [nr = 5643] [nf = 483] [nu = 41] [ut = 2]
% Looking for a proof at depth = 17 ...
% 	t = 0 secs [nr = 6073] [nf = 524] [nu = 44] [ut = 2]
% Looking for a proof at depth = 18 ...
% 	t = 0 secs [nr = 6503] [nf = 565] [nu = 47] [ut = 2]
% Looking for a proof at depth = 19 ...
% 	t = 0 secs [nr = 6933] [nf = 606] [nu = 50] [ut = 2]
% Looking for a proof at depth = 20 ...
% 	t = 0 secs [nr = 7363] [nf = 647] [nu = 53] [ut = 2]
% Looking for a proof at depth = 21 ...
% 	t = 0 secs [nr = 7793] [nf = 688] [nu = 56] [ut = 2]
% Looking for a proof at depth = 22 ...
% 	t = 0 secs [nr = 8223] [nf = 729] [nu = 59] [ut = 2]
% Looking for a proof at depth = 23 ...
% 	t = 0 secs [nr = 8653] [nf = 770] [nu = 62] [ut = 2]
% Looking for a proof at depth = 24 ...
% 	t = 0 secs [nr = 9083] [nf = 811] [nu = 65] [ut = 2]
% Looking for a proof at depth = 25 ...
% 	t = 0 secs [nr = 9513] [nf = 852] [nu = 68] [ut = 2]
% Looking for a proof at depth = 26 ...
% 	t = 0 secs [nr = 9943] [nf = 893] [nu = 71] [ut = 2]
% Looking for a proof at depth = 27 ...
% 	t = 0 secs [nr = 10373] [nf = 934] [nu = 74] [ut = 2]
% Looking for a proof at depth = 28 ...
% 	t = 0 secs [nr = 10803] [nf = 975] [nu = 77] [ut = 2]
% Looking for a proof at depth = 29 ...
% 	t = 0 secs [nr = 11233] [nf = 1016] [nu = 80] [ut = 2]
% Looking for a proof at depth = 30 ...
% 	t = 0 secs [nr = 11663] [nf = 1057] [nu = 83] [ut = 2]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% 	t = 0 secs [nr = 11682] [nf = 1057] [nu = 83] [ut = 2]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 11774] [nf = 1061] [nu = 84] [ut = 2]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 11894] [nf = 1065] [nu = 85] [ut = 2]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 12436] [nf = 1099] [nu = 88] [ut = 2]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 13826] [nf = 1178] [nu = 91] [ut = 2]
% Looking for a proof at depth = 6 ...
% 	t = 1 secs [nr = 18954] [nf = 1465] [nu = 94] [ut = 2]
% Looking for a proof at depth = 7 ...
% 	t = 1 secs [nr = 40542] [nf = 3050] [nu = 97] [ut = 2]
% Looking for a proof at depth = 8 ...
% 	t = 1 secs [nr = 113738] [nf = 10062] [nu = 100] [ut = 2]
% Looking for a proof at depth = 9 ...
% 	t = 3 secs [nr = 460481] [nf = 47899] [nu = 103] [ut = 2]
% Looking for a proof at depth = 10 ...
% 	t
%  = 11 secs [nr = 2072699] [nf = 227800] [nu = 106] [ut = 2]
% Looking for a proof at depth = 11 ...
% 	t = 54 secs [nr = 11154108] [nf = 1438730] [nu = 109] [ut = 2]
% Looking for a proof at depth = 12 ...
% 	t = 279 secs [nr = 54871423] [nf = 7932578] [nu = 112] [ut = 2]
% Looking for a proof at depth = 13 ...
% TIME IS UP!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 67815964
% 	resolvents: 58961562	factors: 8854402
% Number of unit clauses generated: 112
% % unit clauses generated to total clauses generated: 0.00
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 1		[2] = 1		
% Total = 2
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 112	[2] = 6281	[3] = 200651	[4] = 2318243	[5] = 14728648	[6] = 21485412	
% [7] = 13963328	[8] = 8764927	[9] = 5369247	[10] = 979115	
% Average size of a generated clause: 7.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		(+)1	(-)0
% [4] c5_0		(+)0	(-)0
% [5] ndr1_0		(+)1	(-)0
% [6] ssSkC0		(+)0	(-)0
% [7] ssSkC1		(+)0	(-)0
% [8] ssSkC2		(+)0	(-)0
% [9] ssSkC3		(+)0	(-)0
% [10] ssSkC4		(+)0	(-)0
% [11] ssSkC5		(+)0	(-)0
% [12] ssSkC6		(+)0	(-)0
% [13] ssSkC7		(+)0	(-)0
% [14] c1_1_1		(+)0	(-)0
% [15] c2_1_1		(+)0	(-)0
% [16] c3_1_1		(+)0	(-)0
% [17] c4_1_1		(+)0	(-)0
% [18] c5_1_1		(+)0	(-)0
% [19] ndr1_1_1		(+)0	(-)0
% [20] ssSkP0_1		(+)0	(-)0
% [21] ssSkP1_1		(+)0	(-)0
% [22] ssSkP2_1		(+)0	(-)0
% [23] ssSkP3_1		(+)0	(-)0
% [24] ssSkP4_1		(+)0	(-)0
% [25] c1_2_2		(+)0	(-)0
% [26] c2_2_2		(+)0	(-)0
% [27] c3_2_2		(+)0	(-)0
% [28] c4_2_2		(+)0	(-)0
% [29] c5_2_2		(+)0	(-)0
% 			------------------
% 		Total:	(+)2	(-)0
% Total number of unit clauses retained: 2
% Number of clauses skipped because of their length: 961056141
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 2037796819
% Number of successful unifications: 67815964
% Number of unification failures: 7546106
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 1058629694
% N base clause resolution failure due to lookup table: 1666311323
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 6
% N unit clauses dropped because they exceeded max values: 5
% 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: 97
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 75362070
% ConstructUnitClause() = 6
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: 226053
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
% 
%------------------------------------------------------------------------------