TSTP Solution File: GRP124-3.005 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : GRP124-3.005 : TPTP v5.0.0. Released v1.2.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art02.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:57 EST 2010
% Result : Timeout 300.03s
% 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/SystemOnTPTP10337/GRP/GRP124-3.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 = 105] [nf = 0] [nu = 0] [ut = 47]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 571] [nf = 8] [nu = 256] [ut = 109]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 1037] [nf = 16] [nu = 512] [ut = 109]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 2871] [nf = 48] [nu = 912] [ut = 109]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 4705] [nf = 80] [nu = 1312] [ut = 109]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 6539] [nf = 112] [nu = 1712] [ut = 109]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 8373] [nf = 144] [nu = 2112] [ut = 109]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 10207] [nf = 176] [nu = 2512] [ut = 109]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 12041] [nf = 208] [nu = 2912] [ut = 109]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 13875] [nf = 240] [nu = 3312] [ut = 109]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 15709] [nf = 272] [nu = 3712] [ut = 109]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 17543] [nf = 304] [nu = 4112] [ut = 109]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 19377] [nf = 336] [nu = 4512] [ut = 109]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 21211] [nf = 368] [nu = 4912] [ut = 109]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 23045] [nf = 400] [nu = 5312] [ut = 109]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 24879] [nf = 432] [nu = 5712] [ut = 109]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 26713] [nf = 464] [nu = 6112] [ut = 109]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 28547] [nf = 496] [nu = 6512] [ut = 109]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 30381] [nf = 528] [nu = 6912] [ut = 109]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 32215] [nf = 560] [nu = 7312] [ut = 109]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 34049] [nf = 592] [nu = 7712] [ut = 109]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 35883] [nf = 624] [nu = 8112] [ut = 109]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 37717] [nf = 656] [nu = 8512] [ut = 109]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 39551] [nf = 688] [nu = 8912] [ut = 109]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 41385] [nf = 720] [nu = 9312] [ut = 109]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 43219] [nf = 752] [nu = 9712] [ut = 109]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 45053] [nf = 784] [nu = 10112] [ut = 109]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 46887] [nf = 816] [nu = 10512] [ut = 109]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 48721] [nf = 848] [nu = 10912] [ut = 109]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 50555] [nf = 880] [nu = 11312] [ut = 109]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 50660] [nf = 880] [nu = 11312] [ut = 109]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 51126] [nf = 888] [nu = 11568] [ut = 109]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 51624] [nf = 896] [nu = 11824] [ut = 109]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 54828] [nf = 1154] [nu = 12344] [ut = 114]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 75423] [nf = 1424] [nu = 14058] [ut = 123]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 104017] [nf = 1696] [nu = 18431] [ut = 128]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 210747] [nf = 1968] [nu = 30082] [ut = 129]
% Looking for a proof at depth = 8 ...
% t = 43 secs [nr = 3822105] [nf = 23504] [nu = 1277253] [ut = 133
% ]
% Looking for a proof at depth = 9 ...
% t = 126 secs [nr = 27504737] [nf = 5685576] [nu = 2524424] [ut = 133]
% Looking for a proof at depth = 10 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 53616025
% resolvents: 46786273 factors: 6829752
% Number of unit clauses generated: 6927537
% % unit clauses generated to total clauses generated: 12.92
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 47 [2] = 62 [4] = 5 [5] = 9 [6] = 5 [7] = 1
% [8] = 4
% Total = 133
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 6927537 [2] = 12706602 [3] = 16730378 [4] = 11523210 [5] = 4735055 [6] = 993243
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] group_element_1 (+)5 (-)0
% [1] cycle_2 (+)2 (-)13
% [2] equalish_2 (+)6 (-)20
% [3] greater_2 (+)15 (-)1
% [4] next_2 (+)5 (-)0
% [5] product_3 (+)6 (-)60
% ------------------
% Total: (+)39 (-)94
% Total number of unit clauses retained: 133
% Number of clauses skipped because of their length: 107374062
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 53616025
% Number of unification failures: 1175063182
% Number of unit to unit unification failures: 521
% N literal unification failure due to lookup root_id table: 23054748
% N base clause resolution failure due to lookup table: 22123342
% N UC-BCL resolution dropped due to lookup table: 85244999
% Max entries in substitution set: 12
% N unit clauses dropped because they exceeded max values: 5620386
% 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: 82
% Total number of terms of all unit clauses in table: 327
% 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.25
% Number of symbols (columns) in UCFA: 46
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 1228679207
% ConstructUnitClause() = 5620472
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 6.30 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 178720
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------