sw: ampl ampl: option ampl_include '../crashed'; ampl: include zone_group2.run set FG[1] := 8 9 10 11 12; set FG[2] := 13 14 15 16 17; set FG[3] := 18 19 20 21 22; set FG[4] := 23 24 25 26 27; set FG[5] := 28 29 30 31 32; set FG[6] := 33 34 35 36 37; ---------- START PROCESSING FOR THE FIRST 1 GROUP(S)----------- CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 MIP Presolve eliminated 903 rows and 465 columns. MIP Presolve modified 13223 coefficients. Reduced MIP has 6939 rows, 12048 columns, and 68721 nonzeros. Reduced MIP has 11908 binaries, 65 generals, 0 SOSs, and 20839 indicators. Probing fixed 4140 vars, tightened 11 bounds. Probing time = 1.02 sec. (317.38 ticks) Root node processing (before b&c): Real time = 2.27 sec. (2528.87 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 2.27 sec. (2528.87 ticks) CPLEX 12.6.3.0: integer infeasible. 0 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 3 times No basis. GROUP 1: PHASE I: TRYING TO FIX INFEASIBILITY BY ENLARGING STEPS ... ------- GROUP 1: FIXXING ITERATION #1 --------- a = 8 Step[a] = 14 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 MIP Presolve eliminated 908 rows and 467 columns. MIP Presolve modified 13753 coefficients. Reduced MIP has 7173 rows, 12376 columns, and 70521 nonzeros. Reduced MIP has 12234 binaries, 66 generals, 0 SOSs, and 21379 indicators. Probing fixed 11519 vars, tightened 129 bounds. Probing time = 1.31 sec. (354.01 ticks) Cover probing fixed 9 vars, tightened 711 bounds. MIP Presolve eliminated 6853 rows and 12014 columns. MIP Presolve modified 156 coefficients. Reduced MIP has 271 rows, 313 columns, and 1724 nonzeros. Reduced MIP has 282 binaries, 14 generals, 0 SOSs, and 593 indicators. Probing fixed 0 vars, tightened 3 bounds. Probing time = 0.02 sec. (11.00 ticks) Cover probing fixed 0 vars, tightened 9 bounds. MIP Presolve modified 29 coefficients. Reduced MIP has 271 rows, 313 columns, and 1724 nonzeros. Reduced MIP has 282 binaries, 14 generals, 0 SOSs, and 593 indicators. Probing fixed 0 vars, tightened 2 bounds. Probing time = 0.02 sec. (9.03 ticks) Clique table members: 12529. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.00 sec. (1.60 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 21688.0000 12859.9997 40.70% 0 0 13399.9395 12 21688.0000 13399.9395 121 38.21% * 0+ 0 13400.0000 13399.9395 0.00% 0 0 cutoff 13400.0000 13400.0000 135 0.00% Elapsed time = 2.73 sec. (2625.52 ticks, tree = 0.01 MB) Implied bound cuts applied: 14 Root node processing (before b&c): Real time = 2.73 sec. (2625.70 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 2.73 sec. (2625.70 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 13400 135 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 1: INFEASIBILITY FIXING FINISHED -------- ------- GROUP 1: PHASE II: OPTIMIZATION ITERATION #1 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 2 set Conf := (10,12,44) (11,12,43); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 9404 rows, 14124 columns, and 67705 nonzeros. Reduced MIP has 13470 binaries, 66 generals, 0 SOSs, and 22375 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 1195 rows and 793 columns. MIP Presolve modified 13756 coefficients. Reduced MIP has 7733 rows, 12736 columns, and 72922 nonzeros. Reduced MIP has 12377 binaries, 66 generals, 0 SOSs, and 21452 indicators. Probing fixed 11581 vars, tightened 338 bounds. Probing changed sense of 6 constraints. Probing time = 1.34 sec. (354.07 ticks) Cover probing fixed 9 vars, tightened 1341 bounds. MIP Presolve eliminated 7323 rows and 12392 columns. MIP Presolve modified 302 coefficients. Reduced MIP has 414 rows, 276 columns, and 1525 nonzeros. Reduced MIP has 186 binaries, 30 generals, 0 SOSs, and 483 indicators. Probing fixed 0 vars, tightened 44 bounds. Probing time = 0.02 sec. (3.41 ticks) Cover probing fixed 0 vars, tightened 58 bounds. MIP Presolve eliminated 42 rows and 11 columns. MIP Presolve modified 57 coefficients. Reduced MIP has 372 rows, 265 columns, and 1438 nonzeros. Reduced MIP has 176 binaries, 29 generals, 0 SOSs, and 483 indicators. Probing time = 0.01 sec. (2.48 ticks) Cover probing fixed 0 vars, tightened 52 bounds. Clique table members: 2718. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.00 sec. (1.42 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 13360.7030 10 13360.7030 129 0 0 13400.0000 2 Cuts: 44 151 0 0 13400.0000 1 Cuts: 10 156 * 0+ 0 13434.0000 13400.0000 0.25% * 0+ 0 13400.0000 13400.0000 0.00% 0 0 cutoff 13400.0000 13400.0000 156 0.00% Elapsed time = 2.53 sec. (2031.10 ticks, tree = 0.01 MB) Clique cuts applied: 10 Implied bound cuts applied: 25 Mixed integer rounding cuts applied: 6 Gomory fractional cuts applied: 2 Root node processing (before b&c): Real time = 2.53 sec. (2031.29 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 2.53 sec. (2031.29 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 13400 156 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 1: PHASE II: OPTIMIZATION ITERATION #2 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 2 set Conf := (10,12,44) (11,12,43) (11,12,7) (11,12,44); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 10073 rows, 14871 columns, and 70676 nonzeros. Reduced MIP has 13823 binaries, 66 generals, 0 SOSs, and 22769 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 1347 rows and 1064 columns. MIP Presolve modified 13788 coefficients. Reduced MIP has 8029 rows, 12909 columns, and 74228 nonzeros. Reduced MIP has 12459 binaries, 66 generals, 0 SOSs, and 21493 indicators. Probing fixed 11590 vars, tightened 363 bounds. Probing changed sense of 7 constraints. Probing time = 1.39 sec. (362.00 ticks) Cover probing fixed 9 vars, tightened 1648 bounds. MIP Presolve eliminated 7367 rows and 12410 columns. MIP Presolve modified 768 coefficients. Reduced MIP has 612 rows, 377 columns, and 2105 nonzeros. Reduced MIP has 251 binaries, 30 generals, 0 SOSs, and 515 indicators. Probing fixed 0 vars, tightened 30 bounds. Probing time = 0.02 sec. (8.10 ticks) Cover probing fixed 0 vars, tightened 78 bounds. MIP Presolve eliminated 35 rows and 5 columns. MIP Presolve modified 211 coefficients. Reduced MIP has 577 rows, 372 columns, and 2032 nonzeros. Reduced MIP has 247 binaries, 29 generals, 0 SOSs, and 515 indicators. Probing time = 0.02 sec. (3.01 ticks) Clique table members: 2543. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.00 sec. (2.39 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 13360.7030 15 13360.7030 152 * 0+ 0 13400.0000 13360.7030 0.29% 0 0 cutoff 13400.0000 13400.0000 171 0.00% Elapsed time = 2.61 sec. (2022.21 ticks, tree = 0.01 MB) Clique cuts applied: 3 Implied bound cuts applied: 17 Mixed integer rounding cuts applied: 6 Gomory fractional cuts applied: 1 Root node processing (before b&c): Real time = 2.61 sec. (2022.41 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 2.61 sec. (2022.41 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 13400 171 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 1: PHASE II: OPTIMIZATION ITERATION #3 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 1 set Conf := (10,12,44) (11,12,43) (11,12,7) (11,12,44) (10,11,44); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 10463 rows, 15303 columns, and 73154 nonzeros. Reduced MIP has 14027 binaries, 66 generals, 0 SOSs, and 22997 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 1437 rows and 1220 columns. MIP Presolve modified 13788 coefficients. Reduced MIP has 8221 rows, 13029 columns, and 75484 nonzeros. Reduced MIP has 12507 binaries, 66 generals, 0 SOSs, and 21517 indicators. Probing fixed 11606 vars, tightened 515 bounds. Probing changed sense of 3 constraints. Probing time = 1.47 sec. (399.28 ticks) Cover probing fixed 9 vars, tightened 1923 bounds. MIP Presolve eliminated 7501 rows and 12495 columns. MIP Presolve modified 867 coefficients. Reduced MIP has 672 rows, 410 columns, and 2273 nonzeros. Reduced MIP has 267 binaries, 31 generals, 0 SOSs, and 523 indicators. Probing fixed 0 vars, tightened 43 bounds. Probing time = 0.02 sec. (9.24 ticks) MIP Presolve eliminated 39 rows and 6 columns. MIP Presolve modified 191 coefficients. Reduced MIP has 633 rows, 404 columns, and 2192 nonzeros. Reduced MIP has 263 binaries, 29 generals, 0 SOSs, and 523 indicators. Probing time = 0.00 sec. (3.11 ticks) Clique table members: 2522. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.00 sec. (2.83 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 13360.7030 17 13360.7030 166 * 0+ 0 14548.0000 13360.7030 8.16% 0 0 13400.0000 3 14548.0000 Cuts: 26 187 7.89% 0 0 13400.0000 2 14548.0000 Cuts: 11 193 7.89% * 0+ 0 13556.0000 13400.0000 1.15% * 0+ 0 13499.9994 13400.0000 0.74% * 0+ 0 13400.0000 13400.0000 0.00% 0 0 cutoff 13400.0000 13400.0000 193 0.00% Elapsed time = 2.73 sec. (2853.48 ticks, tree = 0.01 MB) Clique cuts applied: 3 Implied bound cuts applied: 17 Mixed integer rounding cuts applied: 7 Gomory fractional cuts applied: 1 Root node processing (before b&c): Real time = 2.75 sec. (2853.69 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 2.75 sec. (2853.69 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 13400 193 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 1: PHASE II: OPTIMIZATION ITERATION #4 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 1 set Conf := (10,12,44) (11,12,43) (11,12,7) (11,12,44) (10,11,44) (11,12,42); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 10948 rows, 15762 columns, and 75281 nonzeros. Reduced MIP has 14232 binaries, 66 generals, 0 SOSs, and 23251 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 1517 rows and 1327 columns. MIP Presolve modified 13836 coefficients. Reduced MIP has 8581 rows, 13240 columns, and 76968 nonzeros. Reduced MIP has 12605 binaries, 66 generals, 0 SOSs, and 21566 indicators. Probing fixed 11646 vars, tightened 599 bounds. Probing changed sense of 10 constraints. Probing time = 1.41 sec. (373.46 ticks) Cover probing fixed 9 vars, tightened 1791 bounds. MIP Presolve eliminated 7778 rows and 12655 columns. MIP Presolve modified 918 coefficients. Reduced MIP has 733 rows, 439 columns, and 2472 nonzeros. Reduced MIP has 285 binaries, 31 generals, 0 SOSs, and 532 indicators. Probing fixed 0 vars, tightened 50 bounds. Probing time = 0.02 sec. (10.99 ticks) MIP Presolve eliminated 44 rows and 6 columns. MIP Presolve modified 311 coefficients. Reduced MIP has 689 rows, 433 columns, and 2381 nonzeros. Reduced MIP has 281 binaries, 29 generals, 0 SOSs, and 532 indicators. Probing fixed 0 vars, tightened 22 bounds. Probing changed sense of 1 constraints. Probing time = 0.03 sec. (10.29 ticks) Clique table members: 2457. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.00 sec. (2.95 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 13359.9895 18 13359.9895 167 0 0 13400.0000 3 Cuts: 27 189 0 0 13400.0000 2 Cuts: 12 196 * 0+ 0 13556.0000 13400.0000 1.15% * 0+ 0 13400.0000 13400.0000 0.00% 0 0 cutoff 13400.0000 13400.0000 196 0.00% Elapsed time = 2.75 sec. (3316.13 ticks, tree = 0.01 MB) Clique cuts applied: 3 Implied bound cuts applied: 17 Mixed integer rounding cuts applied: 7 Gomory fractional cuts applied: 1 Root node processing (before b&c): Real time = 2.75 sec. (3316.34 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 2.75 sec. (3316.34 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 13400 196 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 1: PHASE II: OPTIMIZATION ITERATION #5 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 2 set Conf := (10,12,44) (11,12,7) (10,11,44) (11,12,11) (11,12,43) (11,12,44) (11,12,42) (11,12,12); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 11918 rows, 16680 columns, and 78695 nonzeros. Reduced MIP has 14642 binaries, 66 generals, 0 SOSs, and 23759 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 1677 rows and 1541 columns. MIP Presolve modified 13945 coefficients. Reduced MIP has 9286 rows, 13647 columns, and 79333 nonzeros. Reduced MIP has 12801 binaries, 66 generals, 0 SOSs, and 21664 indicators. Probing fixed 11736 vars, tightened 801 bounds. Probing changed sense of 24 constraints. Probing time = 1.50 sec. (405.60 ticks) Cover probing fixed 9 vars, tightened 1877 bounds. MIP Presolve eliminated 8432 rows and 13030 columns. MIP Presolve modified 1091 coefficients. Reduced MIP has 775 rows, 462 columns, and 2618 nonzeros. Reduced MIP has 301 binaries, 31 generals, 0 SOSs, and 540 indicators. Probing fixed 0 vars, tightened 52 bounds. Probing time = 0.03 sec. (12.02 ticks) Cover probing fixed 0 vars, tightened 132 bounds. MIP Presolve eliminated 39 rows and 6 columns. MIP Presolve modified 868 coefficients. Reduced MIP has 736 rows, 456 columns, and 2537 nonzeros. Reduced MIP has 297 binaries, 29 generals, 0 SOSs, and 540 indicators. Probing fixed 0 vars, tightened 45 bounds. Probing changed sense of 1 constraints. Probing time = 0.02 sec. (11.37 ticks) Clique table members: 2451. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.01 sec. (3.15 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 13360.7030 20 13360.7030 176 0 0 13400.0000 13 Cuts: 29 199 0 0 13400.0000 2 Cuts: 23 207 * 0+ 0 13556.0000 13400.0000 1.15% * 0+ 0 13400.0000 13400.0000 0.00% 0 0 cutoff 13400.0000 13400.0000 207 0.00% Elapsed time = 2.83 sec. (2918.37 ticks, tree = 0.01 MB) Clique cuts applied: 3 Implied bound cuts applied: 21 Mixed integer rounding cuts applied: 8 Gomory fractional cuts applied: 5 Root node processing (before b&c): Real time = 2.84 sec. (2918.60 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 2.84 sec. (2918.60 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 13400 207 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 1: PHASE II: OPTIMIZATION ITERATION #6 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 0 set Conf := (10,12,44) (11,12,7) (10,11,44) (11,12,11) (11,12,43) (11,12,44) (11,12,42) (11,12,12); ------- GROUP 1: CONFLICT-FREE SOLUTION FOUND AFTER #6 ITERATIONS -------- ---------- START PROCESSING FOR THE FIRST 2 GROUP(S)----------- CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 MIP Presolve eliminated 928 rows and 482 columns. MIP Presolve modified 14541 coefficients. Reduced MIP has 8224 rows, 13899 columns, and 77576 nonzeros. Reduced MIP has 13751 binaries, 69 generals, 0 SOSs, and 23910 indicators. Probing fixed 12390 vars, tightened 65 bounds. Probing changed sense of 14 constraints. Probing time = 1.66 sec. (441.34 ticks) Root node processing (before b&c): Real time = 3.11 sec. (3189.63 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 3.11 sec. (3189.63 ticks) CPLEX 12.6.3.0: integer infeasible. 0 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 3 times No basis. GROUP 2: PHASE I: TRYING TO FIX INFEASIBILITY BY ENLARGING STEPS ... ------- GROUP 2: FIXXING ITERATION #1 --------- a = 15 Step[a] = 14 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 9789 rows, 15109 columns, and 73057 nonzeros. Reduced MIP has 14959 binaries, 70 generals, 0 SOSs, and 25067 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 929 rows and 482 columns. MIP Presolve modified 15059 coefficients. Reduced MIP has 8482 rows, 14282 columns, and 79435 nonzeros. Reduced MIP has 14132 binaries, 70 generals, 0 SOSs, and 24556 indicators. Probing fixed 13162 vars, tightened 106 bounds. Probing changed sense of 6 constraints. Probing time = 1.77 sec. (459.46 ticks) Cover probing fixed 5 vars, tightened 849 bounds. MIP Presolve eliminated 8163 rows and 13921 columns. MIP Presolve modified 156 coefficients. Reduced MIP has 271 rows, 313 columns, and 1724 nonzeros. Reduced MIP has 282 binaries, 14 generals, 0 SOSs, and 593 indicators. Probing fixed 0 vars, tightened 2 bounds. Probing time = 0.03 sec. (10.94 ticks) Cover probing fixed 0 vars, tightened 10 bounds. MIP Presolve modified 24 coefficients. Reduced MIP has 271 rows, 313 columns, and 1724 nonzeros. Reduced MIP has 282 binaries, 14 generals, 0 SOSs, and 593 indicators. Probing time = 0.02 sec. (3.42 ticks) Clique table members: 12529. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.00 sec. (2.27 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 37569.0000 30401.9999 19.08% 0 0 31136.9339 30 37569.0000 31136.9339 171 17.12% * 0+ 0 31145.0000 31136.9339 0.03% 0 0 cutoff 31145.0000 199 0.00% Elapsed time = 3.51 sec. (3471.73 ticks, tree = 0.01 MB) Clique cuts applied: 11 Implied bound cuts applied: 10 Gomory fractional cuts applied: 1 Root node processing (before b&c): Real time = 3.51 sec. (3471.93 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 3.51 sec. (3471.93 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 31145 199 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 2: INFEASIBILITY FIXING FINISHED -------- ------- GROUP 2: PHASE II: OPTIMIZATION ITERATION #1 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 6 set Conf := (13,14,8) (13,14,9) (13,14,11) (13,14,12) (13,14,15) (15,16,44); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 14310 rows, 19192 columns, and 92212 nonzeros. Reduced MIP has 16740 binaries, 70 generals, 0 SOSs, and 27369 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 1886 rows and 1431 columns. MIP Presolve modified 15413 coefficients. Reduced MIP has 11943 rows, 16361 columns, and 92861 nonzeros. Reduced MIP has 15053 binaries, 70 generals, 0 SOSs, and 25019 indicators. Probing fixed 13564 vars, tightened 1040 bounds. Probing changed sense of 33 constraints. Probing time = 2.31 sec. (626.37 ticks) Cover probing fixed 5 vars, tightened 1778 bounds. MIP Presolve eliminated 10764 rows and 15249 columns. MIP Presolve modified 827 coefficients. Reduced MIP has 1018 rows, 890 columns, and 4884 nonzeros. Reduced MIP has 706 binaries, 45 generals, 0 SOSs, and 1431 indicators. Probing fixed 1 vars, tightened 103 bounds. Probing changed sense of 2 constraints. Probing time = 0.06 sec. (31.44 ticks) Cover probing fixed 0 vars, tightened 62 bounds. MIP Presolve eliminated 347 rows and 348 columns. MIP Presolve modified 296 coefficients. Reduced MIP has 671 rows, 542 columns, and 2982 nonzeros. Reduced MIP has 413 binaries, 24 generals, 0 SOSs, and 818 indicators. Probing fixed 0 vars, tightened 55 bounds. Probing time = 0.03 sec. (18.82 ticks) MIP Presolve modified 114 coefficients. Reduced MIP has 671 rows, 542 columns, and 2982 nonzeros. Reduced MIP has 413 binaries, 24 generals, 0 SOSs, and 818 indicators. Probing fixed 0 vars, tightened 1 bounds. Probing time = 0.02 sec. (7.42 ticks) Clique table members: 11093. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.00 sec. (4.06 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 46775.0000 30167.9997 35.50% 0 0 31120.3320 15 46775.0000 31120.3320 242 33.47% * 0+ 0 31212.9994 31120.3320 0.30% 0 0 31144.3335 27 31212.9994 Cuts: 33 255 0.22% * 0+ 0 31145.0000 31145.0000 0.00% 0 0 cutoff 31145.0000 31145.0000 261 0.00% Elapsed time = 4.08 sec. (3076.42 ticks, tree = 0.01 MB) Clique cuts applied: 16 Implied bound cuts applied: 10 Root node processing (before b&c): Real time = 4.08 sec. (3076.68 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 4.08 sec. (3076.68 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 31145 261 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 2: PHASE II: OPTIMIZATION ITERATION #2 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 0 set Conf := (13,14,8) (13,14,9) (13,14,11) (13,14,12) (13,14,15) (15,16,44); ------- GROUP 2: CONFLICT-FREE SOLUTION FOUND AFTER #2 ITERATIONS -------- ---------- START PROCESSING FOR THE FIRST 3 GROUP(S)----------- CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Infeasible indicator constraint Root node processing (before b&c): Real time = 0.31 sec. (306.61 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 0.31 sec. (306.61 ticks) CPLEX 12.6.3.0: integer infeasible. 0 MIP simplex iterations 0 branch-and-bound nodes No basis. GROUP 3: PHASE I: TRYING TO FIX INFEASIBILITY BY ENLARGING STEPS ... ------- GROUP 3: FIXXING ITERATION #1 --------- a = 21 Step[a] = 12 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 8472 rows, 13591 columns, and 65331 nonzeros. Reduced MIP has 13449 binaries, 66 generals, 0 SOSs, and 22729 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 873 rows and 492 columns. MIP Presolve modified 10825 coefficients. Reduced MIP has 7216 rows, 12758 columns, and 70097 nonzeros. Reduced MIP has 12616 binaries, 66 generals, 0 SOSs, and 22192 indicators. Probing fixed 6255 vars, tightened 15 bounds. Probing changed sense of 23 constraints. Probing time = 1.34 sec. (473.66 ticks) Root node processing (before b&c): Real time = 2.74 sec. (2663.68 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 2.74 sec. (2663.68 ticks) CPLEX 12.6.3.0: integer infeasible. 0 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 3 times No basis. ------- GROUP 3: FIXXING ITERATION #2 --------- a = 19 Step[a] = 13 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 8732 rows, 13963 columns, and 67200 nonzeros. Reduced MIP has 13819 binaries, 67 generals, 0 SOSs, and 23349 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 886 rows and 482 columns. MIP Presolve modified 10928 coefficients. Reduced MIP has 7461 rows, 13137 columns, and 72920 nonzeros. Reduced MIP has 12993 binaries, 67 generals, 0 SOSs, and 22833 indicators. Probing fixed 7714 vars, tightened 25 bounds. Probing changed sense of 13 constraints. Probing time = 1.42 sec. (498.42 ticks) Root node processing (before b&c): Real time = 2.91 sec. (2981.72 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 2.91 sec. (2981.72 ticks) CPLEX 12.6.3.0: integer infeasible. 0 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 3 times No basis. ------- GROUP 3: FIXXING ITERATION #3 --------- a = 21 Step[a] = 13 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 8987 rows, 14334 columns, and 69056 nonzeros. Reduced MIP has 14188 binaries, 68 generals, 0 SOSs, and 23967 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 899 rows and 472 columns. MIP Presolve modified 11521 coefficients. Reduced MIP has 7701 rows, 13515 columns, and 75666 nonzeros. Reduced MIP has 13369 binaries, 68 generals, 0 SOSs, and 23472 indicators. Probing fixed 10565 vars, tightened 43 bounds. Probing changed sense of 11 constraints. Probing time = 1.77 sec. (506.23 ticks) Root node processing (before b&c): Real time = 3.22 sec. (3066.98 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 3.22 sec. (3066.98 ticks) CPLEX 12.6.3.0: integer infeasible. 0 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 4 times No basis. ------- GROUP 3: FIXXING ITERATION #4 --------- a = 18 Step[a] = 14 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 9253 rows, 14720 columns, and 71005 nonzeros. Reduced MIP has 14572 binaries, 69 generals, 0 SOSs, and 24615 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 909 rows and 473 columns. MIP Presolve modified 11479 coefficients. Reduced MIP has 7957 rows, 13898 columns, and 77550 nonzeros. Reduced MIP has 13750 binaries, 69 generals, 0 SOSs, and 24119 indicators. Probing fixed 11866 vars, tightened 74 bounds. Probing changed sense of 27 constraints. Probing time = 1.97 sec. (516.39 ticks) Root node processing (before b&c): Real time = 3.50 sec. (3184.18 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 3.50 sec. (3184.18 ticks) CPLEX 12.6.3.0: integer infeasible. 0 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 4 times No basis. ------- GROUP 3: FIXXING ITERATION #5 --------- a = 19 Step[a] = 14 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 9519 rows, 15106 columns, and 72954 nonzeros. Reduced MIP has 14956 binaries, 70 generals, 0 SOSs, and 25263 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 908 rows and 473 columns. MIP Presolve modified 11511 coefficients. Reduced MIP has 8221 rows, 14283 columns, and 79459 nonzeros. Reduced MIP has 14133 binaries, 70 generals, 0 SOSs, and 24767 indicators. Probing fixed 8172 vars, tightened 33 bounds. Probing changed sense of 10 constraints. Probing time = 1.84 sec. (549.06 ticks) Root node processing (before b&c): Real time = 3.64 sec. (3561.83 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 3.64 sec. (3561.83 ticks) CPLEX 12.6.3.0: integer infeasible. 0 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 3 times No basis. ------- GROUP 3: FIXXING ITERATION #6 --------- a = 21 Step[a] = 14 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 9780 rows, 15491 columns, and 74890 nonzeros. Reduced MIP has 15339 binaries, 71 generals, 0 SOSs, and 25909 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 909 rows and 473 columns. MIP Presolve modified 12029 coefficients. Reduced MIP has 8479 rows, 14666 columns, and 81318 nonzeros. Reduced MIP has 14514 binaries, 71 generals, 0 SOSs, and 25413 indicators. Probing fixed 12939 vars, tightened 94 bounds. Probing changed sense of 4 constraints. Probing time = 2.13 sec. (557.36 ticks) Cover probing fixed 35 vars, tightened 559 bounds. MIP Presolve eliminated 7476 rows and 13553 columns. MIP Presolve modified 482 coefficients. Reduced MIP has 851 rows, 953 columns, and 5757 nonzeros. Reduced MIP has 887 binaries, 30 generals, 0 SOSs, and 1794 indicators. Probing fixed 46 vars, tightened 6 bounds. Probing time = 0.11 sec. (52.69 ticks) Cover probing fixed 0 vars, tightened 29 bounds. MIP Presolve eliminated 419 rows and 448 columns. MIP Presolve modified 123 coefficients. Reduced MIP has 431 rows, 504 columns, and 3037 nonzeros. Reduced MIP has 469 binaries, 16 generals, 0 SOSs, and 912 indicators. Probing fixed 0 vars, tightened 2 bounds. Probing time = 0.05 sec. (27.07 ticks) Cover probing fixed 0 vars, tightened 4 bounds. MIP Presolve modified 22 coefficients. Reduced MIP has 431 rows, 504 columns, and 3037 nonzeros. Reduced MIP has 469 binaries, 16 generals, 0 SOSs, and 912 indicators. Probing time = 0.00 sec. (4.10 ticks) Cover probing fixed 0 vars, tightened 1 bounds. Clique table members: 30568. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.00 sec. (3.25 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 53349.0000 52080.9998 2.38% 0 0 52765.0000 19 53349.0000 52765.0000 174 1.09% * 0+ 0 52765.0000 52765.0000 0.00% 0 0 cutoff 52765.0000 52765.0000 185 0.00% Elapsed time = 4.14 sec. (3713.42 ticks, tree = 0.01 MB) Implied bound cuts applied: 10 Root node processing (before b&c): Real time = 4.14 sec. (3713.63 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 4.14 sec. (3713.63 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 52765 185 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 3: INFEASIBILITY FIXING FINISHED -------- ------- GROUP 3: PHASE II: OPTIMIZATION ITERATION #1 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 3 set Conf := (19,20,44) (20,21,28) (17,18,43); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 11648 rows, 17119 columns, and 83236 nonzeros. Reduced MIP has 16169 binaries, 71 generals, 0 SOSs, and 26889 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 1373 rows and 1017 columns. MIP Presolve modified 12129 coefficients. Reduced MIP has 9684 rows, 15431 columns, and 86653 nonzeros. Reduced MIP has 14825 binaries, 71 generals, 0 SOSs, and 25562 indicators. Probing fixed 13073 vars, tightened 1178 bounds. Probing changed sense of 16 constraints. Probing time = 2.44 sec. (657.42 ticks) Cover probing fixed 42 vars, tightened 735 bounds. MIP Presolve eliminated 8370 rows and 14056 columns. MIP Presolve modified 753 coefficients. Reduced MIP has 1140 rows, 1157 columns, and 6934 nonzeros. Reduced MIP has 1023 binaries, 44 generals, 0 SOSs, and 2118 indicators. Probing fixed 42 vars, tightened 25 bounds. Probing changed sense of 2 constraints. Probing time = 0.11 sec. (58.36 ticks) Cover probing fixed 0 vars, tightened 39 bounds. MIP Presolve eliminated 431 rows and 441 columns. MIP Presolve modified 150 coefficients. Reduced MIP has 710 rows, 715 columns, and 4180 nonzeros. Reduced MIP has 614 binaries, 28 generals, 0 SOSs, and 1238 indicators. Probing fixed 0 vars, tightened 7 bounds. Probing time = 0.05 sec. (32.20 ticks) MIP Presolve eliminated 2 rows and 0 columns. MIP Presolve modified 48 coefficients. Reduced MIP has 708 rows, 715 columns, and 4176 nonzeros. Reduced MIP has 614 binaries, 28 generals, 0 SOSs, and 1238 indicators. Probing time = 0.02 sec. (4.24 ticks) Clique table members: 34063. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.00 sec. (4.57 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 52764.6733 30 52764.6733 339 0 0 52765.0000 15 Cuts: 47 363 0 0 52765.0000 2 Cuts: 36 369 0 0 52765.0000 2 Cuts: 5 376 * 0+ 0 52773.0000 52765.0000 0.02% Repair heuristic found nothing. Repeating presolve. MIP Presolve eliminated 582 rows and 590 columns. MIP Presolve modified 1156 coefficients. Reduced MIP has 66 rows, 57 columns, and 186 nonzeros. Reduced MIP has 20 binaries, 14 generals, 0 SOSs, and 85 indicators. Probing fixed 0 vars, tightened 26 bounds. Probing changed sense of 2 constraints. Probing time = 0.00 sec. (0.13 ticks) Cover probing fixed 0 vars, tightened 2 bounds. MIP Presolve eliminated 13 rows and 19 columns. MIP Presolve modified 30 coefficients. Reduced MIP has 65 rows, 38 columns, and 181 nonzeros. Reduced MIP has 13 binaries, 2 generals, 0 SOSs, and 9 indicators. Probing time = 0.00 sec. (0.08 ticks) Cover probing fixed 0 vars, tightened 3 bounds. MIP Presolve eliminated 10 rows and 0 columns. Reduced MIP has 55 rows, 38 columns, and 161 nonzeros. Reduced MIP has 13 binaries, 2 generals, 0 SOSs, and 9 indicators. Represolve time = 0.02 sec. (8.25 ticks) Probing time = 0.00 sec. (0.05 ticks) Clique table members: 14. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.00 sec. (0.16 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 52773.0000 52765.0000 0.02% 0 0 52765.0000 1 52773.0000 52765.0000 402 0.02% 0 0 52765.0000 1 52773.0000 MIRcuts: 1 403 0.02% 0 0 52765.0000 4 52773.0000 Cuts: 5 412 0.02% * 0+ 0 52769.0000 52765.0000 0.01% Repair heuristic found nothing. 0 1 52765.0000 4 52769.0000 52765.0000 412 0.01% Elapsed time = 4.36 sec. (3329.60 ticks, tree = 0.01 MB) Clique cuts applied: 2 Implied bound cuts applied: 1 Mixed integer rounding cuts applied: 1 Root node processing (before b&c): Real time = 4.38 sec. (3329.60 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.35 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 4.38 sec. (3329.95 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 52769 431 MIP simplex iterations 8 branch-and-bound nodes No basis. ------- GROUP 3: PHASE II: OPTIMIZATION ITERATION #2 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 0 set Conf := (19,20,44) (20,21,28) (17,18,43); ------- GROUP 3: CONFLICT-FREE SOLUTION FOUND AFTER #2 ITERATIONS -------- ---------- START PROCESSING FOR THE FIRST 4 GROUP(S)----------- CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Infeasibility row 'c5742': 0 = 1. Root node processing (before b&c): Real time = 0.27 sec. (237.92 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 0.27 sec. (237.92 ticks) CPLEX 12.6.3.0: integer infeasible. 0 MIP simplex iterations 0 branch-and-bound nodes No basis. GROUP 4: PHASE I: TRYING TO FIX INFEASIBILITY BY ENLARGING STEPS ... ------- GROUP 4: FIXXING ITERATION #1 --------- a = 23 Step[a] = 12 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 8855 rows, 13531 columns, and 65118 nonzeros. Reduced MIP has 13387 binaries, 67 generals, 0 SOSs, and 22279 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 909 rows and 479 columns. MIP Presolve modified 10485 coefficients. Reduced MIP has 7578 rows, 12720 columns, and 71353 nonzeros. Reduced MIP has 12576 binaries, 67 generals, 0 SOSs, and 21769 indicators. Probing fixed 3489 vars, tightened 0 bounds. Probing time = 1.73 sec. (414.76 ticks) Root node processing (before b&c): Real time = 3.30 sec. (2824.56 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 3.30 sec. (2824.56 ticks) CPLEX 12.6.3.0: integer infeasible. 0 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 3 times No basis. ------- GROUP 4: FIXXING ITERATION #2 --------- a = 23 Step[a] = 13 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 9085 rows, 13831 columns, and 66607 nonzeros. Reduced MIP has 13685 binaries, 68 generals, 0 SOSs, and 22758 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 915 rows and 480 columns. MIP Presolve modified 10949 coefficients. Reduced MIP has 7798 rows, 13015 columns, and 73299 nonzeros. Reduced MIP has 12869 binaries, 68 generals, 0 SOSs, and 22249 indicators. Probing fixed 7166 vars, tightened 11 bounds. Probing changed sense of 35 constraints. Probing time = 1.91 sec. (440.37 ticks) Root node processing (before b&c): Real time = 3.44 sec. (2899.06 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 3.44 sec. (2899.06 ticks) CPLEX 12.6.3.0: integer infeasible. 0 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 3 times No basis. ------- GROUP 4: FIXXING ITERATION #3 --------- a = 23 Step[a] = 14 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 9327 rows, 14164 columns, and 68258 nonzeros. Reduced MIP has 14016 binaries, 69 generals, 0 SOSs, and 23300 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 920 rows and 482 columns. MIP Presolve modified 11479 coefficients. Reduced MIP has 8032 rows, 13343 columns, and 75099 nonzeros. Reduced MIP has 13195 binaries, 69 generals, 0 SOSs, and 22789 indicators. Probing fixed 11986 vars, tightened 109 bounds. Probing time = 2.11 sec. (438.62 ticks) Cover probing fixed 8 vars, tightened 554 bounds. MIP Presolve eliminated 7603 rows and 12845 columns. MIP Presolve modified 216 coefficients. Reduced MIP has 363 rows, 423 columns, and 2345 nonzeros. Reduced MIP has 388 binaries, 16 generals, 0 SOSs, and 783 indicators. Probing fixed 20 vars, tightened 4 bounds. Probing time = 0.05 sec. (18.58 ticks) Cover probing fixed 0 vars, tightened 7 bounds. MIP Presolve eliminated 20 rows and 31 columns. MIP Presolve modified 89 coefficients. Reduced MIP has 343 rows, 392 columns, and 2236 nonzeros. Reduced MIP has 357 binaries, 16 generals, 0 SOSs, and 740 indicators. Probing fixed 0 vars, tightened 1 bounds. Probing time = 0.02 sec. (7.53 ticks) Clique table members: 18191. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.00 sec. (2.44 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 80791.0000 77927.9996 3.54% 0 0 78571.0000 18 80791.0000 78571.0000 154 2.75% * 0+ 0 78571.0000 78571.0000 0.00% 0 0 cutoff 78571.0000 78571.0000 164 0.00% Elapsed time = 4.00 sec. (3135.83 ticks, tree = 0.01 MB) Implied bound cuts applied: 10 Root node processing (before b&c): Real time = 4.00 sec. (3136.03 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 4.00 sec. (3136.03 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 78571 164 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 4: INFEASIBILITY FIXING FINISHED -------- ------- GROUP 4: PHASE II: OPTIMIZATION ITERATION #1 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 1 set Conf := (23,25,43); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 9792 rows, 14620 columns, and 69821 nonzeros. Reduced MIP has 14224 binaries, 69 generals, 0 SOSs, and 23548 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 1057 rows and 635 columns. MIP Presolve modified 11479 coefficients. Reduced MIP has 8302 rows, 13518 columns, and 75998 nonzeros. Reduced MIP has 13265 binaries, 69 generals, 0 SOSs, and 22824 indicators. Probing fixed 12021 vars, tightened 351 bounds. Probing changed sense of 4 constraints. Probing time = 2.17 sec. (477.81 ticks) Cover probing fixed 8 vars, tightened 1050 bounds. MIP Presolve eliminated 7870 rows and 13017 columns. MIP Presolve modified 218 coefficients. Reduced MIP has 363 rows, 423 columns, and 2345 nonzeros. Reduced MIP has 388 binaries, 16 generals, 0 SOSs, and 783 indicators. Probing fixed 20 vars, tightened 4 bounds. Probing time = 0.06 sec. (18.59 ticks) Cover probing fixed 0 vars, tightened 5 bounds. MIP Presolve eliminated 20 rows and 31 columns. MIP Presolve modified 89 coefficients. Reduced MIP has 343 rows, 392 columns, and 2236 nonzeros. Reduced MIP has 357 binaries, 16 generals, 0 SOSs, and 740 indicators. Probing fixed 0 vars, tightened 1 bounds. Probing time = 0.03 sec. (7.52 ticks) Cover probing fixed 0 vars, tightened 1 bounds. Clique table members: 18191. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.00 sec. (2.31 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 79013.0000 77963.9996 1.33% 0 0 78607.0000 18 79013.0000 78607.0000 156 0.51% * 0+ 0 78607.0000 78607.0000 0.00% 0 0 cutoff 78607.0000 78607.0000 167 0.00% Elapsed time = 3.97 sec. (2362.80 ticks, tree = 0.01 MB) Implied bound cuts applied: 10 Root node processing (before b&c): Real time = 3.98 sec. (2362.99 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 3.98 sec. (2362.99 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 78607 167 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 4: PHASE II: OPTIMIZATION ITERATION #2 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 1 set Conf := (23,25,43) (23,25,16); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 10262 rows, 15082 columns, and 71827 nonzeros. Reduced MIP has 14434 binaries, 69 generals, 0 SOSs, and 23800 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 1149 rows and 761 columns. MIP Presolve modified 11494 coefficients. Reduced MIP has 8623 rows, 13713 columns, and 77343 nonzeros. Reduced MIP has 13349 binaries, 69 generals, 0 SOSs, and 22866 indicators. Probing fixed 12065 vars, tightened 606 bounds. Probing changed sense of 7 constraints. Probing time = 1.94 sec. (478.02 ticks) Cover probing fixed 12 vars, tightened 1607 bounds. MIP Presolve eliminated 8196 rows and 13219 columns. MIP Presolve modified 221 coefficients. Reduced MIP has 359 rows, 418 columns, and 2317 nonzeros. Reduced MIP has 383 binaries, 16 generals, 0 SOSs, and 774 indicators. Probing fixed 16 vars, tightened 4 bounds. Probing time = 0.05 sec. (18.35 ticks) Cover probing fixed 0 vars, tightened 12 bounds. MIP Presolve eliminated 16 rows and 26 columns. MIP Presolve modified 69 coefficients. Reduced MIP has 343 rows, 392 columns, and 2236 nonzeros. Reduced MIP has 357 binaries, 16 generals, 0 SOSs, and 740 indicators. Probing fixed 0 vars, tightened 1 bounds. Probing time = 0.02 sec. (7.52 ticks) Cover probing fixed 0 vars, tightened 8 bounds. Clique table members: 18191. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.00 sec. (2.36 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 80623.0000 78000.9996 3.25% 0 0 78639.0000 18 80623.0000 78639.0000 158 2.46% * 0+ 0 78639.0000 78639.0000 0.00% 0 0 cutoff 78639.0000 78639.0000 168 0.00% Elapsed time = 3.70 sec. (2461.97 ticks, tree = 0.01 MB) Implied bound cuts applied: 10 Root node processing (before b&c): Real time = 3.70 sec. (2462.17 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 3.70 sec. (2462.17 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 78639 168 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 4: PHASE II: OPTIMIZATION ITERATION #3 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 1 set Conf := (23,25,43) (23,25,16) (23,25,15); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 10766 rows, 15565 columns, and 73444 nonzeros. Reduced MIP has 14651 binaries, 69 generals, 0 SOSs, and 24066 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 1235 rows and 875 columns. MIP Presolve modified 11532 coefficients. Reduced MIP has 8982 rows, 13925 columns, and 78434 nonzeros. Reduced MIP has 13447 binaries, 69 generals, 0 SOSs, and 22915 indicators. Probing fixed 12107 vars, tightened 898 bounds. Probing changed sense of 4 constraints. Probing time = 2.02 sec. (493.36 ticks) Cover probing fixed 8 vars, tightened 1624 bounds. MIP Presolve eliminated 8361 rows and 13264 columns. MIP Presolve modified 344 coefficients. Reduced MIP has 557 rows, 551 columns, and 3040 nonzeros. Reduced MIP has 464 binaries, 28 generals, 0 SOSs, and 971 indicators. Probing fixed 21 vars, tightened 50 bounds. Probing time = 0.05 sec. (19.82 ticks) Cover probing fixed 0 vars, tightened 20 bounds. MIP Presolve eliminated 214 rows and 159 columns. MIP Presolve modified 69 coefficients. Reduced MIP has 343 rows, 392 columns, and 2236 nonzeros. Reduced MIP has 357 binaries, 16 generals, 0 SOSs, and 740 indicators. Probing fixed 0 vars, tightened 2 bounds. Probing time = 0.03 sec. (16.03 ticks) Cover probing fixed 0 vars, tightened 5 bounds. MIP Presolve modified 16 coefficients. Reduced MIP has 343 rows, 392 columns, and 2236 nonzeros. Reduced MIP has 357 binaries, 16 generals, 0 SOSs, and 740 indicators. Probing fixed 0 vars, tightened 1 bounds. Probing time = 0.03 sec. (7.55 ticks) Clique table members: 18191. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.00 sec. (2.45 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 80905.0000 78037.9996 3.54% 0 0 78675.0000 18 80905.0000 78675.0000 163 2.76% * 0+ 0 78675.0000 78675.0000 0.00% 0 0 cutoff 78675.0000 78675.0000 173 0.00% Elapsed time = 3.59 sec. (2372.76 ticks, tree = 0.01 MB) Implied bound cuts applied: 10 Root node processing (before b&c): Real time = 3.59 sec. (2372.97 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 3.59 sec. (2372.97 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 78675 173 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 4: PHASE II: OPTIMIZATION ITERATION #4 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 0 set Conf := (23,25,43) (23,25,16) (23,25,15); ------- GROUP 4: CONFLICT-FREE SOLUTION FOUND AFTER #4 ITERATIONS -------- ---------- START PROCESSING FOR THE FIRST 5 GROUP(S)----------- CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 MIP Presolve eliminated 877 rows and 449 columns. MIP Presolve modified 16560 coefficients. Reduced MIP has 10082 rows, 16475 columns, and 90652 nonzeros. Reduced MIP has 16309 binaries, 78 generals, 0 SOSs, and 28080 indicators. Probing fixed 14826 vars, tightened 81 bounds. Probing time = 3.64 sec. (904.51 ticks) Cover probing fixed 15 vars, tightened 910 bounds. MIP Presolve eliminated 9250 rows and 15474 columns. MIP Presolve modified 435 coefficients. Reduced MIP has 722 rows, 872 columns, and 4604 nonzeros. Reduced MIP has 798 binaries, 34 generals, 0 SOSs, and 1616 indicators. Probing fixed 53 vars, tightened 11 bounds. Probing changed sense of 4 constraints. Probing time = 0.09 sec. (38.40 ticks) Cover probing fixed 0 vars, tightened 17 bounds. MIP Presolve eliminated 390 rows and 477 columns. MIP Presolve modified 35 coefficients. Reduced MIP has 332 rows, 395 columns, and 2143 nonzeros. Reduced MIP has 359 binaries, 16 generals, 0 SOSs, and 757 indicators. Probing fixed 0 vars, tightened 4 bounds. Probing time = 0.05 sec. (16.19 ticks) Cover probing fixed 0 vars, tightened 12 bounds. Reduced MIP has 332 rows, 395 columns, and 2143 nonzeros. Reduced MIP has 359 binaries, 16 generals, 0 SOSs, and 757 indicators. Probing time = 0.02 sec. (3.59 ticks) Clique table members: 16605. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.00 sec. (2.30 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 109198.0000 107700.9992 1.37% 0 0 108548.0000 20 109198.0000 108548.0000 158 0.60% * 0+ 0 108548.0000 108548.0000 0.00% 0 0 cutoff 108548.0000 108548.0000 171 0.00% Elapsed time = 6.16 sec. (4892.72 ticks, tree = 0.01 MB) Clique cuts applied: 7 Implied bound cuts applied: 13 Root node processing (before b&c): Real time = 6.17 sec. (4892.96 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 6.17 sec. (4892.96 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 108548 171 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 5: PHASE II: OPTIMIZATION ITERATION #1 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 12 set Conf := (28,29,43) (28,30,29) (29,31,33) (30,32,12) (31,32,11) (27,29,12) (28,29,44) (29,30,32) (30,31,44) (30,32,15) (31,32,42) (27,29,15); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 21552 rows, 26218 columns, and 127827 nonzeros. Reduced MIP has 21372 binaries, 78 generals, 0 SOSs, and 33862 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 3078 rows and 2873 columns. MIP Presolve modified 17151 coefficients. Reduced MIP has 17754 rows, 21259 columns, and 122597 nonzeros. Reduced MIP has 18305 binaries, 78 generals, 0 SOSs, and 29059 indicators. Probing fixed 15697 vars, tightened 1972 bounds. Probing changed sense of 36 constraints. Probing time = 6.64 sec. (1819.59 ticks) Cover probing fixed 18 vars, tightened 3259 bounds. MIP Presolve eliminated 15623 rows and 19277 columns. MIP Presolve modified 2492 coefficients. Reduced MIP has 1860 rows, 1591 columns, and 8604 nonzeros. Reduced MIP has 1256 binaries, 72 generals, 0 SOSs, and 2352 indicators. Probing fixed 58 vars, tightened 197 bounds. Probing changed sense of 6 constraints. Probing time = 0.16 sec. (73.31 ticks) MIP Presolve eliminated 95 rows and 91 columns. MIP Presolve modified 1361 coefficients. Reduced MIP has 1764 rows, 1497 columns, and 8132 nonzeros. Reduced MIP has 1165 binaries, 69 generals, 0 SOSs, and 2236 indicators. Probing fixed 0 vars, tightened 9 bounds. Probing time = 0.06 sec. (23.70 ticks) Clique table members: 38486. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.03 sec. (19.16 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 108438.5709 45 108438.5709 851 * 0+ 0 108555.9994 108438.5709 0.11% 0 0 108548.0000 27 108555.9994 Cuts: 118 957 0.01% 0 0 108548.0000 26 108555.9994 Cuts: 6 963 0.01% Repair heuristic found nothing. Repeating presolve. MIP Presolve eliminated 1504 rows and 1246 columns. MIP Presolve modified 700 coefficients. Reduced MIP has 218 rows, 166 columns, and 743 nonzeros. Reduced MIP has 91 binaries, 20 generals, 0 SOSs, and 222 indicators. Probing fixed 12 vars, tightened 104 bounds. Probing changed sense of 10 constraints. Probing time = 0.00 sec. (1.10 ticks) Cover probing fixed 0 vars, tightened 96 bounds. MIP Presolve eliminated 63 rows and 32 columns. MIP Presolve modified 161 coefficients. Reduced MIP has 189 rows, 132 columns, and 624 nonzeros. Reduced MIP has 66 binaries, 13 generals, 0 SOSs, and 148 indicators. Probing fixed 0 vars, tightened 24 bounds. Probing changed sense of 1 constraints. Probing time = 0.00 sec. (0.64 ticks) Cover probing fixed 0 vars, tightened 26 bounds. MIP Presolve eliminated 22 rows and 5 columns. MIP Presolve modified 75 coefficients. Reduced MIP has 167 rows, 127 columns, and 578 nonzeros. Reduced MIP has 61 binaries, 13 generals, 0 SOSs, and 148 indicators. Probing fixed 0 vars, tightened 12 bounds. Probing time = 0.00 sec. (0.56 ticks) Cover probing fixed 0 vars, tightened 3 bounds. MIP Presolve modified 28 coefficients. Reduced MIP has 167 rows, 127 columns, and 578 nonzeros. Reduced MIP has 61 binaries, 13 generals, 0 SOSs, and 148 indicators. Represolve time = 0.03 sec. (15.94 ticks) Probing fixed 0 vars, tightened 2 bounds. Probing time = 0.02 sec. (0.57 ticks) Clique table members: 411. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.00 sec. (0.54 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 108555.9994 108548.0000 0.01% 0 0 108548.0000 6 108555.9994 108548.0000 1014 0.01% 0 0 cutoff 108555.9994 1023 0.00% Elapsed time = 9.30 sec. (5180.07 ticks, tree = 0.01 MB) Clique cuts applied: 10 Cover cuts applied: 1 Implied bound cuts applied: 13 Mixed integer rounding cuts applied: 3 Gomory fractional cuts applied: 2 Root node processing (before b&c): Real time = 9.30 sec. (5180.38 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 9.30 sec. (5180.38 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 108555.9994 1023 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 5: PHASE II: OPTIMIZATION ITERATION #2 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 7 set Conf := (28,29,43) (29,31,33) (31,32,11) (28,29,32) (30,31,35) (28,29,44) (30,31,44) (31,32,42) (28,30,32) (30,32,11) (28,30,29) (30,32,12) (27,29,12) (29,30,33) (30,32,42) (29,30,32) (30,32,15) (27,29,15) (29,31,35); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 27696 rows, 31879 columns, and 150020 nonzeros. Reduced MIP has 23865 binaries, 78 generals, 0 SOSs, and 37030 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 4217 rows and 4171 columns. MIP Presolve modified 17676 coefficients. Reduced MIP has 22362 rows, 23925 columns, and 138705 nonzeros. Reduced MIP has 19592 binaries, 78 generals, 0 SOSs, and 29703 indicators. Probing fixed 16259 vars, tightened 4740 bounds. Probing changed sense of 97 constraints. Probing time = 7.42 sec. (2262.96 ticks) Cover probing fixed 12 vars, tightened 4274 bounds. MIP Presolve eliminated 19588 rows and 21554 columns. MIP Presolve modified 3953 coefficients. Reduced MIP has 2401 rows, 1885 columns, and 10183 nonzeros. Reduced MIP has 1424 binaries, 72 generals, 0 SOSs, and 2438 indicators. Probing fixed 56 vars, tightened 166 bounds. Probing changed sense of 6 constraints. Probing time = 0.09 sec. (29.56 ticks) MIP Presolve eliminated 82 rows and 87 columns. MIP Presolve modified 2732 coefficients. Reduced MIP has 2316 rows, 1793 columns, and 9817 nonzeros. Reduced MIP has 1335 binaries, 69 generals, 0 SOSs, and 2321 indicators. Probing fixed 0 vars, tightened 10 bounds. Probing time = 0.06 sec. (28.48 ticks) Clique table members: 38620. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.03 sec. (25.65 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 108438.5709 60 108438.5709 942 * 0+ 0 108643.9988 108438.5709 0.19% 0 0 108548.0000 27 108643.9988 Cuts: 137 1084 0.09% 0 0 108548.0000 11 108643.9988 Cuts: 15 1100 0.09% Repair heuristic found nothing. Repeating presolve. MIP Presolve eliminated 1483 rows and 1062 columns. MIP Presolve modified 1466 coefficients. Reduced MIP has 745 rows, 633 columns, and 3287 nonzeros. Reduced MIP has 473 binaries, 42 generals, 0 SOSs, and 1011 indicators. Probing fixed 64 vars, tightened 146 bounds. Probing time = 0.03 sec. (16.54 ticks) Cover probing fixed 0 vars, tightened 90 bounds. MIP Presolve eliminated 66 rows and 89 columns. MIP Presolve modified 708 coefficients. Reduced MIP has 692 rows, 542 columns, and 2865 nonzeros. Reduced MIP has 388 binaries, 37 generals, 0 SOSs, and 809 indicators. Probing fixed 0 vars, tightened 35 bounds. Probing time = 0.03 sec. (12.75 ticks) MIP Presolve eliminated 15 rows and 1 columns. MIP Presolve modified 128 coefficients. Reduced MIP has 675 rows, 539 columns, and 2826 nonzeros. Reduced MIP has 386 binaries, 36 generals, 0 SOSs, and 809 indicators. Represolve time = 0.14 sec. (69.78 ticks) Probing fixed 0 vars, tightened 30 bounds. Probing time = 0.03 sec. (12.19 ticks) Clique table members: 7584. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.00 sec. (4.30 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 108643.9988 108548.0000 0.09% 0 0 108548.0000 8 108643.9988 108548.0000 1375 0.09% 0 0 108548.3975 8 108643.9988 Cuts: 36 1425 0.09% 0 0 108558.2671 5 108643.9988 Cuts: 24 1466 0.08% 0 0 108558.2671 6 108643.9988 MIRcuts: 1 1467 0.08% Repair heuristic found nothing. 0 2 108558.2671 6 108643.9988 108558.2671 1467 0.08% Elapsed time = 10.45 sec. (6031.04 ticks, tree = 0.01 MB) Clique cuts applied: 39 Cover cuts applied: 5 Implied bound cuts applied: 41 Flow cuts applied: 1 Mixed integer rounding cuts applied: 7 Gomory fractional cuts applied: 3 Root node processing (before b&c): Real time = 10.45 sec. (6030.46 ticks) Parallel b&c, 4 threads: Real time = 0.01 sec. (11.39 ticks) Sync time (average) = 0.01 sec. Wait time (average) = 0.01 sec. ------------ Total (root+branch&cut) = 10.47 sec. (6041.85 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 108643.9988 1670 MIP simplex iterations 25 branch-and-bound nodes Tried aggregator 2 times No basis. ------- GROUP 5: PHASE II: OPTIMIZATION ITERATION #3 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 4 set Conf := (28,29,43) (29,31,33) (31,32,11) (28,29,32) (30,31,35) (28,31,32) (28,29,44) (30,31,44) (31,32,42) (28,30,32) (30,32,11) (29,30,35) (28,30,29) (30,32,12) (27,29,12) (29,30,33) (30,32,42) (29,31,32) (29,30,32) (30,32,15) (27,29,15) (29,31,35) (28,30,33); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 31328 rows, 35235 columns, and 162938 nonzeros. Reduced MIP has 25351 binaries, 78 generals, 0 SOSs, and 38900 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 4883 rows and 4934 columns. MIP Presolve modified 17920 coefficients. Reduced MIP has 25094 rows, 25532 columns, and 148218 nonzeros. Reduced MIP has 20341 binaries, 78 generals, 0 SOSs, and 30078 indicators. Probing fixed 16599 vars, tightened 5670 bounds. Probing changed sense of 110 constraints. Probing time = 9.92 sec. (2623.65 ticks) Cover probing fixed 17 vars, tightened 4521 bounds. MIP Presolve eliminated 22067 rows and 22997 columns. MIP Presolve modified 4600 coefficients. Reduced MIP has 2620 rows, 2003 columns, and 10946 nonzeros. Reduced MIP has 1485 binaries, 73 generals, 0 SOSs, and 2469 indicators. Probing fixed 59 vars, tightened 201 bounds. Probing changed sense of 6 constraints. Probing time = 0.39 sec. (32.30 ticks) MIP Presolve eliminated 94 rows and 88 columns. MIP Presolve modified 2399 coefficients. Reduced MIP has 2522 rows, 1909 columns, and 10457 nonzeros. Reduced MIP has 1395 binaries, 69 generals, 0 SOSs, and 2351 indicators. Probing fixed 0 vars, tightened 17 bounds. Probing time = 0.13 sec. (23.27 ticks) Clique table members: 38660. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.09 sec. (35.47 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 108438.5709 51 108438.5709 1201 0 0 108548.0000 31 Cuts: 149 1370 0 0 108548.0000 30 Cuts: 11 1379 0 0 108548.0000 33 Cuts: 2 1386 * 0+ 0 120494.0000 108548.0000 9.91% * 0+ 0 108718.0000 108548.0000 0.16% Repair heuristic found nothing. Repeating presolve. MIP Presolve eliminated 1405 rows and 929 columns. MIP Presolve modified 2476 coefficients. Reduced MIP has 1006 rows, 840 columns, and 4602 nonzeros. Reduced MIP has 643 binaries, 46 generals, 0 SOSs, and 1266 indicators. Probing fixed 3 vars, tightened 191 bounds. Probing time = 0.09 sec. (37.25 ticks) MIP Presolve eliminated 35 rows and 12 columns. MIP Presolve modified 798 coefficients. Reduced MIP has 970 rows, 827 columns, and 4515 nonzeros. Reduced MIP has 638 binaries, 39 generals, 0 SOSs, and 1243 indicators. Probing fixed 0 vars, tightened 57 bounds. Probing time = 0.08 sec. (35.12 ticks) MIP Presolve modified 330 coefficients. Reduced MIP has 969 rows, 826 columns, and 4512 nonzeros. Reduced MIP has 638 binaries, 39 generals, 0 SOSs, and 1243 indicators. Represolve time = 0.34 sec. (138.27 ticks) Probing fixed 0 vars, tightened 3 bounds. Probing time = 0.03 sec. (14.07 ticks) Clique table members: 20429. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.02 sec. (12.09 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 108718.0000 108548.0000 0.16% 0 0 108548.0000 9 108718.0000 108548.0000 1926 0.16% 0 0 108548.0000 34 108718.0000 Cuts: 29 1979 0.16% 0 0 108548.7348 17 108718.0000 Cuts: 19 2013 0.16% 0 0 108562.9020 8 108718.0000 Cuts: 51 2075 0.14% 0 0 108562.9020 29 108718.0000 Cuts: 2 2148 0.14% * 0+ 0 108674.0000 108562.9020 0.10% Repair heuristic found nothing. 0 2 108562.9020 29 108674.0000 108578.0000 2148 0.09% Elapsed time = 14.84 sec. (6773.25 ticks, tree = 0.01 MB) Clique cuts applied: 45 Cover cuts applied: 6 Implied bound cuts applied: 36 Flow cuts applied: 1 Mixed integer rounding cuts applied: 14 Gomory fractional cuts applied: 3 Root node processing (before b&c): Real time = 14.86 sec. (6772.82 ticks) Parallel b&c, 4 threads: Real time = 0.03 sec. (20.81 ticks) Sync time (average) = 0.02 sec. Wait time (average) = 0.02 sec. ------------ Total (root+branch&cut) = 14.89 sec. (6793.63 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 108674 2581 MIP simplex iterations 22 branch-and-bound nodes Tried aggregator 2 times No basis. ------- GROUP 5: PHASE II: OPTIMIZATION ITERATION #4 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 6 set Conf := (28,29,43) (30,31,44) (27,29,12) (29,31,35) (28,31,32) (28,31,44) (28,29,44) (30,32,12) (27,29,15) (30,31,35) (29,30,35) (28,32,44) (28,30,29) (30,32,15) (28,29,32) (30,32,11) (29,31,32) (29,31,44) (29,30,32) (31,32,11) (28,30,32) (30,32,42) (28,29,27) (30,32,16) (29,31,33) (31,32,42) (29,30,33) (28,30,33) (28,31,35); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 36647 rows, 40156 columns, and 190913 nonzeros. Reduced MIP has 27523 binaries, 78 generals, 0 SOSs, and 41649 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 5915 rows and 6097 columns. MIP Presolve modified 18718 coefficients. Reduced MIP has 29040 rows, 27871 columns, and 166940 nonzeros. Reduced MIP has 21446 binaries, 78 generals, 0 SOSs, and 30626 indicators. Probing fixed 17066 vars, tightened 4797 bounds. Probing changed sense of 111 constraints. Probing time = 10.34 sec. (3185.78 ticks) Cover probing fixed 11 vars, tightened 6414 bounds. MIP Presolve eliminated 25303 rows and 24882 columns. MIP Presolve modified 5591 coefficients. Reduced MIP has 3201 rows, 2337 columns, and 12693 nonzeros. Reduced MIP has 1668 binaries, 71 generals, 0 SOSs, and 2567 indicators. Probing fixed 61 vars, tightened 287 bounds. Probing changed sense of 6 constraints. Probing time = 0.14 sec. (45.40 ticks) MIP Presolve eliminated 88 rows and 92 columns. MIP Presolve modified 4334 coefficients. Reduced MIP has 3108 rows, 2238 columns, and 12201 nonzeros. Reduced MIP has 1571 binaries, 69 generals, 0 SOSs, and 2444 indicators. Probing fixed 0 vars, tightened 17 bounds. Probing time = 0.09 sec. (26.64 ticks) Clique table members: 38806. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.06 sec. (36.28 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 108438.5709 50 108438.5709 890 * 0+ 0 108789.9994 108438.5709 0.32% 0 0 108548.0000 12 108789.9994 Cuts: 110 986 0.22% 0 0 108548.0000 12 108789.9994 Cuts: 19 1002 0.22% 0 0 108548.0000 12 108789.9994 Cuts: 3 1005 0.22% * 0+ 0 108702.0000 108548.0000 0.14% * 0+ 0 108674.0000 108548.0000 0.12% Repair heuristic succeeded. Repeating presolve. MIP Presolve eliminated 2082 rows and 1340 columns. MIP Presolve modified 2678 coefficients. Reduced MIP has 902 rows, 747 columns, and 3898 nonzeros. Reduced MIP has 549 binaries, 45 generals, 0 SOSs, and 1096 indicators. Probing fixed 59 vars, tightened 213 bounds. Probing time = 0.05 sec. (24.89 ticks) Cover probing fixed 0 vars, tightened 104 bounds. MIP Presolve eliminated 69 rows and 80 columns. MIP Presolve modified 858 coefficients. Reduced MIP has 863 rows, 666 columns, and 3545 nonzeros. Reduced MIP has 475 binaries, 38 generals, 0 SOSs, and 896 indicators. Probing fixed 0 vars, tightened 52 bounds. Probing time = 0.05 sec. (20.63 ticks) Cover probing fixed 0 vars, tightened 59 bounds. MIP Presolve eliminated 8 rows and 1 columns. MIP Presolve modified 287 coefficients. Reduced MIP has 853 rows, 663 columns, and 3522 nonzeros. Reduced MIP has 474 binaries, 38 generals, 0 SOSs, and 896 indicators. Represolve time = 0.17 sec. (90.95 ticks) Probing fixed 0 vars, tightened 53 bounds. Probing time = 0.05 sec. (20.13 ticks) Clique table members: 9893. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.00 sec. (6.37 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 108674.0000 108548.0000 0.12% 0 0 108548.0000 12 108674.0000 108548.0000 1345 0.12% 0 0 108548.7582 33 108674.0000 Cuts: 50 1422 0.12% 0 0 108578.0000 8 108674.0000 Cuts: 4 1438 0.09% 0 0 108578.0000 25 108674.0000 Cuts: 27 1466 0.09% 0 0 108578.0000 9 108674.0000 Cuts: 4 1473 0.09% 0 0 108578.0000 26 108674.0000 MIRcuts: 7 1492 0.09% Repair heuristic found nothing. 0 2 108578.0000 12 108674.0000 108578.0000 1492 0.09% Elapsed time = 14.28 sec. (7839.12 ticks, tree = 0.01 MB) Clique cuts applied: 16 Cover cuts applied: 5 Implied bound cuts applied: 45 Flow cuts applied: 2 Mixed integer rounding cuts applied: 16 Gomory fractional cuts applied: 3 Root node processing (before b&c): Real time = 14.30 sec. (7838.47 ticks) Parallel b&c, 4 threads: Real time = 0.05 sec. (28.12 ticks) Sync time (average) = 0.02 sec. Wait time (average) = 0.02 sec. ------------ Total (root+branch&cut) = 14.34 sec. (7866.60 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 108674 2200 MIP simplex iterations 119 branch-and-bound nodes Tried aggregator 2 times No basis. ------- GROUP 5: PHASE II: OPTIMIZATION ITERATION #5 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 3 set Conf := (28,29,43) (30,32,12) (28,29,32) (30,32,42) (28,31,35) (30,31,43) (28,29,44) (30,32,15) (28,30,32) (28,30,33) (28,31,44) (30,32,41) (28,30,29) (31,32,11) (29,30,33) (28,31,32) (28,32,44) (29,30,32) (31,32,42) (29,31,35) (29,30,35) (29,31,44) (29,31,33) (27,29,12) (30,31,35) (29,31,32) (30,32,16) (30,31,44) (27,29,15) (30,32,11) (28,29,27) (29,31,34); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 38845 rows, 42227 columns, and 199307 nonzeros. Reduced MIP has 28446 binaries, 78 generals, 0 SOSs, and 42797 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 6296 rows and 6570 columns. MIP Presolve modified 18891 coefficients. Reduced MIP has 30619 rows, 28775 columns, and 172937 nonzeros. Reduced MIP has 21893 binaries, 78 generals, 0 SOSs, and 30851 indicators. Probing fixed 17261 vars, tightened 8472 bounds. Probing changed sense of 133 constraints. Probing time = 11.31 sec. (3529.31 ticks) Cover probing fixed 14 vars, tightened 6481 bounds. MIP Presolve eliminated 26709 rows and 25684 columns. MIP Presolve modified 6277 coefficients. Reduced MIP has 3359 rows, 2417 columns, and 13177 nonzeros. Reduced MIP has 1714 binaries, 72 generals, 0 SOSs, and 2595 indicators. Probing fixed 62 vars, tightened 274 bounds. Probing changed sense of 6 constraints. Probing time = 0.14 sec. (47.02 ticks) MIP Presolve eliminated 81 rows and 86 columns. MIP Presolve modified 4188 coefficients. Reduced MIP has 3273 rows, 2324 columns, and 12712 nonzeros. Reduced MIP has 1624 binaries, 69 generals, 0 SOSs, and 2470 indicators. Probing fixed 0 vars, tightened 18 bounds. Probing time = 0.09 sec. (28.22 ticks) Clique table members: 38842. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.06 sec. (43.09 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 108438.5709 52 108438.5709 944 * 0+ 0 108673.9994 108438.5709 0.22% 0 0 108548.0000 35 108673.9994 Cuts: 109 1051 0.12% 0 0 108548.0000 35 108673.9994 Cuts: 12 1062 0.12% 0 0 108548.0000 36 108673.9994 Cuts: 8 1067 0.12% Repair heuristic found nothing. Repeating presolve. MIP Presolve eliminated 2055 rows and 1293 columns. MIP Presolve modified 2512 coefficients. Reduced MIP has 1077 rows, 863 columns, and 4670 nonzeros. Reduced MIP has 640 binaries, 46 generals, 0 SOSs, and 1231 indicators. Probing fixed 53 vars, tightened 248 bounds. Probing time = 0.05 sec. (33.21 ticks) Cover probing fixed 0 vars, tightened 136 bounds. MIP Presolve eliminated 70 rows and 71 columns. MIP Presolve modified 954 coefficients. Reduced MIP has 1028 rows, 790 columns, and 4294 nonzeros. Reduced MIP has 574 binaries, 39 generals, 0 SOSs, and 1037 indicators. Probing fixed 0 vars, tightened 71 bounds. Probing time = 0.05 sec. (28.63 ticks) MIP Presolve eliminated 6 rows and 1 columns. MIP Presolve modified 185 coefficients. Reduced MIP has 1020 rows, 787 columns, and 4274 nonzeros. Reduced MIP has 573 binaries, 39 generals, 0 SOSs, and 1037 indicators. Represolve time = 0.22 sec. (128.40 ticks) Probing time = 0.00 sec. (4.12 ticks) Clique table members: 12866. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.01 sec. (8.09 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 108673.9994 108548.0000 0.12% 0 0 108548.0000 24 108673.9994 108548.0000 1439 0.12% 0 0 108548.7577 11 108673.9994 Cuts: 17 1471 0.12% 0 0 108578.0000 36 108673.9994 Cuts: 13 1509 0.09% 0 0 108578.0000 27 108673.9994 Cuts: 25 1517 0.09% 0 0 108578.0000 27 108673.9994 Cuts: 2 1519 0.09% 0 0 108578.0000 26 108673.9994 MIRcuts: 3 1522 0.09% Repair heuristic found nothing. Repeating presolve. MIP Presolve eliminated 493 rows and 393 columns. MIP Presolve modified 1278 coefficients. Reduced MIP has 491 rows, 348 columns, and 1769 nonzeros. Reduced MIP has 206 binaries, 32 generals, 0 SOSs, and 461 indicators. Probing fixed 23 vars, tightened 293 bounds. Probing time = 0.02 sec. (4.35 ticks) Cover probing fixed 0 vars, tightened 204 bounds. MIP Presolve eliminated 43 rows and 43 columns. MIP Presolve modified 485 coefficients. Reduced MIP has 487 rows, 304 columns, and 1617 nonzeros. Reduced MIP has 166 binaries, 29 generals, 0 SOSs, and 336 indicators. Probing fixed 0 vars, tightened 15 bounds. Probing changed sense of 1 constraints. Probing time = 0.02 sec. (2.90 ticks) Cover probing fixed 0 vars, tightened 141 bounds. MIP Presolve eliminated 12 rows and 0 columns. MIP Presolve modified 174 coefficients. Reduced MIP has 475 rows, 304 columns, and 1593 nonzeros. Reduced MIP has 166 binaries, 29 generals, 0 SOSs, and 336 indicators. Represolve time = 0.05 sec. (23.77 ticks) Probing fixed 0 vars, tightened 6 bounds. Probing time = 0.02 sec. (2.68 ticks) Cover probing fixed 0 vars, tightened 271 bounds. Clique table members: 1042. Tightened 4 constraints. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.00 sec. (2.39 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 108673.9994 108578.0000 0.09% 0 0 108578.0000 20 108673.9994 108578.0000 1680 0.09% 0 0 108583.5514 20 108673.9994 Cuts: 16 1724 0.08% 0 0 108589.4211 20 108673.9994 Cuts: 58 1750 0.08% 0 0 108589.4211 20 108673.9994 Cuts: 11 1759 0.08% 0 0 108589.4211 33 108673.9994 Cuts: 14 1768 0.08% Repair heuristic found nothing. 0 2 108589.4211 16 108673.9994 108589.4211 1768 0.08% Elapsed time = 15.50 sec. (7819.21 ticks, tree = 0.01 MB) Clique cuts applied: 35 Cover cuts applied: 7 Implied bound cuts applied: 35 Mixed integer rounding cuts applied: 12 Zero-half cuts applied: 8 Gomory fractional cuts applied: 5 Root node processing (before b&c): Real time = 15.50 sec. (7818.76 ticks) Parallel b&c, 4 threads: Real time = 0.02 sec. (2.24 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 15.52 sec. (7821.00 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 108673.9994 1795 MIP simplex iterations 7 branch-and-bound nodes No basis. ------- GROUP 5: PHASE II: OPTIMIZATION ITERATION #6 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 1 set Conf := (28,29,43) (30,32,12) (28,29,32) (30,32,42) (28,31,35) (30,31,43) (28,29,44) (30,32,15) (28,30,32) (28,30,33) (28,31,44) (30,32,41) (28,30,29) (31,32,11) (29,30,33) (28,31,32) (28,32,44) (29,31,31) (29,30,32) (31,32,42) (29,31,35) (29,30,35) (29,31,44) (29,31,33) (27,29,12) (30,31,35) (29,31,32) (30,32,16) (30,31,44) (27,29,15) (30,32,11) (28,29,27) (29,31,34); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 39751 rows, 43059 columns, and 202285 nonzeros. Reduced MIP has 28812 binaries, 78 generals, 0 SOSs, and 43263 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 6439 rows and 6736 columns. MIP Presolve modified 19067 coefficients. Reduced MIP has 31317 rows, 29173 columns, and 175339 nonzeros. Reduced MIP has 22090 binaries, 78 generals, 0 SOSs, and 30951 indicators. Probing fixed 17341 vars, tightened 8284 bounds. Probing changed sense of 121 constraints. Probing time = 11.48 sec. (3479.33 ticks) Cover probing fixed 12 vars, tightened 6732 bounds. MIP Presolve eliminated 27289 rows and 26004 columns. MIP Presolve modified 6119 coefficients. Reduced MIP has 3450 rows, 2470 columns, and 13438 nonzeros. Reduced MIP has 1747 binaries, 73 generals, 0 SOSs, and 2612 indicators. Probing fixed 65 vars, tightened 286 bounds. Probing changed sense of 6 constraints. Probing time = 0.16 sec. (49.09 ticks) MIP Presolve eliminated 94 rows and 97 columns. MIP Presolve modified 4699 coefficients. Reduced MIP has 3352 rows, 2367 columns, and 12937 nonzeros. Reduced MIP has 1648 binaries, 69 generals, 0 SOSs, and 2482 indicators. Probing fixed 0 vars, tightened 18 bounds. Probing time = 0.09 sec. (28.30 ticks) Clique table members: 38866. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.06 sec. (41.63 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 108438.5709 68 108438.5709 947 * 0+ 0 108937.9994 108438.5709 0.46% 0 0 108548.0000 32 108937.9994 Cuts: 178 1082 0.36% 0 0 108548.0000 25 108937.9994 Cuts: 22 1098 0.36% 0 0 108548.0000 15 108937.9994 Cuts: 22 1115 0.36% * 0+ 0 108924.0000 108548.0000 0.35% 0 0 108548.0000 14 108924.0000 Cuts: 14 1121 0.35% * 0+ 0 108914.0000 108548.0000 0.34% Repair heuristic found nothing. 0 2 108548.0000 8 108914.0000 108548.0000 1121 0.34% Elapsed time = 15.59 sec. (8041.74 ticks, tree = 0.01 MB) * 130 110 integral 0 108864.0000 108548.0000 4547 0.29% * 134 110 integral 0 108828.0000 108548.0000 4558 0.26% 148 104 108628.0000 15 108828.0000 108548.0000 5408 0.26% 152 106 108708.0000 14 108828.0000 108548.0000 5509 0.26% 153 105 cutoff 108828.0000 108548.0000 5515 0.26% 156 108 108628.0939 28 108828.0000 108548.0000 5525 0.26% 157 109 108548.0301 12 108828.0000 108548.0000 5669 0.26% 160 110 108738.0000 11 108828.0000 108548.0000 5696 0.26% 163 108 cutoff 108828.0000 108548.0000 5746 0.26% 164 108 108548.0000 12 108828.0000 108548.0000 5747 0.26% 165 109 108748.0000 3 108828.0000 108548.0000 5748 0.26% * 216 135 integral 0 108772.0000 108548.0000 7230 0.21% * 898 304 integral 0 108718.0000 108578.0000 21481 0.13% 1110 220 cutoff 108718.0000 108578.0000 29574 0.13% Elapsed time = 17.36 sec. (9035.62 ticks, tree = 0.19 MB) 2542 301 108681.5000 44 108718.0000 108662.0000 55612 0.05% 2597 271 infeasible 108718.0000 108674.0000 56022 0.04% 2598 270 infeasible 108718.0000 108674.0000 56022 0.04% 2599 271 108692.0000 10 108718.0000 108674.0000 56036 0.04% 2600 270 infeasible 108718.0000 108674.0000 56036 0.04% 2601 271 108677.6616 110 108718.0000 108674.0000 56057 0.04% 2602 270 cutoff 108718.0000 108674.0000 56062 0.04% 2603 269 infeasible 108718.0000 108674.0000 56062 0.04% 2604 270 108678.0000 12 108718.0000 108674.0000 56068 0.04% 2605 271 108684.7159 105 108718.0000 108674.0000 56075 0.04% Elapsed time = 19.19 sec. (10042.20 ticks, tree = 0.01 MB) * 3346 5 integral 0 108716.0000 108700.0000 64006 0.01% Clique cuts applied: 54 Cover cuts applied: 4 Implied bound cuts applied: 169 Flow cuts applied: 5 Mixed integer rounding cuts applied: 10 Gomory fractional cuts applied: 4 Root node processing (before b&c): Real time = 15.59 sec. (8040.29 ticks) Parallel b&c, 4 threads: Real time = 4.39 sec. (2415.17 ticks) Sync time (average) = 0.54 sec. Wait time (average) = 0.57 sec. ------------ Total (root+branch&cut) = 19.98 sec. (10455.46 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 108716 64021 MIP simplex iterations 3360 branch-and-bound nodes Tried aggregator 2 times No basis. ------- GROUP 5: PHASE II: OPTIMIZATION ITERATION #7 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 2 set Conf := (28,29,43) (30,32,12) (28,29,32) (30,32,42) (28,31,35) (30,31,43) (28,29,44) (30,32,15) (28,30,32) (28,30,33) (28,31,44) (30,32,41) (28,30,29) (31,32,11) (29,30,33) (28,31,32) (28,32,44) (29,31,31) (29,30,32) (31,32,42) (29,31,35) (29,30,35) (29,31,44) (28,30,35) (29,31,33) (27,29,12) (30,31,35) (29,31,32) (30,32,16) (29,30,44) (30,31,44) (27,29,15) (30,32,11) (28,29,27) (29,31,34); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 41765 rows, 44883 columns, and 212983 nonzeros. Reduced MIP has 29610 binaries, 78 generals, 0 SOSs, and 44289 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 6874 rows and 7173 columns. MIP Presolve modified 19339 coefficients. Reduced MIP has 32783 rows, 30032 columns, and 182407 nonzeros. Reduced MIP has 22501 binaries, 78 generals, 0 SOSs, and 31160 indicators. Probing fixed 17538 vars, tightened 8544 bounds. Probing changed sense of 153 constraints. Probing time = 12.11 sec. (3717.66 ticks) Cover probing fixed 10 vars, tightened 6281 bounds. MIP Presolve eliminated 28681 rows and 26813 columns. MIP Presolve modified 6469 coefficients. Reduced MIP has 3521 rows, 2514 columns, and 13719 nonzeros. Reduced MIP has 1767 binaries, 73 generals, 0 SOSs, and 2627 indicators. Probing fixed 68 vars, tightened 301 bounds. Probing changed sense of 6 constraints. Probing time = 0.14 sec. (50.45 ticks) MIP Presolve eliminated 96 rows and 96 columns. MIP Presolve modified 4759 coefficients. Reduced MIP has 3418 rows, 2409 columns, and 13135 nonzeros. Reduced MIP has 1666 binaries, 69 generals, 0 SOSs, and 2494 indicators. Probing fixed 0 vars, tightened 18 bounds. Probing time = 0.09 sec. (28.70 ticks) Clique table members: 38878. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.06 sec. (43.43 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 108438.5709 53 108438.5709 972 * 0+ 0 108739.9970 108438.5709 0.28% 0 0 108548.0000 44 108739.9970 Cuts: 124 1094 0.18% 0 0 108548.0000 11 108739.9970 Cuts: 16 1114 0.18% 0 0 108548.0000 14 108739.9970 Cuts: 11 1122 0.18% 0 0 108548.0000 22 108739.9970 Cuts: 3 1156 0.18% Repair heuristic found nothing. 0 2 108548.0000 10 108739.9970 108548.0000 1162 0.18% Elapsed time = 16.08 sec. (8578.29 ticks, tree = 0.01 MB) 554 283 108606.0604 27 108739.9970 108576.0604 4374 0.15% 558 287 108606.0604 27 108739.9970 108576.0604 4376 0.15% 562 291 108606.0604 26 108739.9970 108576.0604 4386 0.15% 566 293 108606.0604 26 108739.9970 108576.0604 4389 0.15% 570 293 infeasible 108739.9970 108576.0604 4405 0.15% 571 294 108674.0000 2 108739.9970 108576.0604 4407 0.15% 572 295 108618.0000 24 108739.9970 108576.0604 4408 0.15% 573 296 108674.0000 10 108739.9970 108576.0604 4409 0.15% 574 297 108606.0604 25 108739.9970 108576.0604 4410 0.15% * 784 353 integral 0 108724.0000 108638.0000 5500 0.08% 2783 258 infeasible 108724.0000 108693.0800 11232 0.03% Elapsed time = 17.86 sec. (9532.05 ticks, tree = 0.01 MB) * 2971 142 integral 0 108718.0000 108698.0000 12418 0.02% Clique cuts applied: 26 Cover cuts applied: 2 Implied bound cuts applied: 169 Flow cuts applied: 6 Mixed integer rounding cuts applied: 10 Gomory fractional cuts applied: 3 Root node processing (before b&c): Real time = 16.08 sec. (8576.91 ticks) Parallel b&c, 4 threads: Real time = 2.03 sec. (1090.48 ticks) Sync time (average) = 0.38 sec. Wait time (average) = 0.39 sec. ------------ Total (root+branch&cut) = 18.11 sec. (9667.39 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 108718 12597 MIP simplex iterations 3043 branch-and-bound nodes Tried aggregator 2 times No basis. ------- GROUP 5: PHASE II: OPTIMIZATION ITERATION #8 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 3 set Conf := (28,29,43) (30,32,15) (29,30,33) (29,30,35) (30,32,16) (28,31,29) (28,29,44) (31,32,11) (29,31,35) (29,31,32) (29,31,34) (30,31,32) (28,30,29) (31,32,42) (30,31,35) (28,29,27) (30,31,43) (30,32,43) (29,30,32) (27,29,12) (30,32,11) (28,31,35) (30,32,41) (29,31,33) (27,29,15) (30,32,42) (28,31,44) (29,31,31) (30,31,44) (28,29,32) (28,30,33) (28,32,44) (28,30,35) (30,32,12) (28,30,32) (28,31,32) (29,31,44) (29,30,44); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 44238 rows, 47128 columns, and 222493 nonzeros. Reduced MIP has 30591 binaries, 78 generals, 0 SOSs, and 45553 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 7286 rows and 7616 columns. MIP Presolve modified 19661 coefficients. Reduced MIP has 34736 rows, 31171 columns, and 189851 nonzeros. Reduced MIP has 23050 binaries, 78 generals, 0 SOSs, and 31436 indicators. Probing fixed 17793 vars, tightened 9086 bounds. Probing changed sense of 164 constraints. Probing time = 12.66 sec. (3773.84 ticks) Cover probing fixed 14 vars, tightened 7603 bounds. MIP Presolve eliminated 30523 rows and 27881 columns. MIP Presolve modified 6867 coefficients. Reduced MIP has 3608 rows, 2565 columns, and 13931 nonzeros. Reduced MIP has 1791 binaries, 73 generals, 0 SOSs, and 2638 indicators. Probing fixed 65 vars, tightened 305 bounds. Probing changed sense of 6 constraints. Probing time = 0.16 sec. (51.22 ticks) MIP Presolve eliminated 95 rows and 95 columns. MIP Presolve modified 4430 coefficients. Reduced MIP has 3505 rows, 2460 columns, and 13409 nonzeros. Reduced MIP has 1691 binaries, 69 generals, 0 SOSs, and 2508 indicators. Probing fixed 0 vars, tightened 18 bounds. Probing time = 0.09 sec. (28.81 ticks) Clique table members: 38890. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.06 sec. (43.60 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 108438.5709 52 108438.5709 981 0 0 108548.0000 40 Cuts: 124 1108 0 0 108548.0000 9 Cuts: 48 1124 0 0 108548.0000 8 Cuts: 5 1129 0 0 108548.0000 10 Flowcuts: 2 1132 * 0+ 0 108950.0000 108548.0000 0.37% 0 0 108548.0000 11 108950.0000 MIRcuts: 1 1135 0.37% Repair heuristic found nothing. 0 2 108548.0000 7 108950.0000 108548.0000 1135 0.37% Elapsed time = 16.78 sec. (9013.07 ticks, tree = 0.01 MB) 188 125 108714.0000 7 108950.0000 108548.0000 5342 0.37% 192 127 108714.1641 16 108950.0000 108548.0000 5364 0.37% 193 128 108776.0000 11 108950.0000 108548.0000 5371 0.37% 195 130 108548.0000 12 108950.0000 108548.0000 5376 0.37% 196 131 108802.0000 10 108950.0000 108548.0000 5386 0.37% 197 132 108776.0000 9 108950.0000 108548.0000 5387 0.37% 199 134 108548.0000 12 108950.0000 108548.0000 5397 0.37% 200 135 108802.0000 9 108950.0000 108548.0000 5400 0.37% 201 136 108776.0278 41 108950.0000 108548.0000 5419 0.37% * 439 252 integral 0 108790.0000 108548.0000 9086 0.22% * 850+ 344 108740.0000 108548.0000 0.18% * 1326 355 integral 0 108724.0000 108576.0604 18700 0.14% 1471 293 cutoff 108724.0000 108596.0000 20081 0.12% Elapsed time = 18.41 sec. (9967.77 ticks, tree = 0.26 MB) Clique cuts applied: 53 Cover cuts applied: 5 Implied bound cuts applied: 132 Flow cuts applied: 8 Mixed integer rounding cuts applied: 8 Lift and project cuts applied: 1 Gomory fractional cuts applied: 4 Root node processing (before b&c): Real time = 16.77 sec. (9011.57 ticks) Parallel b&c, 4 threads: Real time = 2.61 sec. (1433.53 ticks) Sync time (average) = 0.27 sec. Wait time (average) = 0.28 sec. ------------ Total (root+branch&cut) = 19.38 sec. (10445.11 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 108724 27841 MIP simplex iterations 2579 branch-and-bound nodes Tried aggregator 2 times No basis. ------- GROUP 5: PHASE II: OPTIMIZATION ITERATION #9 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 0 set Conf := (28,29,43) (30,32,15) (29,30,33) (29,30,35) (30,32,16) (28,31,29) (28,29,44) (31,32,11) (29,31,35) (29,31,32) (29,31,34) (30,31,32) (28,30,29) (31,32,42) (30,31,35) (28,29,27) (30,31,43) (30,32,43) (29,30,32) (27,29,12) (30,32,11) (28,31,35) (30,32,41) (29,31,33) (27,29,15) (30,32,42) (28,31,44) (29,31,31) (30,31,44) (28,29,32) (28,30,33) (28,32,44) (28,30,35) (30,32,12) (28,30,32) (28,31,32) (29,31,44) (29,30,44); ------- GROUP 5: CONFLICT-FREE SOLUTION FOUND AFTER #9 ITERATIONS -------- ---------- START PROCESSING FOR THE FIRST 6 GROUP(S)----------- CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 MIP Presolve eliminated 969 rows and 504 columns. MIP Presolve modified 12473 coefficients. Reduced MIP has 8249 rows, 14018 columns, and 78232 nonzeros. Reduced MIP has 13870 binaries, 69 generals, 0 SOSs, and 24062 indicators. Probing fixed 11603 vars, tightened 38 bounds. Probing changed sense of 22 constraints. Probing time = 2.16 sec. (639.57 ticks) Root node processing (before b&c): Real time = 3.63 sec. (3359.99 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 3.63 sec. (3359.99 ticks) CPLEX 12.6.3.0: integer infeasible. 0 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 4 times No basis. GROUP 6: PHASE I: TRYING TO FIX INFEASIBILITY BY ENLARGING STEPS ... ------- GROUP 6: FIXXING ITERATION #1 --------- a = 33 Step[a] = 14 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 9932 rows, 15270 columns, and 73890 nonzeros. Reduced MIP has 15120 binaries, 70 generals, 0 SOSs, and 25312 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 971 rows and 504 columns. MIP Presolve modified 12444 coefficients. Reduced MIP has 8510 rows, 14408 columns, and 80251 nonzeros. Reduced MIP has 14258 binaries, 70 generals, 0 SOSs, and 24724 indicators. Probing fixed 10537 vars, tightened 33 bounds. Probing changed sense of 16 constraints. Probing time = 2.42 sec. (660.46 ticks) Root node processing (before b&c): Real time = 4.05 sec. (3686.41 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 4.05 sec. (3686.41 ticks) CPLEX 12.6.3.0: integer infeasible. 0 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 4 times No basis. ------- GROUP 6: FIXXING ITERATION #2 --------- a = 34 Step[a] = 14 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 10198 rows, 15656 columns, and 75839 nonzeros. Reduced MIP has 15504 binaries, 71 generals, 0 SOSs, and 25960 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 972 rows and 504 columns. MIP Presolve modified 12444 coefficients. Reduced MIP has 8773 rows, 14792 columns, and 82193 nonzeros. Reduced MIP has 14640 binaries, 71 generals, 0 SOSs, and 25372 indicators. Probing fixed 7362 vars, tightened 34 bounds. Probing time = 2.34 sec. (705.76 ticks) Root node processing (before b&c): Real time = 4.09 sec. (3747.93 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 4.09 sec. (3747.93 ticks) CPLEX 12.6.3.0: integer infeasible. 0 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 5 times No basis. ------- GROUP 6: FIXXING ITERATION #3 --------- a = 37 Step[a] = 14 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 10459 rows, 16041 columns, and 77775 nonzeros. Reduced MIP has 15887 binaries, 72 generals, 0 SOSs, and 26606 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 973 rows and 504 columns. MIP Presolve modified 12962 coefficients. Reduced MIP has 9028 rows, 15175 columns, and 84046 nonzeros. Reduced MIP has 15021 binaries, 72 generals, 0 SOSs, and 26015 indicators. Probing fixed 13405 vars, tightened 101 bounds. Probing time = 3.38 sec. (712.46 ticks) Cover probing fixed 38 vars, tightened 833 bounds. MIP Presolve eliminated 8300 rows and 14246 columns. MIP Presolve modified 294 coefficients. Reduced MIP has 656 rows, 850 columns, and 4998 nonzeros. Reduced MIP has 811 binaries, 18 generals, 0 SOSs, and 1484 indicators. Probing fixed 19 vars, tightened 0 bounds. Probing time = 0.13 sec. (72.21 ticks) Cover probing fixed 0 vars, tightened 4 bounds. MIP Presolve eliminated 13 rows and 30 columns. MIP Presolve modified 38 coefficients. Reduced MIP has 640 rows, 817 columns, and 4939 nonzeros. Reduced MIP has 778 binaries, 18 generals, 0 SOSs, and 1444 indicators. Probing time = 0.02 sec. (4.95 ticks) Clique table members: 74450. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.02 sec. (5.71 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 142174.0000 140859.9996 0.92% 0 0 141480.0000 29 142174.0000 141480.0000 256 0.49% * 0+ 0 141630.0000 141480.0000 0.11% 0 0 141490.0000 3 141630.0000 Cuts: 35 326 0.10% * 0+ 0 141494.0000 141490.0000 0.00% * 0 0 integral 0 141490.0000 Cuts: 6 335 0.00% 0 0 cutoff 141490.0000 141490.0000 335 0.00% Elapsed time = 5.50 sec. (4108.04 ticks, tree = 0.01 MB) Clique cuts applied: 21 Implied bound cuts applied: 14 Root node processing (before b&c): Real time = 5.52 sec. (4108.26 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 5.52 sec. (4108.26 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 141490 335 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 2 times No basis. ------- GROUP 6: INFEASIBILITY FIXING FINISHED -------- ------- GROUP 6: PHASE II: OPTIMIZATION ITERATION #1 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 6 set Conf := (34,35,44) (36,37,12) (30,33,42) (30,34,43) (31,33,27) (31,34,12); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 13477 rows, 18374 columns, and 89168 nonzeros. Reduced MIP has 17354 binaries, 72 generals, 0 SOSs, and 28244 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 1880 rows and 1616 columns. MIP Presolve modified 13042 coefficients. Reduced MIP has 10467 rows, 16102 columns, and 90187 nonzeros. Reduced MIP has 15409 binaries, 72 generals, 0 SOSs, and 26195 indicators. Probing fixed 13580 vars, tightened 1135 bounds. Probing time = 3.01 sec. (813.03 ticks) Cover probing fixed 32 vars, tightened 606 bounds. MIP Presolve eliminated 9194 rows and 14645 columns. MIP Presolve modified 657 coefficients. Reduced MIP has 1134 rows, 1264 columns, and 7131 nonzeros. Reduced MIP has 1117 binaries, 45 generals, 0 SOSs, and 2165 indicators. Probing fixed 23 vars, tightened 40 bounds. Probing changed sense of 4 constraints. Probing time = 0.16 sec. (83.39 ticks) Cover probing fixed 0 vars, tightened 43 bounds. MIP Presolve eliminated 406 rows and 382 columns. MIP Presolve modified 72 coefficients. Reduced MIP has 727 rows, 879 columns, and 5197 nonzeros. Reduced MIP has 802 binaries, 19 generals, 0 SOSs, and 1458 indicators. Probing fixed 0 vars, tightened 1 bounds. Probing time = 0.13 sec. (68.99 ticks) MIP Presolve eliminated 2 rows and 0 columns. MIP Presolve modified 10 coefficients. Reduced MIP has 725 rows, 879 columns, and 5193 nonzeros. Reduced MIP has 802 binaries, 19 generals, 0 SOSs, and 1458 indicators. Probing time = 0.00 sec. (5.08 ticks) Clique table members: 74462. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.02 sec. (4.81 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 141480.0000 29 141480.0000 317 0 0 141490.0000 6 Cuts: 35 395 0 0 141490.0000 3 Cuts: 8 399 * 0 0 integral 0 141490.0000 Impl Bds: 2 401 0.00% 0 0 cutoff 141490.0000 141490.0000 401 0.00% Elapsed time = 5.13 sec. (3467.76 ticks, tree = 0.01 MB) Clique cuts applied: 21 Implied bound cuts applied: 17 Root node processing (before b&c): Real time = 5.13 sec. (3468.01 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 5.13 sec. (3468.01 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 141490 401 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 6: PHASE II: OPTIMIZATION ITERATION #2 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 2 set Conf := (34,35,44) (30,33,42) (31,33,27) (30,33,11) (36,37,12) (30,34,43) (31,34,12) (31,34,42); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 14218 rows, 18834 columns, and 90982 nonzeros. Reduced MIP has 17776 binaries, 72 generals, 0 SOSs, and 28670 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 2190 rows and 2018 columns. MIP Presolve modified 13046 coefficients. Reduced MIP has 10544 rows, 16159 columns, and 90394 nonzeros. Reduced MIP has 15441 binaries, 72 generals, 0 SOSs, and 26204 indicators. Probing fixed 13571 vars, tightened 870 bounds. Probing time = 3.09 sec. (827.51 ticks) Cover probing fixed 28 vars, tightened 741 bounds. MIP Presolve eliminated 9237 rows and 14665 columns. MIP Presolve modified 700 coefficients. Reduced MIP has 1162 rows, 1285 columns, and 7228 nonzeros. Reduced MIP has 1131 binaries, 48 generals, 0 SOSs, and 2198 indicators. Probing fixed 28 vars, tightened 61 bounds. Probing changed sense of 4 constraints. Probing time = 0.14 sec. (83.60 ticks) Cover probing fixed 0 vars, tightened 23 bounds. MIP Presolve eliminated 434 rows and 403 columns. MIP Presolve modified 70 coefficients. Reduced MIP has 729 rows, 879 columns, and 5201 nonzeros. Reduced MIP has 802 binaries, 19 generals, 0 SOSs, and 1458 indicators. Probing fixed 0 vars, tightened 8 bounds. Probing time = 0.11 sec. (68.97 ticks) MIP Presolve eliminated 4 rows and 0 columns. Reduced MIP has 725 rows, 879 columns, and 5193 nonzeros. Reduced MIP has 802 binaries, 19 generals, 0 SOSs, and 1458 indicators. Probing time = 0.00 sec. (5.09 ticks) Clique table members: 74462. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.01 sec. (4.99 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 142182.0000 140788.9998 0.98% 0 0 141480.0000 29 142182.0000 141480.0000 326 0.49% * 0+ 0 141490.0000 141480.0000 0.01% 0 0 cutoff 141490.0000 416 0.00% Elapsed time = 5.11 sec. (3454.16 ticks, tree = 0.01 MB) Clique cuts applied: 18 Implied bound cuts applied: 17 Root node processing (before b&c): Real time = 5.11 sec. (3454.42 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 5.11 sec. (3454.42 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 141490 416 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 6: PHASE II: OPTIMIZATION ITERATION #3 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 1 set Conf := (34,35,44) (30,33,42) (31,33,27) (30,33,11) (33,34,44) (36,37,12) (30,34,43) (31,34,12) (31,34,42); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 14702 rows, 19318 columns, and 94326 nonzeros. Reduced MIP has 17998 binaries, 72 generals, 0 SOSs, and 28932 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 2292 rows and 2160 columns. MIP Presolve modified 13046 coefficients. Reduced MIP has 10864 rows, 16359 columns, and 92502 nonzeros. Reduced MIP has 15521 binaries, 72 generals, 0 SOSs, and 26244 indicators. Probing fixed 13594 vars, tightened 1439 bounds. Probing changed sense of 2 constraints. Probing time = 3.11 sec. (841.10 ticks) Cover probing fixed 37 vars, tightened 849 bounds. MIP Presolve eliminated 9153 rows and 14515 columns. MIP Presolve modified 1049 coefficients. Reduced MIP has 1475 rows, 1531 columns, and 8548 nonzeros. Reduced MIP has 1315 binaries, 60 generals, 0 SOSs, and 2551 indicators. Probing fixed 25 vars, tightened 72 bounds. Probing changed sense of 4 constraints. Probing time = 0.17 sec. (92.19 ticks) Cover probing fixed 0 vars, tightened 117 bounds. MIP Presolve eliminated 57 rows and 47 columns. MIP Presolve modified 448 coefficients. Reduced MIP has 1418 rows, 1480 columns, and 8319 nonzeros. Reduced MIP has 1271 binaries, 54 generals, 0 SOSs, and 2483 indicators. Probing time = 0.00 sec. (5.32 ticks) Clique table members: 86075. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.01 sec. (10.61 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 141457.2152 14 141457.2152 592 0 0 141490.0000 3 Cuts: 131 733 0 0 141490.0000 3 Cuts: 19 765 0 0 141490.0000 3 Cuts: 8 773 * 0+ 0 141604.0000 141490.0000 0.08% 0 0 141490.0000 3 141604.0000 MIRcuts: 2 774 0.08% * 0+ 0 141490.0000 141490.0000 0.00% 0 0 cutoff 141490.0000 141490.0000 774 0.00% Elapsed time = 5.23 sec. (3370.29 ticks, tree = 0.01 MB) Clique cuts applied: 57 Implied bound cuts applied: 60 Mixed integer rounding cuts applied: 1 Lift and project cuts applied: 1 Gomory fractional cuts applied: 1 Root node processing (before b&c): Real time = 5.23 sec. (3370.56 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 5.23 sec. (3370.56 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 141490 774 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 2 times No basis. ------- GROUP 6: PHASE II: OPTIMIZATION ITERATION #4 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 0 set Conf := (34,35,44) (30,33,42) (31,33,27) (30,33,11) (33,34,44) (36,37,12) (30,34,43) (31,34,12) (31,34,42); ------- GROUP 6: CONFLICT-FREE SOLUTION FOUND AFTER #4 ITERATIONS -------- ampl: