TSTP Solution File: SYN464-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN464-1 : TPTP v5.0.0. Released v2.1.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art05.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:29:02 EST 2010
% Result : Timeout 300.03s
% 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/SystemOnTPTP1359/SYN/SYN464-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 = 0]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 84] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 168] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 1092] [nf = 42] [nu = 0] [ut = 0]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 4727] [nf = 462] [nu = 42] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 8362] [nf = 882] [nu = 84] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 12057] [nf = 1340] [nu = 126] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 15752] [nf = 1798] [nu = 168] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 19507] [nf = 2308] [nu = 210] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 23262] [nf = 2818] [nu = 252] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 27017] [nf = 3328] [nu = 294] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 30772] [nf = 3838] [nu = 336] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 34527] [nf = 4348] [nu = 378] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 2 secs [nr = 38282] [nf = 4858] [nu = 420] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 2 secs [nr = 42037] [nf = 5368] [nu = 462] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 2 secs [nr = 45792] [nf = 5878] [nu = 504] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 2 secs [nr = 49547] [nf = 6388] [nu = 546] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 2 secs [nr = 53302] [nf = 6898] [nu = 588] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 2 secs [nr = 57057] [nf = 7408] [nu = 630] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 2 secs [nr = 60812] [nf = 7918] [nu = 672] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 2 secs [nr = 64567] [nf = 8428] [nu = 714] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 3 secs [nr = 68322] [nf = 8938] [nu = 756] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 3 secs [nr = 72077] [nf = 9448] [nu = 798] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 3 secs [nr = 75832] [nf = 9958] [nu = 840] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 3 secs [nr = 79587] [nf = 10468] [nu = 882] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 3 secs [nr = 83342] [nf = 10978] [nu = 924] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 3 secs [nr = 87097] [nf = 11488] [nu = 966] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 3 secs [nr = 90852] [nf = 11998] [nu = 1008] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 3 secs [nr = 94607] [nf = 12508] [nu = 1050] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 4 secs [nr = 98362] [nf = 13018] [nu = 1092] [ut = 1]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 4 secs [nr = 98362] [nf = 13018] [nu = 1092] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 4 secs [nr = 98446] [nf = 13018] [nu = 1092] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 4 secs [nr = 98530] [nf = 13018] [nu = 1092] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 4 secs [nr = 99454] [nf = 13060] [nu = 1092] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 4 secs [nr = 106677] [nf = 13527] [nu = 1134] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 4 secs [nr = 359680] [nf = 21516] [nu = 1176] [ut = 1]
% L
% ooking for a proof at depth = 7 ...
% t = 17 secs [nr = 2907682] [nf = 152837] [nu = 1218] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 141 secs [nr = 14720805] [nf = 1045764] [nu = 1260] [ut = 1]
% Looking for a proof at depth = 9 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 30299649
% resolvents: 28113803 factors: 2185846
% Number of unit clauses generated: 1302
% % unit clauses generated to total clauses generated: 0.00
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [5] = 1
% Total = 1
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 1302 [2] = 17244 [3] = 117393 [4] = 200675 [5] = 3559883 [6] = 18488435
% [7] = 3724784 [8] = 4187973 [9] = 1960
% Average size of a generated clause: 7.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] hskp0 (+)0 (-)0
% [1] hskp1 (+)0 (-)0
% [2] hskp10 (+)0 (-)0
% [3] hskp11 (+)0 (-)0
% [4] hskp12 (+)0 (-)0
% [5] hskp13 (+)0 (-)0
% [6] hskp14 (+)0 (-)0
% [7] hskp15 (+)0 (-)0
% [8] hskp16 (+)0 (-)0
% [9] hskp17 (+)0 (-)0
% [10] hskp18 (+)0 (-)0
% [11] hskp19 (+)0 (-)0
% [12] hskp2 (+)0 (-)0
% [13] hskp20 (+)0 (-)0
% [14] hskp21 (+)0 (-)0
% [15] hskp22 (+)0 (-)0
% [16] hskp23 (+)0 (-)0
% [17] hskp24 (+)0 (-)0
% [18] hskp25 (+)0 (-)0
% [19] hskp26 (+)0 (-)0
% [20] hskp27 (+)0 (-)0
% [21] hskp28 (+)0 (-)0
% [22] hskp29 (+)0 (-)0
% [23] hskp3 (+)0 (-)0
% [24] hskp30 (+)0 (-)0
% [25] hskp31 (+)0 (-)0
% [26] hskp32 (+)0 (-)0
% [27] hskp33 (+)0 (-)0
% [28] hskp34 (+)0 (-)0
% [29] hskp35 (+)0 (-)0
% [30] hskp36 (+)0 (-)0
% [31] hskp37 (+)0 (-)0
% [32] hskp38 (+)0 (-)0
% [33] hskp39 (+)0 (-)0
% [34] hskp4 (+)0 (-)0
% [35] hskp40 (+)0 (-)0
% [36] hskp41 (+)0 (-)0
% [37] hskp42 (+)0 (-)0
% [38] hskp43 (+)0 (-)0
% [39] hskp44 (+)0 (-)0
% [40] hskp45 (+)0 (-)0
% [41] hskp46 (+)0 (-)0
% [42] hskp47 (+)0 (-)0
% [43] hskp48 (+)0 (-)0
% [44] hskp49 (+)0 (-)0
% [45] hskp5 (+)0 (-)0
% [46] hskp50 (+)0 (-)0
% [47] hskp51 (+)0 (-)0
% [48] hskp52 (+)0 (-)0
% [49] hskp53 (+)0 (-)0
% [50] hskp54 (+)0 (-)0
% [51] hskp55 (+)0 (-)0
% [52] hskp56 (+)0 (-)0
% [53] hskp57 (+)0 (-)0
% [54] hskp58 (+)0 (-)0
% [55] hskp59 (+)0 (-)0
% [56] hskp6 (+)0 (-)0
% [57] hskp60 (+)0 (-)0
% [58] hskp61 (+)0 (-)0
% [59] hskp62 (+)0 (-)0
% [60] hskp63 (+)0 (-)0
% [61] hskp64 (+)0 (-)0
% [62] hskp65 (+)0 (-)0
% [63] hskp66 (+)0 (-)0
% [64] hskp67 (+)0 (-)0
% [65] hskp68 (+)0 (-)0
% [66] hskp69 (+)0 (-)0
% [67] hskp7 (+)0 (-)0
% [68] hskp8 (+)0 (-)0
% [69] hskp9 (+)0 (-)0
% [70] ndr1_0 (+)1 (-)0
% [71] c0_1_1 (+)0 (-)0
% [72] c1_1_1 (+)0 (-)0
% [73] c2_1_1 (+)0 (-)0
% [74] c3_1_1 (+)0 (-)0
% ------------------
% Total: (+)1 (-)0
% Total number of unit clauses retained: 1
% Number of clauses skipped because of their length: 113337685
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 2563282745
% Number of successful unifications: 30299649
% Number of unification failures: 108477919
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 2472686430
% N base clause resolution failure due to lookup table: 2571514620
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 2
% N unit clauses dropped because they exceeded max values: 83
% 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: 179
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 138777568
% ConstructUnitClause() = 84
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 100999
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------