TSTP Solution File: GRP124-2.005 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : GRP124-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 : art03.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:56:36 EST 2010
% Result : Timeout 300.06s
% 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/SystemOnTPTP2779/GRP/GRP124-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 = 2733] [nf = 42] [nu = 942] [ut = 105]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 4529] [nf = 72] [nu = 1352] [ut = 105]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 6325] [nf = 102] [nu = 1762] [ut = 105]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 8121] [nf = 132] [nu = 2172] [ut = 105]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 9917] [nf = 162] [nu = 2582] [ut = 105]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 11713] [nf = 192] [nu = 2992] [ut = 105]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 13509] [nf = 222] [nu = 3402] [ut = 105]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 15305] [nf = 252] [nu = 3812] [ut = 105]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 17101] [nf = 282] [nu = 4222] [ut = 105]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 18897] [nf = 312] [nu = 4632] [ut = 105]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 20693] [nf = 342] [nu = 5042] [ut = 105]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 22489] [nf = 372] [nu = 5452] [ut = 105]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 24285] [nf = 402] [nu = 5862] [ut = 105]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 26081] [nf = 432] [nu = 6272] [ut = 105]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 27877] [nf = 462] [nu = 6682] [ut = 105]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 29673] [nf = 492] [nu = 7092] [ut = 105]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 31469] [nf = 522] [nu = 7502] [ut = 105]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 33265] [nf = 552] [nu = 7912] [ut = 105]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 35061] [nf = 582] [nu = 8322] [ut = 105]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 36857] [nf = 612] [nu = 8732] [ut = 105]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 38653] [nf = 642] [nu = 9142] [ut = 105]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 40449] [nf = 672] [nu = 9552] [ut = 105]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 42245] [nf = 702] [nu = 9962] [ut = 105]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 44041] [nf = 732] [nu = 10372] [ut = 105]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 45837] [nf = 762] [nu = 10782] [ut = 105]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 47633] [nf = 792] [nu = 11192] [ut = 105]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 49429] [nf = 822] [nu = 11602] [ut = 105]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 49510] [nf = 822] [nu = 11602] [ut = 105]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 49938] [nf = 828] [nu = 11868] [ut = 105]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 50366] [nf = 834] [nu = 12134] [ut = 105]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 52162] [nf = 864] [nu = 12544] [ut = 105]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 53968] [nf = 894] [nu = 12954] [ut = 105]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 63883] [nf = 926] [nu = 16188] [ut = 111]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 151253] [nf = 1028] [nu = 24204] [ut = 111]
% Looking for a proof at depth = 8 ...
% t = 189 secs [nr = 12400647] [nf = 1130] [nu = 3518172] [ut = 123]
% Looking for a pr
% oof at depth = 9 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 45862430
% resolvents: 40650546 factors: 5211884
% Number of unit clauses generated: 4862056
% % unit clauses generated to total clauses generated: 10.60
% 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] = 4862056 [2] = 8400023 [3] = 18483876 [4] = 13464463 [5] = 436274 [6] = 134967
% [7] = 61164 [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: 65551127
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 3442389
% Number of successful unifications: 45862430
% Number of unification failures: 1244854007
% Number of unit to unit unification failures: 617
% N literal unification failure due to lookup root_id table: 20672121
% N base clause resolution failure due to lookup table: 8989378
% N UC-BCL resolution dropped due to lookup table: 101419339
% Max entries in substitution set: 11
% N unit clauses dropped because they exceeded max values: 3489329
% 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() = 1290716437
% ConstructUnitClause() = 3489412
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 3.48 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 152875
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------