Warning: Output names have been modified to conform to LP format. Default row names c1, c2 ... being created. Tried aggregator 5 times. MIP Presolve eliminated 149344 rows and 29356 columns. MIP Presolve modified 1537 coefficients. Aggregator did 1818 substitutions. Reduced MIP has 1020 rows, 602 columns, and 2650 nonzeros. Presolve time = 0.30 sec. Clique table members: 584. 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 -1141.5000 18 -1141.5000 48 * 0+ 0 -1141.0000 -1141.5000 48 0.04% 0 0 cutoff -1141.0000 -1141.5000 48 0.04% >>>>>>> Objval = -1141.000000 (int)-1141 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 1042.0000. Tried aggregator 7 times. MIP Presolve eliminated 149126 rows and 29097 columns. MIP Presolve modified 1584 coefficients. Aggregator did 1958 substitutions. Reduced MIP has 1096 rows, 721 columns, and 3006 nonzeros. Presolve time = 0.37 sec. Clique table members: 713. 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 -872.0625 33 1042.0000 -872.0625 65 183.69% * 0+ 0 -856.0000 -872.0625 65 1.88% 0 0 infeasible -856.0000 Cuts: 8 95 0.00% 0 0 cutoff -856.0000 -856.0000 95 0.00% Implied bound cuts applied: 1 Zero-half cuts applied: 2