TSTP Solution File: NLP026-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : NLP026-1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Nov 28 02:06:47 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/SystemOnTPTP18395/NLP/NLP026-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 = 126] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 294] [nf = 8] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 800] [nf = 16] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 1542] [nf = 24] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 2284] [nf = 32] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 3026] [nf = 40] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 3768] [nf = 48] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 4510] [nf = 56] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 5252] [nf = 64] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 5994] [nf = 72] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 6736] [nf = 80] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 7478] [nf = 88] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 8220] [nf = 96] [nu = 0] [ut = 2]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 8962] [nf = 104] [nu = 0] [ut = 2]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 9704] [nf = 112] [nu = 0] [ut = 2]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 10446] [nf = 120] [nu = 0] [ut = 2]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 11188] [nf = 128] [nu = 0] [ut = 2]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 11930] [nf = 136] [nu = 0] [ut = 2]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 12672] [nf = 144] [nu = 0] [ut = 2]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 13414] [nf = 152] [nu = 0] [ut = 2]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 14156] [nf = 160] [nu = 0] [ut = 2]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 14898] [nf = 168] [nu = 0] [ut = 2]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 15640] [nf = 176] [nu = 0] [ut = 2]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 16382] [nf = 184] [nu = 0] [ut = 2]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 17124] [nf = 192] [nu = 0] [ut = 2]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 17866] [nf = 200] [nu = 0] [ut = 2]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 18608] [nf = 208] [nu = 0] [ut = 2]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 19350] [nf = 216] [nu = 0] [ut = 2]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 20092] [nf = 224] [nu = 0] [ut = 2]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 20098] [nf = 224] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 20218] [nf = 224] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 20444] [nf = 253] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 21972] [nf = 335] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 30026] [nf = 1101] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 59226] [nf = 4753] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 239433] [nf = 21124] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 4 secs [nr = 1082723] [nf = 114707] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 16 secs [nr = 4672590] [nf = 475728] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 83 secs [nr = 22436623] [nf = 2863638] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ..
% .
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 91746338
% resolvents: 77304397 factors: 14441941
% 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] = 260 [3] = 136684 [4] = 3149737 [5] = 33691785 [6] = 37957484 [7] = 14311764
% [8] = 2393791 [9] = 102865 [10] = 1966 [11] = 2
% 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] ssSkP3_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] ssSkP2_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: 1811004807
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 609471463
% Number of successful unifications: 91746338
% Number of unification failures: 15620120
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 652550331
% N base clause resolution failure due to lookup table: 442621661
% 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() = 107366458
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 305821
% | |
% --------------------------------------------------------
% Elapsed time: 304 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------