Warning: Output names have been modified to conform to LP format. Default row names c1, c2 ... being created. Tried aggregator 6 times. MIP Presolve eliminated 149652 rows and 29503 columns. MIP Presolve modified 1531 coefficients. Aggregator did 1800 substitutions. Reduced MIP has 730 rows, 473 columns, and 1816 nonzeros. Presolve time = 0.39 sec. Clique table members: 518. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: none, using 1 thread. Root relaxation solution time = -0.00 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap 0 0 -1144.0000 3 -1144.0000 18 * 0+ 0 -1144.0000 -1144.0000 18 0.00% 0 0 cutoff -1144.0000 -1144.0000 18 0.00% >>>>>>> Objval = -1144.000000 (int)-1144 Warning: Output names have been modified to conform to LP format. Default row names c1, c2 ... being created. MIP start values provide initial solution with objective 1258.0000. Tried aggregator 4 times. MIP Presolve eliminated 149944 rows and 29649 columns. MIP Presolve modified 785 coefficients. Aggregator did 1843 substitutions. Reduced MIP has 395 rows, 284 columns, and 1005 nonzeros. Presolve time = 0.29 sec. Clique table members: 317. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: none, using 1 thread. Root relaxation solution time = 0.01 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap 0 0 -675.3750 16 1258.0000 -675.3750 40 153.69% * 0+ 0 -669.0000 -675.3750 40 0.95% 0 0 infeasible -669.0000 Cuts: 9 48 0.00% 0 0 cutoff -669.0000 -669.0000 48 0.00% Cover cuts applied: 1 Implied bound cuts applied: 1