TSTP Solution File: GRP127-2.005 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : GRP127-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 : 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 21:14:20 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/SystemOnTPTP15680/GRP/GRP127-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 = 513] [nf = 8] [nu = 268] [ut = 105]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 1174] [nf = 502] [nu = 536] [ut = 105]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 4370] [nf = 996] [nu = 2448] [ut = 105]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 10373] [nf = 5842] [nu = 4360] [ut = 105]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 40395] [nf = 10688] [nu = 21308] [ut = 105]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 97878] [nf = 55418] [nu = 38256] [ut = 105]
% Looking for a proof at depth = 8 ...
% t = 2 secs [nr = 382895] [nf = 100148] [nu = 197992] [ut = 105]
% Looking for a proof at depth = 9 ...
% t = 3 secs [nr = 925708] [nf = 508154] [nu = 357728] [ut = 105]
% Looking for a proof at depth = 10 ...
% t = 11 secs [nr = 3661445] [nf = 916160] [nu = 1894396] [ut = 105]
% Looking for a proof at depth = 11 ...
% t = 26 secs [nr = 8843560] [nf = 4755428] [nu = 3431064] [ut = 105]
% Looking for a proof at depth = 12 ...
% t = 101 secs [nr = 35419945] [nf = 8594696] [nu = 18419004] [ut = 105]
% Looking for a proof at depth = 13 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% t = 123 secs [nr = 42790996] [nf = 14017848] [nu = 20701940] [ut = 105]
% Looking for a proof at depth = 2 ...
% t = 123 secs [nr = 42791491] [nf = 14017856] [nu = 20702208] [ut = 105]
% Looking for a proof at depth = 3 ...
% t = 123 secs [nr = 42792163] [nf = 14018374] [nu = 20702476] [ut = 105]
% Looking for a proof at depth = 4 ...
% t = 123 secs [nr = 42800416] [nf = 14018892] [nu = 20706920] [ut = 105]
% Looking for a proof at depth = 5 ...
% t = 123 secs [nr = 42818010] [nf = 14037702] [nu = 20711364] [ut = 105]
% Looking for a proof at depth = 6 ...
% t = 124 secs [nr = 43332070] [nf = 14058360] [nu = 20968620] [ut = 118]
% Looking for a proof at depth = 7 ...
% t = 141 secs [nr = 48359344] [nf = 18013933] [nu = 22499210] [ut = 118]
% Looking for a proof at depth = 8 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 110136947
% resolvents: 91529126 factors: 18607821
% Number of unit clauses generated: 50241436
% % unit clauses generated to total clauses generated: 45.62
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 40 [2] = 65 [6] = 13
% Total = 118
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 50241436 [2] = 42711530 [3] = 16148859 [4] = 963756 [5] = 62168 [6] = 8543
% [7] = 610 [8] = 45
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] group_element_1 (+)5 (-)0
% [1] equalish_2 (+)6 (-)20
% [2] greater_2 (+)10 (-)1
% [3] next_2 (+)4 (-)0
% [4] product_3 (+)7 (-)65
% ------------------
% Total: (+)32 (-)86
% Total number of unit clauses retained: 118
% Number of clauses skipped because of their length: 154654397
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 118942
% Number of successful unifications: 110136947
% Number of unification failures: 472050251
% Number of unit to unit unification failures: 585
% N literal unification failure due to lookup root_id table: 131400124
% N base clause resolution failure due to lookup table: 10505703
% N UC-BCL resolution dropped due to lookup table: 72498
% Max entries in substitution set: 32
% N unit clauses dropped because they exceeded max values: 42714266
% 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: 74
% Total number of terms of all unit clauses in table: 303
% 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() = 582187198
% ConstructUnitClause() = 42714344
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 47.16 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 367123
% | |
% --------------------------------------------------------
% Elapsed time: 304 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------