TSTP Solution File: GRP131-2.002 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : GRP131-2.002 : TPTP v5.0.0. Released v1.2.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art05.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 21:33:10 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/SystemOnTPTP9740/GRP/GRP131-2.002+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 = 8] [nf = 0] [nu = 0] [ut = 6]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 28] [nf = 6] [nu = 0] [ut = 6]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 64] [nf = 14] [nu = 0] [ut = 6]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 284] [nf = 46] [nu = 0] [ut = 6]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 662] [nf = 78] [nu = 0] [ut = 6]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 2074] [nf = 404] [nu = 0] [ut = 6]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 4534] [nf = 730] [nu = 0] [ut = 6]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 6994] [nf = 1056] [nu = 0] [ut = 6]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 9454] [nf = 1382] [nu = 0] [ut = 6]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 11914] [nf = 1708] [nu = 0] [ut = 6]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 14374] [nf = 2034] [nu = 0] [ut = 6]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 16834] [nf = 2360] [nu = 0] [ut = 6]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 19294] [nf = 2686] [nu = 0] [ut = 6]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 21754] [nf = 3012] [nu = 0] [ut = 6]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 24214] [nf = 3338] [nu = 0] [ut = 6]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 26674] [nf = 3664] [nu = 0] [ut = 6]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 29134] [nf = 3990] [nu = 0] [ut = 6]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 31594] [nf = 4316] [nu = 0] [ut = 6]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 34054] [nf = 4642] [nu = 0] [ut = 6]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 36514] [nf = 4968] [nu = 0] [ut = 6]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 38974] [nf = 5294] [nu = 0] [ut = 6]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 41434] [nf = 5620] [nu = 0] [ut = 6]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 43894] [nf = 5946] [nu = 0] [ut = 6]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 46354] [nf = 6272] [nu = 0] [ut = 6]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 48814] [nf = 6598] [nu = 0] [ut = 6]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 51274] [nf = 6924] [nu = 0] [ut = 6]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 53734] [nf = 7250] [nu = 0] [ut = 6]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 56194] [nf = 7576] [nu = 0] [ut = 6]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 58654] [nf = 7902] [nu = 0] [ut = 6]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 61114] [nf = 8228] [nu = 0] [ut = 6]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 61122] [nf = 8228] [nu = 0] [ut = 6]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 61142] [nf = 8234] [nu = 0] [ut = 6]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 61178] [nf = 8242] [nu = 0] [ut = 6]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 61466] [nf = 8302] [nu = 0] [ut = 6]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 63370] [nf = 8362] [nu = 0] [ut = 6]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 72759] [nf = 12003] [nu = 0] [ut = 6]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 189041] [nf = 22753] [nu = 0] [ut = 6]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 361199] [nf = 69227] [nu = 0] [ut = 6]
% Looking for a proof at depth = 9 ...
% t = 3 secs [nr = 1303991] [nf = 470797] [nu = 0] [ut = 6]
% Looking for a proof at depth = 10 ...
% t = 20 secs [nr = 10808465] [nf = 1038031] [nu = 0] [ut = 6]
% Looking for a proof at dept
% h = 11 ...
% t = 127 secs [nr = 55858387] [nf = 28078595] [nu = 0] [ut = 6]
% Looking for a proof at depth = 12 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 186658773
% resolvents: 149725306 factors: 36933467
% Number of unit clauses generated: 0
% % unit clauses generated to total clauses generated: 0.00
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 6
% Total = 6
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [2] = 39597385 [3] = 61598564 [4] = 42041068 [5] = 31165395 [6] = 10622397 [7] = 1633964
% Average size of a generated clause: 4.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] group_element_1 (+)2 (-)0
% [1] equalish_2 (+)0 (-)2
% [2] greater_2 (+)1 (-)0
% [3] next_2 (+)1 (-)0
% [4] product_3 (+)0 (-)0
% ------------------
% Total: (+)4 (-)2
% Total number of unit clauses retained: 6
% Number of clauses skipped because of their length: 624008399
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 15293140
% Number of successful unifications: 186658773
% Number of unification failures: 210374383
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 92780034
% N base clause resolution failure due to lookup table: 49977176
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 16
% N unit clauses dropped because they exceeded max values: 0
% 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: 2
% Max term depth in a unit clause: 1
% Number of states in UCFA table: 11
% Total number of terms of all unit clauses in table: 10
% 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: 1.10
% Number of symbols (columns) in UCFA: 41
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 397033156
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 622196
% | |
% --------------------------------------------------------
% Elapsed time: 304 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------