TSTP Solution File: PUZ018-2 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : PUZ018-2 : TPTP v5.0.0. Released v1.2.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art07.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 : Sun Nov 28 03:54:33 EST 2010
% Result : Timeout 300.05s
% 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/SystemOnTPTP17398/PUZ/PUZ018-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 = 33] [nf = 0] [nu = 12] [ut = 43]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 87] [nf = 2] [nu = 24] [ut = 43]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 145] [nf = 4] [nu = 36] [ut = 43]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 203] [nf = 6] [nu = 48] [ut = 43]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 261] [nf = 8] [nu = 60] [ut = 43]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 319] [nf = 10] [nu = 72] [ut = 43]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 377] [nf = 12] [nu = 84] [ut = 43]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 435] [nf = 14] [nu = 96] [ut = 43]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 493] [nf = 16] [nu = 108] [ut = 43]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 551] [nf = 18] [nu = 120] [ut = 43]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 609] [nf = 20] [nu = 132] [ut = 43]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 667] [nf = 22] [nu = 144] [ut = 43]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 725] [nf = 24] [nu = 156] [ut = 43]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 783] [nf = 26] [nu = 168] [ut = 43]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 841] [nf = 28] [nu = 180] [ut = 43]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 899] [nf = 30] [nu = 192] [ut = 43]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 957] [nf = 32] [nu = 204] [ut = 43]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 1015] [nf = 34] [nu = 216] [ut = 43]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 1073] [nf = 36] [nu = 228] [ut = 43]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 1131] [nf = 38] [nu = 240] [ut = 43]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 1189] [nf = 40] [nu = 252] [ut = 43]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 1247] [nf = 42] [nu = 264] [ut = 43]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 1305] [nf = 44] [nu = 276] [ut = 43]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 1363] [nf = 46] [nu = 288] [ut = 43]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 1421] [nf = 48] [nu = 300] [ut = 43]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 1479] [nf = 50] [nu = 312] [ut = 43]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 1537] [nf = 52] [nu = 324] [ut = 43]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 1595] [nf = 54] [nu = 336] [ut = 43]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 1653] [nf = 56] [nu = 348] [ut = 43]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 1711] [nf = 58] [nu = 360] [ut = 43]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 1744] [nf = 58] [nu = 372] [ut = 43]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 1798] [nf = 60] [nu = 384] [ut = 43]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 1862] [nf = 62] [nu = 396] [ut = 43]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 2066] [nf = 471] [nu = 408] [ut = 43]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 23704] [nf = 1379] [nu = 3090] [ut = 56]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 107029] [nf = 6695] [nu = 7236] [ut = 58]
% Looking for a proof at depth = 7 ...
% t = 2 secs [nr = 561076] [nf = 32477] [nu = 56164] [ut = 66]
% Looking for a proof at depth = 8 ...
% t = 14 secs [nr = 6083085] [nf = 132815] [nu = 496569] [ut = 66]
% Looking for a proof at depth = 9 ...
% t = 229 secs [nr = 106218380] [nf = 1297505] [nu = 7405470] [ut = 66]
% Looking for a proof at depth = 10 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 140354959
% resolvents: 138141436 factors: 2213523
% Number of unit clauses generated: 10563367
% % unit clauses generated to total clauses generated: 7.53
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 39 [1] = 4 [5] = 13 [6] = 2 [7] = 8
% Total = 66
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 10563367 [2] = 49721426 [3] = 57158125 [4] = 8340865 [5] = 11769160 [6] = 2489316
% [7] = 296903 [8] = 15797
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] all_on_1 (+)1 (-)6
% [1] consecutive_2 (+)7 (-)7
% [2] on_2 (+)8 (-)6
% [3] same_day_2 (+)4 (-)21
% [4] same_person_2 (+)3 (-)3
% ------------------
% Total: (+)23 (-)43
% Total number of unit clauses retained: 66
% Number of clauses skipped because of their length: 119989156
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 18072336
% Number of successful unifications: 140354959
% Number of unification failures: 541553390
% Number of unit to unit unification failures: 196
% N literal unification failure due to lookup root_id table: 354476692
% N base clause resolution failure due to lookup table: 186296213
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 9
% N unit clauses dropped because they exceeded max values: 9705932
% 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: 46
% Total number of terms of all unit clauses in table: 125
% 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.37
% Number of symbols (columns) in UCFA: 49
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 681908349
% ConstructUnitClause() = 9705959
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 9.50 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 467850
% | |
% --------------------------------------------------------
% Elapsed time: 304 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------