TSTP Solution File: NLP231-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : NLP231-1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : add_equality
% 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 03:01:56 EST 2010
% Result : GaveUp 1.36s
% 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/SystemOnTPTP20843/NLP/NLP231-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 = 1225] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 2730] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 4235] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 5740] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 7245] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 8750] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 10255] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 11760] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 13265] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 14770] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 16275] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 17780] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 19285] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 20790] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 22295] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 23800] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 25305] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 26810] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 28315] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 29820] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 31325] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 32830] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 34335] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 35840] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 37345] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 38850] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 40355] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 41860] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 43365] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 44870] [nf = 0] [nu = 0] [ut = 2]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 46095] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 47600] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 49121] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 50642] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 52163] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 53684] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 55205] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 56726] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 58247] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 59768] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 61289] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 62810] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 64331] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 65852] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 67373] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 68894] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 17 ...
% t = 1 secs [nr = 70415] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 18 ...
% t = 1 secs [nr = 71936] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 19 ...
% t = 1 secs [nr = 73457] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 20 ...
% t = 1 secs [nr = 74978] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 21 ...
% t = 1 secs [nr = 76499] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 22 ...
% t = 1 secs [nr = 78020] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 23 ...
% t = 1 secs [nr = 79541] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 24 ...
% t = 1 secs [nr = 81062] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 25 ...
% t = 1 secs [nr = 82583] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 26 ...
% t = 1 secs [nr = 84104] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 27 ...
% t = 1 secs [nr = 85625] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 28 ...
% t = 1 secs [nr = 87146] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 29 ...
% t = 1 secs [nr = 88667] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 30 ...
% t = 1 secs [nr = 90188] [nf = 0] [nu = 0] [ut = 2]
% GIVE UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 90188
% resolvents: 90188 factors: 0
% 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] = 73500 [3] = 16240 [4] = 448
% Average size of a generated clause: 3.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: 30936
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 560
% Number of successful unifications: 90188
% Number of unification failures: 0
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 15602892
% N base clause resolution failure due to lookup table: 6815148
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 0
% 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: 83
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 90188
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 90188
% | |
% --------------------------------------------------------
% Elapsed time: 1 secs
% CPU time: 1.35 secs
%
%------------------------------------------------------------------------------