Writing problem data to 'example.ilp'...
614 lines were written
Constructing initial basis...
Size of triangular part is 351
0: obj = 5.000000000e+00 inf = 5.162e+01 (90)
105: obj = 9.000000000e+00 inf = 0.000e+00 (0)
* 113: obj = 6.000000000e+00 inf = 0.000e+00 (0)
Long-step dual simplex will be used
+ 113: mip = not found yet >= -inf (1; 0)
+ 666: >>>>> 1.700000000e+01 >= 7.500000000e+00 55.9% (89; 11)
+ 8256: >>>>> 9.000000000e+00 >= 8.000000000e+00 11.1% (566; 1280)
+ 37691: mip = 9.000000000e+00 >= tree is empty 0.0% (0; 11825)
solving LP!
Success
Solved program with 141 variables.
[(1,2,0.0),(9,1,0.0),(2,2,3.0),(0,2,5.0),(3,0,5.0),(4,0,6.0),(7,1,6.0),(6,1,7.0),(8,0,7.0),(5,1,8.0),(10,0,8.0)]