T SUM NUM_NODES 7244
T SUM NUM_PRUNES 7
T SUM SEARCH_TIME 0.287718

Solving normal LP:
Solving with simplex method...done!
CPXlpopt ended with status 0!
CPXlpopt ended with lpstat 1!
Obj: w = 1 / 4 == 0.250000
Assigning optimum fraction and reducing LP.
temp_error_term = 0.0000001000
num_rounded = 12, num_remaining = 32
                                  w =          1 /          4 == 0.2500000000 =/= 0.2500000000
                     v1a(1,1,0,1,1) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                     v1a(1,1,1,0,1) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                     v1a(1,1,1,1,0) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                     v1a(1,1,0,0,1) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                     v1a(1,1,0,0,0) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                     v1a(0,1,1,1,0) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                     v1a(0,0,1,1,0) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                     v1a(0,1,1,0,0) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                     v1a(0,1,0,1,0) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                     v1a(0,0,0,1,0) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                     v1a(0,0,1,0,0) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                     v1a(1,1,1,1,1) =         -3 /         16 == -0.1875000000 =/= -0.1875000000
                     v1a(1,0,1,1,1) =         -3 /          4 == -0.7500000000 =/= -0.7500000000
                     v1a(1,0,0,1,1) =         -1 /          4 == -0.2500000000 =/= -0.2500000000
                     v1a(1,0,1,1,0) =         -3 /         16 == -0.1875000000 =/= -0.1875000000
                     v1a(1,1,1,0,0) =         -5 /         16 == -0.3125000000 =/= -0.3125000000
                     v1a(1,0,1,0,1) =         -1 /          4 == -0.2500000000 =/= -0.2500000000
                     v1a(1,1,0,1,0) =         -1 /          8 == -0.1250000000 =/= -0.1250000000
                     v1a(1,0,0,0,1) =         -1 /          4 == -0.2500000000 =/= -0.2500000000
                     v1a(1,0,0,1,0) =         -5 /         16 == -0.3125000000 =/= -0.3125000000
                     v1a(1,0,1,0,0) =         -3 /         16 == -0.1875000000 =/= -0.1875000000
                     v1a(1,0,0,0,0) =         -3 /         16 == -0.1875000000 =/= -0.1875000000
                     v1a(0,1,1,1,1) =          1 /         16 == 0.0625000000 =/= 0.0625000000
                     v1a(0,0,1,1,1) =          1 /          8 == 0.1250000000 =/= 0.1250000000
                     v1a(0,1,0,1,1) =          3 /         16 == 0.1875000000 =/= 0.1875000000
                     v1a(0,1,1,0,1) =         -1 /         16 == -0.0625000000 =/= -0.0625000000
                     v1a(0,0,0,1,1) =          1 /          8 == 0.1250000000 =/= 0.1250000000
                     v1a(0,1,0,0,1) =          1 /          8 == 0.1250000000 =/= 0.1250000000
                     v1a(0,0,1,0,1) =          1 /          8 == 0.1250000000 =/= 0.1250000000
                     v1a(0,0,0,0,1) =          3 /         16 == 0.1875000000 =/= 0.1875000000
                     v1a(0,1,0,0,0) =          1 /         16 == 0.0625000000 =/= 0.0625000000

Now          0 of         32 variables and          0 of        843 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.250000 == 1 / 4.
