TSTP Solution File: NLP103-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : NLP103-1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art06.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:30:05 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/SystemOnTPTP8275/NLP/NLP103-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 = 1 secs [nr = 18] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 36] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 54] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 76] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 98] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 120] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 142] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 164] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 186] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 208] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 234] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 260] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 286] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 312] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 338] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 404] [nf = 18] [nu = 0] [ut = 2]
% Looking for a proof at depth = 17 ...
% t = 1 secs [nr = 470] [nf = 36] [nu = 0] [ut = 2]
% Looking for a proof at depth = 18 ...
% t = 1 secs [nr = 536] [nf = 54] [nu = 0] [ut = 2]
% Looking for a proof at depth = 19 ...
% t = 1 secs [nr = 602] [nf = 72] [nu = 0] [ut = 2]
% Looking for a proof at depth = 20 ...
% t = 1 secs [nr = 668] [nf = 90] [nu = 0] [ut = 2]
% Looking for a proof at depth = 21 ...
% t = 1 secs [nr = 734] [nf = 108] [nu = 0] [ut = 2]
% Looking for a proof at depth = 22 ...
% t = 1 secs [nr = 800] [nf = 126] [nu = 0] [ut = 2]
% Looking for a proof at depth = 23 ...
% t = 1 secs [nr = 866] [nf = 144] [nu = 0] [ut = 2]
% Looking for a proof at depth = 24 ...
% t = 1 secs [nr = 932] [nf = 162] [nu = 0] [ut = 2]
% Looking for a proof at depth = 25 ...
% t = 1 secs [nr = 998] [nf = 180] [nu = 0] [ut = 2]
% Looking for a proof at depth = 26 ...
% t = 1 secs [nr = 1064] [nf = 198] [nu = 0] [ut = 2]
% Looking for a proof at depth = 27 ...
% t = 1 secs [nr = 1130] [nf = 216] [nu = 0] [ut = 2]
% Looking for a proof at depth = 28 ...
% t = 1 secs [nr = 1196] [nf = 234] [nu = 0] [ut = 2]
% Looking for a proof at depth = 29 ...
% t = 1 secs [nr = 1262] [nf = 252] [nu = 0] [ut = 2]
% Looking for a proof at depth = 30 ...
% t = 1 secs [nr = 1328] [nf = 270] [nu = 0] [ut = 2]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 1 secs [nr = 1346] [nf = 270] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 1364] [nf = 270] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 1515] [nf = 270] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 1698] [nf = 278] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 2171] [nf = 306] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 3422] [nf = 370] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 11819] [nf = 1376] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 53372] [nf = 6400] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 280264] [nf = 28342] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 4 secs [nr = 1967735] [nf = 226068] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% t = 29 secs [nr = 15184088] [nf = 2146786] [nu = 0] [ut = 2]
% Looking for a proof
% at depth = 12 ...
% t = 114 secs [nr = 52802443] [nf = 8378868] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 155660651
% resolvents: 127739133 factors: 27921518
% 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] = 6198 [3] = 277138 [4] = 4112031 [5] = 28489836 [6] = 45638871 [7] = 47807430
% [8] = 24008567 [9] = 5005522 [10] = 267362 [11] = 40198 [12] = 6404 [13] = 146
% [14] = 78 [15] = 540 [16] = 330
% 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] coffee_2 (+)0 (-)0
% [3] customer_2 (+)0 (-)0
% [4] drink_2 (+)0 (-)0
% [5] event_2 (+)0 (-)0
% [6] human_person_2 (+)0 (-)0
% [7] nonreflexive_2 (+)0 (-)0
% [8] past_2 (+)0 (-)0
% [9] restaurant_2 (+)0 (-)0
% [10] see_2 (+)0 (-)0
% [11] agent_3 (+)0 (-)0
% [12] in_3 (+)0 (-)0
% [13] patient_3 (+)0 (-)0
% ------------------
% Total: (+)2 (-)0
% Total number of unit clauses retained: 2
% Number of clauses skipped because of their length: 1522700157
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 632061013
% Number of successful unifications: 155660651
% Number of unification failures: 31187927
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 1902539873
% N base clause resolution failure due to lookup table: 506645985
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 9
% 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: 62
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 186848578
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 518869
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------