TSTP Solution File: PUZ008-3 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : PUZ008-3 : TPTP v5.0.0. Released v1.2.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 : Sun Nov 28 03:52:00 EST 2010
% Result : Timeout 300.02s
% 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/SystemOnTPTP21801/PUZ/PUZ008-3+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 = 19] [nf = 0] [nu = 16] [ut = 17]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 99] [nf = 0] [nu = 78] [ut = 27]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 619] [nf = 8] [nu = 244] [ut = 31]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 1618] [nf = 16] [nu = 631] [ut = 31]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 3360] [nf = 24] [nu = 1446] [ut = 31]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 6327] [nf = 32] [nu = 3092] [ut = 31]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 11398] [nf = 50] [nu = 6346] [ut = 31]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 20294] [nf = 68] [nu = 12712] [ut = 31]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 36527] [nf = 86] [nu = 25210] [ut = 31]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 67265] [nf = 104] [nu = 49984] [ut = 31]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 126844] [nf = 122] [nu = 99322] [ut = 31]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 243936] [nf = 140] [nu = 197800] [ut = 31]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 475885] [nf = 158] [nu = 394570] [ut = 31]
% Looking for a proof at depth = 14 ...
% t = 2 secs [nr = 937379] [nf = 176] [nu = 787936] [ut = 31]
% Looking for a proof at depth = 15 ...
% t = 4 secs [nr = 1857794] [nf = 194] [nu = 1574506] [ut = 31]
% Looking for a proof at depth = 16 ...
% t = 7 secs [nr = 3695882] [nf = 212] [nu = 3147496] [ut = 31]
% Looking for a proof at depth = 17 ...
% t = 14 secs [nr = 7369147] [nf = 230] [nu = 6293338] [ut = 31]
% Looking for a proof at depth = 18 ...
% t = 27 secs [nr = 14712597] [nf = 248] [nu = 12584896] [ut = 31]
% Looking for a proof at depth = 19 ...
% t = 54 secs [nr = 29396248] [nf = 266] [nu = 25167898] [ut = 31]
% Looking for a proof at depth = 20 ...
% t = 109 secs [nr = 58760132] [nf = 284] [nu = 50333800] [ut = 31]
% Looking for a proof at depth = 21 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% t = 122 secs [nr = 66088641] [nf = 302] [nu = 56613924] [ut = 31]
% Looking for a proof at depth = 2 ...
% t = 122 secs [nr = 66088721] [nf = 302] [nu = 56613986] [ut = 31]
% Looking for a proof at depth = 3 ...
% t = 122 secs [nr = 66089245] [nf = 310] [nu = 56614154] [ut = 31]
% Looking for a proof at depth = 4 ...
% t = 122 secs [nr = 66090244] [nf = 318] [nu = 56614541] [ut = 31]
% Looking for a proof at depth = 5 ...
% t = 122 secs [nr = 66091986] [nf = 326] [nu = 56615356] [ut = 31]
% Looking for a proof at depth = 6 ...
% t = 122 secs [nr = 66094953] [nf = 334] [nu = 56617002] [ut = 31]
% Looking for a proof at depth = 7 ...
% t = 122 secs [nr = 66100024] [nf = 352] [nu = 56620256] [ut = 31]
% Looking for a proof at depth = 8 ...
% t = 122 secs [nr = 66108920] [nf = 370] [nu = 56626622] [ut = 31]
% Looking for a proof at depth = 9 ...
% t = 122 secs [nr = 66125153] [nf = 388] [nu = 56639120] [ut = 31]
% Looking for a proof at depth = 10 ...
% t = 122 secs [nr = 66155891] [nf = 406] [nu = 56663894] [ut = 31]
% Looking for a proof at depth = 11 ...
% t = 122 secs [nr = 66215470] [nf = 424] [nu = 56713232] [ut = 31]
% Looking for a proof at depth = 12 ...
% t = 122 secs [nr = 66332562] [nf = 442] [nu = 56811710] [ut = 31]
% Looking for a proof at depth = 13 ...
% t = 123 secs [nr = 66564511] [nf = 460] [nu = 57008480] [ut = 31]
% Looking for a proof at depth = 14 ...
% t = 124 secs [nr = 67026005] [nf = 478] [nu = 57401846] [ut = 31]
% Looking for a proof at depth = 15 ...
% t = 125 secs [nr = 67946420] [nf = 496] [nu = 58188416] [ut = 31]
% Looking for a proof at depth = 16 ...
% t = 128 secs [nr = 69784508] [nf = 514] [nu = 59761406] [ut = 31]
% Looking for a proof at depth = 17 ...
% t = 135 secs [nr = 7345
% 7773] [nf = 532] [nu = 62907248] [ut = 31]
% Looking for a proof at depth = 18 ...
% t = 149 secs [nr = 80801223] [nf = 550] [nu = 69198806] [ut = 31]
% Looking for a proof at depth = 19 ...
% t = 176 secs [nr = 95484874] [nf = 568] [nu = 81781808] [ut = 31]
% Looking for a proof at depth = 20 ...
% t = 231 secs [nr = 124848758] [nf = 586] [nu = 106947710] [ut = 31]
% Looking for a proof at depth = 21 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 164463201
% resolvents: 164462605 factors: 596
% Number of unit clauses generated: 140901020
% % unit clauses generated to total clauses generated: 85.67
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 4 [1] = 13 [2] = 10 [3] = 4
% Total = 31
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 140901020 [2] = 23551365 [3] = 10816
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] greater_or_equal_2 (+)12 (-)0
% [1] safe_2 (+)13 (-)0
% [2] achievable_3 (+)2 (-)4
% ------------------
% Total: (+)27 (-)4
% Total number of unit clauses retained: 31
% Number of clauses skipped because of their length: 632
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 164463201
% Number of unification failures: 338371
% Number of unit to unit unification failures: 8
% N literal unification failure due to lookup root_id table: 59231284
% N base clause resolution failure due to lookup table: 5950012
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 42
% N unit clauses dropped because they exceeded max values: 70447341
% N unit clauses dropped because too much nesting: 70422330
% 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: 24
% Max term depth in a unit clause: 12
% Number of states in UCFA table: 262
% Total number of terms of all unit clauses in table: 416
% Max allowed number of states in UCFA: 528000
% Ratio n states used/total allowed states: 0.00
% Ratio n states used/total unit clauses terms: 0.63
% Number of symbols (columns) in UCFA: 45
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 164801572
% ConstructUnitClause() = 70447368
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 104.50 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 548211
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------