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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CARINE---0.734
% Problem  : SYN760-1 : TPTP v5.0.0. Released v2.5.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 11:39:33 EST 2010

% Result   : Timeout 300.03s
% 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/SystemOnTPTP12764/SYN/SYN760-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 = 1]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 10] [nf = 8] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 346] [nf = 118] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% 	t = 0 secs [nr = 2694] [nf = 426] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% 	t = 0 secs [nr = 18121] [nf = 1058] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% 	t = 0 secs [nr = 52238] [nf = 1786] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% 	t = 0 secs [nr = 86355] [nf = 2514] [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% 	t = 0 secs [nr = 120472] [nf = 3242] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% 	t = 0 secs [nr = 154589] [nf = 3970] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% 	t = 0 secs [nr = 188706] [nf = 4698] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% 	t = 0 secs [nr = 222823] [nf = 5426] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% 	t = 1 secs [nr = 256940] [nf = 6154] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% 	t = 1 secs [nr = 291057] [nf = 6882] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% 	t = 1 secs [nr = 325174] [nf = 7610] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% 	t = 1 secs [nr = 359291] [nf = 8338] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% 	t = 1 secs [nr = 393408] [nf = 9066] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% 	t = 1 secs [nr = 427525] [nf = 9794] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% 	t = 1 secs [nr = 461642] [nf = 10522] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% 	t = 1 secs [nr = 495759] [nf = 11250] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% 	t = 1 secs [nr = 529876] [nf = 11978] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% 	t = 1 secs [nr = 563993] [nf = 12706] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% 	t = 1 secs [nr = 598110] [nf = 13434] [nu = 0] [ut = 1]
% Looking for a proof at depth = 26 ...
% 	t = 1 secs [nr = 632227] [nf = 14162] [nu = 0] [ut = 1]
% Looking for a proof at depth = 27 ...
% 	t = 1 secs [nr = 666344] [nf = 14890] [nu = 0] [ut = 1]
% Looking for a proof at depth = 28 ...
% 	t = 2 secs [nr = 700461] [nf = 15618] [nu = 0] [ut = 1]
% Looking for a proof at depth = 29 ...
% 	t = 2 secs [nr = 734578] [nf = 16346] [nu = 0] [ut = 1]
% Looking for a proof at depth = 30 ...
% 	t = 2 secs [nr = 768695] [nf = 17074] [nu = 0] [ut = 1]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% 	t = 2 secs [nr = 768695] [nf = 17074] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% 	t = 2 secs [nr = 768695] [nf = 17074] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% 	t = 2 secs [nr = 768695] [nf = 17074] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% 	t = 2 secs [nr = 768701] [nf = 17078] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% 	t = 2 secs [nr = 768765] [nf = 17194] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% 	t = 2 secs [nr = 769479] [nf = 17778] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% 	t = 2 secs [nr = 774276] [nf = 19452] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% 	t = 2 secs [nr = 806562] [nf = 21810] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% 	t = 2 secs [nr = 878828] [nf = 24546] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% 	t = 2 secs [nr = 95428
% 8] [nf = 39762] [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% 	t = 3 secs [nr = 1076248] [nf = 102782] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% 	t = 4 secs [nr = 1381032] [nf = 429338] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% 	t = 8 secs [nr = 2447448] [nf = 1086230] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% 	t = 16 secs [nr = 4640928] [nf = 1708742] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% 	t = 24 secs [nr = 6961872] [nf = 2409110] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% 	t = 33 secs [nr = 9360984] [nf = 3242246] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% 	t = 43 secs [nr = 12143424] [nf = 4822934] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% 	t = 62 secs [nr = 16502496] [nf = 8940206] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% 	t = 97 secs [nr = 24212736] [nf = 13365638] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% 	t = 145 secs [nr = 34971168] [nf = 19548734] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% 	t = 194 secs [nr = 45729600] [nf = 25731830] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% 	t = 243 secs [nr = 56488032] [nf = 31914926] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% 	t = 291 secs [nr = 67246464] [nf = 38098022] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% TIME IS UP!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 109694975
% 	resolvents: 70046413	factors: 39648562
% 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] = 615613	[5] = 3871601	[6] = 19860149	[7] = 35637771	[8] = 39628606	[9] = 10081235	
% 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: 7907700
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 602903
% Number of successful unifications: 109694975
% Number of unification failures: 69740710
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 126610441
% N base clause resolution failure due to lookup table: 2949898
% 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() = 179435685
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: 365650
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
% 
%------------------------------------------------------------------------------