TSTP Solution File: KRS005-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : KRS005-1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art01.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 : Sat Nov 27 22:42:51 EST 2010
% Result : Timeout 300.02s
% 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/SystemOnTPTP1775/KRS/KRS005-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 = 9] [nf = 0] [nu = 8] [ut = 5]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 31] [nf = 3] [nu = 19] [ut = 8]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 71] [nf = 6] [nu = 42] [ut = 8]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 111] [nf = 9] [nu = 65] [ut = 8]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 151] [nf = 12] [nu = 88] [ut = 8]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 191] [nf = 15] [nu = 111] [ut = 8]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 231] [nf = 18] [nu = 134] [ut = 8]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 271] [nf = 21] [nu = 157] [ut = 8]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 311] [nf = 24] [nu = 180] [ut = 8]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 351] [nf = 27] [nu = 203] [ut = 8]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 391] [nf = 30] [nu = 226] [ut = 8]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 431] [nf = 33] [nu = 249] [ut = 8]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 471] [nf = 36] [nu = 272] [ut = 8]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 511] [nf = 39] [nu = 295] [ut = 8]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 551] [nf = 42] [nu = 318] [ut = 8]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 591] [nf = 45] [nu = 341] [ut = 8]
% Looking for a proof at depth = 17 ...
% t = 1 secs [nr = 631] [nf = 48] [nu = 364] [ut = 8]
% Looking for a proof at depth = 18 ...
% t = 1 secs [nr = 671] [nf = 51] [nu = 387] [ut = 8]
% Looking for a proof at depth = 19 ...
% t = 1 secs [nr = 711] [nf = 54] [nu = 410] [ut = 8]
% Looking for a proof at depth = 20 ...
% t = 1 secs [nr = 751] [nf = 57] [nu = 433] [ut = 8]
% Looking for a proof at depth = 21 ...
% t = 1 secs [nr = 791] [nf = 60] [nu = 456] [ut = 8]
% Looking for a proof at depth = 22 ...
% t = 1 secs [nr = 831] [nf = 63] [nu = 479] [ut = 8]
% Looking for a proof at depth = 23 ...
% t = 1 secs [nr = 871] [nf = 66] [nu = 502] [ut = 8]
% Looking for a proof at depth = 24 ...
% t = 1 secs [nr = 911] [nf = 69] [nu = 525] [ut = 8]
% Looking for a proof at depth = 25 ...
% t = 1 secs [nr = 951] [nf = 72] [nu = 548] [ut = 8]
% Looking for a proof at depth = 26 ...
% t = 1 secs [nr = 991] [nf = 75] [nu = 571] [ut = 8]
% Looking for a proof at depth = 27 ...
% t = 1 secs [nr = 1031] [nf = 78] [nu = 594] [ut = 8]
% Looking for a proof at depth = 28 ...
% t = 1 secs [nr = 1071] [nf = 81] [nu = 617] [ut = 8]
% Looking for a proof at depth = 29 ...
% t = 1 secs [nr = 1111] [nf = 84] [nu = 640] [ut = 8]
% Looking for a proof at depth = 30 ...
% t = 1 secs [nr = 1151] [nf = 87] [nu = 663] [ut = 8]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 1 secs [nr = 1160] [nf = 87] [nu = 671] [ut = 8]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 1182] [nf = 90] [nu = 682] [ut = 8]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 1222] [nf = 93] [nu = 705] [ut = 8]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 1262] [nf = 96] [nu = 728] [ut = 8]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 3558] [nf = 203] [nu = 751] [ut = 8]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 45574] [nf = 1531] [nu = 774] [ut = 8]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 409576] [nf = 22017] [nu = 797] [ut = 8]
% Looking for a proof at depth = 8 ...
% t = 6 secs [nr = 2909904] [nf = 210072] [nu = 820] [ut = 8]
% Looking for a proof at depth = 9 ...
% t = 41 secs [nr = 18480672] [nf = 1654344] [nu = 843] [ut = 8]
% Looking for a proof at depth = 10 ...
% t = 242 secs [nr = 103826900] [nf = 10479062] [nu = 866] [ut = 8]
% Looking for a proof at depth = 11 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 143931845
% resolvents: 130595569 factors: 13336276
% Number of unit clauses generated: 880
% % unit clauses generated to total clauses generated: 0.00
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 1 [1] = 4 [2] = 3
% Total = 8
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 880 [2] = 30041026 [3] = 60758294 [4] = 39788059 [5] = 11875483 [6] = 1220748
% [7] = 241917 [8] = 5438
% Average size of a generated clause: 4.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] e_1 (+)1 (-)0
% [1] equalish_2 (+)3 (-)1
% [2] r_2 (+)3 (-)0
% ------------------
% Total: (+)7 (-)1
% Total number of unit clauses retained: 8
% Number of clauses skipped because of their length: 122222466
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 52059027
% Number of successful unifications: 143931845
% Number of unification failures: 214853878
% Number of unit to unit unification failures: 3
% N literal unification failure due to lookup root_id table: 1541491730
% N base clause resolution failure due to lookup table: 343656524
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 11
% N unit clauses dropped because they exceeded max values: 39
% 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: 4
% Max term depth in a unit clause: 2
% Number of states in UCFA table: 23
% Total number of terms of all unit clauses in table: 26
% 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: 0.88
% Number of symbols (columns) in UCFA: 42
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 358785723
% ConstructUnitClause() = 46
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 479773
% | |
% --------------------------------------------------------
% Elapsed time: 304 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------