TSTP Solution File: SYN437-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN437-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:12:38 EST 2010
% Result : Timeout 300.04s
% 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/SystemOnTPTP32678/SYN/SYN437-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 = 48] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 96] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 624] [nf = 24] [nu = 0] [ut = 0]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 2703] [nf = 264] [nu = 24] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 4787] [nf = 508] [nu = 48] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 6941] [nf = 800] [nu = 72] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 9095] [nf = 1092] [nu = 96] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 11297] [nf = 1426] [nu = 120] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 13499] [nf = 1760] [nu = 144] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 15701] [nf = 2094] [nu = 168] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 17903] [nf = 2428] [nu = 192] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 20105] [nf = 2762] [nu = 216] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 22307] [nf = 3096] [nu = 240] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 24509] [nf = 3430] [nu = 264] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 26711] [nf = 3764] [nu = 288] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 1 secs [nr = 28913] [nf = 4098] [nu = 312] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 1 secs [nr = 31115] [nf = 4432] [nu = 336] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 1 secs [nr = 33317] [nf = 4766] [nu = 360] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 1 secs [nr = 35519] [nf = 5100] [nu = 384] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 1 secs [nr = 37721] [nf = 5434] [nu = 408] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 2 secs [nr = 39923] [nf = 5768] [nu = 432] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 2 secs [nr = 42125] [nf = 6102] [nu = 456] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 2 secs [nr = 44327] [nf = 6436] [nu = 480] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 2 secs [nr = 46529] [nf = 6770] [nu = 504] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 2 secs [nr = 48731] [nf = 7104] [nu = 528] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 2 secs [nr = 50933] [nf = 7438] [nu = 552] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 2 secs [nr = 53135] [nf = 7772] [nu = 576] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 2 secs [nr = 55337] [nf = 8106] [nu = 600] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 2 secs [nr = 57539] [nf = 8440] [nu = 624] [ut = 1]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 2 secs [nr = 57539] [nf = 8440] [nu = 624] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 2 secs [nr = 57587] [nf = 8440] [nu = 624] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 2 secs [nr = 57635] [nf = 8440] [nu = 624] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 2 secs [nr = 58163] [nf = 8464] [nu = 624] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 2 secs [nr = 62018] [nf = 8739] [nu = 648] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 2 secs [nr = 162210] [nf = 13460] [nu = 672] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 6 secs [nr = 1035751] [nf = 68145] [nu = 696] [ut = 1]
% Looking for a
% proof at depth = 8 ...
% t = 40 secs [nr = 5245504] [nf = 386484] [nu = 720] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 152 secs [nr = 20356831] [nf = 1454182] [nu = 744] [ut = 1]
% Looking for a proof at depth = 10 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 35640968
% resolvents: 32914393 factors: 2726575
% Number of unit clauses generated: 754
% % 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] = 754 [2] = 10342 [3] = 83807 [4] = 395138 [5] = 3306243 [6] = 13465816
% [7] = 7530264 [8] = 10814016 [9] = 34588
% 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] hskp6 (+)0 (-)0
% [49] hskp7 (+)0 (-)0
% [50] hskp8 (+)0 (-)0
% [51] hskp9 (+)0 (-)0
% [52] ndr1_0 (+)1 (-)0
% [53] c0_1_1 (+)0 (-)0
% [54] c1_1_1 (+)0 (-)0
% [55] c2_1_1 (+)0 (-)0
% [56] c3_1_1 (+)0 (-)0
% ------------------
% Total: (+)1 (-)0
% Total number of unit clauses retained: 1
% Number of clauses skipped because of their length: 96085453
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 3385794229
% Number of successful unifications: 35640968
% Number of unification failures: 76591343
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 1896396599
% N base clause resolution failure due to lookup table: 1814143989
% 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: 47
% 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: 143
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 112232311
% ConstructUnitClause() = 48
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 118803
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------