TSTP Solution File: SYN771-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN771-1 : TPTP v5.0.0. Released v2.5.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art04.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 11:43:06 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/SystemOnTPTP20133/SYN/SYN771-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 = 0] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 8] [nf = 4] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 148] [nf = 34] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 2092] [nf = 142] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 31330] [nf = 398] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 102820] [nf = 684] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 174310] [nf = 970] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 245800] [nf = 1256] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 317290] [nf = 1542] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 388780] [nf = 1828] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 460270] [nf = 2114] [nu = 0] [ut = 2]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 531760] [nf = 2400] [nu = 0] [ut = 2]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 603250] [nf = 2686] [nu = 0] [ut = 2]
% Looking for a proof at depth = 17 ...
% t = 1 secs [nr = 674740] [nf = 2972] [nu = 0] [ut = 2]
% Looking for a proof at depth = 18 ...
% t = 2 secs [nr = 746230] [nf = 3258] [nu = 0] [ut = 2]
% Looking for a proof at depth = 19 ...
% t = 2 secs [nr = 817720] [nf = 3544] [nu = 0] [ut = 2]
% Looking for a proof at depth = 20 ...
% t = 2 secs [nr = 889210] [nf = 3830] [nu = 0] [ut = 2]
% Looking for a proof at depth = 21 ...
% t = 2 secs [nr = 960700] [nf = 4116] [nu = 0] [ut = 2]
% Looking for a proof at depth = 22 ...
% t = 2 secs [nr = 1032190] [nf = 4402] [nu = 0] [ut = 2]
% Looking for a proof at depth = 23 ...
% t = 2 secs [nr = 1103680] [nf = 4688] [nu = 0] [ut = 2]
% Looking for a proof at depth = 24 ...
% t = 2 secs [nr = 1175170] [nf = 4974] [nu = 0] [ut = 2]
% Looking for a proof at depth = 25 ...
% t = 2 secs [nr = 1246660] [nf = 5260] [nu = 0] [ut = 2]
% Looking for a proof at depth = 26 ...
% t = 3 secs [nr = 1318150] [nf = 5546] [nu = 0] [ut = 2]
% Looking for a proof at depth = 27 ...
% t = 3 secs [nr = 1389640] [nf = 5832] [nu = 0] [ut = 2]
% Looking for a proof at depth = 28 ...
% t = 3 secs [nr = 1461130] [nf = 6118] [nu = 0] [ut = 2]
% Looking for a proof at depth = 29 ...
% t = 3 secs [nr = 1532620] [nf = 6404] [nu = 0] [ut = 2]
% Looking for a proof at depth = 30 ...
% t = 3 secs [nr = 1604110] [nf = 6690] [nu = 0] [ut = 2]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 3 secs [nr = 1604110] [nf = 6690] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 3 secs [nr = 1604110] [nf = 6690] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 3 secs [nr = 1604110] [nf = 6690] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 3 secs [nr = 1604118] [nf = 6690] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 3 secs [nr = 1604170] [nf = 6742] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 3 secs [nr = 1604630] [nf = 7128] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 3 secs [nr = 1610076] [nf = 8444] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 3 secs [nr = 1686326] [nf = 10124] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 4 secs [nr = 1876179] [nf = 12073] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 4 secs [nr = 2071672] [nf = 19794] [nu = 0] [ut =
% 2]
% Looking for a proof at depth = 11 ...
% t = 5 secs [nr = 2423724] [nf = 108331] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% t = 16 secs [nr = 6821730] [nf = 1277412] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% t = 250 secs [nr = 103723533] [nf = 4733819] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 131010149
% resolvents: 126239379 factors: 4770770
% Number of unit clauses generated: 0
% % unit clauses generated to total clauses generated: 0.00
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 2
% Total = 2
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [4] = 1070456 [5] = 4329032 [6] = 43126576 [7] = 48053090 [8] = 24307049 [9] = 7092014
% [10] = 2402048 [11] = 529476 [12] = 94168 [13] = 6152 [14] = 88
% Average size of a generated clause: 7.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] ssPv1_1 (+)0 (-)0
% [1] ssPv2_1 (+)0 (-)0
% [2] ssPv3_1 (+)0 (-)0
% [3] ssPv4_1 (+)0 (-)0
% [4] ssRr_2 (+)2 (-)0
% ------------------
% Total: (+)2 (-)0
% Total number of unit clauses retained: 2
% Number of clauses skipped because of their length: 1423223450
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 131010149
% Number of unification failures: 211971549
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 12246706
% N base clause resolution failure due to lookup table: 7047
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 17
% N unit clauses dropped because they exceeded max values: 0
% 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: 7
% Total number of terms of all unit clauses in table: 6
% 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: 1.17
% Number of symbols (columns) in UCFA: 41
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 342981698
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 436700
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------