TSTP Solution File: SYN426-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN426-1 : TPTP v5.0.0. Released v2.1.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 09:06:56 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/SystemOnTPTP8214/SYN/SYN426-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 = 99] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 1032] [nf = 24] [nu = 10] [ut = 3]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 3173] [nf = 66] [nu = 22] [ut = 3]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 8660] [nf = 360] [nu = 72] [ut = 9]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 17081] [nf = 821] [nu = 130] [ut = 9]
% Looking for a proof at depth = 6 ...
% t = 2 secs [nr = 29348] [nf = 1612] [nu = 194] [ut = 9]
% Looking for a proof at depth = 7 ...
% t = 2 secs [nr = 47034] [nf = 3017] [nu = 268] [ut = 9]
% Looking for a proof at depth = 8 ...
% t = 3 secs [nr = 71262] [nf = 5280] [nu = 342] [ut = 9]
% Looking for a proof at depth = 9 ...
% t = 4 secs [nr = 101585] [nf = 8283] [nu = 422] [ut = 9]
% Looking for a proof at depth = 10 ...
% t = 6 secs [nr = 142432] [nf = 12050] [nu = 515] [ut = 9]
% Looking for a proof at depth = 11 ...
% t = 8 secs [nr = 193659] [nf = 16821] [nu = 617] [ut = 9]
% Looking for a proof at depth = 12 ...
% t = 11 secs [nr = 255571] [nf = 22346] [nu = 733] [ut = 9]
% Looking for a proof at depth = 13 ...
% t = 14 secs [nr = 335746] [nf = 28916] [nu = 861] [ut = 9]
% Looking for a proof at depth = 14 ...
% t = 18 secs [nr = 432599] [nf = 37300] [nu = 1005] [ut = 9]
% Looking for a proof at depth = 15 ...
% t = 24 secs [nr = 547721] [nf = 47069] [nu = 1167] [ut = 9]
% Looking for a proof at depth = 16 ...
% t = 30 secs [nr = 690169] [nf = 58389] [nu = 1339] [ut = 9]
% Looking for a proof at depth = 17 ...
% t = 38 secs [nr = 856304] [nf = 72183] [nu = 1525] [ut = 9]
% Looking for a proof at depth = 18 ...
% t = 48 secs [nr = 1049774] [nf = 88001] [nu = 1734] [ut = 9]
% Looking for a proof at depth = 19 ...
% t = 59 secs [nr = 1280302] [nf = 105892] [nu = 1958] [ut = 9]
% Looking for a proof at depth = 20 ...
% t = 73 secs [nr = 1544667] [nf = 126511] [nu = 2198] [ut = 9]
% Looking for a proof at depth = 21 ...
% t = 89 secs [nr = 1848913] [nf = 149773] [nu = 2452] [ut = 9]
% Looking for a proof at depth = 22 ...
% t = 110 secs [nr = 2299508] [nf = 176144] [nu = 2726] [ut = 9]
% Looking for a proof at depth = 23 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% t = 123 secs [nr = 2526344] [nf = 192734] [nu = 2894] [ut = 9]
% Looking for a proof at depth = 2 ...
% t = 123 secs [nr = 2527277] [nf = 192758] [nu = 2904] [ut = 9]
% Looking for a proof at depth = 3 ...
% t = 123 secs [nr = 2531080] [nf = 192881] [nu = 2916] [ut = 9]
% Looking for a proof at depth = 4 ...
% t = 123 secs [nr = 2550550] [nf = 193791] [nu = 2966] [ut = 9]
% Looking for a proof at depth = 5 ...
% t = 124 secs [nr = 2668299] [nf = 201042] [nu = 3024] [ut = 9]
% Looking for a proof at depth = 6 ...
% t = 131 secs [nr = 3439209] [nf = 249487] [nu = 3096] [ut = 9]
% Looking for a proof at depth = 7 ...
% t = 185 secs [nr = 8959552] [nf = 625910] [nu = 3198] [ut = 9]
% Looking for a proof at depth = 8 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 22166550
% resolvents: 20633090 factors: 1533460
% Number of unit clauses generated: 3271
% % unit clauses generated to total clauses generated: 0.01
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 1 [2] = 2 [4] = 6
% Total = 9
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 3271 [2] = 414378 [3] = 2518197 [4] = 2285854 [5] = 8761541 [6] = 6340753
% [7] = 1624497 [8] = 107261 [9] = 4824 [10] = 2323 [11] = 1303 [12] = 1792
% [13] = 1453 [14] = 738 [15] = 30724 [16] = 36004 [17] = 20880 [18] = 7920
% [19] = 2220 [20] = 492 [21] = 90 [22] = 35
% 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 (-)1
% [6] c6_0 (+)0 (-)1
% [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] ssSkC33 (+)0 (-)0
% [39] ssSkC34 (+)0 (-)0
% [40] ssSkC35 (+)0 (-)0
% [41] ssSkC36 (+)0 (-)0
% [42] ssSkC37 (+)0 (-)0
% [43] ssSkC38 (+)0 (-)0
% [44] ssSkC39 (+)0 (-)0
% [45] ssSkC4 (+)0 (-)0
% [46] ssSkC40 (+)0 (-)0
% [47] ssSkC41 (+)0 (-)0
% [48] ssSkC42 (+)0 (-)0
% [49] ssSkC5 (+)0 (-)0
% [50] ssSkC6 (+)0 (-)0
% [51] ssSkC7 (+)0 (-)0
% [52] ssSkC8 (+)0 (-)0
% [53] ssSkC9 (+)0 (-)0
% [54] c10_1_1 (+)0 (-)0
% [55] c1_1_1 (+)0 (-)0
% [56] c2_1_1 (+)0 (-)0
% [57] c3_1_1 (+)0 (-)0
% [58] c4_1_1 (+)0 (-)1
% [59] c5_1_1 (+)0 (-)2
% [60] c6_1_1 (+)0 (-)0
% [61] c7_1_1 (+)0 (-)0
% [62] c8_1_1 (+)0 (-)0
% [63] c9_1_1 (+)0 (-)0
% [64] ndr1_1_1 (+)1 (-)0
% [65] ssSkP0_1 (+)0 (-)0
% [66] ssSkP10_1 (+)0 (-)0
% [67] ssSkP11_1 (+)0 (-)0
% [68] ssSkP12_1 (+)0 (-)0
% [69] ssSkP13_1 (+)0 (-)0
% [70] ssSkP14_1 (+)0 (-)0
% [71] ssSkP15_1 (+)0 (-)0
% [72] ssSkP16_1 (+)0 (-)0
% [73] ssSkP17_1 (+)0 (-)0
% [74] ssSkP18_1 (+)0 (-)0
% [75] ssSkP19_1 (+)0 (-)0
% [76] ssSkP1_1 (+)0 (-)0
% [77] ssSkP20_1 (+)0 (-)0
% [78] ssSkP2_1 (+)0 (-)0
% [79] ssSkP3_1 (+)0 (-)0
% [80] ssSkP4_1 (+)0 (-)0
% [81] ssSkP5_1 (+)0 (-)0
% [82] ssSkP6_1 (+)0 (-)0
% [83] ssSkP7_1 (+)0 (-)0
% [84] ssSkP8_1 (+)0 (-)0
% [85] ssSkP9_1 (+)0 (-)0
% [86] c10_2_2 (+)0 (-)0
% [87] c1_2_2 (+)0 (-)0
% [88] c2_2_2 (+)0 (-)0
% [89] c3_2_2 (+)0 (-)0
% [90] c4_2_2 (+)0 (-)1
% [91] c5_2_2 (+)0 (-)0
% [92] c6_2_2 (+)0 (-)0
% [93] c7_2_2 (+)0 (-)0
% [94] c8_2_2 (+)1 (-)0
% [95] c9_2_2 (+)0 (-)0
% ------------------
% Total: (+)3 (-)6
% Total number of unit clauses retained: 9
% Number of clauses skipped because of their length: 1577634037
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 786348650
% Number of successful unifications: 22166550
% Number of unification failures: 1256222
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 739064425
% N base clause resolution failure due to lookup table: 2496898277
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 8
% N unit clauses dropped because they exceeded max values: 371
% 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: 10
% Total number of terms of all unit clauses in table: 8
% 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.25
% Number of symbols (columns) in UCFA: 342
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 23422772
% ConstructUnitClause() = 379
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 73888
% | |
% --------------------------------------------------------
% Elapsed time: 304 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------