T SUM NUM_NODES 856
T SUM NUM_PRUNES 0
T SUM SEARCH_TIME 0.026374

Solving normal LP:
Solving with simplex method...done!
CPXlpopt ended with status 0!
CPXlpopt ended with lpstat 1!
Obj: w = 1 / 3 == 0.333333
Assigning optimum fraction and reducing LP.
temp_error_term = 0.0000005000
num_rounded = 19, num_remaining = 33
                                  w =          1 /          3 == 0.3333333333 =/= 0.3333333333
                 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(1,0,1,0,1,0) =          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(1,0,0,0,0,0) =          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 /          6 == 0.1666666667 =/= 0.1666666667
                 d1r2a(1,0,1,1,_,_) =         -1 /          2 == -0.5000000000 =/= -0.5000000000
                 d1r2a(0,1,1,0,1,1) =          1 /          6 == 0.1666666667 =/= 0.1666666667
                 d1r2a(0,1,0,1,1,1) =          1 /          6 == 0.1666666667 =/= 0.1666666667
                 d1r2a(0,1,0,0,1,1) =          1 /          6 == 0.1666666667 =/= 0.1666666667
                 d1r2a(0,1,0,1,0,1) =          1 /          6 == 0.1666666667 =/= 0.1666666667
                 d1r2a(1,0,1,0,0,1) =         -1 /          6 == -0.1666666667 =/= -0.1666666667
                 d1r2a(0,1,0,0,0,1) =          1 /          3 == 0.3333333333 =/= 0.3333333333
                 d1r2a(1,0,0,1,1,0) =         -1 /          6 == -0.1666666667 =/= -0.1666666667
                 d1r2a(1,0,0,1,0,1) =         -1 /          6 == -0.1666666667 =/= -0.1666666667
                 d1r2a(0,1,0,0,1,0) =          1 /          3 == 0.3333333333 =/= 0.3333333333
                 d1r2a(0,1,0,1,0,0) =          1 /          6 == 0.1666666667 =/= 0.1666666667
                 d1r2a(0,1,1,0,0,0) =          1 /          6 == 0.1666666667 =/= 0.1666666667
                 d1r2a(0,1,0,0,0,0) =          1 /          3 == 0.3333333333 =/= 0.3333333333
Now          0 of         33 variables and          0 of        135 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.333333 == 1 / 3.
