Log started (V12.4.0.0) Wed Dec 12 16:19:27 2012 Problem '1TEN.matrix.39p.9aa.usingEref_self_digit8.wcsp.lp' read. Read time = 1.02 sec. Warning: CPLEX version found in file /work/tschiex/CPD-Décembre2012/cplex/cplex.prm (12.2.0.0) does not match this CPLEX version (12.4.0.0). Parameter file '/work/tschiex/CPD-Décembre2012/cplex/cplex.prm' read. Tried aggregator 1 time. Presolve time = 1.43 sec. Probing time = 1.40 sec. Clique table members: 1280791. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: none, using 1 thread. Root relaxation solution time = 18.92 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 1.96025e+12 630 1.96025e+12 73436 * 0+ 0 1.53723e+18 1.96025e+12 73436 100.00% * 0+ 0 1.96332e+12 1.96025e+12 73436 0.16% Repeating presolve. Tried aggregator 2 times. MIP Presolve eliminated 10945 rows and 183645 columns. Aggregator did 562 substitutions. Reduced MIP has 19236 rows, 127625 columns, and 273970 nonzeros. Reduced MIP has 127625 binaries, 0 generals, 0 SOSs, and 0 indicators. Elapsed time 10.01 sec. for 2% of probing (557 vars fixed). Elapsed time 20.03 sec. for 5% of probing (557 vars fixed). Probing fixed 557 vars, tightened 0 bounds. Probing time = 25.95 sec. Tried aggregator 1 time. MIP Presolve eliminated 40 rows and 561 columns. Reduced MIP has 19196 rows, 127064 columns, and 272812 nonzeros. Reduced MIP has 127064 binaries, 0 generals, 0 SOSs, and 0 indicators. Represolve time = 28.40 sec. Probing time = 1.42 sec. Clique table members: 531027. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: none, using 1 thread. Root relaxation solution time = 12.67 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 1.96332e+12 1.96025e+12 132411 0.16% 0 0 1.96025e+12 610 1.96332e+12 1.96025e+12 132411 0.16% * 0+ 0 1.96070e+12 1.96025e+12 132411 0.02% * 0+ 0 1.96042e+12 1.96025e+12 132411 0.01% Repeating presolve. Tried aggregator 2 times. MIP Presolve eliminated 10225 rows and 98076 columns. Aggregator did 2182 substitutions. Reduced MIP has 6789 rows, 26806 columns, and 60146 nonzeros. Reduced MIP has 26806 binaries, 0 generals, 0 SOSs, and 0 indicators. Probing fixed 137 vars, tightened 0 bounds. Probing time = 2.80 sec. Tried aggregator 1 time. MIP Presolve eliminated 1 rows and 138 columns. Reduced MIP has 6788 rows, 26668 columns, and 59870 nonzeros. Reduced MIP has 26668 binaries, 0 generals, 0 SOSs, and 0 indicators. Represolve time = 3.48 sec. Probing time = 0.20 sec. Clique table members: 116277. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: none, using 1 thread. Root relaxation solution time = 1.44 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 1.96042e+12 1.96025e+12 149005 0.01% 0 0 1.96028e+12 318 1.96042e+12 1.96028e+12 149005 0.01% * 0+ 0 1.96037e+12 1.96028e+12 149005 0.00% Repeating presolve. Tried aggregator 2 times. MIP Presolve eliminated 2267 rows and 14770 columns. Aggregator did 512 substitutions. Reduced MIP has 4009 rows, 11386 columns, and 26636 nonzeros. Reduced MIP has 11386 binaries, 0 generals, 0 SOSs, and 0 indicators. Probing fixed 873 vars, tightened 0 bounds. Probing time = 3.38 sec. Tried aggregator 1 time. MIP Presolve eliminated 317 rows and 1514 columns. Reduced MIP has 3692 rows, 9872 columns, and 23320 nonzeros. Reduced MIP has 9872 binaries, 0 generals, 0 SOSs, and 0 indicators. Probing time = 0.05 sec. Tried aggregator 1 time. Represolve time = 3.76 sec. Probing time = 0.05 sec. Clique table members: 46731. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: none, using 1 thread. Root relaxation solution time = 0.40 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 1.96037e+12 1.96028e+12 156777 0.00% * 0 0 integral 0 1.96029e+12 1.96029e+12 156777 0.00% Elapsed real time = 81.59 sec. (tree size = 0.00 MB, solutions = 6) Root node processing (before b&c): Real time = 80.18 Sequential b&c: Real time = 0.00 ------- Total (root+branch&cut) = 80.18 sec. Solution pool: 6 solutions saved. MIP - Integer optimal solution: Objective = 1.9602944977e+12 Solution time = 81.65 sec. Iterations = 156777 Nodes = 0 Deterministic time = 27214.95 ticks (333.31 ticks/sec) Incumbent solution written to file '1TEN.matrix.39p.9aa.usingEref_self_digit8.wcsp.sol'.