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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CARINE---0.734
% Problem  : SYN418-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 09:01:58 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/SystemOnTPTP18203/SYN/SYN418-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 = 28] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 2 ...
% 	t = 1 secs [nr = 399] [nf = 15] [nu = 1] [ut = 1]
% Looking for a proof at depth = 3 ...
% 	t = 1 secs [nr = 799] [nf = 30] [nu = 2] [ut = 1]
% Looking for a proof at depth = 4 ...
% 	t = 1 secs [nr = 2010] [nf = 88] [nu = 5] [ut = 1]
% Looking for a proof at depth = 5 ...
% 	t = 1 secs [nr = 3245] [nf = 146] [nu = 8] [ut = 1]
% Looking for a proof at depth = 6 ...
% 	t = 1 secs [nr = 4706] [nf = 237] [nu = 11] [ut = 1]
% Looking for a proof at depth = 7 ...
% 	t = 1 secs [nr = 6261] [nf = 334] [nu = 14] [ut = 1]
% Looking for a proof at depth = 8 ...
% 	t = 1 secs [nr = 8290] [nf = 530] [nu = 24] [ut = 1]
% Looking for a proof at depth = 9 ...
% 	t = 1 secs [nr = 10495] [nf = 754] [nu = 34] [ut = 1]
% Looking for a proof at depth = 10 ...
% 	t = 1 secs [nr = 13132] [nf = 1062] [nu = 50] [ut = 1]
% Looking for a proof at depth = 11 ...
% 	t = 1 secs [nr = 16079] [nf = 1416] [nu = 66] [ut = 1]
% Looking for a proof at depth = 12 ...
% 	t = 1 secs [nr = 19477] [nf = 1854] [nu = 86] [ut = 1]
% Looking for a proof at depth = 13 ...
% 	t = 1 secs [nr = 23440] [nf = 2390] [nu = 110] [ut = 1]
% Looking for a proof at depth = 14 ...
% 	t = 2 secs [nr = 28184] [nf = 3070] [nu = 142] [ut = 1]
% Looking for a proof at depth = 15 ...
% 	t = 2 secs [nr = 33589] [nf = 3898] [nu = 182] [ut = 1]
% Looking for a proof at depth = 16 ...
% 	t = 2 secs [nr = 40089] [nf = 4952] [nu = 238] [ut = 1]
% Looking for a proof at depth = 17 ...
% 	t = 2 secs [nr = 47472] [nf = 6166] [nu = 302] [ut = 1]
% Looking for a proof at depth = 18 ...
% 	t = 3 secs [nr = 55839] [nf = 7550] [nu = 378] [ut = 1]
% Looking for a proof at depth = 19 ...
% 	t = 3 secs [nr = 65568] [nf = 9196] [nu = 474] [ut = 1]
% Looking for a proof at depth = 20 ...
% 	t = 4 secs [nr = 76760] [nf = 11126] [nu = 586] [ut = 1]
% Looking for a proof at depth = 21 ...
% 	t = 4 secs [nr = 89212] [nf = 13270] [nu = 714] [ut = 1]
% Looking for a proof at depth = 22 ...
% 	t = 5 secs [nr = 103748] [nf = 15860] [nu = 882] [ut = 1]
% Looking for a proof at depth = 23 ...
% 	t = 5 secs [nr = 119945] [nf = 18766] [nu = 1066] [ut = 1]
% Looking for a proof at depth = 24 ...
% 	t = 6 secs [nr = 137870] [nf = 21958] [nu = 1270] [ut = 1]
% Looking for a proof at depth = 25 ...
% 	t = 7 secs [nr = 158369] [nf = 25716] [nu = 1526] [ut = 1]
% Looking for a proof at depth = 26 ...
% 	t = 8 secs [nr = 181205] [nf = 29930] [nu = 1806] [ut = 1]
% Looking for a proof at depth = 27 ...
% 	t = 10 secs [nr = 206141] [nf = 34482] [nu = 2110] [ut = 1]
% Looking for a proof at depth = 28 ...
% 	t = 11 secs [nr = 234573] [nf = 39848] [nu = 2494] [ut = 1]
% Looking for a proof at depth = 29 ...
% 	t = 13 secs [nr = 265636] [nf = 45718] [nu = 2902] [ut = 1]
% Looking for a proof at depth = 30 ...
% 	t = 14 secs [nr = 299363] [nf = 52006] [nu = 3338] [ut = 1]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% 	t = 14 secs [nr = 299391] [nf = 52006] [nu = 3338] [ut = 1]
% Looking for a proof at depth = 2 ...
% 	t = 14 secs [nr = 299762] [nf = 52021] [nu = 3339] [ut = 1]
% Looking for a proof at depth = 3 ...
% 	t = 14 secs [nr = 302275] [nf = 52106] [nu = 3340] [ut = 1]
% Looking for a proof at depth = 4 ...
% 	t = 15 secs [nr = 315280] [nf = 52733] [nu = 3343] [ut = 1]
% Looking f
% or a proof at depth = 5 ...
% 	t = 15 secs [nr = 387615] [nf = 58416] [nu = 3346] [ut = 1]
% Looking for a proof at depth = 6 ...
% 	t = 18 secs [nr = 715810] [nf = 82534] [nu = 3349] [ut = 1]
% Looking for a proof at depth = 7 ...
% 	t = 35 secs [nr = 2522726] [nf = 263461] [nu = 3352] [ut = 1]
% Looking for a proof at depth = 8 ...
% 	t = 140 secs [nr = 13806088] [nf = 1724188] [nu = 3380] [ut = 1]
% Looking for a proof at depth = 9 ...
% TIME IS UP!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 33233756
% 	resolvents: 28951717	factors: 4282039
% Number of unit clauses generated: 3390
% % unit clauses generated to total clauses generated: 0.01
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [2] = 1		
% Total = 1
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 3390	[2] = 67893	[3] = 411427	[4] = 1536288	[5] = 9610332	[6] = 15548532	
% [7] = 5142868	[8] = 845178	[9] = 63403	[10] = 971	[11] = 526	[12] = 577	
% [13] = 270	[14] = 672	[15] = 1084	[16] = 345	
% Average size of a generated clause: 6.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] c10_0		(+)0	(-)0
% [1] c1_0		(+)0	(-)0
% [2] c2_0		(+)0	(-)0
% [3] c3_0		(+)0	(-)0
% [4] c4_0		(+)0	(-)0
% [5] c5_0		(+)0	(-)0
% [6] c6_0		(+)0	(-)0
% [7] c7_0		(+)0	(-)0
% [8] c8_0		(+)0	(-)0
% [9] c9_0		(+)0	(-)0
% [10] ndr1_0		(+)1	(-)0
% [11] ssSkC0		(+)0	(-)0
% [12] ssSkC1		(+)0	(-)0
% [13] ssSkC10		(+)0	(-)0
% [14] ssSkC11		(+)0	(-)0
% [15] ssSkC12		(+)0	(-)0
% [16] ssSkC13		(+)0	(-)0
% [17] ssSkC14		(+)0	(-)0
% [18] ssSkC15		(+)0	(-)0
% [19] ssSkC16		(+)0	(-)0
% [20] ssSkC17		(+)0	(-)0
% [21] ssSkC18		(+)0	(-)0
% [22] ssSkC19		(+)0	(-)0
% [23] ssSkC2		(+)0	(-)0
% [24] ssSkC20		(+)0	(-)0
% [25] ssSkC21		(+)0	(-)0
% [26] ssSkC22		(+)0	(-)0
% [27] ssSkC23		(+)0	(-)0
% [28] ssSkC24		(+)0	(-)0
% [29] ssSkC25		(+)0	(-)0
% [30] ssSkC26		(+)0	(-)0
% [31] ssSkC27		(+)0	(-)0
% [32] ssSkC28		(+)0	(-)0
% [33] ssSkC29		(+)0	(-)0
% [34] ssSkC3		(+)0	(-)0
% [35] ssSkC30		(+)0	(-)0
% [36] ssSkC4		(+)0	(-)0
% [37] ssSkC5		(+)0	(-)0
% [38] ssSkC6		(+)0	(-)0
% [39] ssSkC7		(+)0	(-)0
% [40] ssSkC8		(+)0	(-)0
% [41] ssSkC9		(+)0	(-)0
% [42] c10_1_1		(+)0	(-)0
% [43] c1_1_1		(+)0	(-)0
% [44] c2_1_1		(+)0	(-)0
% [45] c3_1_1		(+)0	(-)0
% [46] c4_1_1		(+)0	(-)0
% [47] c5_1_1		(+)0	(-)0
% [48] c6_1_1		(+)0	(-)0
% [49] c7_1_1		(+)0	(-)0
% [50] c8_1_1		(+)0	(-)0
% [51] c9_1_1		(+)0	(-)0
% [52] ndr1_1_1		(+)0	(-)0
% [53] ssSkP0_1		(+)0	(-)0
% [54] ssSkP1_1		(+)0	(-)0
% [55] ssSkP2_1		(+)0	(-)0
% [56] ssSkP3_1		(+)0	(-)0
% [57] ssSkP4_1		(+)0	(-)0
% [58] ssSkP5_1		(+)0	(-)0
% [59] ssSkP6_1		(+)0	(-)0
% [60] ssSkP7_1		(+)0	(-)0
% [61] c10_2_2		(+)0	(-)0
% [62] c1_2_2		(+)0	(-)0
% [63] c2_2_2		(+)0	(-)0
% [64] c3_2_2		(+)0	(-)0
% [65] c4_2_2		(+)0	(-)0
% [66] c5_2_2		(+)0	(-)0
% [67] c6_2_2		(+)0	(-)0
% [68] c7_2_2		(+)0	(-)0
% [69] c8_2_2		(+)0	(-)0
% [70] c9_2_2		(+)0	(-)0
% 			------------------
% 		Total:	(+)1	(-)0
% Total number of unit clauses retained: 1
% Number of clauses skipped because of their length: 2560593704
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 1677214241
% Number of successful unifications: 33233756
% Number of unification failures: 766443
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 606324599
% N base clause resolution failure due to lookup table: 1975388907
% 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: 463
% 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: 251
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 34000199
% ConstructUnitClause() = 464
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: 110779
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 305 secs
% CPU time: 300.00 secs
% 
%------------------------------------------------------------------------------