TSTP Solution File: PUZ031-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : PUZ031-1 : TPTP v5.0.0. Released v1.0.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art06.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:59:59 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/SystemOnTPTP20053/PUZ/PUZ031-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 = 22] [nf = 0] [nu = 14] [ut = 13]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 85] [nf = 0] [nu = 37] [ut = 18]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 173] [nf = 2] [nu = 61] [ut = 18]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 590] [nf = 8] [nu = 99] [ut = 19]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 1219] [nf = 34] [nu = 137] [ut = 19]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 1926] [nf = 60] [nu = 175] [ut = 19]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 2685] [nf = 98] [nu = 213] [ut = 19]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 3458] [nf = 138] [nu = 251] [ut = 19]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 4235] [nf = 178] [nu = 289] [ut = 19]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 5012] [nf = 218] [nu = 327] [ut = 19]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 5789] [nf = 258] [nu = 365] [ut = 19]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 6566] [nf = 298] [nu = 403] [ut = 19]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 7343] [nf = 338] [nu = 441] [ut = 19]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 8120] [nf = 378] [nu = 479] [ut = 19]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 8897] [nf = 418] [nu = 517] [ut = 19]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 9674] [nf = 458] [nu = 555] [ut = 19]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 10451] [nf = 498] [nu = 593] [ut = 19]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 11228] [nf = 538] [nu = 631] [ut = 19]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 12005] [nf = 578] [nu = 669] [ut = 19]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 12782] [nf = 618] [nu = 707] [ut = 19]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 13559] [nf = 658] [nu = 745] [ut = 19]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 14336] [nf = 698] [nu = 783] [ut = 19]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 15113] [nf = 738] [nu = 821] [ut = 19]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 15890] [nf = 778] [nu = 859] [ut = 19]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 16667] [nf = 818] [nu = 897] [ut = 19]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 17444] [nf = 858] [nu = 935] [ut = 19]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 18221] [nf = 898] [nu = 973] [ut = 19]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 18998] [nf = 938] [nu = 1011] [ut = 19]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 19775] [nf = 978] [nu = 1049] [ut = 19]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 20552] [nf = 1018] [nu = 1087] [ut = 19]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 20588] [nf = 1018] [nu = 1107] [ut = 22]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 20682] [nf = 1018] [nu = 1145] [ut = 26]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 20803] [nf = 1021] [nu = 1183] [ut = 26]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 21358] [nf = 1028] [nu = 1251] [ut = 26]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 27650] [nf = 1245] [nu = 1439] [ut = 28]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 65462] [nf = 3775] [nu = 2371] [ut = 28]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 321044] [nf = 22107] [nu = 11763] [ut = 31]
% Looking for a proof at depth = 8 ...
% t = 17 secs [nr = 5330688] [nf = 120485] [nu = 418503] [ut = 39]
% Looking for a proof at depth = 9 ...
% t = 207 secs [nr = 62598347] [nf = 1278282] [nu = 5314143] [ut = 45]
% Looking for
% a proof at depth = 10 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 91555355
% resolvents: 89579262 factors: 1976093
% Number of unit clauses generated: 7701408
% % unit clauses generated to total clauses generated: 8.41
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 6 [1] = 10 [2] = 9 [4] = 1 [5] = 2 [7] = 3
% [8] = 8 [9] = 6
% Total = 45
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 7701408 [2] = 25157572 [3] = 38079494 [4] = 12078076 [5] = 6757109 [6] = 1600984
% [7] = 171129 [8] = 8876 [9] = 707
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] animal_1 (+)5 (-)0
% [1] bird_1 (+)1 (-)0
% [2] caterpillar_1 (+)1 (-)2
% [3] fox_1 (+)1 (-)0
% [4] grain_1 (+)1 (-)3
% [5] plant_1 (+)3 (-)2
% [6] snail_1 (+)1 (-)5
% [7] wolf_1 (+)1 (-)1
% [8] eats_2 (+)7 (-)7
% [9] much_smaller_2 (+)4 (-)0
% ------------------
% Total: (+)25 (-)20
% Total number of unit clauses retained: 45
% Number of clauses skipped because of their length: 359302860
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 172819457
% Number of successful unifications: 91555355
% Number of unification failures: 540930003
% Number of unit to unit unification failures: 66
% N literal unification failure due to lookup root_id table: 1112283658
% N base clause resolution failure due to lookup table: 262612166
% 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: 6624385
% 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: 2
% Number of states in UCFA table: 42
% Total number of terms of all unit clauses in table: 74
% 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.57
% Number of symbols (columns) in UCFA: 52
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 632485358
% ConstructUnitClause() = 6624424
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 6.53 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 305185
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------