lpx_read_cpxlp: 123 rows, 17 columns, 261 non-zeros
lpx_read_cpxlp: 17 integer columns, all of which are binary
lpx_read_cpxlp: 129 lines were read
ipp_basic_tech:  0 row(s) and 0 column(s) removed
ipp_reduce_bnds: 1 pass(es) made, 0 bound(s) reduced
ipp_basic_tech:  0 row(s) and 0 column(s) removed
ipp_reduce_coef: 1 pass(es) made, 0 coefficient(s) reduced
lpx_intopt: presolved MIP has 123 rows, 17 columns, 261 non-zeros
lpx_intopt: 17 integer columns, all of which are binary
lpx_adv_basis: size of triangular part = 123
Solving LP relaxation...
      0:   objval =   0.000000000e+00   infeas =   1.000000000e+00 (0)
      1:   objval =  -6.752600000e-02   infeas =   0.000000000e+00 (0)
*     1:   objval =  -6.752600000e-02   infeas =   0.000000000e+00 (0)
*    28:   objval =  -9.664375000e-01   infeas =   0.000000000e+00 (0)
OPTIMAL SOLUTION FOUND
Integer optimization begins...
+    28: mip =     not found yet >=              -inf        (1; 0)
+    57: mip =  -5.508790000e-01 >=  -9.664375000e-01  75.4% (10; 0)
+    85: mip =  -5.934180000e-01 >=  -7.280825000e-01  22.7% (6; 4)
+    90: mip =  -6.080060000e-01 >=  -6.825930000e-01  12.3% (3; 8)
+    94: mip =  -6.080060000e-01 >=     tree is empty   0.0% (0; 19)
INTEGER OPTIMAL SOLUTION FOUND
mip_x1= 0.000000
mip_x2= 1.000000
mip_x3= 0.000000
mip_x4= 0.000000
mip_x5= 0.000000
mip_x6= 0.000000
mip_x7= 1.000000
mip_x8= 0.000000
mip_x9= 0.000000
mip_x10= 0.000000
mip_x11= 0.000000
mip_x12= 0.000000
mip_x13= 0.000000
mip_x14= 0.000000
mip_x15= 0.000000
mip_x16= 0.000000
mip_x17= 0.000000

The maximum reliability is 0.753399 with a bandwidth of 16.000000
Press Enter to continue!