TSTP Solution File: HWV006-2 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : HWV006-2 : TPTP v5.0.0. Bugfixed v2.7.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 22:31:04 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/SystemOnTPTP23192/HWV/HWV006-2+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 = 112] [nf = 0] [nu = 58] [ut = 53]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 646] [nf = 0] [nu = 186] [ut = 75]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 3176] [nf = 21] [nu = 780] [ut = 130]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 16536] [nf = 306] [nu = 3283] [ut = 244]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 121523] [nf = 958] [nu = 28036] [ut = 407]
% Looking for a proof at depth = 6 ...
% t = 4 secs [nr = 565968] [nf = 5898] [nu = 125213] [ut = 407]
% Looking for a proof at depth = 7 ...
% t = 25 secs [nr = 2638856] [nf = 21187] [nu = 478742] [ut = 410]
% Looking for a proof at depth = 8 ...
% t = 100 secs [nr = 9762050] [nf = 120451] [nu = 1728318] [ut = 410]
% Looking for a proof at depth = 9 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% t = 122 secs [nr = 11800171] [nf = 147177] [nu = 2061610] [ut = 410]
% Looking for a proof at depth = 2 ...
% t = 122 secs [nr = 11800959] [nf = 147177] [nu = 2061854] [ut = 410]
% Looking for a proof at depth = 3 ...
% t = 122 secs [nr = 11805254] [nf = 147198] [nu = 2063782] [ut = 410]
% Looking for a proof at depth = 4 ...
% t = 122 secs [nr = 11820524] [nf = 147544] [nu = 2067203] [ut = 410]
% Looking for a proof at depth = 5 ...
% t = 123 secs [nr = 11933324] [nf = 148227] [nu = 2094193] [ut = 410]
% Looking for a proof at depth = 6 ...
% t = 126 secs [nr = 12378157] [nf = 153170] [nu = 2191370] [ut = 410]
% Looking for a proof at depth = 7 ...
% t = 148 secs [nr = 14451571] [nf = 168472] [nu = 2544899] [ut = 410]
% Looking for a proof at depth = 8 ...
% t = 222 secs [nr = 21574765] [nf = 267736] [nu = 3794475] [ut = 410]
% Looking for a proof at depth = 9 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 29122208
% resolvents: 28751350 factors: 370858
% Number of unit clauses generated: 4994662
% % unit clauses generated to total clauses generated: 17.15
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 11 [1] = 42 [2] = 22 [3] = 55
% [4] = 114 [5] = 163 [7] = 3
% Total = 410
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 4994662 [2] = 15981637 [3] = 8145909
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] abnormal_1 (+)0 (-)5
% [1] and_ok_1 (+)3 (-)2
% [2] fulladder_1 (+)1 (-)1
% [3] halfadder_1 (+)2 (-)0
% [4] logic_and_1 (+)4 (-)2
% [5] logic_not_1 (+)2 (-)1
% [6] logic_or_1 (+)3 (-)1
% [7] not_ok_1 (+)1 (-)4
% [8] one_1 (+)15 (-)10
% [9] or_ok_1 (+)1 (-)1
% [10] zero_1 (+)10 (-)15
% [11] connection_2 (+)26 (-)300
% ------------------
% Total: (+)68 (-)342
% Total number of unit clauses retained: 410
% Number of clauses skipped because of their length: 192277653
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 3445842
% Number of successful unifications: 29122208
% Number of unification failures: 1010925295
% Number of unit to unit unification failures: 8125
% N literal unification failure due to lookup root_id table: 788252210
% N base clause resolution failure due to lookup table: 560381560
% N UC-BCL resolution dropped due to lookup table: 470374
% Max entries in substitution set: 10
% N unit clauses dropped because they exceeded max values: 3564763
% 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: 8
% Max term depth in a unit clause: 4
% Number of states in UCFA table: 830
% Total number of terms of all unit clauses in table: 2416
% Max allowed number of states in UCFA: 96000
% Ratio n states used/total allowed states: 0.01
% Ratio n states used/total unit clauses terms: 0.34
% Number of symbols (columns) in UCFA: 59
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 1040047503
% ConstructUnitClause() = 3565162
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 4.93 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 97074
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------