TSTP Solution File: NLP033-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : NLP033-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 02:07:11 EST 2010
% Result : Timeout 300.05s
% 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/SystemOnTPTP16006/NLP/NLP033-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 = 82] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 207] [nf = 8] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 565] [nf = 16] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 1131] [nf = 24] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 1697] [nf = 32] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 2263] [nf = 40] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 2829] [nf = 48] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 3395] [nf = 56] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 3961] [nf = 64] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 4527] [nf = 72] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 5093] [nf = 80] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 5659] [nf = 88] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 6225] [nf = 96] [nu = 0] [ut = 2]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 6791] [nf = 104] [nu = 0] [ut = 2]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 7357] [nf = 112] [nu = 0] [ut = 2]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 7923] [nf = 120] [nu = 0] [ut = 2]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 8489] [nf = 128] [nu = 0] [ut = 2]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 9055] [nf = 136] [nu = 0] [ut = 2]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 9621] [nf = 144] [nu = 0] [ut = 2]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 10187] [nf = 152] [nu = 0] [ut = 2]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 10753] [nf = 160] [nu = 0] [ut = 2]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 11319] [nf = 168] [nu = 0] [ut = 2]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 11885] [nf = 176] [nu = 0] [ut = 2]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 12451] [nf = 184] [nu = 0] [ut = 2]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 13017] [nf = 192] [nu = 0] [ut = 2]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 13583] [nf = 200] [nu = 0] [ut = 2]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 14149] [nf = 208] [nu = 0] [ut = 2]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 14715] [nf = 216] [nu = 0] [ut = 2]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 15281] [nf = 224] [nu = 0] [ut = 2]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 15287] [nf = 224] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 15363] [nf = 224] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 15537] [nf = 252] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 16451] [nf = 320] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 20769] [nf = 854] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 37063] [nf = 3502] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 118991] [nf = 14043] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 456502] [nf = 64829] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 6 secs [nr = 2054713] [nf = 289873] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 31 secs [nr = 10521206] [nf = 1785312] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% t = 198 secs [
% nr = 66884930] [nf = 14550321] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 126299242
% resolvents: 103198940 factors: 23100302
% 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] = 726 [3] = 419300 [4] = 5003129 [5] = 32201960 [6] = 46914536 [7] = 34129349
% [8] = 7025153 [9] = 580106 [10] = 24983
% 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: 1768636301
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 635646547
% Number of successful unifications: 126299242
% Number of unification failures: 31616044
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 755099066
% N base clause resolution failure due to lookup table: 442063494
% 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() = 157915286
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 420997
% | |
% --------------------------------------------------------
% Elapsed time: 302 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------