TSTP Solution File: COM005-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : COM005-1 : TPTP v5.0.0. Released v2.7.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 18:04:37 EST 2010
% Result : Timeout 300.04s
% 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/SystemOnTPTP19171/COM/COM005-1+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 = 277] [nf = 0] [nu = 28] [ut = 24]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 1126] [nf = 0] [nu = 159] [ut = 44]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 8485] [nf = 6] [nu = 538] [ut = 44]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 60010] [nf = 232] [nu = 2173] [ut = 44]
% Looking for a proof at depth = 5 ...
% t = 2 secs [nr = 383387] [nf = 3866] [nu = 11812] [ut = 44]
% Looking for a proof at depth = 6 ...
% t = 11 secs [nr = 2295302] [nf = 19824] [nu = 72249] [ut = 44]
% Looking for a proof at depth = 7 ...
% t = 64 secs [nr = 13990267] [nf = 109442] [nu = 416302] [ut = 44]
% Looking for a proof at depth = 8 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% t = 122 secs [nr = 27187796] [nf = 247710] [nu = 738147] [ut = 44]
% Looking for a proof at depth = 2 ...
% t = 122 secs [nr = 27188645] [nf = 247710] [nu = 738278] [ut = 44]
% Looking for a proof at depth = 3 ...
% t = 122 secs [nr = 27196051] [nf = 247728] [nu = 738657] [ut = 44]
% Looking for a proof at depth = 4 ...
% t = 122 secs [nr = 27253909] [nf = 248116] [nu = 740292] [ut = 44]
% Looking for a proof at depth = 5 ...
% t = 125 secs [nr = 27772661] [nf = 253884] [nu = 750075] [ut = 44]
% Looking for a proof at depth = 6 ...
% t = 144 secs [nr = 33028109] [nf = 351944] [nu = 814356] [ut = 44]
% Looking for a proof at depth = 7 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 76993476
% resolvents: 75267233 factors: 1726243
% Number of unit clauses generated: 1219813
% % unit clauses generated to total clauses generated: 1.58
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 1 [1] = 23 [2] = 20
% Total = 44
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 1219813 [2] = 26365730 [3] = 30227269 [4] = 12674641 [5] = 5770786 [6] = 620357
% [7] = 114880
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] ap_1 (+)2 (-)2
% [1] aq_1 (+)1 (-)3
% [2] ar_1 (+)1 (-)3
% [3] p_1 (+)0 (-)0
% [4] pp_1 (+)0 (-)0
% [5] pqr1_1 (+)0 (-)3
% [6] pqr2_1 (+)0 (-)3
% [7] pqr3_1 (+)0 (-)3
% [8] pqr4_1 (+)0 (-)3
% [9] pr_1 (+)0 (-)0
% [10] q_1 (+)0 (-)0
% [11] qp_1 (+)0 (-)0
% [12] qq_1 (+)0 (-)0
% [13] qrp1_1 (+)0 (-)3
% [14] qrp2_1 (+)0 (-)3
% [15] qrp3_1 (+)0 (-)3
% [16] qrp4_1 (+)0 (-)3
% [17] r_1 (+)0 (-)0
% [18] rpq1_1 (+)0 (-)2
% [19] rpq2_1 (+)0 (-)2
% [20] rpq3_1 (+)0 (-)2
% [21] rpq4_1 (+)0 (-)2
% [22] rq_1 (+)0 (-)0
% [23] rr_1 (+)0 (-)0
% ------------------
% Total: (+)4 (-)40
% Total number of unit clauses retained: 44
% Number of clauses skipped because of their length: 217722961
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 95202456
% Number of successful unifications: 76993476
% Number of unification failures: 14806491
% Number of unit to unit unification failures: 10
% N literal unification failure due to lookup root_id table: 527043235
% N base clause resolution failure due to lookup table: 2460803976
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 8
% N unit clauses dropped because they exceeded max values: 1008489
% N unit clauses dropped because too much nesting: 101005
% 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: 4
% Max term depth in a unit clause: 4
% Number of states in UCFA table: 67
% Total number of terms of all unit clauses in table: 110
% 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.61
% Number of symbols (columns) in UCFA: 60
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 91799967
% ConstructUnitClause() = 1008532
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 1.16 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 256645
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------