TSTP Solution File: SYN421-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN421-1 : TPTP v5.0.0. Released v2.1.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 09:03:19 EST 2010
% Result : Timeout 300.06s
% 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/SystemOnTPTP27291/SYN/SYN421-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 = 1 secs [nr = 2] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 636] [nf = 20] [nu = 0] [ut = 0]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 1508] [nf = 65] [nu = 0] [ut = 0]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 4387] [nf = 221] [nu = 6] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 8199] [nf = 415] [nu = 12] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 13152] [nf = 714] [nu = 21] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 19970] [nf = 1171] [nu = 36] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 2 secs [nr = 29421] [nf = 1881] [nu = 65] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 2 secs [nr = 41989] [nf = 2830] [nu = 104] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 3 secs [nr = 60307] [nf = 4287] [nu = 172] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 3 secs [nr = 88138] [nf = 6669] [nu = 293] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 4 secs [nr = 126902] [nf = 10101] [nu = 474] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 6 secs [nr = 177164] [nf = 14872] [nu = 750] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 8 secs [nr = 241670] [nf = 21178] [nu = 1119] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 10 secs [nr = 325843] [nf = 29653] [nu = 1614] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 14 secs [nr = 437559] [nf = 41105] [nu = 2295] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 18 secs [nr = 585870] [nf = 57023] [nu = 3242] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 25 secs [nr = 781427] [nf = 78734] [nu = 4560] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 35 secs [nr = 1039622] [nf = 108886] [nu = 6394] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 46 secs [nr = 1372019] [nf = 148378] [nu = 8833] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 63 secs [nr = 1819874] [nf = 202217] [nu = 12260] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 85 secs [nr = 2406336] [nf = 273007] [nu = 16781] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 115 secs [nr = 3176137] [nf = 366226] [nu = 22680] [ut = 1]
% Looking for a proof at depth = 24 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% t = 123 secs [nr = 3381531] [nf = 392300] [nu = 24341] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 123 secs [nr = 3382165] [nf = 392320] [nu = 24341] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 123 secs [nr = 3385646] [nf = 392437] [nu = 24341] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 124 secs [nr = 3402125] [nf = 393312] [nu = 24347] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 124 secs [nr = 3506938] [nf = 401511] [nu = 24353] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 128 secs [nr = 4059998] [nf = 451088] [nu = 24364] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 154 secs [nr = 7568427] [nf = 847983] [nu = 24385] [ut = 1]
% Looking for a proof at depth = 8 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 29003869
% resolvents: 25389276 factors: 3614593
% Number of unit clauses generated: 24447
% % unit clauses generated to total clauses generated: 0.08
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [4] = 1
% Total = 1
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 24447 [2] = 572893 [3] = 3390425 [4] = 1729632 [5] = 9867360 [6] = 10763489
% [7] = 2471054 [8] = 180363 [9] = 3568 [10] = 110 [11] = 73 [12] = 133
% [13] = 226 [14] = 96
% Average size of a generated clause: 6.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] c10_0 (+)0 (-)0
% [1] c1_0 (+)0 (-)0
% [2] c2_0 (+)0 (-)0
% [3] c3_0 (+)0 (-)0
% [4] c4_0 (+)0 (-)0
% [5] c5_0 (+)0 (-)0
% [6] c6_0 (+)0 (-)0
% [7] c7_0 (+)0 (-)0
% [8] c8_0 (+)0 (-)0
% [9] c9_0 (+)0 (-)0
% [10] ndr1_0 (+)1 (-)0
% [11] ssSkC0 (+)0 (-)0
% [12] ssSkC1 (+)0 (-)0
% [13] ssSkC10 (+)0 (-)0
% [14] ssSkC11 (+)0 (-)0
% [15] ssSkC12 (+)0 (-)0
% [16] ssSkC13 (+)0 (-)0
% [17] ssSkC14 (+)0 (-)0
% [18] ssSkC15 (+)0 (-)0
% [19] ssSkC16 (+)0 (-)0
% [20] ssSkC17 (+)0 (-)0
% [21] ssSkC18 (+)0 (-)0
% [22] ssSkC19 (+)0 (-)0
% [23] ssSkC2 (+)0 (-)0
% [24] ssSkC20 (+)0 (-)0
% [25] ssSkC21 (+)0 (-)0
% [26] ssSkC22 (+)0 (-)0
% [27] ssSkC23 (+)0 (-)0
% [28] ssSkC24 (+)0 (-)0
% [29] ssSkC25 (+)0 (-)0
% [30] ssSkC26 (+)0 (-)0
% [31] ssSkC27 (+)0 (-)0
% [32] ssSkC28 (+)0 (-)0
% [33] ssSkC29 (+)0 (-)0
% [34] ssSkC3 (+)0 (-)0
% [35] ssSkC30 (+)0 (-)0
% [36] ssSkC31 (+)0 (-)0
% [37] ssSkC32 (+)0 (-)0
% [38] ssSkC4 (+)0 (-)0
% [39] ssSkC5 (+)0 (-)0
% [40] ssSkC6 (+)0 (-)0
% [41] ssSkC7 (+)0 (-)0
% [42] ssSkC8 (+)0 (-)0
% [43] ssSkC9 (+)0 (-)0
% [44] c10_1_1 (+)0 (-)0
% [45] c1_1_1 (+)0 (-)0
% [46] c2_1_1 (+)0 (-)0
% [47] c3_1_1 (+)0 (-)0
% [48] c4_1_1 (+)0 (-)0
% [49] c5_1_1 (+)0 (-)0
% [50] c6_1_1 (+)0 (-)0
% [51] c7_1_1 (+)0 (-)0
% [52] c8_1_1 (+)0 (-)0
% [53] c9_1_1 (+)0 (-)0
% [54] ndr1_1_1 (+)0 (-)0
% [55] ssSkP0_1 (+)0 (-)0
% [56] ssSkP10_1 (+)0 (-)0
% [57] ssSkP1_1 (+)0 (-)0
% [58] ssSkP2_1 (+)0 (-)0
% [59] ssSkP3_1 (+)0 (-)0
% [60] ssSkP4_1 (+)0 (-)0
% [61] ssSkP5_1 (+)0 (-)0
% [62] ssSkP6_1 (+)0 (-)0
% [63] ssSkP7_1 (+)0 (-)0
% [64] ssSkP8_1 (+)0 (-)0
% [65] ssSkP9_1 (+)0 (-)0
% [66] c10_2_2 (+)0 (-)0
% [67] c1_2_2 (+)0 (-)0
% [68] c2_2_2 (+)0 (-)0
% [69] c3_2_2 (+)0 (-)0
% [70] c4_2_2 (+)0 (-)0
% [71] c5_2_2 (+)0 (-)0
% [72] c6_2_2 (+)0 (-)0
% [73] c7_2_2 (+)0 (-)0
% [74] c8_2_2 (+)0 (-)0
% [75] c9_2_2 (+)0 (-)0
% ------------------
% Total: (+)1 (-)0
% Total number of unit clauses retained: 1
% Number of clauses skipped because of their length: 1923154723
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 777662926
% Number of successful unifications: 29003869
% Number of unification failures: 254598
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 448803696
% N base clause resolution failure due to lookup table: 2135479659
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 4
% N unit clauses dropped because they exceeded max values: 6334
% 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: 0
% Max term depth in a unit clause: 0
% Number of states in UCFA table: 2
% Total number of terms of all unit clauses in table: 0
% 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: inf
% Number of symbols (columns) in UCFA: 269
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 29258467
% ConstructUnitClause() = 6335
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 96680
% | |
% --------------------------------------------------------
% Elapsed time: 304 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------