sw: ampl ampl: option ampl_include '../crashed'; ampl: include zone_group2.run set FG[1] := 6 7 8 9 10; set FG[2] := 11 12 13 14 15; set FG[3] := 16 17 18 19 20; set FG[4] := 21 22 23 24 25; set FG[5] := 26 27 28 29 30; set FG[6] := 31 32 33 34 35; ---------- 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 1018 rows and 534 columns. MIP Presolve modified 12404 coefficients. Reduced MIP has 7974 rows, 13494 columns, and 75293 nonzeros. Reduced MIP has 13349 binaries, 67 generals, 0 SOSs, and 23273 indicators. Probing fixed 3965 vars, tightened 0 bounds. Probing time = 1.45 sec. (426.30 ticks) Root node processing (before b&c): Real time = 2.92 sec. (2896.64 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.92 sec. (2896.64 ticks) CPLEX 12.6.3.0: integer infeasible. 0 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 4 times No basis. GROUP 1: PHASE I: TRYING TO FIX INFEASIBILITY BY ENLARGING STEPS ... ------- GROUP 1: FIXXING ITERATION #1 --------- a = 6 Step[a] = 14 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 MIP Presolve eliminated 1021 rows and 534 columns. MIP Presolve modified 12404 coefficients. Reduced MIP has 8233 rows, 13885 columns, and 77266 nonzeros. Reduced MIP has 13738 binaries, 68 generals, 0 SOSs, and 23935 indicators. Probing fixed 4567 vars, tightened 0 bounds. Probing time = 1.45 sec. (419.98 ticks) Root node processing (before b&c): Real time = 2.99 sec. (3129.66 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.99 sec. (3129.66 ticks) CPLEX 12.6.3.0: integer infeasible. 0 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 4 times No basis. ------- GROUP 1: FIXXING ITERATION #2 --------- a = 8 Step[a] = 14 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 MIP Presolve eliminated 963 rows and 534 columns. MIP Presolve modified 13103 coefficients. Reduced MIP has 8511 rows, 14245 columns, and 77683 nonzeros. Reduced MIP has 14096 binaries, 69 generals, 0 SOSs, and 24477 indicators. Probing fixed 12977 vars, tightened 113 bounds. Probing time = 1.66 sec. (424.18 ticks) Cover probing fixed 6 vars, tightened 753 bounds. MIP Presolve eliminated 8097 rows and 13828 columns. MIP Presolve modified 183 coefficients. Reduced MIP has 330 rows, 321 columns, and 2073 nonzeros. Reduced MIP has 290 binaries, 14 generals, 0 SOSs, and 695 indicators. Probing fixed 4 vars, tightened 3 bounds. Probing time = 0.03 sec. (13.73 ticks) MIP Presolve eliminated 11 rows and 11 columns. MIP Presolve modified 14 coefficients. Reduced MIP has 319 rows, 310 columns, and 2031 nonzeros. Reduced MIP has 279 binaries, 14 generals, 0 SOSs, and 687 indicators. Probing time = 0.00 sec. (3.59 ticks) Clique table members: 17352. 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. (1.74 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 13079.0000 11992.9997 8.30% 0 0 12642.5046 11 13079.0000 12642.5046 118 3.34% * 0+ 0 12643.0000 12642.5046 0.00% 0 0 cutoff 12643.0000 126 0.00% Elapsed time = 3.39 sec. (3451.88 ticks, tree = 0.01 MB) Implied bound cuts applied: 5 Root node processing (before b&c): Real time = 3.39 sec. (3452.09 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.39 sec. (3452.09 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 12643 126 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 := (6,7,41) (6,7,42); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 11458 rows, 16515 columns, and 79923 nonzeros. Reduced MIP has 15568 binaries, 69 generals, 0 SOSs, and 25834 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 1310 rows and 866 columns. MIP Presolve modified 13119 coefficients. Reduced MIP has 9784 rows, 15015 columns, and 83195 nonzeros. Reduced MIP has 14422 binaries, 69 generals, 0 SOSs, and 24645 indicators. Probing fixed 13101 vars, tightened 429 bounds. Probing time = 1.95 sec. (519.74 ticks) Cover probing fixed 3 vars, tightened 543 bounds. MIP Presolve eliminated 8873 rows and 14197 columns. MIP Presolve modified 582 coefficients. Reduced MIP has 758 rows, 624 columns, and 3866 nonzeros. Reduced MIP has 517 binaries, 25 generals, 0 SOSs, and 1069 indicators. Probing fixed 6 vars, tightened 35 bounds. Probing time = 0.06 sec. (28.63 ticks) MIP Presolve eliminated 22 rows and 15 columns. MIP Presolve modified 316 coefficients. Reduced MIP has 734 rows, 607 columns, and 3804 nonzeros. Reduced MIP has 501 binaries, 24 generals, 0 SOSs, and 1057 indicators. Probing time = 0.02 sec. (4.19 ticks) Clique table members: 22347. 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. (5.39 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 12638.3257 12 12638.3257 359 * 0+ 0 12649.0000 12638.3257 0.08% 0 0 12643.0000 2 12649.0000 Cuts: 27 383 0.05% 0 0 12643.0000 9 12649.0000 Cuts: 2 390 0.05% * 0+ 0 12643.0000 12643.0000 0.00% 0 0 cutoff 12643.0000 12643.0000 390 0.00% Elapsed time = 3.56 sec. (2717.64 ticks, tree = 0.01 MB) Clique cuts applied: 5 Implied bound cuts applied: 11 Mixed integer rounding cuts applied: 1 Gomory fractional cuts applied: 2 Root node processing (before b&c): Real time = 3.56 sec. (2717.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) = 3.56 sec. (2717.87 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 12643 390 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 2 times No basis. ------- GROUP 1: PHASE II: OPTIMIZATION ITERATION #2 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 0 set Conf := (6,7,41) (6,7,42); ------- GROUP 1: CONFLICT-FREE SOLUTION FOUND AFTER #2 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 875 rows and 453 columns. MIP Presolve modified 14084 coefficients. Reduced MIP has 6583 rows, 12545 columns, and 69812 nonzeros. Reduced MIP has 12407 binaries, 64 generals, 0 SOSs, and 22210 indicators. Probing fixed 8109 vars, tightened 21 bounds. Probing changed sense of 16 constraints. Probing time = 1.08 sec. (368.09 ticks) Root node processing (before b&c): Real time = 2.41 sec. (2798.12 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.41 sec. (2798.12 ticks) CPLEX 12.6.3.0: integer infeasible. 0 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 2 times No basis. GROUP 2: PHASE I: TRYING TO FIX INFEASIBILITY BY ENLARGING STEPS ... ------- GROUP 2: FIXXING ITERATION #1 --------- a = 11 Step[a] = 14 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 8108 rows, 13728 columns, and 65939 nonzeros. Reduced MIP has 13588 binaries, 65 generals, 0 SOSs, and 23334 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 869 rows and 452 columns. MIP Presolve modified 14070 coefficients. Reduced MIP has 6853 rows, 12930 columns, and 71839 nonzeros. Reduced MIP has 12790 binaries, 65 generals, 0 SOSs, and 22859 indicators. Probing fixed 7944 vars, tightened 27 bounds. Probing changed sense of 14 constraints. Probing time = 1.06 sec. (343.37 ticks) Root node processing (before b&c): Real time = 2.45 sec. (2824.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.45 sec. (2824.87 ticks) CPLEX 12.6.3.0: integer infeasible. 0 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 2 times No basis. ------- GROUP 2: FIXXING ITERATION #2 --------- a = 12 Step[a] = 14 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 8374 rows, 14114 columns, and 67888 nonzeros. Reduced MIP has 13972 binaries, 66 generals, 0 SOSs, and 23982 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 858 rows and 450 columns. MIP Presolve modified 14118 coefficients. Reduced MIP has 7125 rows, 13316 columns, and 73846 nonzeros. Reduced MIP has 13174 binaries, 66 generals, 0 SOSs, and 23509 indicators. Probing fixed 10889 vars, tightened 38 bounds. Probing changed sense of 10 constraints. Probing time = 1.44 sec. (384.56 ticks) Root node processing (before b&c): Real time = 2.88 sec. (3021.20 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.88 sec. (3021.20 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: FIXXING ITERATION #3 --------- a = 15 Step[a] = 14 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 8635 rows, 14499 columns, and 69824 nonzeros. Reduced MIP has 14355 binaries, 67 generals, 0 SOSs, and 24628 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 859 rows and 450 columns. MIP Presolve modified 14636 coefficients. Reduced MIP has 7383 rows, 13699 columns, and 75705 nonzeros. Reduced MIP has 13555 binaries, 67 generals, 0 SOSs, and 24155 indicators. Probing fixed 12639 vars, tightened 113 bounds. Probing changed sense of 1 constraints. Probing time = 1.58 sec. (412.68 ticks) Cover probing fixed 0 vars, tightened 601 bounds. MIP Presolve eliminated 7134 rows and 13402 columns. MIP Presolve modified 38 coefficients. Reduced MIP has 207 rows, 238 columns, and 1236 nonzeros. Reduced MIP has 208 binaries, 13 generals, 0 SOSs, and 468 indicators. Probing fixed 4 vars, tightened 11 bounds. Probing time = 0.02 sec. (6.82 ticks) Cover probing fixed 0 vars, tightened 7 bounds. MIP Presolve eliminated 10 rows and 8 columns. Reduced MIP has 197 rows, 230 columns, and 1197 nonzeros. Reduced MIP has 200 binaries, 13 generals, 0 SOSs, and 460 indicators. Probing time = 0.00 sec. (3.05 ticks) Cover probing fixed 0 vars, tightened 5 bounds. Clique table members: 7563. 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.41 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 28260.0000 26950.9993 4.63% 0 0 27314.0000 9 28260.0000 27314.0000 120 3.35% * 0+ 0 27338.0000 27314.0000 0.09% 0 0 cutoff 27338.0000 27338.0000 135 0.00% Elapsed time = 3.27 sec. (3282.23 ticks, tree = 0.01 MB) Clique cuts applied: 22 Implied bound cuts applied: 34 Gomory fractional cuts applied: 1 Root node processing (before b&c): Real time = 3.27 sec. (3282.43 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.27 sec. (3282.43 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 27338 135 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 = 7 set Conf := (11,12,43) (13,14,11) (13,14,15) (10,12,44) (13,14,9) (13,14,12) (13,14,42); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 13474 rows, 18799 columns, and 88496 nonzeros. Reduced MIP has 16329 binaries, 67 generals, 0 SOSs, and 27142 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 1984 rows and 1625 columns. MIP Presolve modified 14811 coefficients. Reduced MIP has 10896 rows, 15824 columns, and 88216 nonzeros. Reduced MIP has 14503 binaries, 67 generals, 0 SOSs, and 24630 indicators. Probing fixed 13054 vars, tightened 840 bounds. Probing changed sense of 36 constraints. Probing time = 2.28 sec. (611.51 ticks) Cover probing fixed 0 vars, tightened 1874 bounds. MIP Presolve eliminated 9645 rows and 14700 columns. MIP Presolve modified 1003 coefficients. Reduced MIP has 1069 rows, 853 columns, and 4798 nonzeros. Reduced MIP has 661 binaries, 50 generals, 0 SOSs, and 1449 indicators. Probing fixed 3 vars, tightened 87 bounds. Probing changed sense of 6 constraints. Probing time = 0.05 sec. (24.61 ticks) Cover probing fixed 0 vars, tightened 91 bounds. MIP Presolve eliminated 421 rows and 322 columns. MIP Presolve modified 290 coefficients. Reduced MIP has 648 rows, 531 columns, and 2947 nonzeros. Reduced MIP has 405 binaries, 24 generals, 0 SOSs, and 814 indicators. Probing fixed 0 vars, tightened 47 bounds. Probing time = 0.03 sec. (17.12 ticks) MIP Presolve modified 137 coefficients. Reduced MIP has 648 rows, 531 columns, and 2947 nonzeros. Reduced MIP has 405 binaries, 24 generals, 0 SOSs, and 814 indicators. Probing fixed 0 vars, tightened 4 bounds. Probing time = 0.03 sec. (12.88 ticks) Clique table members: 11075. 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.27 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 34510.0000 26359.9997 23.62% 0 0 27313.2906 14 34510.0000 27313.2906 231 20.85% * 0+ 0 27405.9994 27313.2906 0.34% 0 0 27338.0000 5 27405.9994 Cuts: 38 259 0.25% 0 0 27338.0000 5 27405.9994 Cuts: 8 264 0.25% * 0+ 0 27338.0000 27338.0000 0.00% 0 0 cutoff 27338.0000 27338.0000 264 0.00% Elapsed time = 3.92 sec. (3192.93 ticks, tree = 0.01 MB) Clique cuts applied: 17 Implied bound cuts applied: 16 Mixed integer rounding cuts applied: 2 Gomory fractional cuts applied: 1 Root node processing (before b&c): Real time = 3.94 sec. (3193.19 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.94 sec. (3193.19 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 27338 264 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 2: PHASE II: OPTIMIZATION ITERATION #2 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 2 set Conf := (11,12,43) (13,14,11) (13,14,15) (10,12,44) (11,12,44) (13,14,9) (13,14,12) (13,14,42) (11,12,7); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 14329 rows, 19710 columns, and 92449 nonzeros. Reduced MIP has 16754 binaries, 67 generals, 0 SOSs, and 27628 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 2145 rows and 1922 columns. MIP Presolve modified 14942 coefficients. Reduced MIP has 11355 rows, 16089 columns, and 90385 nonzeros. Reduced MIP has 14635 binaries, 67 generals, 0 SOSs, and 24697 indicators. Probing fixed 13075 vars, tightened 942 bounds. Probing changed sense of 26 constraints. Probing time = 2.41 sec. (648.55 ticks) Cover probing fixed 0 vars, tightened 2079 bounds. MIP Presolve eliminated 9719 rows and 14735 columns. MIP Presolve modified 1785 coefficients. Reduced MIP has 1358 rows, 1004 columns, and 5665 nonzeros. Reduced MIP has 762 binaries, 46 generals, 0 SOSs, and 1499 indicators. Probing fixed 3 vars, tightened 110 bounds. Probing changed sense of 6 constraints. Probing time = 0.08 sec. (35.84 ticks) Cover probing fixed 0 vars, tightened 155 bounds. MIP Presolve eliminated 710 rows and 473 columns. MIP Presolve modified 283 coefficients. Reduced MIP has 648 rows, 531 columns, and 2947 nonzeros. Reduced MIP has 405 binaries, 24 generals, 0 SOSs, and 814 indicators. Probing fixed 0 vars, tightened 47 bounds. Probing time = 0.03 sec. (17.29 ticks) MIP Presolve modified 137 coefficients. Reduced MIP has 648 rows, 531 columns, and 2947 nonzeros. Reduced MIP has 405 binaries, 24 generals, 0 SOSs, and 814 indicators. Probing fixed 0 vars, tightened 4 bounds. Probing time = 0.03 sec. (12.88 ticks) Clique table members: 11075. 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.35 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 34762.0000 26359.9997 24.17% 0 0 27313.2906 27 34762.0000 27313.2906 239 21.43% * 0+ 0 27338.0000 27313.2906 0.09% 0 0 cutoff 27338.0000 27338.0000 266 0.00% Elapsed time = 4.09 sec. (3826.21 ticks, tree = 0.01 MB) Clique cuts applied: 27 Implied bound cuts applied: 43 Mixed integer rounding cuts applied: 1 Gomory fractional cuts applied: 2 Root node processing (before b&c): Real time = 4.09 sec. (3826.47 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. (3826.47 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 27338 266 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 2: PHASE II: OPTIMIZATION ITERATION #3 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 1 set Conf := (11,12,43) (13,14,11) (13,14,15) (10,12,44) (11,12,44) (13,14,9) (13,14,12) (13,14,42) (11,12,7) (10,11,44); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 14609 rows, 19920 columns, and 93589 nonzeros. Reduced MIP has 16954 binaries, 67 generals, 0 SOSs, and 27827 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 2220 rows and 2112 columns. MIP Presolve modified 14942 coefficients. Reduced MIP has 11385 rows, 16109 columns, and 90493 nonzeros. Reduced MIP has 14645 binaries, 67 generals, 0 SOSs, and 24702 indicators. Probing fixed 13075 vars, tightened 1013 bounds. Probing changed sense of 31 constraints. Probing time = 2.59 sec. (647.66 ticks) Cover probing fixed 0 vars, tightened 2103 bounds. MIP Presolve eliminated 9742 rows and 14754 columns. MIP Presolve modified 1861 coefficients. Reduced MIP has 1382 rows, 1016 columns, and 5710 nonzeros. Reduced MIP has 767 binaries, 48 generals, 0 SOSs, and 1502 indicators. Probing fixed 2 vars, tightened 111 bounds. Probing changed sense of 6 constraints. Probing time = 0.08 sec. (36.08 ticks) Cover probing fixed 0 vars, tightened 157 bounds. MIP Presolve eliminated 734 rows and 485 columns. MIP Presolve modified 286 coefficients. Reduced MIP has 648 rows, 531 columns, and 2947 nonzeros. Reduced MIP has 405 binaries, 24 generals, 0 SOSs, and 814 indicators. Probing fixed 0 vars, tightened 47 bounds. Probing time = 0.03 sec. (17.21 ticks) MIP Presolve modified 137 coefficients. Reduced MIP has 648 rows, 531 columns, and 2947 nonzeros. Reduced MIP has 405 binaries, 24 generals, 0 SOSs, and 814 indicators. Probing fixed 0 vars, tightened 4 bounds. Probing time = 0.03 sec. (12.90 ticks) Clique table members: 11075. 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.26 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 27848.0000 26359.9997 5.34% 0 0 27313.2906 27 27848.0000 27313.2906 234 1.92% * 0+ 0 27338.0000 27313.2906 0.09% 0 0 cutoff 27338.0000 27338.0000 260 0.00% Elapsed time = 4.33 sec. (3294.98 ticks, tree = 0.01 MB) Clique cuts applied: 3 Implied bound cuts applied: 17 Root node processing (before b&c): Real time = 4.33 sec. (3295.25 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.33 sec. (3295.25 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 27338 260 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 2: PHASE II: OPTIMIZATION ITERATION #4 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 0 set Conf := (11,12,43) (13,14,11) (13,14,15) (10,12,44) (11,12,44) (13,14,9) (13,14,12) (13,14,42) (11,12,7) (10,11,44); ------- GROUP 2: CONFLICT-FREE SOLUTION FOUND AFTER #4 ITERATIONS -------- ---------- START PROCESSING FOR THE FIRST 3 GROUP(S)----------- CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 MIP Presolve eliminated 884 rows and 480 columns. MIP Presolve modified 11171 coefficients. Reduced MIP has 8061 rows, 12972 columns, and 73330 nonzeros. Reduced MIP has 12824 binaries, 69 generals, 0 SOSs, and 21963 indicators. Probing fixed 11505 vars, tightened 80 bounds. Probing time = 1.69 sec. (459.41 ticks) Cover probing fixed 22 vars, tightened 850 bounds. MIP Presolve eliminated 7526 rows and 12331 columns. MIP Presolve modified 249 coefficients. Reduced MIP has 469 rows, 571 columns, and 3237 nonzeros. Reduced MIP has 536 binaries, 16 generals, 0 SOSs, and 1003 indicators. Probing fixed 44 vars, tightened 2 bounds. Probing time = 0.05 sec. (33.30 ticks) Cover probing fixed 0 vars, tightened 9 bounds. MIP Presolve eliminated 37 rows and 66 columns. MIP Presolve modified 79 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.02 sec. (4.10 ticks) Cover probing fixed 0 vars, tightened 9 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.02 sec. (3.41 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 51582.0000 46711.9998 9.44% 0 0 47410.0000 11 51582.0000 47410.0000 193 8.09% * 0+ 0 47410.0000 47410.0000 0.00% 0 0 cutoff 47410.0000 47410.0000 198 0.00% Elapsed time = 3.34 sec. (2927.17 ticks, tree = 0.01 MB) Clique cuts applied: 3 Implied bound cuts applied: 13 Root node processing (before b&c): Real time = 3.34 sec. (2927.35 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.34 sec. (2927.35 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 47410 198 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 2 times No basis. ------- GROUP 3: PHASE II: OPTIMIZATION ITERATION #1 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 3 set Conf := (17,18,43) (19,20,44) (15,16,44); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 10790 rows, 15068 columns, and 73721 nonzeros. Reduced MIP has 14332 binaries, 69 generals, 0 SOSs, and 23261 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 1363 rows and 1023 columns. MIP Presolve modified 11237 coefficients. Reduced MIP has 8737 rows, 13420 columns, and 76292 nonzeros. Reduced MIP has 13010 binaries, 69 generals, 0 SOSs, and 22047 indicators. Probing fixed 11568 vars, tightened 492 bounds. Probing changed sense of 1 constraints. Probing time = 1.84 sec. (499.82 ticks) Cover probing fixed 36 vars, tightened 1769 bounds. MIP Presolve eliminated 8093 rows and 12685 columns. MIP Presolve modified 346 coefficients. Reduced MIP has 589 rows, 645 columns, and 3655 nonzeros. Reduced MIP has 582 binaries, 25 generals, 0 SOSs, and 1125 indicators. Probing fixed 46 vars, tightened 10 bounds. Probing time = 0.06 sec. (34.06 ticks) Cover probing fixed 0 vars, tightened 14 bounds. MIP Presolve eliminated 47 rows and 69 columns. MIP Presolve modified 89 coefficients. Reduced MIP has 541 rows, 575 columns, and 3428 nonzeros. Reduced MIP has 512 binaries, 25 generals, 0 SOSs, and 1032 indicators. Probing time = 0.02 sec. (4.08 ticks) Cover probing fixed 0 vars, tightened 9 bounds. Clique table members: 31131. 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. (3.14 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 47410.0000 1 47410.0000 242 0 0 47410.0000 1 Cuts: 25 264 0 0 47410.0000 2 Cuts: 6 271 * 0+ 0 47410.0000 47410.0000 0.00% 0 0 cutoff 47410.0000 47410.0000 271 0.00% Elapsed time = 3.27 sec. (2354.35 ticks, tree = 0.01 MB) Clique cuts applied: 9 Implied bound cuts applied: 15 Gomory fractional cuts applied: 1 Root node processing (before b&c): Real time = 3.27 sec. (2354.55 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.27 sec. (2354.55 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 47410 271 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 2 times No basis. ------- GROUP 3: PHASE II: OPTIMIZATION ITERATION #2 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 0 set Conf := (17,18,43) (19,20,44) (15,16,44); ------- 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 'c4854': 0 = 1. Root node processing (before b&c): Real time = 0.22 sec. (213.21 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.22 sec. (213.21 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 = 21 Step[a] = 12 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 7855 rows, 12690 columns, and 60996 nonzeros. Reduced MIP has 12556 binaries, 62 generals, 0 SOSs, and 21274 indicators. Retaining values of one MIP start for possible repair. Infeasibility row 'c5010': 0 = 1. Root node processing (before b&c): Real time = 0.27 sec. (229.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. (229.92 ticks) CPLEX 12.6.3.0: integer infeasible. 0 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 4: FIXXING ITERATION #2 --------- a = 23 Step[a] = 12 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 8064 rows, 12964 columns, and 62334 nonzeros. Reduced MIP has 12828 binaries, 63 generals, 0 SOSs, and 21705 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 917 rows and 511 columns. MIP Presolve modified 10734 coefficients. Reduced MIP has 6755 rows, 12111 columns, and 66664 nonzeros. Reduced MIP has 11975 binaries, 63 generals, 0 SOSs, and 21149 indicators. Probing fixed 3238 vars, tightened 0 bounds. Probing time = 1.31 sec. (389.69 ticks) Root node processing (before b&c): Real time = 2.72 sec. (2673.67 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.72 sec. (2673.67 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 = 21 Step[a] = 13 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 8319 rows, 13335 columns, and 64190 nonzeros. Reduced MIP has 13197 binaries, 64 generals, 0 SOSs, and 22323 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 973 rows and 509 columns. MIP Presolve modified 11178 coefficients. Reduced MIP has 6962 rows, 12477 columns, and 69201 nonzeros. Reduced MIP has 12339 binaries, 64 generals, 0 SOSs, and 21780 indicators. Probing fixed 3222 vars, tightened 0 bounds. Probing time = 1.13 sec. (392.97 ticks) Root node processing (before b&c): Real time = 2.59 sec. (2736.08 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.59 sec. (2736.08 ticks) CPLEX 12.6.3.0: integer infeasible. 0 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 4 times No basis. ------- GROUP 4: FIXXING ITERATION #4 --------- a = 23 Step[a] = 13 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 8549 rows, 13635 columns, and 65679 nonzeros. Reduced MIP has 13495 binaries, 65 generals, 0 SOSs, and 22802 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 963 rows and 506 columns. MIP Presolve modified 11726 coefficients. Reduced MIP has 7194 rows, 12780 columns, and 71175 nonzeros. Reduced MIP has 12640 binaries, 65 generals, 0 SOSs, and 22264 indicators. Probing fixed 3216 vars, tightened 0 bounds. Probing time = 1.34 sec. (399.67 ticks) Root node processing (before b&c): Real time = 2.83 sec. (2816.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) = 2.83 sec. (2816.98 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 #5 --------- a = 21 Step[a] = 14 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 8810 rows, 14020 columns, and 67615 nonzeros. Reduced MIP has 13878 binaries, 66 generals, 0 SOSs, and 23448 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 955 rows and 504 columns. MIP Presolve modified 12241 coefficients. Reduced MIP has 7461 rows, 13165 columns, and 73143 nonzeros. Reduced MIP has 13023 binaries, 66 generals, 0 SOSs, and 22912 indicators. Probing fixed 10298 vars, tightened 91 bounds. Probing changed sense of 28 constraints. Probing time = 1.53 sec. (426.01 ticks) Root node processing (before b&c): Real time = 2.98 sec. (2968.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) = 2.98 sec. (2968.93 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 #6 --------- a = 23 Step[a] = 14 CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 9052 rows, 14353 columns, and 69266 nonzeros. Reduced MIP has 14209 binaries, 67 generals, 0 SOSs, and 23990 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 951 rows and 505 columns. MIP Presolve modified 12784 coefficients. Reduced MIP has 7704 rows, 13495 columns, and 75008 nonzeros. Reduced MIP has 13351 binaries, 67 generals, 0 SOSs, and 23454 indicators. Probing fixed 12305 vars, tightened 131 bounds. Probing changed sense of 4 constraints. Probing time = 1.67 sec. (464.57 ticks) Cover probing fixed 9 vars, tightened 434 bounds. MIP Presolve eliminated 7214 rows and 12994 columns. MIP Presolve modified 211 coefficients. Reduced MIP has 405 rows, 415 columns, and 2693 nonzeros. Reduced MIP has 385 binaries, 13 generals, 0 SOSs, and 843 indicators. Probing fixed 24 vars, tightened 1 bounds. Probing time = 0.05 sec. (22.08 ticks) Cover probing fixed 0 vars, tightened 1 bounds. MIP Presolve eliminated 44 rows and 41 columns. MIP Presolve modified 76 coefficients. Reduced MIP has 358 rows, 371 columns, and 2453 nonzeros. Reduced MIP has 341 binaries, 13 generals, 0 SOSs, and 793 indicators. Probing time = 0.00 sec. (3.85 ticks) Clique table members: 23815. 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.09 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 74972.0000 70812.9997 5.55% 0 0 71340.0000 7 74972.0000 71340.0000 129 4.84% * 0+ 0 71340.0000 71340.0000 0.00% 0 0 cutoff 71340.0000 71340.0000 133 0.00% Elapsed time = 3.44 sec. (3210.30 ticks, tree = 0.01 MB) Implied bound cuts applied: 4 Root node processing (before b&c): Real time = 3.44 sec. (3210.49 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. (3210.49 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 71340 133 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 2 times No basis. ------- GROUP 4: INFEASIBILITY FIXING FINISHED -------- ------- GROUP 4: PHASE II: OPTIMIZATION ITERATION #1 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 2 set Conf := (23,25,43) (20,21,28); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 9875 rows, 15061 columns, and 71569 nonzeros. Reduced MIP has 14657 binaries, 67 generals, 0 SOSs, and 24482 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 1193 rows and 885 columns. MIP Presolve modified 12819 coefficients. Reduced MIP has 8008 rows, 13692 columns, and 75991 nonzeros. Reduced MIP has 13431 binaries, 67 generals, 0 SOSs, and 23495 indicators. Probing fixed 12348 vars, tightened 430 bounds. Probing changed sense of 4 constraints. Probing time = 1.83 sec. (459.24 ticks) Cover probing fixed 9 vars, tightened 1062 bounds. MIP Presolve eliminated 7520 rows and 13191 columns. MIP Presolve modified 199 coefficients. Reduced MIP has 404 rows, 411 columns, and 2684 nonzeros. Reduced MIP has 380 binaries, 14 generals, 0 SOSs, and 839 indicators. Probing fixed 23 vars, tightened 1 bounds. Probing time = 0.05 sec. (21.57 ticks) Cover probing fixed 0 vars, tightened 1 bounds. MIP Presolve eliminated 44 rows and 38 columns. MIP Presolve modified 35 coefficients. Reduced MIP has 358 rows, 371 columns, and 2453 nonzeros. Reduced MIP has 341 binaries, 13 generals, 0 SOSs, and 793 indicators. Probing time = 0.00 sec. (3.86 ticks) Clique table members: 23815. 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.67 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 75350.0000 70855.9994 5.96% 0 0 71380.0000 7 75350.0000 71380.0000 159 5.27% * 0+ 0 71380.0000 71380.0000 0.00% 0 0 cutoff 71380.0000 71380.0000 163 0.00% Elapsed time = 3.25 sec. (2480.17 ticks, tree = 0.01 MB) Implied bound cuts applied: 4 Root node processing (before b&c): Real time = 3.25 sec. (2480.37 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.25 sec. (2480.37 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 71380 163 MIP simplex iterations 0 branch-and-bound nodes absmipgap = 1.45519e-11, relmipgap = 2.03865e-16 Tried aggregator 2 times No basis. ------- GROUP 4: PHASE II: OPTIMIZATION ITERATION #2 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 1 set Conf := (23,25,43) (20,21,28) (23,25,16); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 10345 rows, 15523 columns, and 73575 nonzeros. Reduced MIP has 14867 binaries, 67 generals, 0 SOSs, and 24734 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 1297 rows and 1013 columns. MIP Presolve modified 12786 coefficients. Reduced MIP has 8320 rows, 13885 columns, and 77271 nonzeros. Reduced MIP has 13513 binaries, 67 generals, 0 SOSs, and 23535 indicators. Probing fixed 12387 vars, tightened 1710 bounds. Probing changed sense of 1 constraints. Probing time = 1.89 sec. (509.08 ticks) Cover probing fixed 15 vars, tightened 1592 bounds. MIP Presolve eliminated 7848 rows and 13399 columns. MIP Presolve modified 221 coefficients. Reduced MIP has 391 rows, 399 columns, and 2592 nonzeros. Reduced MIP has 368 binaries, 14 generals, 0 SOSs, and 819 indicators. Probing fixed 13 vars, tightened 0 bounds. Probing time = 0.05 sec. (20.85 ticks) MIP Presolve eliminated 31 rows and 26 columns. MIP Presolve modified 37 coefficients. Reduced MIP has 358 rows, 371 columns, and 2453 nonzeros. Reduced MIP has 341 binaries, 13 generals, 0 SOSs, and 793 indicators. Probing time = 0.00 sec. (3.86 ticks) Clique table members: 23815. 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.07 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 75452.0000 70888.9999 6.05% 0 0 71412.0000 7 75452.0000 71412.0000 125 5.35% * 0+ 0 71412.0000 71412.0000 0.00% 0 0 cutoff 71412.0000 71412.0000 129 0.00% Elapsed time = 3.34 sec. (3211.44 ticks, tree = 0.01 MB) Implied bound cuts applied: 4 Root node processing (before b&c): Real time = 3.34 sec. (3211.65 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.34 sec. (3211.65 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 71412 129 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 2 times No basis. ------- GROUP 4: PHASE II: OPTIMIZATION ITERATION #3 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 1 set Conf := (23,25,43) (20,21,28) (23,25,16) (23,25,15); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 10849 rows, 16006 columns, and 75192 nonzeros. Reduced MIP has 15084 binaries, 67 generals, 0 SOSs, and 25000 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 1383 rows and 1127 columns. MIP Presolve modified 12824 coefficients. Reduced MIP has 8679 rows, 14097 columns, and 78362 nonzeros. Reduced MIP has 13611 binaries, 67 generals, 0 SOSs, and 23584 indicators. Probing fixed 12432 vars, tightened 1519 bounds. Probing changed sense of 7 constraints. Probing time = 1.83 sec. (474.97 ticks) Cover probing fixed 11 vars, tightened 2721 bounds. MIP Presolve eliminated 8016 rows and 13452 columns. MIP Presolve modified 355 coefficients. Reduced MIP has 588 rows, 531 columns, and 3288 nonzeros. Reduced MIP has 451 binaries, 25 generals, 0 SOSs, and 1016 indicators. Probing fixed 17 vars, tightened 19 bounds. Probing changed sense of 1 constraints. Probing time = 0.03 sec. (22.64 ticks) Cover probing fixed 0 vars, tightened 12 bounds. MIP Presolve eliminated 228 rows and 158 columns. MIP Presolve modified 68 coefficients. Reduced MIP has 358 rows, 371 columns, and 2453 nonzeros. Reduced MIP has 341 binaries, 13 generals, 0 SOSs, and 793 indicators. Probing fixed 0 vars, tightened 1 bounds. Probing time = 0.03 sec. (18.27 ticks) MIP Presolve modified 2 coefficients. Reduced MIP has 358 rows, 371 columns, and 2453 nonzeros. Reduced MIP has 341 binaries, 13 generals, 0 SOSs, and 793 indicators. Probing time = 0.02 sec. (3.80 ticks) Clique table members: 23815. 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.75 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 75418.0000 70927.0000 5.95% 0 0 71448.0000 7 75418.0000 71448.0000 171 5.26% * 0+ 0 71448.0000 71448.0000 0.00% 0 0 cutoff 71448.0000 71448.0000 175 0.00% Elapsed time = 3.36 sec. (2710.14 ticks, tree = 0.01 MB) Implied bound cuts applied: 4 Root node processing (before b&c): Real time = 3.36 sec. (2710.35 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.36 sec. (2710.35 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 71448 175 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) (20,21,28) (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 875 rows and 452 columns. MIP Presolve modified 15836 coefficients. Reduced MIP has 10867 rows, 17642 columns, and 96407 nonzeros. Reduced MIP has 17470 binaries, 81 generals, 0 SOSs, and 30033 indicators. Probing fixed 15541 vars, tightened 70 bounds. Probing time = 3.77 sec. (1010.03 ticks) Cover probing fixed 20 vars, tightened 933 bounds. MIP Presolve eliminated 9577 rows and 16104 columns. MIP Presolve modified 638 coefficients. Reduced MIP has 1100 rows, 1321 columns, and 7046 nonzeros. Reduced MIP has 1212 binaries, 50 generals, 0 SOSs, and 2437 indicators. Probing fixed 92 vars, tightened 16 bounds. Probing changed sense of 4 constraints. Probing time = 0.13 sec. (58.51 ticks) Cover probing fixed 0 vars, tightened 32 bounds. MIP Presolve eliminated 757 rows and 929 columns. MIP Presolve modified 124 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 4 bounds. Probing time = 0.03 sec. (16.06 ticks) Cover probing fixed 0 vars, tightened 7 bounds. MIP Presolve modified 32 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.51 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.19 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 101872.0000 99478.9996 2.35% 0 0 100108.0000 18 101872.0000 100108.0000 132 1.73% * 0+ 0 100108.0000 100108.0000 0.00% 0 0 cutoff 100108.0000 100108.0000 142 0.00% Elapsed time = 6.47 sec. (5211.64 ticks, tree = 0.01 MB) Implied bound cuts applied: 10 Root node processing (before b&c): Real time = 6.47 sec. (5211.89 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.47 sec. (5211.89 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 100108 142 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 5: PHASE II: OPTIMIZATION ITERATION #1 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 7 set Conf := (27,29,12) (28,29,27) (28,29,44) (29,30,32) (27,29,15) (28,29,43) (28,30,29); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 20256 rows, 25800 columns, and 123259 nonzeros. Reduced MIP has 21468 binaries, 81 generals, 0 SOSs, and 34662 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 2136 rows and 1876 columns. MIP Presolve modified 16381 coefficients. Reduced MIP has 17963 rows, 21972 columns, and 122617 nonzeros. Reduced MIP has 19340 binaries, 81 generals, 0 SOSs, and 30964 indicators. Probing fixed 16332 vars, tightened 1396 bounds. Probing changed sense of 17 constraints. Probing time = 7.22 sec. (2183.95 ticks) Cover probing fixed 25 vars, tightened 2446 bounds. MIP Presolve eliminated 15321 rows and 19532 columns. MIP Presolve modified 3020 coefficients. Reduced MIP has 2255 rows, 1990 columns, and 10686 nonzeros. Reduced MIP has 1598 binaries, 64 generals, 0 SOSs, and 2792 indicators. Probing fixed 89 vars, tightened 131 bounds. Probing changed sense of 4 constraints. Probing time = 0.09 sec. (34.68 ticks) MIP Presolve eliminated 88 rows and 128 columns. MIP Presolve modified 2477 coefficients. Reduced MIP has 2159 rows, 1854 columns, and 10169 nonzeros. Reduced MIP has 1464 binaries, 62 generals, 0 SOSs, and 2618 indicators. Probing fixed 0 vars, tightened 9 bounds. Probing time = 0.06 sec. (17.19 ticks) Clique table members: 53006. 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. (23.53 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 99999.5875 31 99999.5875 871 * 0+ 0 100201.9994 99999.5875 0.20% 0 0 100108.0000 5 100201.9994 Cuts: 86 929 0.09% 0 0 100108.0000 5 100201.9994 Impl Bds: 6 935 0.09% * 0+ 0 100115.9994 100108.0000 0.01% Repair heuristic found nothing. Repeating presolve. MIP Presolve eliminated 1948 rows and 1631 columns. MIP Presolve modified 645 coefficients. Reduced MIP has 144 rows, 145 columns, and 616 nonzeros. Reduced MIP has 97 binaries, 15 generals, 0 SOSs, and 246 indicators. Probing fixed 27 vars, tightened 101 bounds. Probing changed sense of 2 constraints. Probing time = 0.01 sec. (1.36 ticks) Cover probing fixed 0 vars, tightened 84 bounds. MIP Presolve eliminated 36 rows and 48 columns. MIP Presolve modified 138 coefficients. Reduced MIP has 130 rows, 95 columns, and 454 nonzeros. Reduced MIP has 53 binaries, 10 generals, 0 SOSs, and 128 indicators. Probing fixed 0 vars, tightened 8 bounds. Probing changed sense of 1 constraints. Probing time = 0.00 sec. (0.59 ticks) Cover probing fixed 0 vars, tightened 46 bounds. MIP Presolve eliminated 10 rows and 0 columns. MIP Presolve modified 81 coefficients. Reduced MIP has 120 rows, 95 columns, and 434 nonzeros. Reduced MIP has 53 binaries, 10 generals, 0 SOSs, and 128 indicators. Represolve time = 0.03 sec. (18.04 ticks) Probing fixed 0 vars, tightened 1 bounds. Probing time = 0.00 sec. (0.52 ticks) Cover probing fixed 0 vars, tightened 78 bounds. Clique table members: 324. 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.29 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 100115.9994 100108.0000 0.01% 0 0 100108.0000 2 100115.9994 100108.0000 955 0.01% 0 0 100108.5503 11 100115.9994 Cuts: 27 978 0.01% 0 0 cutoff 100115.9994 982 0.00% Elapsed time = 9.89 sec. (5814.96 ticks, tree = 0.01 MB) Clique cuts applied: 18 Implied bound cuts applied: 13 Gomory fractional cuts applied: 1 Root node processing (before b&c): Real time = 9.89 sec. (5815.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) = 9.89 sec. (5815.26 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 100115.9994 982 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 5: PHASE II: OPTIMIZATION ITERATION #2 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 3 set Conf := (27,29,12) (28,29,27) (28,29,44) (29,30,32) (28,30,32) (27,29,15) (28,29,43) (28,30,29) (28,29,32) (29,30,33); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 23047 rows, 28452 columns, and 133333 nonzeros. Reduced MIP has 22656 binaries, 81 generals, 0 SOSs, and 36126 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 2678 rows and 2520 columns. MIP Presolve modified 16546 coefficients. Reduced MIP has 19875 rows, 23075 columns, and 129890 nonzeros. Reduced MIP has 19866 binaries, 81 generals, 0 SOSs, and 31232 indicators. Probing fixed 16534 vars, tightened 1935 bounds. Probing changed sense of 18 constraints. Probing time = 8.25 sec. (2545.66 ticks) Cover probing fixed 15 vars, tightened 3085 bounds. MIP Presolve eliminated 16758 rows and 20341 columns. MIP Presolve modified 4367 coefficients. Reduced MIP has 2636 rows, 2190 columns, and 11889 nonzeros. Reduced MIP has 1717 binaries, 64 generals, 0 SOSs, and 2854 indicators. Probing fixed 89 vars, tightened 166 bounds. Probing changed sense of 4 constraints. Probing time = 0.13 sec. (42.57 ticks) Cover probing fixed 0 vars, tightened 229 bounds. MIP Presolve eliminated 88 rows and 127 columns. MIP Presolve modified 3657 coefficients. Reduced MIP has 2540 rows, 2055 columns, and 11325 nonzeros. Reduced MIP has 1584 binaries, 62 generals, 0 SOSs, and 2678 indicators. Probing fixed 0 vars, tightened 9 bounds. Probing time = 0.06 sec. (18.63 ticks) Clique table members: 53106. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.05 sec. (33.51 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 99999.5875 33 99999.5875 999 * 0+ 0 100203.9988 99999.5875 0.20% 0 0 100108.0000 6 100203.9988 Cuts: 101 1078 0.10% 0 0 100108.0000 6 100203.9988 Impl Bds: 5 1084 0.10% Repair heuristic found nothing. Repeating presolve. MIP Presolve eliminated 1860 rows and 1363 columns. MIP Presolve modified 2729 coefficients. Reduced MIP has 575 rows, 577 columns, and 2809 nonzeros. Reduced MIP has 464 binaries, 33 generals, 0 SOSs, and 983 indicators. Probing fixed 120 vars, tightened 86 bounds. Probing changed sense of 2 constraints. Probing time = 0.02 sec. (14.57 ticks) Cover probing fixed 0 vars, tightened 81 bounds. MIP Presolve eliminated 92 rows and 164 columns. MIP Presolve modified 716 coefficients. Reduced MIP has 506 rows, 411 columns, and 2136 nonzeros. Reduced MIP has 306 binaries, 26 generals, 0 SOSs, and 645 indicators. Probing fixed 0 vars, tightened 17 bounds. Probing time = 0.01 sec. (9.97 ticks) MIP Presolve eliminated 25 rows and 1 columns. MIP Presolve modified 285 coefficients. Reduced MIP has 479 rows, 408 columns, and 2078 nonzeros. Reduced MIP has 304 binaries, 25 generals, 0 SOSs, and 645 indicators. Represolve time = 0.13 sec. (67.01 ticks) Probing fixed 0 vars, tightened 10 bounds. Probing time = 0.02 sec. (9.38 ticks) Clique table members: 5871. 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.66 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 100203.9988 100108.0000 0.10% 0 0 100108.0000 2 100203.9988 100108.0000 1238 0.10% 0 0 100108.0000 15 100203.9988 Cuts: 35 1278 0.10% 0 0 100108.5010 16 100203.9988 Cuts: 11 1306 0.10% Repair heuristic found nothing. Repeating presolve. MIP Presolve eliminated 212 rows and 169 columns. MIP Presolve modified 739 coefficients. Reduced MIP has 240 rows, 203 columns, and 911 nonzeros. Reduced MIP has 129 binaries, 23 generals, 0 SOSs, and 336 indicators. Probing fixed 24 vars, tightened 152 bounds. Probing time = 0.00 sec. (1.84 ticks) Cover probing fixed 0 vars, tightened 136 bounds. MIP Presolve eliminated 41 rows and 45 columns. MIP Presolve modified 195 coefficients. Reduced MIP has 226 rows, 156 columns, and 749 nonzeros. Reduced MIP has 88 binaries, 19 generals, 0 SOSs, and 216 indicators. Probing fixed 0 vars, tightened 11 bounds. Probing changed sense of 1 constraints. Probing time = 0.00 sec. (0.99 ticks) Cover probing fixed 0 vars, tightened 73 bounds. MIP Presolve eliminated 10 rows and 0 columns. MIP Presolve modified 108 coefficients. Reduced MIP has 216 rows, 156 columns, and 729 nonzeros. Reduced MIP has 88 binaries, 19 generals, 0 SOSs, and 216 indicators. Represolve time = 0.03 sec. (12.12 ticks) Probing fixed 0 vars, tightened 3 bounds. Probing time = 0.00 sec. (0.90 ticks) Cover probing fixed 0 vars, tightened 69 bounds. Clique table members: 491. Tightened 1 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. (1.11 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 100203.9988 100108.5010 0.10% 0 0 100114.6498 4 100203.9988 100114.6498 1395 0.09% 0 0 100138.0000 6 100203.9988 Cuts: 21 1418 0.07% 0 0 100138.0000 18 100203.9988 Cuts: 14 1433 0.07% 0 0 100138.0000 12 100203.9988 Cuts: 8 1453 0.07% 0 0 100138.0000 17 100203.9988 Impl Bds: 7 1460 0.07% 0 0 cutoff 100203.9988 100203.9988 1460 0.00% Elapsed time = 11.23 sec. (7719.24 ticks, tree = 0.01 MB) Clique cuts applied: 21 Cover cuts applied: 2 Implied bound cuts applied: 32 Flow cuts applied: 1 Mixed integer rounding cuts applied: 7 Gomory fractional cuts applied: 1 Root node processing (before b&c): Real time = 11.25 sec. (7719.57 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) = 11.25 sec. (7719.57 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 100203.9988 1460 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 5: PHASE II: OPTIMIZATION ITERATION #3 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 2 set Conf := (27,29,12) (28,29,27) (28,29,44) (29,30,32) (28,30,32) (28,30,33) (27,29,15) (28,29,43) (28,30,29) (28,29,32) (29,30,33) (29,30,35); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 24957 rows, 30204 columns, and 140655 nonzeros. Reduced MIP has 23430 binaries, 81 generals, 0 SOSs, and 37104 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 3058 rows and 2931 columns. MIP Presolve modified 16705 coefficients. Reduced MIP has 21246 rows, 23861 columns, and 135297 nonzeros. Reduced MIP has 20253 binaries, 81 generals, 0 SOSs, and 31427 indicators. Probing fixed 16711 vars, tightened 2545 bounds. Probing changed sense of 45 constraints. Probing time = 8.84 sec. (2651.07 ticks) Cover probing fixed 30 vars, tightened 3340 bounds. MIP Presolve eliminated 18013 rows and 21073 columns. MIP Presolve modified 4999 coefficients. Reduced MIP has 2752 rows, 2243 columns, and 12240 nonzeros. Reduced MIP has 1738 binaries, 64 generals, 0 SOSs, and 2846 indicators. Probing fixed 78 vars, tightened 183 bounds. Probing changed sense of 4 constraints. Probing time = 0.14 sec. (43.49 ticks) MIP Presolve eliminated 86 rows and 116 columns. MIP Presolve modified 2979 coefficients. Reduced MIP has 2662 rows, 2123 columns, and 11725 nonzeros. Reduced MIP has 1620 binaries, 62 generals, 0 SOSs, and 2696 indicators. Probing fixed 0 vars, tightened 9 bounds. Probing time = 0.06 sec. (18.93 ticks) Clique table members: 53122. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.05 sec. (33.56 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 99999.5875 33 99999.5875 996 0 0 100108.0000 6 Cuts: 96 1085 0 0 100108.0000 6 Cuts: 8 1093 * 0+ 0 100412.0000 100108.0000 0.30% 0 0 100108.0000 6 100412.0000 Flowcuts: 1 1094 0.30% 0 0 100108.0000 6 100412.0000 MIRcuts: 5 1098 0.30% * 0+ 0 100356.0000 100108.0000 0.25% Repair heuristic found nothing. 0 2 100108.0000 6 100356.0000 100108.0000 1098 0.25% Elapsed time = 11.78 sec. (6725.88 ticks, tree = 0.01 MB) * 23 18 integral 0 100350.0000 100108.0000 1959 0.24% * 62+ 44 100334.0000 100108.0000 0.23% * 65 42 integral 0 100234.0000 100108.0000 2618 0.13% * 68 39 integral 0 100234.0000 100108.0000 2625 0.13% Clique cuts applied: 32 Implied bound cuts applied: 111 Flow cuts applied: 3 Mixed integer rounding cuts applied: 7 Gomory fractional cuts applied: 1 Root node processing (before b&c): Real time = 11.77 sec. (6724.64 ticks) Parallel b&c, 4 threads: Real time = 0.38 sec. (222.58 ticks) Sync time (average) = 0.14 sec. Wait time (average) = 0.15 sec. ------------ Total (root+branch&cut) = 12.14 sec. (6947.22 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 100234 4420 MIP simplex iterations 200 branch-and-bound nodes Tried aggregator 2 times No basis. ------- GROUP 5: PHASE II: OPTIMIZATION ITERATION #4 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 0 set Conf := (27,29,12) (28,29,27) (28,29,44) (29,30,32) (28,30,32) (28,30,33) (27,29,15) (28,29,43) (28,30,29) (28,29,32) (29,30,33) (29,30,35); ------- GROUP 5: CONFLICT-FREE SOLUTION FOUND AFTER #4 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 904 rows and 481 columns. MIP Presolve modified 12191 coefficients. Reduced MIP has 7094 rows, 11915 columns, and 67690 nonzeros. Reduced MIP has 11775 binaries, 65 generals, 0 SOSs, and 20332 indicators. Probing fixed 10982 vars, tightened 103 bounds. Probing time = 0.83 sec. (212.19 ticks) Cover probing fixed 13 vars, tightened 719 bounds. MIP Presolve eliminated 6886 rows and 11684 columns. MIP Presolve modified 48 coefficients. Reduced MIP has 168 rows, 177 columns, and 896 nonzeros. Reduced MIP has 148 binaries, 13 generals, 0 SOSs, and 334 indicators. Probing fixed 2 vars, tightened 6 bounds. Probing changed sense of 2 constraints. Probing time = 0.02 sec. (3.39 ticks) Cover probing fixed 0 vars, tightened 35 bounds. MIP Presolve eliminated 3 rows and 4 columns. MIP Presolve modified 4 coefficients. Reduced MIP has 165 rows, 173 columns, and 884 nonzeros. Reduced MIP has 144 binaries, 13 generals, 0 SOSs, and 330 indicators. Probing time = 0.02 sec. (2.68 ticks) Cover probing fixed 0 vars, tightened 24 bounds. Clique table members: 3854. 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.82 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 132368.0000 131515.9999 0.64% 0 0 132112.0000 14 132368.0000 132112.0000 78 0.19% * 0+ 0 132112.0000 132112.0000 0.00% 0 0 cutoff 132112.0000 132112.0000 88 0.00% Elapsed time = 2.20 sec. (2373.45 ticks, tree = 0.01 MB) Implied bound cuts applied: 11 Root node processing (before b&c): Real time = 2.20 sec. (2373.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) = 2.20 sec. (2373.63 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 132112 88 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 6: PHASE II: OPTIMIZATION ITERATION #1 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 13 set Conf := (31,32,11) (31,33,42) (32,33,42) (29,31,31) (30,32,15) (31,32,42) (31,34,43) (34,35,44) (30,31,44) (31,33,27) (32,33,11) (28,32,44) (30,32,12); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 15517 rows, 18683 columns, and 88706 nonzeros. Reduced MIP has 15823 binaries, 65 generals, 0 SOSs, and 24691 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 2806 rows and 2746 columns. MIP Presolve modified 12267 coefficients. Reduced MIP has 11328 rows, 14538 columns, and 83882 nonzeros. Reduced MIP has 12889 binaries, 65 generals, 0 SOSs, and 20884 indicators. Probing fixed 11482 vars, tightened 2711 bounds. Probing changed sense of 28 constraints. Probing time = 1.59 sec. (442.79 ticks) Cover probing fixed 7 vars, tightened 2105 bounds. MIP Presolve eliminated 10266 rows and 13582 columns. MIP Presolve modified 840 coefficients. Reduced MIP has 953 rows, 735 columns, and 3935 nonzeros. Reduced MIP has 520 binaries, 60 generals, 0 SOSs, and 1215 indicators. Probing fixed 2 vars, tightened 93 bounds. Probing changed sense of 4 constraints. Probing time = 0.03 sec. (13.46 ticks) Cover probing fixed 0 vars, tightened 108 bounds. MIP Presolve eliminated 52 rows and 10 columns. MIP Presolve modified 237 coefficients. Reduced MIP has 903 rows, 725 columns, and 3826 nonzeros. Reduced MIP has 514 binaries, 56 generals, 0 SOSs, and 1203 indicators. Probing fixed 0 vars, tightened 33 bounds. Probing time = 0.03 sec. (12.44 ticks) Cover probing fixed 0 vars, tightened 51 bounds. Clique table members: 10894. 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. (5.33 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 132045.9395 24 132045.9395 368 0 0 132090.8527 23 Cuts: 89 423 0 0 132112.0000 4 Cuts: 17 432 * 0+ 0 132228.0000 132112.0000 0.09% 0 0 132112.0000 4 132228.0000 Cuts: 3 436 0.09% 0 0 132112.0000 4 132228.0000 MIRcuts: 2 437 0.09% * 0+ 0 132114.0000 132112.0000 0.00% * 0+ 0 132112.0000 132112.0000 0.00% 0 0 cutoff 132112.0000 132112.0000 437 0.00% Elapsed time = 3.08 sec. (2156.02 ticks, tree = 0.01 MB) Clique cuts applied: 14 Cover cuts applied: 3 Implied bound cuts applied: 40 Flow cuts applied: 2 Mixed integer rounding cuts applied: 3 Lift and project cuts applied: 1 Gomory fractional cuts applied: 4 Root node processing (before b&c): Real time = 3.09 sec. (2156.28 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.09 sec. (2156.28 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 132112 437 MIP simplex iterations 0 branch-and-bound nodes No basis. ------- GROUP 6: PHASE II: OPTIMIZATION ITERATION #2 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 5 set Conf := (31,32,11) (31,33,42) (32,33,42) (29,31,31) (30,32,15) (28,31,32) (31,32,42) (31,34,43) (34,35,44) (30,31,44) (31,34,16) (29,31,33) (31,33,27) (32,33,11) (28,32,44) (30,32,12) (33,34,44) (30,32,16); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 17763 rows, 20413 columns, and 97036 nonzeros. Reduced MIP has 17005 binaries, 65 generals, 0 SOSs, and 25963 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 3518 rows and 3716 columns. MIP Presolve modified 12285 coefficients. Reduced MIP has 12099 rows, 15020 columns, and 87386 nonzeros. Reduced MIP has 13100 binaries, 65 generals, 0 SOSs, and 20990 indicators. Probing fixed 11563 vars, tightened 2578 bounds. Probing changed sense of 30 constraints. Probing time = 1.73 sec. (478.79 ticks) Cover probing fixed 6 vars, tightened 2825 bounds. MIP Presolve eliminated 10837 rows and 13930 columns. MIP Presolve modified 1146 coefficients. Reduced MIP has 1104 rows, 820 columns, and 4381 nonzeros. Reduced MIP has 571 binaries, 60 generals, 0 SOSs, and 1240 indicators. Probing fixed 2 vars, tightened 111 bounds. Probing changed sense of 4 constraints. Probing time = 0.03 sec. (16.48 ticks) Cover probing fixed 0 vars, tightened 161 bounds. MIP Presolve eliminated 52 rows and 11 columns. MIP Presolve modified 595 coefficients. Reduced MIP has 1053 rows, 808 columns, and 4270 nonzeros. Reduced MIP has 564 binaries, 56 generals, 0 SOSs, and 1228 indicators. Probing fixed 0 vars, tightened 40 bounds. Probing time = 0.03 sec. (15.27 ticks) Cover probing fixed 0 vars, tightened 80 bounds. Clique table members: 10937. 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. (6.76 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 132045.9395 28 132045.9395 395 * 0+ 0 132140.0000 132045.9395 0.07% 0 0 132090.8527 24 132140.0000 Cuts: 109 457 0.02% 0 0 132126.5914 37 132140.0000 Cuts: 48 515 0.01% * 0+ 0 132134.0000 132126.5914 0.01% Repair heuristic succeeded. 0 0 cutoff 132134.0000 132134.0000 516 0.00% Elapsed time = 3.25 sec. (2377.99 ticks, tree = 0.01 MB) Clique cuts applied: 12 Cover cuts applied: 4 Implied bound cuts applied: 45 Flow cuts applied: 1 Mixed integer rounding cuts applied: 2 Gomory fractional cuts applied: 4 Root node processing (before b&c): Real time = 3.25 sec. (2378.27 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.25 sec. (2378.27 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 132134 516 MIP simplex iterations 0 branch-and-bound nodes Tried aggregator 2 times No basis. ------- GROUP 6: PHASE II: OPTIMIZATION ITERATION #3 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 4 set Conf := (31,32,11) (31,34,43) (28,32,44) (30,32,15) (29,31,33) (29,31,35) (31,32,42) (32,33,11) (29,31,31) (31,34,16) (30,32,16) (30,32,43) (31,33,27) (32,33,42) (30,31,44) (33,34,44) (31,34,15) (31,33,42) (34,35,44) (30,32,12) (28,31,32) (28,31,33); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 19701 rows, 21774 columns, and 102160 nonzeros. Reduced MIP has 18012 binaries, 65 generals, 0 SOSs, and 27041 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 4178 rows and 4554 columns. MIP Presolve modified 12345 coefficients. Reduced MIP has 12665 rows, 15360 columns, and 89019 nonzeros. Reduced MIP has 13255 binaries, 65 generals, 0 SOSs, and 21075 indicators. Probing fixed 11629 vars, tightened 2080 bounds. Probing changed sense of 38 constraints. Probing time = 1.69 sec. (471.93 ticks) Cover probing fixed 5 vars, tightened 3031 bounds. MIP Presolve eliminated 11371 rows and 14259 columns. MIP Presolve modified 1252 coefficients. Reduced MIP has 1143 rows, 841 columns, and 4489 nonzeros. Reduced MIP has 585 binaries, 58 generals, 0 SOSs, and 1240 indicators. Probing fixed 2 vars, tightened 187 bounds. Probing changed sense of 4 constraints. Probing time = 0.03 sec. (17.50 ticks) Cover probing fixed 0 vars, tightened 131 bounds. MIP Presolve eliminated 54 rows and 11 columns. MIP Presolve modified 481 coefficients. Reduced MIP has 1089 rows, 830 columns, and 4368 nonzeros. Reduced MIP has 576 binaries, 56 generals, 0 SOSs, and 1236 indicators. Probing fixed 0 vars, tightened 31 bounds. Probing time = 0.03 sec. (15.85 ticks) Cover probing fixed 0 vars, tightened 73 bounds. Clique table members: 10920. 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. (7.10 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 132045.9395 29 132045.9395 401 * 0+ 0 132340.0000 132045.9395 0.22% 0 0 132122.9420 77 132340.0000 Cuts: 136 501 0.16% 0 0 132183.2923 76 132340.0000 Cuts: 127 574 0.12% 0 0 132198.8215 60 132340.0000 Cuts: 98 625 0.11% 0 0 132202.0356 84 132340.0000 Cuts: 39 644 0.10% 0 0 132202.9782 78 132340.0000 Cuts: 6 656 0.10% * 0+ 0 132288.0000 132202.9782 0.06% Repair heuristic succeeded. 0 2 132202.9782 76 132288.0000 132202.9782 656 0.06% Elapsed time = 3.38 sec. (2417.80 ticks, tree = 0.01 MB) * 157 76 integral 0 132244.0000 132203.5681 2018 0.03% Clique cuts applied: 60 Cover cuts applied: 8 Implied bound cuts applied: 86 Flow cuts applied: 2 Mixed integer rounding cuts applied: 6 Gomory fractional cuts applied: 3 Root node processing (before b&c): Real time = 3.38 sec. (2417.27 ticks) Parallel b&c, 4 threads: Real time = 0.11 sec. (56.32 ticks) Sync time (average) = 0.04 sec. Wait time (average) = 0.05 sec. ------------ Total (root+branch&cut) = 3.49 sec. (2473.59 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 132244 2773 MIP simplex iterations 267 branch-and-bound nodes No basis. ------- GROUP 6: PHASE II: OPTIMIZATION ITERATION #4 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 5 set Conf := (31,32,11) (32,33,11) (30,31,44) (28,31,32) (29,31,35) (28,31,35) (31,32,42) (32,33,42) (30,32,12) (29,31,33) (30,32,43) (29,31,44) (31,33,27) (34,35,44) (30,32,15) (30,32,16) (31,33,29) (31,33,42) (28,32,44) (31,34,16) (31,34,15) (31,34,11) (31,34,43) (29,31,31) (33,34,44) (28,31,33) (31,34,42); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 22582 rows, 24082 columns, and 113314 nonzeros. Reduced MIP has 19316 binaries, 65 generals, 0 SOSs, and 28566 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 4890 rows and 5405 columns. MIP Presolve modified 12535 coefficients. Reduced MIP has 14256 rows, 16281 columns, and 95131 nonzeros. Reduced MIP has 13694 binaries, 65 generals, 0 SOSs, and 21305 indicators. Probing fixed 11811 vars, tightened 2682 bounds. Probing changed sense of 58 constraints. Probing time = 1.94 sec. (532.72 ticks) Cover probing fixed 18 vars, tightened 3731 bounds. MIP Presolve eliminated 12862 rows and 15120 columns. MIP Presolve modified 1378 coefficients. Reduced MIP has 1229 rows, 892 columns, and 4765 nonzeros. Reduced MIP has 614 binaries, 58 generals, 0 SOSs, and 1265 indicators. Probing fixed 3 vars, tightened 219 bounds. Probing changed sense of 4 constraints. Probing time = 0.03 sec. (19.60 ticks) Cover probing fixed 0 vars, tightened 220 bounds. MIP Presolve eliminated 49 rows and 12 columns. MIP Presolve modified 773 coefficients. Reduced MIP has 1180 rows, 878 columns, and 4651 nonzeros. Reduced MIP has 604 binaries, 56 generals, 0 SOSs, and 1251 indicators. Probing fixed 0 vars, tightened 42 bounds. Probing time = 0.05 sec. (17.92 ticks) Cover probing fixed 0 vars, tightened 130 bounds. Clique table members: 10881. 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.02 sec. (8.15 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 132045.9395 31 132045.9395 443 0 0 132122.9420 68 Cuts: 138 528 0 0 132180.9666 80 Cuts: 135 576 0 0 132184.2738 73 Cuts: 39 613 0 0 132184.4498 73 Cuts: 71 634 0 0 132188.9752 79 Cuts: 64 680 * 0+ 0 136136.0000 132188.9752 2.90% * 0+ 0 132340.0000 132188.9752 0.11% * 0+ 0 132264.0000 132204.3288 0.05% Repair heuristic succeeded. 0 2 132189.1411 80 132264.0000 132204.3288 680 0.05% Elapsed time = 3.84 sec. (2970.36 ticks, tree = 0.01 MB) * 80 24 integral 0 132244.0000 132204.3288 1848 0.03% Clique cuts applied: 43 Cover cuts applied: 1 Implied bound cuts applied: 111 Flow cuts applied: 5 Mixed integer rounding cuts applied: 5 Gomory fractional cuts applied: 6 Root node processing (before b&c): Real time = 3.84 sec. (2969.82 ticks) Parallel b&c, 4 threads: Real time = 0.08 sec. (41.14 ticks) Sync time (average) = 0.02 sec. Wait time (average) = 0.04 sec. ------------ Total (root+branch&cut) = 3.92 sec. (3010.96 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 132244 2272 MIP simplex iterations 125 branch-and-bound nodes Tried aggregator 3 times No basis. ------- GROUP 6: PHASE II: OPTIMIZATION ITERATION #5 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 1 set Conf := (31,32,11) (32,33,11) (30,31,44) (28,31,32) (29,31,35) (28,31,35) (31,32,42) (32,33,42) (30,32,12) (29,31,33) (30,32,43) (29,31,44) (31,33,27) (34,35,44) (30,32,15) (30,32,16) (31,33,29) (29,31,34) (31,33,42) (28,32,44) (31,34,16) (31,34,15) (31,34,11) (31,34,43) (29,31,31) (33,34,44) (28,31,33) (31,34,42); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 23084 rows, 24381 columns, and 114582 nonzeros. Reduced MIP has 19593 binaries, 65 generals, 0 SOSs, and 28847 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 5097 rows and 5660 columns. MIP Presolve modified 12559 coefficients. Reduced MIP has 14323 rows, 16326 columns, and 95280 nonzeros. Reduced MIP has 13717 binaries, 65 generals, 0 SOSs, and 21316 indicators. Probing fixed 11822 vars, tightened 5671 bounds. Probing changed sense of 60 constraints. Probing time = 2.00 sec. (567.47 ticks) Cover probing fixed 17 vars, tightened 3254 bounds. MIP Presolve eliminated 12921 rows and 15158 columns. MIP Presolve modified 1426 coefficients. Reduced MIP has 1244 rows, 896 columns, and 4796 nonzeros. Reduced MIP has 614 binaries, 59 generals, 0 SOSs, and 1259 indicators. Probing fixed 3 vars, tightened 133 bounds. Probing changed sense of 4 constraints. Probing time = 0.03 sec. (19.65 ticks) Cover probing fixed 0 vars, tightened 226 bounds. MIP Presolve eliminated 57 rows and 11 columns. MIP Presolve modified 714 coefficients. Reduced MIP has 1185 rows, 883 columns, and 4664 nonzeros. Reduced MIP has 606 binaries, 56 generals, 0 SOSs, and 1253 indicators. Probing fixed 0 vars, tightened 47 bounds. Probing time = 0.05 sec. (17.93 ticks) Cover probing fixed 0 vars, tightened 99 bounds. Clique table members: 10851. 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.02 sec. (7.87 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 132045.9395 31 132045.9395 429 0 0 132122.9420 85 Cuts: 161 541 0 0 132171.1077 124 Cuts: 149 592 0 0 132184.3520 70 Cuts: 21 619 0 0 132184.3852 76 Cuts: 66 645 0 0 132185.8807 80 Cuts: 25 694 * 0+ 0 135970.0000 132185.8807 2.78% * 0+ 0 132360.0000 132185.8807 0.13% Repair heuristic found nothing. 0 2 132186.1666 70 132360.0000 132201.5731 694 0.12% Elapsed time = 3.83 sec. (2866.42 ticks, tree = 0.01 MB) * 86 73 integral 0 132314.0000 132201.5731 1907 0.08% * 105 64 integral 0 132264.0000 132201.5731 2005 0.05% Clique cuts applied: 44 Cover cuts applied: 9 Implied bound cuts applied: 170 Flow cuts applied: 2 Mixed integer rounding cuts applied: 6 Zero-half cuts applied: 1 Lift and project cuts applied: 1 Gomory fractional cuts applied: 8 Root node processing (before b&c): Real time = 3.81 sec. (2865.86 ticks) Parallel b&c, 4 threads: Real time = 0.17 sec. (91.85 ticks) Sync time (average) = 0.02 sec. Wait time (average) = 0.03 sec. ------------ Total (root+branch&cut) = 3.98 sec. (2957.71 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 132264 4200 MIP simplex iterations 328 branch-and-bound nodes Tried aggregator 3 times No basis. ------- GROUP 6: PHASE II: OPTIMIZATION ITERATION #6 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 1 set Conf := (31,32,11) (32,33,11) (30,31,44) (28,31,32) (29,31,35) (28,31,35) (31,32,42) (32,33,42) (30,32,12) (29,31,33) (30,32,43) (29,31,44) (31,33,27) (34,35,44) (30,32,15) (30,32,16) (31,33,29) (29,31,34) (31,33,42) (28,32,44) (31,34,16) (31,34,15) (31,34,11) (28,31,44) (31,34,43) (29,31,31) (33,34,44) (28,31,33) (31,34,42); CPLEX 12.6.3.0: mipdisplay=2 integrality=1e-08 absmipgap=0 mipgap=0 Reduced MIP has 23588 rows, 24680 columns, and 116954 nonzeros. Reduced MIP has 19870 binaries, 65 generals, 0 SOSs, and 29131 indicators. Retaining values of one MIP start for possible repair. MIP Presolve eliminated 5310 rows and 5922 columns. MIP Presolve modified 12579 coefficients. Reduced MIP has 14371 rows, 16354 columns, and 95394 nonzeros. Reduced MIP has 13727 binaries, 65 generals, 0 SOSs, and 21326 indicators. Probing fixed 11822 vars, tightened 5421 bounds. Probing changed sense of 88 constraints. Probing time = 2.01 sec. (564.05 ticks) Cover probing fixed 17 vars, tightened 3360 bounds. MIP Presolve eliminated 12970 rows and 15189 columns. MIP Presolve modified 1467 coefficients. Reduced MIP has 1245 rows, 897 columns, and 4797 nonzeros. Reduced MIP has 615 binaries, 60 generals, 0 SOSs, and 1268 indicators. Probing fixed 3 vars, tightened 133 bounds. Probing changed sense of 4 constraints. Probing time = 0.05 sec. (19.70 ticks) Cover probing fixed 0 vars, tightened 154 bounds. MIP Presolve eliminated 59 rows and 13 columns. MIP Presolve modified 559 coefficients. Reduced MIP has 1188 rows, 884 columns, and 4669 nonzeros. Reduced MIP has 606 binaries, 56 generals, 0 SOSs, and 1254 indicators. Probing fixed 0 vars, tightened 46 bounds. Probing time = 0.05 sec. (18.16 ticks) Cover probing fixed 0 vars, tightened 85 bounds. Clique table members: 10849. 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. (7.95 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 132045.9395 31 132045.9395 449 * 0+ 0 132378.0000 132045.9395 0.25% 0 0 132090.8527 38 132378.0000 Cuts: 143 522 0.22% 0 0 132163.9361 96 132378.0000 Cuts: 94 592 0.16% 0 0 132185.7835 95 132378.0000 Cuts: 97 673 0.15% 0 0 132193.7460 56 132378.0000 Cuts: 82 700 0.14% 0 0 132198.8895 88 132378.0000 Cuts: 86 710 0.14% 0 0 132201.2796 90 132378.0000 Cuts: 18 739 0.13% Repair heuristic found nothing. 0 2 132201.2796 90 132378.0000 132208.9379 739 0.13% Elapsed time = 3.81 sec. (2552.08 ticks, tree = 0.01 MB) * 211 96 integral 0 132368.0000 132208.9379 3271 0.12% * 273 121 integral 0 132322.0000 132212.0000 3856 0.08% * 312+ 88 132294.0000 132212.0000 0.06% Clique cuts applied: 58 Cover cuts applied: 13 Implied bound cuts applied: 204 Flow cuts applied: 2 Mixed integer rounding cuts applied: 6 Zero-half cuts applied: 1 Gomory fractional cuts applied: 7 Root node processing (before b&c): Real time = 3.83 sec. (2551.50 ticks) Parallel b&c, 4 threads: Real time = 0.27 sec. (133.75 ticks) Sync time (average) = 0.04 sec. Wait time (average) = 0.06 sec. ------------ Total (root+branch&cut) = 4.09 sec. (2685.26 ticks) CPLEX 12.6.3.0: optimal integer solution; objective 132294 6370 MIP simplex iterations 494 branch-and-bound nodes No basis. ------- GROUP 6: PHASE II: OPTIMIZATION ITERATION #7 -------- FINDING NEW CONFLICT TUPLES ... OK nAdded = 0 set Conf := (31,32,11) (32,33,11) (30,31,44) (28,31,32) (29,31,35) (28,31,35) (31,32,42) (32,33,42) (30,32,12) (29,31,33) (30,32,43) (29,31,44) (31,33,27) (34,35,44) (30,32,15) (30,32,16) (31,33,29) (29,31,34) (31,33,42) (28,32,44) (31,34,16) (31,34,15) (31,34,11) (28,31,44) (31,34,43) (29,31,31) (33,34,44) (28,31,33) (31,34,42); ------- GROUP 6: CONFLICT-FREE SOLUTION FOUND AFTER #7 ITERATIONS -------- ampl: