TSTP Solution File: GRP123-2.005 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : GRP123-2.005 : TPTP v5.0.0. Released v1.2.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art07.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:56 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/SystemOnTPTP3907/GRP/GRP123-2.005+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 = 81] [nf = 0] [nu = 0] [ut = 40]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 509] [nf = 6] [nu = 266] [ut = 105]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 937] [nf = 12] [nu = 532] [ut = 105]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 3453] [nf = 42] [nu = 1422] [ut = 105]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 5969] [nf = 72] [nu = 2312] [ut = 105]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 8485] [nf = 102] [nu = 3202] [ut = 105]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 11001] [nf = 132] [nu = 4092] [ut = 105]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 13517] [nf = 162] [nu = 4982] [ut = 105]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 16033] [nf = 192] [nu = 5872] [ut = 105]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 18549] [nf = 222] [nu = 6762] [ut = 105]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 21065] [nf = 252] [nu = 7652] [ut = 105]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 23581] [nf = 282] [nu = 8542] [ut = 105]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 26097] [nf = 312] [nu = 9432] [ut = 105]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 28613] [nf = 342] [nu = 10322] [ut = 105]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 31129] [nf = 372] [nu = 11212] [ut = 105]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 33645] [nf = 402] [nu = 12102] [ut = 105]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 36161] [nf = 432] [nu = 12992] [ut = 105]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 38677] [nf = 462] [nu = 13882] [ut = 105]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 41193] [nf = 492] [nu = 14772] [ut = 105]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 43709] [nf = 522] [nu = 15662] [ut = 105]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 46225] [nf = 552] [nu = 16552] [ut = 105]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 48741] [nf = 582] [nu = 17442] [ut = 105]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 51257] [nf = 612] [nu = 18332] [ut = 105]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 53773] [nf = 642] [nu = 19222] [ut = 105]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 56289] [nf = 672] [nu = 20112] [ut = 105]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 58805] [nf = 702] [nu = 21002] [ut = 105]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 61321] [nf = 732] [nu = 21892] [ut = 105]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 63837] [nf = 762] [nu = 22782] [ut = 105]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 66353] [nf = 792] [nu = 23672] [ut = 105]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 68869] [nf = 822] [nu = 24562] [ut = 105]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 68950] [nf = 822] [nu = 24562] [ut = 105]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 69378] [nf = 828] [nu = 24828] [ut = 105]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 69806] [nf = 834] [nu = 25094] [ut = 105]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 72322] [nf = 864] [nu = 25984] [ut = 105]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 74848] [nf = 894] [nu = 26874] [ut = 105]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 85483] [nf = 926] [nu = 30588] [ut = 111]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 175373] [nf = 1028] [nu = 40524] [ut = 111]
% Looking for a proof at depth = 8 ...
% t = 190 secs [nr = 12427287] [nf = 1130] [nu = 3536412] [ut = 123]
% Looking for a proof at depth = 9 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 45742797
% resolvents: 40562868 factors: 5179929
% Number of unit clauses generated: 4875032
% % unit clauses generated to total clauses generated: 10.66
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 40 [2] = 65 [6] = 6 [8] = 12
% Total = 123
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 4875032 [2] = 8390846 [3] = 18406834 [4] = 13421283 [5] = 436001 [6] = 132510
% [7] = 60684 [8] = 19607
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] group_element_1 (+)5 (-)0
% [1] equalish_2 (+)6 (-)20
% [2] greater_2 (+)10 (-)2
% [3] next_2 (+)4 (-)2
% [4] product_3 (+)7 (-)67
% ------------------
% Total: (+)32 (-)91
% Total number of unit clauses retained: 123
% Number of clauses skipped because of their length: 65434878
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 3432626
% Number of successful unifications: 45742797
% Number of unification failures: 1243500945
% Number of unit to unit unification failures: 617
% N literal unification failure due to lookup root_id table: 20582131
% N base clause resolution failure due to lookup table: 9003639
% N UC-BCL resolution dropped due to lookup table: 101314499
% Max entries in substitution set: 11
% N unit clauses dropped because they exceeded max values: 3490289
% 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: 77
% Total number of terms of all unit clauses in table: 315
% 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.24
% Number of symbols (columns) in UCFA: 44
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 1289243742
% ConstructUnitClause() = 3490372
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 3.79 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 152476
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------