TSTP Solution File: NLP031-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : NLP031-1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art09.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:44 EST 2010
% Result : Timeout 300.06s
% 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/SystemOnTPTP11881/NLP/NLP031-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 = 12] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 99] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 255] [nf = 4] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 646] [nf = 8] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 1207] [nf = 12] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 1772] [nf = 16] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 2339] [nf = 20] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 2906] [nf = 24] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 3473] [nf = 28] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 4040] [nf = 32] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 4607] [nf = 36] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 5174] [nf = 40] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 5741] [nf = 44] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 6308] [nf = 48] [nu = 0] [ut = 2]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 6875] [nf = 52] [nu = 0] [ut = 2]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 7442] [nf = 56] [nu = 0] [ut = 2]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 8009] [nf = 60] [nu = 0] [ut = 2]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 8576] [nf = 64] [nu = 0] [ut = 2]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 9143] [nf = 68] [nu = 0] [ut = 2]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 9710] [nf = 72] [nu = 0] [ut = 2]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 10277] [nf = 76] [nu = 0] [ut = 2]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 10844] [nf = 80] [nu = 0] [ut = 2]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 11411] [nf = 84] [nu = 0] [ut = 2]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 11978] [nf = 88] [nu = 0] [ut = 2]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 12545] [nf = 92] [nu = 0] [ut = 2]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 13112] [nf = 96] [nu = 0] [ut = 2]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 13679] [nf = 100] [nu = 0] [ut = 2]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 14246] [nf = 104] [nu = 0] [ut = 2]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 14813] [nf = 108] [nu = 0] [ut = 2]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 15380] [nf = 112] [nu = 0] [ut = 2]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 15392] [nf = 112] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 15479] [nf = 112] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 15673] [nf = 132] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 16589] [nf = 192] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 20486] [nf = 509] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 34501] [nf = 2357] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 95808] [nf = 9484] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 361603] [nf = 44556] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 4 secs [nr = 1496674] [nf = 191458] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 21 secs [nr = 7104458] [nf = 1109644] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% t = 129 secs [nr = 42472252]
% [nf = 8095261] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 117310357
% resolvents: 98321793 factors: 18988564
% 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] = 492 [3] = 233479 [4] = 3144341 [5] = 25795605 [6] = 52555747 [7] = 28854606
% [8] = 5941213 [9] = 758576 [10] = 25474 [11] = 824
% 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] 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] table_2 (+)0 (-)0
% [10] three_2 (+)0 (-)0
% [11] young_2 (+)0 (-)0
% [12] agent_3 (+)0 (-)0
% [13] at_3 (+)0 (-)0
% [14] member_3 (+)0 (-)0
% [15] ssSkP1_3 (+)0 (-)0
% [16] with_3 (+)0 (-)0
% [17] ssSkP0_4 (+)0 (-)0
% ------------------
% Total: (+)2 (-)0
% Total number of unit clauses retained: 2
% Number of clauses skipped because of their length: 1802736532
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 899362273
% Number of successful unifications: 117310357
% Number of unification failures: 29934898
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 777917075
% N base clause resolution failure due to lookup table: 485304436
% 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: 68
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 147245255
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 391035
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------