TSTP Solution File: GRP123-4.004 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : GRP123-4.004 : TPTP v5.0.0. Bugfixed v1.2.1.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sat Nov 27 20:53:10 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/SystemOnTPTP12595/GRP/GRP123-4.004+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 = 42] [nf = 0] [nu = 0] [ut = 17]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 282] [nf = 6] [nu = 156] [ut = 54]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 522] [nf = 12] [nu = 312] [ut = 54]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 2162] [nf = 42] [nu = 900] [ut = 54]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 3802] [nf = 72] [nu = 1488] [ut = 54]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 5442] [nf = 102] [nu = 2076] [ut = 54]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 7082] [nf = 132] [nu = 2664] [ut = 54]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 8722] [nf = 162] [nu = 3252] [ut = 54]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 10362] [nf = 192] [nu = 3840] [ut = 54]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 12002] [nf = 222] [nu = 4428] [ut = 54]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 13642] [nf = 252] [nu = 5016] [ut = 54]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 15282] [nf = 282] [nu = 5604] [ut = 54]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 16922] [nf = 312] [nu = 6192] [ut = 54]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 18562] [nf = 342] [nu = 6780] [ut = 54]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 20202] [nf = 372] [nu = 7368] [ut = 54]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 21842] [nf = 402] [nu = 7956] [ut = 54]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 23482] [nf = 432] [nu = 8544] [ut = 54]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 25122] [nf = 462] [nu = 9132] [ut = 54]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 26762] [nf = 492] [nu = 9720] [ut = 54]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 28402] [nf = 522] [nu = 10308] [ut = 54]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 30042] [nf = 552] [nu = 10896] [ut = 54]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 31682] [nf = 582] [nu = 11484] [ut = 54]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 33322] [nf = 612] [nu = 12072] [ut = 54]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 34962] [nf = 642] [nu = 12660] [ut = 54]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 36602] [nf = 672] [nu = 13248] [ut = 54]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 38242] [nf = 702] [nu = 13836] [ut = 54]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 39882] [nf = 732] [nu = 14424] [ut = 54]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 41522] [nf = 762] [nu = 15012] [ut = 54]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 43162] [nf = 792] [nu = 15600] [ut = 54]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 44802] [nf = 822] [nu = 16188] [ut = 54]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 44844] [nf = 822] [nu = 16188] [ut = 54]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 45084] [nf = 828] [nu = 16344] [ut = 54]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 45324] [nf = 834] [nu = 16500] [ut = 54]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 46988] [nf = 864] [nu = 17088] [ut = 54]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 53051] [nf = 900] [nu = 18924] [ut = 58]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 105734] [nf = 1080] [nu = 25584] [ut = 58]
% Looking for a proof at depth = 7 ...
% t = 29 secs [nr = 3627919] [nf = 1260] [nu = 996372] [ut = 62]
% Looking for a proof at depth = 8 ...
% t = 92 secs [nr = 23411400] [nf = 4118308] [nu = 2024472] [ut = 62]
% Looking for a proof at depth = 9 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 59762343
% resolvents: 55482436 factors: 4279907
% Number of unit clauses generated: 7813470
% % unit clauses generated to total clauses generated: 13.07
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 17 [2] = 37 [5] = 4 [7] = 4
% Total = 62
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 7813470 [2] = 17561890 [3] = 21356402 [4] = 11935302 [5] = 817419 [6] = 191178
% [7] = 84330 [8] = 2352
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] group_element_1 (+)4 (-)0
% [1] equalish_2 (+)5 (-)12
% [2] product_3 (+)5 (-)36
% ------------------
% Total: (+)14 (-)48
% Total number of unit clauses retained: 62
% Number of clauses skipped because of their length: 114842915
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 1176888
% Number of successful unifications: 59762343
% Number of unification failures: 1207536970
% Number of unit to unit unification failures: 240
% N literal unification failure due to lookup root_id table: 13810193
% N base clause resolution failure due to lookup table: 6250404
% N UC-BCL resolution dropped due to lookup table: 56615120
% Max entries in substitution set: 12
% N unit clauses dropped because they exceeded max values: 6723291
% 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: 47
% Total number of terms of all unit clauses in table: 161
% 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.29
% Number of symbols (columns) in UCFA: 41
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 1267299313
% ConstructUnitClause() = 6723336
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 7.55 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 199208
% | |
% --------------------------------------------------------
% Elapsed time: 304 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------