TSTP Solution File: NLP221-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : NLP221-1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art01.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 03:00:51 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/SystemOnTPTP31235/NLP/NLP221-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 = 306] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 752] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 1198] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 1644] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 2090] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 2536] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 2982] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 3428] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 3874] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 4320] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 4766] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 5212] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 5658] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 6104] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 6550] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 6996] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 7442] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 7888] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 8348] [nf = 6] [nu = 0] [ut = 2]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 8830] [nf = 22] [nu = 0] [ut = 2]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 9312] [nf = 38] [nu = 0] [ut = 2]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 9820] [nf = 66] [nu = 0] [ut = 2]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 10362] [nf = 110] [nu = 0] [ut = 2]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 10904] [nf = 154] [nu = 0] [ut = 2]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 11446] [nf = 198] [nu = 0] [ut = 2]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 11988] [nf = 242] [nu = 0] [ut = 2]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 12530] [nf = 286] [nu = 0] [ut = 2]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 13072] [nf = 330] [nu = 0] [ut = 2]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 13614] [nf = 374] [nu = 0] [ut = 2]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 14156] [nf = 418] [nu = 0] [ut = 2]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 14462] [nf = 418] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 14908] [nf = 418] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 15370] [nf = 418] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 15832] [nf = 418] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 16294] [nf = 418] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 16756] [nf = 418] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 17218] [nf = 418] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 17680] [nf = 418] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 18142] [nf = 418] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 18604] [nf = 418] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 19066] [nf = 418] [nu = 0]
% [ut = 2]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 19528] [nf = 418] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 19990] [nf = 418] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 20452] [nf = 418] [nu = 0] [ut = 2]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 20914] [nf = 418] [nu = 0] [ut = 2]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 21376] [nf = 418] [nu = 0] [ut = 2]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 21838] [nf = 418] [nu = 0] [ut = 2]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 22302] [nf = 430] [nu = 0] [ut = 2]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 24213] [nf = 1254] [nu = 0] [ut = 2]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 167131] [nf = 60815] [nu = 0] [ut = 2]
% Looking for a proof at depth = 21 ...
% t = 25 secs [nr = 11882907] [nf = 5888855] [nu = 0] [ut = 2]
% Looking for a proof at depth = 22 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 221153701
% resolvents: 146629008 factors: 74524693
% 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] = 15640 [3] = 6868 [4] = 304 [14] = 491136 [15] = 9410784 [16] = 43268576
% [17] = 82723501 [18] = 67941736 [19] = 16305056 [20] = 973003 [21] = 16393 [22] = 556
% [23] = 148
% 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] accessible_world_2 (+)0 (-)0
% [3] event_2 (+)0 (-)0
% [4] forename_2 (+)0 (-)0
% [5] jules_forename_2 (+)0 (-)0
% [6] man_2 (+)0 (-)0
% [7] present_2 (+)0 (-)0
% [8] proposition_2 (+)0 (-)0
% [9] smoke_2 (+)0 (-)0
% [10] state_2 (+)0 (-)0
% [11] think_believe_consider_2 (+)0 (-)0
% [12] vincent_forename_2 (+)0 (-)0
% [13] agent_3 (+)0 (-)0
% [14] of_3 (+)0 (-)0
% [15] theme_3 (+)0 (-)0
% [16] be_4 (+)0 (-)0
% ------------------
% Total: (+)2 (-)0
% Total number of unit clauses retained: 2
% Number of clauses skipped because of their length: 243770848
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 280
% Number of successful unifications: 221153701
% Number of unification failures: 74091285
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 3596772351
% N base clause resolution failure due to lookup table: 117900061
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 9
% 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: 72
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 295244986
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 737179
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------