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

View Problem - Process Solution

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

% Computer : art06.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:17:25 EST 2010

% Result   : Timeout 300.06s
% 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/SystemOnTPTP7003/NLP/NLP064-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 = 16] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 84] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 246] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 666] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 1246] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 1834] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% 	t = 0 secs [nr = 2422] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% 	t = 0 secs [nr = 3010] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% 	t = 0 secs [nr = 3598] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% 	t = 0 secs [nr = 4186] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% 	t = 0 secs [nr = 4774] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% 	t = 0 secs [nr = 5362] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% 	t = 0 secs [nr = 5950] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% 	t = 0 secs [nr = 6538] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 15 ...
% 	t = 0 secs [nr = 7126] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 16 ...
% 	t = 0 secs [nr = 7714] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 17 ...
% 	t = 0 secs [nr = 8302] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 18 ...
% 	t = 0 secs [nr = 8890] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 19 ...
% 	t = 0 secs [nr = 9478] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 20 ...
% 	t = 0 secs [nr = 10066] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 21 ...
% 	t = 0 secs [nr = 10654] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 22 ...
% 	t = 0 secs [nr = 11242] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 23 ...
% 	t = 0 secs [nr = 11830] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 24 ...
% 	t = 0 secs [nr = 12418] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 25 ...
% 	t = 0 secs [nr = 13006] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 26 ...
% 	t = 0 secs [nr = 13594] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 27 ...
% 	t = 0 secs [nr = 14182] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 28 ...
% 	t = 0 secs [nr = 14770] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 29 ...
% 	t = 0 secs [nr = 15358] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 30 ...
% 	t = 0 secs [nr = 15946] [nf = 0] [nu = 0] [ut = 2]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% 	t = 0 secs [nr = 15962] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 16030] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 16247] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 16996] [nf = 29] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 19656] [nf = 189] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 29399] [nf = 1101] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% 	t = 0 secs [nr = 72424] [nf = 7157] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% 	t = 1 secs [nr = 247209] [nf = 34410] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% 	t = 2 secs [nr = 897917] [nf = 146484] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% 	t = 8 secs [nr = 3110264] [nf = 614502] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% 	t = 37 secs [nr = 13103101] [nf = 2319709] [nu = 0] [ut = 2]
% Looki
% ng for a proof at depth = 12 ...
% 	t = 270 secs [nr = 90069898] [nf = 15501516] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% TIME IS UP!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 118487631
% 	resolvents: 100342155	factors: 18145476
% 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:
% ------------------------------------------------
% [2] = 672	[3] = 801797	[4] = 6690098	[5] = 29442860	[6] = 54464776	[7] = 20650844	
% [8] = 5188562	[9] = 1155965	[10] = 88407	[11] = 3276	[12] = 365	[13] = 9	
% Average size of a generated clause: 6.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] ssSkC0		(+)0	(-)0
% [1] actual_world_1	(+)2	(-)0
% [2] cannon_2		(+)0	(-)0
% [3] event_2		(+)0	(-)0
% [4] fire_2		(+)0	(-)0
% [5] group_2		(+)0	(-)0
% [6] male_2		(+)0	(-)0
% [7] man_2		(+)0	(-)0
% [8] nonreflexive_2	(+)0	(-)0
% [9] present_2		(+)0	(-)0
% [10] shot_2		(+)0	(-)0
% [11] six_2		(+)0	(-)0
% [12] agent_3		(+)0	(-)0
% [13] from_loc_3		(+)0	(-)0
% [14] member_3		(+)0	(-)0
% [15] of_3		(+)0	(-)0
% [16] patient_3		(+)0	(-)0
% [17] ssSkP0_3		(+)0	(-)0
% [18] ssSkP1_3		(+)0	(-)0
% 			------------------
% 		Total:	(+)2	(-)0
% Total number of unit clauses retained: 2
% Number of clauses skipped because of their length: 2404407563
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 1356886021
% Number of successful unifications: 118487631
% Number of unification failures: 25593208
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 751948882
% N base clause resolution failure due to lookup table: 495800642
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 27
% 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: 1
% Max term depth in a unit clause: 1
% Number of states in UCFA table: 3
% Total number of terms of all unit clauses in table: 2
% 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.50
% Number of symbols (columns) in UCFA: 69
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 144080839
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: 394959
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 302 secs
% CPU time: 300.00 secs
% 
%------------------------------------------------------------------------------