TSTP Solution File: NLP029-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : NLP029-1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art07.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:06:21 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/SystemOnTPTP7167/NLP/NLP029-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 = 6] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 132] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 333] [nf = 6] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 875] [nf = 12] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 1611] [nf = 18] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 2349] [nf = 24] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 3087] [nf = 30] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 3825] [nf = 36] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 4563] [nf = 42] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 5301] [nf = 48] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 6039] [nf = 54] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 6777] [nf = 60] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 7515] [nf = 66] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 8253] [nf = 72] [nu = 0] [ut = 2]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 8991] [nf = 78] [nu = 0] [ut = 2]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 9729] [nf = 84] [nu = 0] [ut = 2]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 10467] [nf = 90] [nu = 0] [ut = 2]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 11205] [nf = 96] [nu = 0] [ut = 2]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 11943] [nf = 102] [nu = 0] [ut = 2]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 12681] [nf = 108] [nu = 0] [ut = 2]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 13419] [nf = 114] [nu = 0] [ut = 2]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 14157] [nf = 120] [nu = 0] [ut = 2]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 14895] [nf = 126] [nu = 0] [ut = 2]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 15633] [nf = 132] [nu = 0] [ut = 2]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 16371] [nf = 138] [nu = 0] [ut = 2]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 17109] [nf = 144] [nu = 0] [ut = 2]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 17847] [nf = 150] [nu = 0] [ut = 2]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 18585] [nf = 156] [nu = 0] [ut = 2]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 19323] [nf = 162] [nu = 0] [ut = 2]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 20061] [nf = 168] [nu = 0] [ut = 2]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 20067] [nf = 168] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 20193] [nf = 168] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 20443] [nf = 193] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 22046] [nf = 271] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 30127] [nf = 917] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 58001] [nf = 4170] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 232118] [nf = 18969] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 3 secs [nr = 1043278] [nf = 100463] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 13 secs [nr = 4485080] [nf = 414457] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 67 secs [nr = 21560917] [nf = 2525828] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 109180488
% resolvents: 92976214 factors: 16204274
% 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] = 652 [3] = 179819 [4] = 3711226 [5] = 37740308 [6] = 45139746 [7] = 18830352
% [8] = 3463844 [9] = 111925 [10] = 2609 [11] = 7
% 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] event_2 (+)0 (-)0
% [3] group_2 (+)0 (-)0
% [4] guy_2 (+)0 (-)0
% [5] hamburger_2 (+)0 (-)0
% [6] present_2 (+)0 (-)0
% [7] sit_2 (+)0 (-)0
% [8] ssSkP2_2 (+)0 (-)0
% [9] ssSkP3_2 (+)0 (-)0
% [10] table_2 (+)0 (-)0
% [11] three_2 (+)0 (-)0
% [12] young_2 (+)0 (-)0
% [13] agent_3 (+)0 (-)0
% [14] at_3 (+)0 (-)0
% [15] member_3 (+)0 (-)0
% [16] ssSkP1_3 (+)0 (-)0
% [17] with_3 (+)0 (-)0
% [18] ssSkP0_4 (+)0 (-)0
% ------------------
% Total: (+)2 (-)0
% Total number of unit clauses retained: 2
% Number of clauses skipped because of their length: 2127175128
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 729522264
% Number of successful unifications: 109180488
% Number of unification failures: 20141393
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 796756754
% N base clause resolution failure due to lookup table: 525831380
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 36
% 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: 71
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 129321881
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 363935
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------