TSTP Solution File: MSC008-2.002 by CARINE---0.734

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CARINE---0.734
% Problem  : MSC008-2.002 : TPTP v5.0.0. Released v1.0.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 02:01:12 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/SystemOnTPTP6621/MSC/MSC008-2.002+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 = 13] [nf = 0] [nu = 5] [ut = 3]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 270] [nf = 24] [nu = 16] [ut = 3]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 1885] [nf = 72] [nu = 39] [ut = 3]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 9354] [nf = 840] [nu = 86] [ut = 3]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 69381] [nf = 3438] [nu = 181] [ut = 3]
% Looking for a proof at depth = 6 ...
% 	t = 1 secs [nr = 512326] [nf = 13884] [nu = 372] [ut = 3]
% Looking for a proof at depth = 7 ...
% 	t = 5 secs [nr = 2900773] [nf = 141114] [nu = 755] [ut = 3]
% Looking for a proof at depth = 8 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% 	t = 32 secs [nr = 17053958] [nf = 655076] [nu = 1527] [ut = 3]
% Looking for a proof at depth = 2 ...
% 	t = 32 secs [nr = 17054215] [nf = 655100] [nu = 1538] [ut = 3]
% Looking for a proof at depth = 3 ...
% 	t = 32 secs [nr = 17055830] [nf = 655148] [nu = 1561] [ut = 3]
% Looking for a proof at depth = 4 ...
% 	t = 32 secs [nr = 17063731] [nf = 656564] [nu = 1608] [ut = 3]
% Looking for a proof at depth = 5 ...
% 	t = 32 secs [nr = 17162138] [nf = 665196] [nu = 1703] [ut = 3]
% Looking for a proof at depth = 6 ...
% 	t = 34 secs [nr = 18263847] [nf = 714078] [nu = 1894] [ut = 3]
% Looking for a proof at depth = 7 ...
% 	t = 50 secs [nr = 26558676] [nf = 1847106] [nu = 2277] [ut = 3]
% Looking for a proof at depth = 8 ...
% 	t = 230 secs [nr = 123666511] [nf = 13612656] [nu = 3044] [ut = 3]
% Looking for a proof at depth = 9 ...
% TIME IS UP!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 182146088
% 	resolvents: 164199724	factors: 17946364
% Number of unit clauses generated: 3046
% % unit clauses generated to total clauses generated: 0.00
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 2		[1] = 1		
% Total = 3
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 3046	[2] = 62358645	[3] = 52649889	[4] = 41930740	[5] = 20197086	[6] = 4700826	
% [7] = 305856	
% Average size of a generated clause: 4.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] eq_2		(+)1	(-)2
% [1] greek_3		(+)0	(-)0
% [2] latin_3		(+)0	(-)0
% 			------------------
% 		Total:	(+)1	(-)2
% Total number of unit clauses retained: 3
% Number of clauses skipped because of their length: 290163476
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 66554820
% Number of successful unifications: 182146088
% Number of unification failures: 108438951
% Number of unit to unit unification failures: 2
% N literal unification failure due to lookup root_id table: 209446510
% N base clause resolution failure due to lookup table: 371198188
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 20
% N unit clauses dropped because they exceeded max values: 1533
% 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: 2
% Max term depth in a unit clause: 1
% Number of states in UCFA table: 8
% 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.33
% Number of symbols (columns) in UCFA: 39
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 290585039
% ConstructUnitClause() = 1534
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: 607154
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 304 secs
% CPU time: 300.00 secs
% 
%------------------------------------------------------------------------------