TSTP Solution File: GRP127-1.004 by CARINE---0.734

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CARINE---0.734
% Problem  : GRP127-1.004 : TPTP v5.0.0. Released v1.2.0.
% Transfm  : add_equality
% Format   : carine
% Command  : carine %s t=%d xo=off uct=32000

% Computer : art05.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 21:12:14 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/SystemOnTPTP8168/GRP/GRP127-1.004+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 = 42] [nf = 0] [nu = 0] [ut = 17]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 286] [nf = 8] [nu = 158] [ut = 54]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 668] [nf = 324] [nu = 316] [ut = 54]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 2606] [nf = 640] [nu = 1490] [ut = 54]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 6296] [nf = 3700] [nu = 2664] [ut = 54]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 24826] [nf = 6760] [nu = 13158] [ut = 54]
% Looking for a proof at depth = 7 ...
% 	t = 0 secs [nr = 60588] [nf = 35004] [nu = 23652] [ut = 54]
% Looking for a proof at depth = 8 ...
% 	t = 1 secs [nr = 237094] [nf = 63248] [nu = 122690] [ut = 54]
% Looking for a proof at depth = 9 ...
% 	t = 2 secs [nr = 575984] [nf = 321876] [nu = 221728] [ut = 54]
% Looking for a proof at depth = 10 ...
% 	t = 6 secs [nr = 2272418] [nf = 580504] [nu = 1175222] [ut = 54]
% Looking for a proof at depth = 11 ...
% 	t = 15 secs [nr = 5514260] [nf = 3021556] [nu = 2128716] [ut = 54]
% Looking for a proof at depth = 12 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% 	t = 32 secs [nr = 11543939] [nf = 3810334] [nu = 5622339] [ut = 54]
% Looking for a proof at depth = 2 ...
% 	t = 32 secs [nr = 11544219] [nf = 3810342] [nu = 5622497] [ut = 54]
% Looking for a proof at depth = 3 ...
% 	t = 32 secs [nr = 11544611] [nf = 3810682] [nu = 5622655] [ut = 54]
% Looking for a proof at depth = 4 ...
% 	t = 32 secs [nr = 11549621] [nf = 3811022] [nu = 5625377] [ut = 54]
% Looking for a proof at depth = 5 ...
% 	t = 32 secs [nr = 11564339] [nf = 3824176] [nu = 5629683] [ut = 58]
% Looking for a proof at depth = 6 ...
% 	t = 36 secs [nr = 13113081] [nf = 3849538] [nu = 6617469] [ut = 62]
% Looking for a proof at depth = 7 ...
% 	t = 60 secs [nr = 17849523] [nf = 6448004] [nu = 8115015] [ut = 62]
% Looking for a proof at depth = 8 ...
% TIME IS UP!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 102333939
% 	resolvents: 94940232	factors: 7393707
% Number of unit clauses generated: 57195801
% % unit clauses generated to total clauses generated: 55.89
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 17	[2] = 37	[5] = 4		[6] = 4		
% Total = 62
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 57195801	[2] = 33625061	[3] = 10381264	[4] = 1056630	[5] = 72220	[6] = 2899	
% [7] = 64	
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] group_element_1	(+)4	(-)0
% [1] equalish_2		(+)5	(-)12
% [2] product_3		(+)5	(-)36
% 			------------------
% 		Total:	(+)14	(-)48
% Total number of unit clauses retained: 62
% Number of clauses skipped because of their length: 139799017
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 0
% Number of successful unifications: 102333939
% Number of unification failures: 530937034
% Number of unit to unit unification failures: 240
% N literal unification failure due to lookup root_id table: 35882226
% N base clause resolution failure due to lookup table: 2842624
% N UC-BCL resolution dropped due to lookup table: 3468152
% Max entries in substitution set: 29
% N unit clauses dropped because they exceeded max values: 54341556
% 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: 1
% Number of states in UCFA table: 47
% Total number of terms of all unit clauses in table: 161
% 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.29
% Number of symbols (columns) in UCFA: 41
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 633270973
% ConstructUnitClause() = 54341601
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 58.08 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: 341113
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
% 
%------------------------------------------------------------------------------