Warning: Output names have been modified to conform to LP format. Default row names c1, c2 ... being created. Tried aggregator 11 times. MIP Presolve eliminated 210236 rows and 18145 columns. MIP Presolve modified 337 coefficients. Aggregator did 2485 substitutions. Reduced MIP has 893 rows, 289 columns, and 2637 nonzeros. Presolve time = 0.39 sec. Clique table members: 222. 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 0.0000 0.0000 0 0.00% 0 0 cutoff 0.0000 0.0000 0 0.00% >>>>>>> Objval = 0.000000 (int)0 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 195.0000. Tried aggregator 7 times. MIP Presolve eliminated 210113 rows and 18147 columns. MIP Presolve modified 108 coefficients. Aggregator did 2380 substitutions. Reduced MIP has 1121 rows, 392 columns, and 3403 nonzeros. Presolve time = 0.33 sec. Clique table members: 358. 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 integral 0 0.0000 0.0000 0 0.00% >>>>>>> Objval = 0.000000 (int)0 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 1379.0000. Tried aggregator 12 times. MIP Presolve eliminated 210766 rows and 19017 columns. MIP Presolve modified 166 coefficients. Aggregator did 1379 substitutions. Reduced MIP has 1469 rows, 523 columns, and 3218 nonzeros. Presolve time = 0.37 sec. Clique table members: 1447. 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 integral 0 4.0000 4.0000 0 0.00%