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

View Problem - Process Solution

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

% Computer : art07.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:58:55 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/SystemOnTPTP31527/SYN/SYN515-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 = 52] [nf = 3] [nu = 0] [ut = 0]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 104] [nf = 6] [nu = 0] [ut = 0]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 164] [nf = 11] [nu = 0] [ut = 0]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 234] [nf = 18] [nu = 0] [ut = 0]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 365] [nf = 39] [nu = 2] [ut = 1]
% Looking for a proof at depth = 7 ...
% 	t = 0 secs [nr = 498] [nf = 60] [nu = 4] [ut = 1]
% Looking for a proof at depth = 8 ...
% 	t = 0 secs [nr = 631] [nf = 81] [nu = 6] [ut = 1]
% Looking for a proof at depth = 9 ...
% 	t = 0 secs [nr = 764] [nf = 102] [nu = 8] [ut = 1]
% Looking for a proof at depth = 10 ...
% 	t = 0 secs [nr = 897] [nf = 123] [nu = 10] [ut = 1]
% Looking for a proof at depth = 11 ...
% 	t = 0 secs [nr = 1030] [nf = 144] [nu = 12] [ut = 1]
% Looking for a proof at depth = 12 ...
% 	t = 0 secs [nr = 1163] [nf = 165] [nu = 14] [ut = 1]
% Looking for a proof at depth = 13 ...
% 	t = 0 secs [nr = 1296] [nf = 186] [nu = 16] [ut = 1]
% Looking for a proof at depth = 14 ...
% 	t = 0 secs [nr = 1429] [nf = 207] [nu = 18] [ut = 1]
% Looking for a proof at depth = 15 ...
% 	t = 0 secs [nr = 1562] [nf = 228] [nu = 20] [ut = 1]
% Looking for a proof at depth = 16 ...
% 	t = 0 secs [nr = 1695] [nf = 249] [nu = 22] [ut = 1]
% Looking for a proof at depth = 17 ...
% 	t = 0 secs [nr = 1828] [nf = 270] [nu = 24] [ut = 1]
% Looking for a proof at depth = 18 ...
% 	t = 0 secs [nr = 1961] [nf = 291] [nu = 26] [ut = 1]
% Looking for a proof at depth = 19 ...
% 	t = 0 secs [nr = 2094] [nf = 312] [nu = 28] [ut = 1]
% Looking for a proof at depth = 20 ...
% 	t = 0 secs [nr = 2227] [nf = 333] [nu = 30] [ut = 1]
% Looking for a proof at depth = 21 ...
% 	t = 0 secs [nr = 2360] [nf = 354] [nu = 32] [ut = 1]
% Looking for a proof at depth = 22 ...
% 	t = 0 secs [nr = 2493] [nf = 375] [nu = 34] [ut = 1]
% Looking for a proof at depth = 23 ...
% 	t = 0 secs [nr = 2626] [nf = 396] [nu = 36] [ut = 1]
% Looking for a proof at depth = 24 ...
% 	t = 0 secs [nr = 2759] [nf = 417] [nu = 38] [ut = 1]
% Looking for a proof at depth = 25 ...
% 	t = 0 secs [nr = 2892] [nf = 438] [nu = 40] [ut = 1]
% Looking for a proof at depth = 26 ...
% 	t = 0 secs [nr = 3025] [nf = 459] [nu = 42] [ut = 1]
% Looking for a proof at depth = 27 ...
% 	t = 0 secs [nr = 3158] [nf = 480] [nu = 44] [ut = 1]
% Looking for a proof at depth = 28 ...
% 	t = 0 secs [nr = 3291] [nf = 501] [nu = 46] [ut = 1]
% Looking for a proof at depth = 29 ...
% 	t = 0 secs [nr = 3424] [nf = 522] [nu = 48] [ut = 1]
% Looking for a proof at depth = 30 ...
% 	t = 0 secs [nr = 3557] [nf = 543] [nu = 50] [ut = 1]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% 	t = 0 secs [nr = 3557] [nf = 543] [nu = 50] [ut = 1]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 3609] [nf = 546] [nu = 50] [ut = 1]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 3680] [nf = 551] [nu = 50] [ut = 1]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 3955] [nf = 598] [nu = 50] [ut = 1]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 4835] [nf = 905] [nu = 50] [ut = 1]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 7699] [nf = 1384] [nu = 54] [ut = 1]
% Looking for a proof at depth = 7 ...
% 	t = 0 secs [nr = 15789] [nf = 2528] [nu = 58] [ut = 1]
% Looking for a proof at depth = 8 ...
% 	t = 0 secs [nr = 48357] [nf = 7648] [nu = 62] [ut = 1]
% Looking for a proof at depth = 9 ...
% 	t = 1 secs [nr = 187785] [nf = 34982] [nu = 66] [ut = 1]
% Looking for a proof at depth = 10 ...
% 	t = 3 secs [nr = 803187] [nf = 167897] [nu = 70] [ut = 1
% ]
% Looking for a proof at depth = 11 ...
% 	t = 12 secs [nr = 3012358] [nf = 716370] [nu = 74] [ut = 1]
% Looking for a proof at depth = 12 ...
% 	t = 45 secs [nr = 10656253] [nf = 3536620] [nu = 78] [ut = 1]
% Looking for a proof at depth = 13 ...
% 	t = 208 secs [nr = 47806991] [nf = 18695674] [nu = 82] [ut = 1]
% Looking for a proof at depth = 14 ...
% TIME IS UP!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 100216448
% 	resolvents: 70159690	factors: 30056758
% Number of unit clauses generated: 82
% % unit clauses generated to total clauses generated: 0.00
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [6] = 1		
% Total = 1
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 82	[2] = 1500	[3] = 19807	[4] = 264200	[5] = 3628093	[6] = 16723923	
% [7] = 40005307	[8] = 22284316	[9] = 10528270	[10] = 5715408	[11] = 1045542	
% Average size of a generated clause: 8.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] 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] c1_1_1		(+)0	(-)0
% [14] c2_1_1		(+)0	(-)0
% [15] c3_1_1		(+)0	(-)0
% [16] c4_1_1		(+)0	(-)0
% [17] c5_1_1		(+)0	(-)0
% [18] ndr1_1_1		(+)0	(-)0
% [19] ssSkP0_1		(+)0	(-)0
% [20] ssSkP1_1		(+)0	(-)0
% [21] ssSkP2_1		(+)0	(-)0
% [22] c1_2_2		(+)0	(-)0
% [23] c2_2_2		(+)0	(-)0
% [24] c3_2_2		(+)0	(-)0
% [25] c4_2_2		(+)0	(-)0
% [26] c5_2_2		(+)0	(-)0
% 			------------------
% 		Total:	(+)1	(-)0
% Total number of unit clauses retained: 1
% Number of clauses skipped because of their length: 864390108
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 1139367546
% Number of successful unifications: 100216448
% Number of unification failures: 7538727
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 1285486759
% N base clause resolution failure due to lookup table: 1192604494
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 7
% 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: 87
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 107755175
% ConstructUnitClause() = 6
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: 334055
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 304 secs
% CPU time: 300.00 secs
% 
%------------------------------------------------------------------------------