Build (method = -2) #dp: 193 Step-3' Graph: 37 vertices and 104 arcs (0.00s) Step-4' Graph: 30 vertices and 90 arcs (0.00s) #V4/#V3 = 0.81 #A4/#A3 = 0.87 Ready! (0.00s) Optimize a model with 40 rows, 91 columns and 217 nonzeros Presolve removed 12 rows and 21 columns Presolve time: 0.00s Presolved: 28 rows, 70 columns, 188 nonzeros Variable types: 0 continuous, 70 integer (0 binary) Found heuristic solution: objective 39.0000000 Optimize a model with 28 rows, 70 columns and 188 nonzeros Presolved: 28 rows, 70 columns, 188 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.410e+02 Factor NZ : 3.360e+02 Factor Ops : 4.914e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.10796899e+02 -1.03878852e+03 4.71e+02 2.22e-16 2.71e+01 0s 1 8.41814453e+01 -3.37898131e+02 6.50e+01 3.33e-16 4.62e+00 0s 2 3.41774495e+01 -5.48304996e+01 3.38e-14 2.78e-16 6.01e-01 0s 3 2.12924186e+01 4.81241882e+00 3.99e-14 2.24e-16 1.11e-01 0s 4 1.70288881e+01 1.36372241e+01 1.42e-14 1.11e-16 2.29e-02 0s 5 1.61245064e+01 1.56923730e+01 3.20e-14 1.94e-16 2.92e-03 0s 6 1.60102001e+01 1.59960755e+01 6.27e-14 3.64e-16 9.54e-05 0s 7 1.60000004e+01 1.59999993e+01 1.96e-13 1.11e-16 7.91e-09 0s 8 1.60000000e+01 1.60000000e+01 3.70e-12 1.25e-16 7.91e-12 0s Barrier solved model in 8 iterations and 0.00 seconds Optimal objective 1.60000000e+01 Root relaxation: objective 1.600000e+01, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 16.0000000 16.00000 0.0% - 0s Explored 0 nodes (23 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.600000000000e+01, best bound 1.600000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 16 Solution: 3 x [1, 2, 4, 5, 6, 9] 3 x [1, 2, 5, 6, 7, 8] 3 x [1, 3, 5, 6, 7, 8] 1 x [2, 3, 4, 5, 6] 3 x [2, 3, 4, 5, 7, 9, 10] 1 x [2, 3, 5, 6, 7, 9] 2 x [3, 4, 5, 6, 7, 9, 10]