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

View Problem - Process Solution

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

% Computer : art04.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 : Sat Nov 27 22:43:38 EST 2010

% Result   : Timeout 300.04s
% 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/SystemOnTPTP18449/KRS/KRS010-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 = 9] [nf = 0] [nu = 5] [ut = 6]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 41] [nf = 0] [nu = 16] [ut = 9]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 121] [nf = 6] [nu = 36] [ut = 9]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 290] [nf = 26] [nu = 92] [ut = 9]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 606] [nf = 54] [nu = 148] [ut = 9]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 1295] [nf = 108] [nu = 234] [ut = 9]
% Looking for a proof at depth = 7 ...
% 	t = 0 secs [nr = 2926] [nf = 414] [nu = 440] [ut = 9]
% Looking for a proof at depth = 8 ...
% 	t = 0 secs [nr = 6037] [nf = 1594] [nu = 1144] [ut = 9]
% Looking for a proof at depth = 9 ...
% 	t = 0 secs [nr = 12344] [nf = 3030] [nu = 1872] [ut = 9]
% Looking for a proof at depth = 10 ...
% 	t = 0 secs [nr = 24399] [nf = 6274] [nu = 3080] [ut = 9]
% Looking for a proof at depth = 11 ...
% 	t = 1 secs [nr = 53918] [nf = 19058] [nu = 6304] [ut = 9]
% Looking for a proof at depth = 12 ...
% 	t = 1 secs [nr = 110889] [nf = 53078] [nu = 16668] [ut = 9]
% Looking for a proof at depth = 13 ...
% 	t = 1 secs [nr = 234440] [nf = 94738] [nu = 27968] [ut = 9]
% Looking for a proof at depth = 14 ...
% 	t = 2 secs [nr = 467151] [nf = 187566] [nu = 48988] [ut = 9]
% Looking for a proof at depth = 15 ...
% 	t = 4 secs [nr = 1042790] [nf = 502010] [nu = 109680] [ut = 9]
% Looking for a proof at depth = 16 ...
% 	t = 8 secs [nr = 2172389] [nf = 1244246] [nu = 288428] [ut = 9]
% Looking for a proof at depth = 17 ...
% 	t = 15 secs [nr = 4653884] [nf = 2196594] [nu = 495832] [ut = 9]
% Looking for a proof at depth = 18 ...
% 	t = 32 secs [nr = 9413491] [nf = 4384190] [nu = 916596] [ut = 9]
% Looking for a proof at depth = 19 ...
% 	t = 74 secs [nr = 21011898] [nf = 11221690] [nu = 2155232] [ut = 9]
% Looking for a proof at depth = 20 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% 	t = 122 secs [nr = 33689271] [nf = 19143929] [nu = 3901166] [ut = 12]
% Looking for a proof at depth = 2 ...
% 	t = 122 secs [nr = 33689318] [nf = 19143929] [nu = 3901183] [ut = 12]
% Looking for a proof at depth = 3 ...
% 	t = 122 secs [nr = 33689461] [nf = 19143936] [nu = 3901209] [ut = 12]
% Looking for a proof at depth = 4 ...
% 	t = 122 secs [nr = 33690058] [nf = 19143972] [nu = 3901271] [ut = 12]
% Looking for a proof at depth = 5 ...
% 	t = 122 secs [nr = 33694292] [nf = 19144235] [nu = 3901333] [ut = 12]
% Looking for a proof at depth = 6 ...
% 	t = 123 secs [nr = 33734763] [nf = 19146723] [nu = 3901533] [ut = 12]
% Looking for a proof at depth = 7 ...
% 	t = 124 secs [nr = 34359195] [nf = 19165665] [nu = 3910913] [ut = 12]
% Looking for a proof at depth = 8 ...
% 	t = 145 secs [nr = 42836453] [nf = 19522813] [nu = 4223179] [ut = 12]
% Looking for a proof at depth = 9 ...
% TIME IS UP!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 130214463
% 	resolvents: 107707567	factors: 22506896
% Number of unit clauses generated: 9167610
% % unit clauses generated to total clauses generated: 7.04
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 2		[1] = 7		[2] = 3		
% Total = 12
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 9167610	[2] = 54432419	[3] = 48712429	[4] = 12250374	[5] = 4549794	[6] = 935300	
% [7] = 151694	[8] = 14071	[9] = 772	
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] a_1		(+)3	(-)0
% [1] c_1		(+)0	(-)0
% [2] d_1		(+)0	(-)0
% [3] e_1		(+)1	(-)0
% [4] f_1		(+)0	(-)1
% [5] r3least_1		(+)1	(-)0
% [6] equalish_2		(+)0	(-)3
% [7] r_2		(+)3	(-)0
% 			------------------
% 		Total:	(+)8	(-)4
% Total number of unit clauses retained: 12
% Number of clauses skipped because of their length: 245917422
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 106708326
% Number of successful unifications: 130214463
% Number of unification failures: 150997497
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 561444382
% N base clause resolution failure due to lookup table: 769508722
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 16
% N unit clauses dropped because they exceeded max values: 7273744
% 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: 4
% Max term depth in a unit clause: 2
% Number of states in UCFA table: 23
% Total number of terms of all unit clauses in table: 30
% 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: 0.77
% Number of symbols (columns) in UCFA: 51
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 281211960
% ConstructUnitClause() = 7273754
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 7.44 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: 434048
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
% 
%------------------------------------------------------------------------------