TSTP Solution File: SYN440-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN440-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:14:12 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/SystemOnTPTP28203/SYN/SYN440-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 = 8] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 132] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 256] [nf = 2] [nu = 2] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 1221] [nf = 46] [nu = 4] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 4894] [nf = 468] [nu = 48] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 8583] [nf = 902] [nu = 92] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 12324] [nf = 1370] [nu = 136] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 16065] [nf = 1838] [nu = 180] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 19883] [nf = 2374] [nu = 224] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 23701] [nf = 2910] [nu = 268] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 27519] [nf = 3446] [nu = 312] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 31337] [nf = 3982] [nu = 356] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 35155] [nf = 4518] [nu = 400] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 38973] [nf = 5054] [nu = 444] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 42791] [nf = 5590] [nu = 488] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 46609] [nf = 6126] [nu = 532] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 2 secs [nr = 50427] [nf = 6662] [nu = 576] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 2 secs [nr = 54245] [nf = 7198] [nu = 620] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 2 secs [nr = 58063] [nf = 7734] [nu = 664] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 2 secs [nr = 61881] [nf = 8270] [nu = 708] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 2 secs [nr = 65699] [nf = 8806] [nu = 752] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 2 secs [nr = 69517] [nf = 9342] [nu = 796] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 2 secs [nr = 73335] [nf = 9878] [nu = 840] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 2 secs [nr = 77153] [nf = 10414] [nu = 884] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 3 secs [nr = 80971] [nf = 10950] [nu = 928] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 3 secs [nr = 84789] [nf = 11486] [nu = 972] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 3 secs [nr = 88607] [nf = 12022] [nu = 1016] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 3 secs [nr = 92425] [nf = 12558] [nu = 1060] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 3 secs [nr = 96243] [nf = 13094] [nu = 1104] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 3 secs [nr = 100061] [nf = 13630] [nu = 1148] [ut = 1]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 3 secs [nr = 100069] [nf = 13630] [nu = 1148] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 3 secs [nr = 100193] [nf = 13630] [nu = 1148] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 3 secs [nr = 100317] [nf = 13632] [nu = 1150] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 3 secs [nr = 101427] [nf = 13678] [nu = 1152] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 3 secs [nr = 114014] [nf = 14384] [nu = 1196] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 4 secs [nr = 308460] [nf = 23421] [nu = 1240] [ut = 1]
% Look
% ing for a proof at depth = 7 ...
% t = 16 secs [nr = 2625132] [nf = 147601] [nu = 1284] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 143 secs [nr = 16131620] [nf = 1246393] [nu = 1328] [ut = 1]
% Looking for a proof at depth = 9 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 28280098
% resolvents: 25798428 factors: 2481670
% Number of unit clauses generated: 1358
% % unit clauses generated to total clauses generated: 0.00
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [3] = 1
% Total = 1
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 1358 [2] = 18624 [3] = 115413 [4] = 304433 [5] = 3805563 [6] = 17531547
% [7] = 5187097 [8] = 1311704 [9] = 4359
% 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] hskp7 (+)0 (-)0
% [65] hskp8 (+)0 (-)0
% [66] hskp9 (+)0 (-)0
% [67] ndr1_0 (+)1 (-)0
% [68] c0_1_1 (+)0 (-)0
% [69] c1_1_1 (+)0 (-)0
% [70] c2_1_1 (+)0 (-)0
% [71] c3_1_1 (+)0 (-)0
% ------------------
% Total: (+)1 (-)0
% Total number of unit clauses retained: 1
% Number of clauses skipped because of their length: 126307428
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 2274829893
% Number of successful unifications: 28280098
% Number of unification failures: 133333459
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 2525634759
% N base clause resolution failure due to lookup table: 2915734879
% 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: 87
% 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: 173
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 161613557
% ConstructUnitClause() = 88
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 94267
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------