CPLEX> read code10.lp Problem 'code10.lp' read. Read time = 0.01 sec. CPLEX> opt Tried aggregator 1 time. MIP Presolve eliminated 0 rows and 1 columns. MIP Presolve modified 4599 coefficients. Reduced MIP has 206 rows, 205 columns, and 39921 nonzeros. Presolve time = 0.06 sec. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 2 threads. Root relaxation solution time = 0.01 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap 0 0 1.0000 4 1.0000 19 0 0 1.0000 10 Cuts: 19 45 0 0 1.0000 9 Covers: 4 52 0 2 1.0000 9 1.0000 52 100 76 infeasible 1.0000 950 * 154 101 integral 0 1.0000 1.0000 1643 0.00% Cover cuts applied: 40 Root node processing (before b&c): Real time = 0.87 Parallel b&c, 2 threads: Real time = 0.33 Sync time (average) = 0.03 Wait time (average) = 0.09 ------- Total (root+branch&cut) = 1.19 sec. Solution pool: 1 solution saved. MIP - Integer optimal solution: Objective = 1.0000000000e+00 Solution time = 1.28 sec. Iterations = 1643 Nodes = 155 CPLEX> dis sol var - Incumbent solution Variable Name Solution Value y0 1.000000 x4 1.000000 x5 1.000000 x19 1.000000 x29 1.000000 x39 1.000000 x75 1.000000 x97 1.000000 x134 1.000000 x150 1.000000 x179 1.000000 x204 1.000000 All other variables in the range 1-206 are 0.