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

View Problem - Process Solution

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

% Result   : GaveUp 149.55s
% 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/SystemOnTPTP32360/SYN/SYN782-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 = 2]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 4] [nf = 2] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 254] [nf = 38] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% 	t = 0 secs [nr = 3480] [nf = 210] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% 	t = 0 secs [nr = 32880] [nf = 566] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% 	t = 0 secs [nr = 195952] [nf = 1046] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% 	t = 1 secs [nr = 359024] [nf = 1526] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% 	t = 1 secs [nr = 522096] [nf = 2006] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% 	t = 1 secs [nr = 685168] [nf = 2486] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% 	t = 2 secs [nr = 848240] [nf = 2966] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% 	t = 2 secs [nr = 1011312] [nf = 3446] [nu = 0] [ut = 2]
% Looking for a proof at depth = 15 ...
% 	t = 3 secs [nr = 1174384] [nf = 3926] [nu = 0] [ut = 2]
% Looking for a proof at depth = 16 ...
% 	t = 3 secs [nr = 1337456] [nf = 4406] [nu = 0] [ut = 2]
% Looking for a proof at depth = 17 ...
% 	t = 3 secs [nr = 1500528] [nf = 4886] [nu = 0] [ut = 2]
% Looking for a proof at depth = 18 ...
% 	t = 4 secs [nr = 1663600] [nf = 5366] [nu = 0] [ut = 2]
% Looking for a proof at depth = 19 ...
% 	t = 4 secs [nr = 1826672] [nf = 5846] [nu = 0] [ut = 2]
% Looking for a proof at depth = 20 ...
% 	t = 5 secs [nr = 1989744] [nf = 6326] [nu = 0] [ut = 2]
% Looking for a proof at depth = 21 ...
% 	t = 5 secs [nr = 2152816] [nf = 6806] [nu = 0] [ut = 2]
% Looking for a proof at depth = 22 ...
% 	t = 5 secs [nr = 2315888] [nf = 7286] [nu = 0] [ut = 2]
% Looking for a proof at depth = 23 ...
% 	t = 6 secs [nr = 2478960] [nf = 7766] [nu = 0] [ut = 2]
% Looking for a proof at depth = 24 ...
% 	t = 6 secs [nr = 2642032] [nf = 8246] [nu = 0] [ut = 2]
% Looking for a proof at depth = 25 ...
% 	t = 6 secs [nr = 2805104] [nf = 8726] [nu = 0] [ut = 2]
% Looking for a proof at depth = 26 ...
% 	t = 7 secs [nr = 2968176] [nf = 9206] [nu = 0] [ut = 2]
% Looking for a proof at depth = 27 ...
% 	t = 7 secs [nr = 3131248] [nf = 9686] [nu = 0] [ut = 2]
% Looking for a proof at depth = 28 ...
% 	t = 8 secs [nr = 3294320] [nf = 10166] [nu = 0] [ut = 2]
% Looking for a proof at depth = 29 ...
% 	t = 8 secs [nr = 3457392] [nf = 10646] [nu = 0] [ut = 2]
% Looking for a proof at depth = 30 ...
% 	t = 8 secs [nr = 3620464] [nf = 11126] [nu = 0] [ut = 2]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% 	t = 8 secs [nr = 3620464] [nf = 11126] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% 	t = 8 secs [nr = 3620464] [nf = 11126] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% 	t = 8 secs [nr = 3620464] [nf = 11126] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% 	t = 8 secs [nr = 3620468] [nf = 11126] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% 	t = 8 secs [nr = 3620512] [nf = 11188] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% 	t = 8 secs [nr = 3621266] [nf = 11804] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% 	t = 8 secs [nr = 3630510] [nf = 13608] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% 	t = 8 secs [nr = 3711090] [nf = 16556] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% 	t = 9 secs [nr = 4136990] [nf = 19700] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% 	t = 10 secs [nr = 45634
% 80] [nf = 24068] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% 	t = 11 secs [nr = 4999434] [nf = 42428] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% 	t = 12 secs [nr = 5509410] [nf = 210244] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% 	t = 16 secs [nr = 6477902] [nf = 1078740] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% 	t = 24 secs [nr = 8639014] [nf = 1947236] [nu = 0] [ut = 2]
% Looking for a proof at depth = 15 ...
% 	t = 32 secs [nr = 10800594] [nf = 2816668] [nu = 0] [ut = 2]
% Looking for a proof at depth = 16 ...
% 	t = 40 secs [nr = 12964430] [nf = 3695124] [nu = 0] [ut = 2]
% Looking for a proof at depth = 17 ...
% 	t = 48 secs [nr = 15143386] [nf = 4573580] [nu = 0] [ut = 2]
% Looking for a proof at depth = 18 ...
% 	t = 56 secs [nr = 17322342] [nf = 5452036] [nu = 0] [ut = 2]
% Looking for a proof at depth = 19 ...
% 	t = 64 secs [nr = 19501298] [nf = 6330492] [nu = 0] [ut = 2]
% Looking for a proof at depth = 20 ...
% 	t = 72 secs [nr = 21680254] [nf = 7208948] [nu = 0] [ut = 2]
% Looking for a proof at depth = 21 ...
% 	t = 80 secs [nr = 23859210] [nf = 8087404] [nu = 0] [ut = 2]
% Looking for a proof at depth = 22 ...
% 	t = 88 secs [nr = 26038166] [nf = 8965860] [nu = 0] [ut = 2]
% Looking for a proof at depth = 23 ...
% 	t = 96 secs [nr = 28217122] [nf = 9844316] [nu = 0] [ut = 2]
% Looking for a proof at depth = 24 ...
% 	t = 104 secs [nr = 30396078] [nf = 10722772] [nu = 0] [ut = 2]
% Looking for a proof at depth = 25 ...
% 	t = 112 secs [nr = 32575034] [nf = 11601228] [nu = 0] [ut = 2]
% Looking for a proof at depth = 26 ...
% 	t = 120 secs [nr = 34753990] [nf = 12479684] [nu = 0] [ut = 2]
% Looking for a proof at depth = 27 ...
% 	t = 128 secs [nr = 36932946] [nf = 13358140] [nu = 0] [ut = 2]
% Looking for a proof at depth = 28 ...
% 	t = 136 secs [nr = 39111902] [nf = 14236596] [nu = 0] [ut = 2]
% Looking for a proof at depth = 29 ...
% 	t = 144 secs [nr = 41290858] [nf = 15115052] [nu = 0] [ut = 2]
% Looking for a proof at depth = 30 ...
% 	t = 152 secs [nr = 43469814] [nf = 15993508] [nu = 0] [ut = 2]
% GIVE UP!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 59463322
% 	resolvents: 43469814	factors: 15993508
% 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] = 2		
% Total = 2
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [4] = 4421322	[5] = 5522306	[6] = 9894322	[7] = 19385330	[8] = 16005612	[9] = 4234430	
% Average size of a generated clause: 7.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] ssPv5_1		(+)0	(-)0
% [5] ssPv6_1		(+)0	(-)0
% [6] ssPv7_1		(+)0	(-)0
% [7] ssPv8_1		(+)0	(-)0
% [8] ssRr_2		(+)2	(-)0
% 			------------------
% 		Total:	(+)2	(-)0
% Total number of unit clauses retained: 2
% Number of clauses skipped because of their length: 1595540
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 0
% Number of successful unifications: 59463322
% Number of unification failures: 111972246
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 69767242
% N base clause resolution failure due to lookup table: 792198
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 18
% 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: 7
% Total number of terms of all unit clauses in table: 6
% 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.17
% Number of symbols (columns) in UCFA: 45
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 171435568
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: 399083
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 152 secs
% CPU time: 149.53 secs
% 
%------------------------------------------------------------------------------