T SUM NUM_NODES 748
T SUM NUM_PRUNES 0
T SUM SEARCH_TIME 0.023161

Solving normal LP:
Solving with simplex method...done!
CPXlpopt ended with status 0!
CPXlpopt ended with lpstat 1!
Obj: w = 2 / 5 == 0.400000
Assigning optimum fraction and reducing LP.
temp_error_term = 0.0000005000
num_rounded = 18, num_remaining = 31
                                  w =          2 /          5 == 0.4000000000 =/= 0.4000000000
                 d1r2a(1,0,0,1,1,1) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                 d1r2a(1,0,1,0,1,1) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                 d1r2a(0,1,0,1,0,1) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                 d1r2a(0,1,1,0,0,1) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                 d1r2a(1,0,1,0,0,0) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                 d1r2a(0,1,0,1,1,0) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                 d1r2a(0,1,1,0,1,0) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                 d1r2a(1,0,0,1,0,0) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                 d1r2a(1,0,0,0,1,1) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                 d1r2a(1,0,0,0,1,0) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                 d1r2a(1,0,0,0,0,1) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                 d1r2a(0,0,0,1,1,1) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                 d1r2a(0,0,1,1,1,0) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                 d1r2a(0,0,1,0,1,1) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                 d1r2a(0,0,1,1,0,1) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                 d1r2a(0,0,0,1,0,1) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                 d1r2a(0,0,1,0,1,0) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                 d1r2a(0,1,1,1,_,_) =          1 /          5 == 0.2000000000 =/= 0.2000000000
                 d1r2a(1,0,1,1,_,_) =         -2 /          5 == -0.4000000000 =/= -0.4000000000
                 d1r2a(0,1,1,0,1,1) =          1 /          5 == 0.2000000000 =/= 0.2000000000
                 d1r2a(0,1,0,1,1,1) =          1 /          5 == 0.2000000000 =/= 0.2000000000
                 d1r2a(0,1,0,0,1,1) =          1 /          5 == 0.2000000000 =/= 0.2000000000
                 d1r2a(1,0,1,0,1,0) =         -1 /          5 == -0.2000000000 =/= -0.2000000000
                 d1r2a(1,0,1,0,0,1) =         -1 /          5 == -0.2000000000 =/= -0.2000000000
                 d1r2a(0,1,0,0,0,1) =          2 /          5 == 0.4000000000 =/= 0.4000000000
                 d1r2a(1,0,0,1,1,0) =         -1 /          5 == -0.2000000000 =/= -0.2000000000
                 d1r2a(1,0,0,1,0,1) =         -1 /          5 == -0.2000000000 =/= -0.2000000000
                 d1r2a(0,1,0,0,1,0) =          2 /          5 == 0.4000000000 =/= 0.4000000000
                 d1r2a(0,1,0,1,0,0) =          1 /          5 == 0.2000000000 =/= 0.2000000000
                 d1r2a(0,1,1,0,0,0) =          1 /          5 == 0.2000000000 =/= 0.2000000000
Now          0 of         31 variables and          0 of        121 constraints are remaining.
Maximum error with w : 0 / 1 == 0.000000
Maximum error without w : 0 / 1 == 0.000000
LP is feasible.
Optimum Value: 0.400000 == 2 / 5.
