TSTP Solution File: GRP123-2.003 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : GRP123-2.003 : TPTP v5.0.0. Released v1.2.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art04.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 20:50:50 EST 2010
% Result : Timeout 300.01s
% 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/SystemOnTPTP1803/GRP/GRP123-2.003+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 = 30] [nf = 0] [nu = 0] [ut = 15]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 178] [nf = 6] [nu = 88] [ut = 35]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 326] [nf = 12] [nu = 176] [ut = 35]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 1358] [nf = 42] [nu = 552] [ut = 35]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 2390] [nf = 72] [nu = 928] [ut = 35]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 3422] [nf = 102] [nu = 1304] [ut = 35]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 4454] [nf = 132] [nu = 1680] [ut = 35]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 5486] [nf = 162] [nu = 2056] [ut = 35]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 6518] [nf = 192] [nu = 2432] [ut = 35]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 7550] [nf = 222] [nu = 2808] [ut = 35]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 8582] [nf = 252] [nu = 3184] [ut = 35]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 9614] [nf = 282] [nu = 3560] [ut = 35]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 10646] [nf = 312] [nu = 3936] [ut = 35]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 11678] [nf = 342] [nu = 4312] [ut = 35]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 12710] [nf = 372] [nu = 4688] [ut = 35]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 13742] [nf = 402] [nu = 5064] [ut = 35]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 14774] [nf = 432] [nu = 5440] [ut = 35]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 15806] [nf = 462] [nu = 5816] [ut = 35]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 16838] [nf = 492] [nu = 6192] [ut = 35]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 17870] [nf = 522] [nu = 6568] [ut = 35]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 18902] [nf = 552] [nu = 6944] [ut = 35]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 19934] [nf = 582] [nu = 7320] [ut = 35]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 20966] [nf = 612] [nu = 7696] [ut = 35]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 21998] [nf = 642] [nu = 8072] [ut = 35]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 23030] [nf = 672] [nu = 8448] [ut = 35]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 24062] [nf = 702] [nu = 8824] [ut = 35]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 25094] [nf = 732] [nu = 9200] [ut = 35]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 26126] [nf = 762] [nu = 9576] [ut = 35]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 27158] [nf = 792] [nu = 9952] [ut = 35]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 28190] [nf = 822] [nu = 10328] [ut = 35]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 28220] [nf = 822] [nu = 10328] [ut = 35]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 28368] [nf = 828] [nu = 10416] [ut = 35]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 28522] [nf = 834] [nu = 10504] [ut = 35]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 30166] [nf = 866] [nu = 11191] [ut = 44]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 43497] [nf = 940] [nu = 17776] [ut = 44]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 248867] [nf = 1014] [nu = 101429] [ut = 50]
% Looking for a proof at depth = 7 ...
% t = 3 secs [nr = 1136093] [nf = 186532] [nu = 185218] [ut = 50]
% Looking for a proof at depth = 8 ...
% t = 184 secs [nr = 45590067] [nf = 420176] [nu = 17783179] [ut = 51]
% Looking for a proof at depth = 9 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 99928183
% resolvents: 88334185 factors: 11593998
% Number of unit clauses generated: 25138568
% % unit clauses generated to total clauses generated: 25.16
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 15 [2] = 20 [4] = 9 [6] = 6 [8] = 1
% Total = 51
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 25138568 [2] = 29542915 [3] = 31667236 [4] = 12238685 [5] = 928880 [6] = 411899
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] group_element_1 (+)3 (-)0
% [1] equalish_2 (+)4 (-)6
% [2] greater_2 (+)3 (-)2
% [3] next_2 (+)2 (-)3
% [4] product_3 (+)10 (-)18
% ------------------
% Total: (+)22 (-)29
% Total number of unit clauses retained: 51
% Number of clauses skipped because of their length: 140187574
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 5943248
% Number of successful unifications: 99928183
% Number of unification failures: 781838497
% Number of unit to unit unification failures: 216
% N literal unification failure due to lookup root_id table: 46996196
% N base clause resolution failure due to lookup table: 59679360
% N UC-BCL resolution dropped due to lookup table: 20078672
% Max entries in substitution set: 16
% N unit clauses dropped because they exceeded max values: 17592100
% 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: 3
% Max term depth in a unit clause: 1
% Number of states in UCFA table: 53
% Total number of terms of all unit clauses in table: 127
% 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.42
% Number of symbols (columns) in UCFA: 42
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 881766680
% ConstructUnitClause() = 17592136
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 18.12 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 333094
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------