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

View Problem - Process Solution

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

% Computer : art11.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory   : 2006MB
% OS       : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Nov 28 02:39:24 EST 2010

% Result   : Timeout 300.00s
% 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/SystemOnTPTP23946/NLP/NLP130-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 = 361] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 822] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 1587] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 2824] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 4381] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 5938] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% 	t = 0 secs [nr = 7495] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% 	t = 0 secs [nr = 9052] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% 	t = 0 secs [nr = 10609] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% 	t = 0 secs [nr = 12166] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% 	t = 0 secs [nr = 13723] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% 	t = 0 secs [nr = 15280] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% 	t = 0 secs [nr = 16837] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% 	t = 0 secs [nr = 18394] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 15 ...
% 	t = 0 secs [nr = 19951] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 16 ...
% 	t = 1 secs [nr = 21508] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 17 ...
% 	t = 1 secs [nr = 23065] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 18 ...
% 	t = 1 secs [nr = 24622] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 19 ...
% 	t = 1 secs [nr = 26179] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 20 ...
% 	t = 1 secs [nr = 27736] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 21 ...
% 	t = 1 secs [nr = 29297] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 22 ...
% 	t = 1 secs [nr = 30862] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 23 ...
% 	t = 1 secs [nr = 32427] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 24 ...
% 	t = 1 secs [nr = 33992] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 25 ...
% 	t = 1 secs [nr = 35557] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 26 ...
% 	t = 1 secs [nr = 37122] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 27 ...
% 	t = 1 secs [nr = 38687] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 28 ...
% 	t = 1 secs [nr = 40252] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 29 ...
% 	t = 1 secs [nr = 41817] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 30 ...
% 	t = 1 secs [nr = 43382] [nf = 0] [nu = 0] [ut = 2]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% 	t = 1 secs [nr = 43743] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% 	t = 1 secs [nr = 44204] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% 	t = 1 secs [nr = 44991] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% 	t = 1 secs [nr = 46353] [nf = 11] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% 	t = 1 secs [nr = 48946] [nf = 67] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% 	t = 1 secs [nr = 55497] [nf = 635] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% 	t = 1 secs [nr = 73667] [nf = 2398] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% 	t = 1 secs [nr = 119067] [nf = 8561] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% 	t = 2 secs [nr = 233294] [nf = 27525] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% 	t = 3 secs [nr = 633188] [nf = 100228] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% 	t = 10 secs [nr = 2110009] [nf = 370
% 140] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% 	t = 41 secs [nr = 8357405] [nf = 1726453] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% 	t = 195 secs [nr = 37599126] [nf = 9006328] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% TIME IS UP!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 72302792
% 	resolvents: 57473234	factors: 14829558
% 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] = 15523	[3] = 334930	[4] = 2616529	[5] = 9642739	[6] = 28467238	[7] = 22380217	
% [8] = 7596116	[9] = 1204736	[10] = 43872	[11] = 816	[21] = 40	[22] = 36	
% Average size of a generated clause: 7.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] ssSkC0		(+)0	(-)0
% [1] actual_world_1	(+)2	(-)0
% [2] barrel_2		(+)0	(-)0
% [3] chevy_2		(+)0	(-)0
% [4] city_2		(+)0	(-)0
% [5] dirty_2		(+)0	(-)0
% [6] event_2		(+)0	(-)0
% [7] fellow_2		(+)0	(-)0
% [8] frontseat_2		(+)0	(-)0
% [9] group_2		(+)0	(-)0
% [10] hollywood_placename_2	(+)0	(-)0
% [11] lonely_2		(+)0	(-)0
% [12] old_2		(+)0	(-)0
% [13] placename_2		(+)0	(-)0
% [14] present_2		(+)0	(-)0
% [15] ssSkP0_2		(+)0	(-)0
% [16] ssSkP1_2		(+)0	(-)0
% [17] state_2		(+)0	(-)0
% [18] street_2		(+)0	(-)0
% [19] two_2		(+)0	(-)0
% [20] white_2		(+)0	(-)0
% [21] young_2		(+)0	(-)0
% [22] agent_3		(+)0	(-)0
% [23] down_3		(+)0	(-)0
% [24] in_3		(+)0	(-)0
% [25] member_3		(+)0	(-)0
% [26] of_3		(+)0	(-)0
% [27] be_4		(+)0	(-)0
% 			------------------
% 		Total:	(+)2	(-)0
% Total number of unit clauses retained: 2
% Number of clauses skipped because of their length: 568394420
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 2005405531
% Number of successful unifications: 72302792
% Number of unification failures: 25180285
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 951203532
% N base clause resolution failure due to lookup table: 1272114382
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 26
% 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: 82
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 97483077
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: 241009
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
% 
%------------------------------------------------------------------------------