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

View Problem - Process Solution

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

% Computer : art06.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 11:35:04 EST 2010

% Result   : Timeout 300.02s
% 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/SystemOnTPTP11431/SYN/SYN746-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 = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% 	t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% 	t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% 	t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% 	t = 1 secs [nr = 4] [nf = 4] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% 	t = 1 secs [nr = 182] [nf = 64] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% 	t = 1 secs [nr = 1580] [nf = 260] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% 	t = 1 secs [nr = 14829] [nf = 738] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% 	t = 1 secs [nr = 60770] [nf = 1400] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% 	t = 1 secs [nr = 106711] [nf = 2062] [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% 	t = 1 secs [nr = 152652] [nf = 2724] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% 	t = 1 secs [nr = 198593] [nf = 3386] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% 	t = 1 secs [nr = 244534] [nf = 4048] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% 	t = 1 secs [nr = 290475] [nf = 4710] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% 	t = 1 secs [nr = 336416] [nf = 5372] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% 	t = 1 secs [nr = 382357] [nf = 6034] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% 	t = 1 secs [nr = 428298] [nf = 6696] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% 	t = 2 secs [nr = 474239] [nf = 7358] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% 	t = 2 secs [nr = 520180] [nf = 8020] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% 	t = 2 secs [nr = 566121] [nf = 8682] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% 	t = 2 secs [nr = 612062] [nf = 9344] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% 	t = 2 secs [nr = 658003] [nf = 10006] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% 	t = 2 secs [nr = 703944] [nf = 10668] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% 	t = 2 secs [nr = 749885] [nf = 11330] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% 	t = 2 secs [nr = 795826] [nf = 11992] [nu = 0] [ut = 1]
% Looking for a proof at depth = 26 ...
% 	t = 2 secs [nr = 841767] [nf = 12654] [nu = 0] [ut = 1]
% Looking for a proof at depth = 27 ...
% 	t = 2 secs [nr = 887708] [nf = 13316] [nu = 0] [ut = 1]
% Looking for a proof at depth = 28 ...
% 	t = 2 secs [nr = 933649] [nf = 13978] [nu = 0] [ut = 1]
% Looking for a proof at depth = 29 ...
% 	t = 3 secs [nr = 979590] [nf = 14640] [nu = 0] [ut = 1]
% Looking for a proof at depth = 30 ...
% 	t = 3 secs [nr = 1025531] [nf = 15302] [nu = 0] [ut = 1]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% 	t = 3 secs [nr = 1025531] [nf = 15302] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% 	t = 3 secs [nr = 1025531] [nf = 15302] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% 	t = 3 secs [nr = 1025531] [nf = 15302] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% 	t = 3 secs [nr = 1025535] [nf = 15302] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% 	t = 3 secs [nr = 1025571] [nf = 15360] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% 	t = 3 secs [nr = 1025969] [nf = 15708] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% 	t = 3 secs [nr = 1028916] [nf = 16978] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% 	t = 3 secs [nr = 1056726] [nf = 19202] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% 	t = 3 secs [nr = 1155120] [nf = 21816] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% 	t = 3 secs [nr = 1254680]
%  [nf = 28240] [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% 	t = 3 secs [nr = 1367594] [nf = 52748] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% 	t = 4 secs [nr = 1551936] [nf = 233896] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% 	t = 7 secs [nr = 2258902] [nf = 917652] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% 	t = 13 secs [nr = 4455116] [nf = 1602320] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% 	t = 20 secs [nr = 6656826] [nf = 2302036] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% 	t = 27 secs [nr = 8885464] [nf = 3052440] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% 	t = 36 secs [nr = 11362694] [nf = 4351484] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% 	t = 55 secs [nr = 15880692] [nf = 10808320] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% 	t = 96 secs [nr = 25875298] [nf = 17265156] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% 	t = 138 secs [nr = 35869904] [nf = 23721992] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% 	t = 179 secs [nr = 45864510] [nf = 30178828] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% 	t = 221 secs [nr = 55859116] [nf = 36635664] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% 	t = 263 secs [nr = 65853722] [nf = 43092500] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% TIME IS UP!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 125162263
% 	resolvents: 75709343	factors: 49452920
% Number of unit clauses generated: 0
% % unit clauses generated to total clauses generated: 0.00
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 1		
% Total = 1
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [4] = 817328	[5] = 4288304	[6] = 19986058	[7] = 35865392	[8] = 49455520	[9] = 14749661	
% Average size of a generated clause: 8.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] ssPv1_1		(+)0	(-)0
% [1] ssPv2_1		(+)0	(-)0
% [2] ssPv3_1		(+)0	(-)0
% [3] ssPv4_1		(+)0	(-)0
% [4] ssRr_2		(+)1	(-)0
% 			------------------
% 		Total:	(+)1	(-)0
% Total number of unit clauses retained: 1
% Number of clauses skipped because of their length: 9123472
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 0
% Number of successful unifications: 125162263
% Number of unification failures: 69221296
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 138427882
% N base clause resolution failure due to lookup table: 38168
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 22
% N unit clauses dropped because they exceeded max values: 0
% 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: 3
% Max term depth in a unit clause: 2
% Number of states in UCFA table: 5
% Total number of terms of all unit clauses in table: 3
% 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: 1.67
% Number of symbols (columns) in UCFA: 40
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 194383559
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: 417208
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 304 secs
% CPU time: 300.00 secs
% 
%------------------------------------------------------------------------------