Build (method = -2) #dp: 1383 Step-3' Graph: 62 vertices and 174 arcs (0.01s) Step-4' Graph: 8 vertices and 66 arcs (0.01s) #V4/#V3 = 0.13 #A4/#A3 = 0.38 Ready! (0.01s) Optimize a model with 18 rows, 67 columns and 194 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 16 rows, 65 columns, 190 nonzeros Variable types: 0 continuous, 65 integer (0 binary) Found heuristic solution: objective 999.0000000 Found heuristic solution: objective 774.0000000 Optimize a model with 16 rows, 65 columns and 190 nonzeros Presolved: 16 rows, 65 columns, 190 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.900e+01 Factor NZ : 1.360e+02 Factor Ops : 1.496e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.50350568e+03 -7.69605527e+03 1.16e+03 1.11e-16 2.55e+02 0s 1 6.50941674e+02 -3.14620229e+03 1.73e-12 4.44e-16 2.79e+01 0s 2 4.17682077e+02 -4.07852605e+02 1.17e-13 3.33e-16 5.99e+00 0s 3 1.86560525e+02 -9.12429496e+00 8.53e-14 2.22e-16 1.40e+00 0s 4 1.68615962e+02 1.59996748e+02 1.15e-13 2.69e-16 6.16e-02 0s 5 1.66668026e+02 1.66665267e+02 3.00e-13 1.21e-16 1.97e-05 0s 6 1.66666667e+02 1.66666667e+02 2.67e-14 2.50e-16 1.98e-11 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 1.66666667e+02 Root relaxation: objective 1.666667e+02, 55 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 166.66667 0 8 774.00000 166.66667 78.5% - 0s H 0 0 167.0000000 166.66667 0.20% - 0s Explored 0 nodes (65 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.670000000000e+02, best bound 1.670000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 167 Solution: 31 x [1, 2, 4, 6, 7, 8] 9 x [1, 3, 4, 6, 8, 9] 4 x [1, 3, 4, 7, 8, 9] 2 x [4, 6, 7, 8, 9, 9] 61 x [1, 1, 1, 3, 8, 10] 1 x [3, 6, 8, 9] 53 x [1, 3, 5, 8, 8, 9] 5 x [1, 4, 6, 8, 8, 9] 1 x [3, 3, 6, 8, 8, 9]