## TSTP Solution File: NLP117-1 by CARINE---0.734

View Problem - Process Solution

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

% Computer : art02.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:31:45 EST 2010

% Result   : Timeout 300.02s
% Output   : None
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Command entered:
% /home/graph/tptp/Systems/CARINE---0.734/carine /tmp/SystemOnTPTP18412/NLP/NLP117-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 = 256] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 512] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 768] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 1024] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 1280] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 1536] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% 	t = 0 secs [nr = 1792] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% 	t = 0 secs [nr = 2048] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% 	t = 0 secs [nr = 2304] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% 	t = 0 secs [nr = 2560] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% 	t = 0 secs [nr = 2816] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% 	t = 0 secs [nr = 3072] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% 	t = 0 secs [nr = 3328] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% 	t = 0 secs [nr = 3584] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 15 ...
% 	t = 0 secs [nr = 3840] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 16 ...
% 	t = 0 secs [nr = 4096] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 17 ...
% 	t = 0 secs [nr = 4356] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 18 ...
% 	t = 0 secs [nr = 4616] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 19 ...
% 	t = 0 secs [nr = 4876] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 20 ...
% 	t = 0 secs [nr = 5136] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 21 ...
% 	t = 0 secs [nr = 5396] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 22 ...
% 	t = 0 secs [nr = 5656] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 23 ...
% 	t = 0 secs [nr = 5916] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 24 ...
% 	t = 0 secs [nr = 6176] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 25 ...
% 	t = 0 secs [nr = 6436] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 26 ...
% 	t = 0 secs [nr = 6696] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 27 ...
% 	t = 0 secs [nr = 6956] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 28 ...
% 	t = 0 secs [nr = 7216] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 29 ...
% 	t = 0 secs [nr = 7476] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 30 ...
% 	t = 0 secs [nr = 7736] [nf = 0] [nu = 0] [ut = 2]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% 	t = 0 secs [nr = 7992] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 8248] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 8504] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 8760] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 9016] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 9272] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% 	t = 0 secs [nr = 9528] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% 	t = 0 secs [nr = 9784] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% 	t = 0 secs [nr = 10040] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% 	t = 0 secs [nr = 10296] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% 	t = 0 secs [nr = 10552] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% 	t = 0 secs [nr = 10808
% ] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% 	t = 0 secs [nr = 11064] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% 	t = 0 secs [nr = 11320] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 15 ...
% 	t = 0 secs [nr = 11576] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 16 ...
% 	t = 0 secs [nr = 11836] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 17 ...
% 	t = 0 secs [nr = 12324] [nf = 64] [nu = 0] [ut = 2]
% Looking for a proof at depth = 18 ...
% 	t = 0 secs [nr = 28044] [nf = 5888] [nu = 0] [ut = 2]
% Looking for a proof at depth = 19 ...
% 	t = 2 secs [nr = 1111316] [nf = 520896] [nu = 0] [ut = 2]
% Looking for a proof at depth = 20 ...
% 	t = 162 secs [nr = 80942236] [nf = 40803904] [nu = 0] [ut = 2]
% Looking for a proof at depth = 21 ...
% TIME IS UP!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 230299929
% 	resolvents: 149913323	factors: 80386606
% 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] = 12800	[12] = 131040	[13] = 4063800	[14] = 24642806	[15] = 64516045	[16] = 82792769
% [17] = 47807165	[18] = 6333504
% Average size of a generated clause: -2.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] hollywood_placename_2	(+)0	(-)0
% [8] lonely_2		(+)0	(-)0
% [9] old_2		(+)0	(-)0
% [10] placename_2		(+)0	(-)0
% [11] present_2		(+)0	(-)0
% [12] street_2		(+)0	(-)0
% [13] white_2		(+)0	(-)0
% [14] agent_3		(+)0	(-)0
% [15] down_3		(+)0	(-)0
% [16] in_3		(+)0	(-)0
% [17] of_3		(+)0	(-)0
% 			------------------
% 		Total:	(+)2	(-)0
% Total number of unit clauses retained: 2
% Number of clauses skipped because of their length: 226637500
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 0
% Number of successful unifications: 230299929
% Number of unification failures: 49365071
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 3294542383
% N base clause resolution failure due to lookup table: 131811619
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 6
% 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: 64
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 279665000
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: 767666
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------
```