T SUM NUM_NODES 6972
T SUM NUM_PRUNES 7
T SUM SEARCH_TIME 0.291450

Solving normal LP:
Solving with simplex method...done!
CPXlpopt ended with status 0!
CPXlpopt ended with lpstat 1!
Obj: w = 3 / 10 == 0.300000
Assigning optimum fraction and reducing LP.
temp_error_term = 0.0000001000
num_rounded = 11, num_remaining = 32
                                  w =          3 /         10 == 0.3000000000 =/= 0.3000000000
                     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,0,0,1) =          0 /          1 == 0.0000000000 =/= 0.0000000000
                     v1a(1,1,1,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) =         -7 /         40 == -0.1750000000 =/= -0.1750000000
                     v1a(1,0,1,1,1) =        -33 /         40 == -0.8250000000 =/= -0.8250000000
                     v1a(1,1,1,1,0) =          1 /          8 == 0.1250000000 =/= 0.1250000000
                     v1a(1,0,0,1,1) =        -19 /         40 == -0.4750000000 =/= -0.4750000000
                     v1a(1,0,1,1,0) =         -9 /         40 == -0.2250000000 =/= -0.2250000000
                     v1a(1,0,1,0,1) =        -19 /         40 == -0.4750000000 =/= -0.4750000000
                     v1a(1,1,0,1,0) =          1 /          8 == 0.1250000000 =/= 0.1250000000
                     v1a(1,0,0,0,1) =        -17 /         40 == -0.4250000000 =/= -0.4250000000
                     v1a(1,0,0,1,0) =         -9 /         40 == -0.2250000000 =/= -0.2250000000
                     v1a(1,0,1,0,0) =         -9 /         40 == -0.2250000000 =/= -0.2250000000
                     v1a(1,1,0,0,0) =          7 /         40 == 0.1750000000 =/= 0.1750000000
                     v1a(1,0,0,0,0) =         -7 /         40 == -0.1750000000 =/= -0.1750000000
                     v1a(0,1,1,1,1) =          3 /         40 == 0.0750000000 =/= 0.0750000000
                     v1a(0,0,1,1,1) =          3 /         20 == 0.1500000000 =/= 0.1500000000
                     v1a(0,1,0,1,1) =          7 /         40 == 0.1750000000 =/= 0.1750000000
                     v1a(0,1,1,0,1) =         -1 /         40 == -0.0250000000 =/= -0.0250000000
                     v1a(0,0,0,1,1) =          1 /          8 == 0.1250000000 =/= 0.1250000000
                     v1a(0,1,0,0,1) =          7 /         40 == 0.1750000000 =/= 0.1750000000
                     v1a(0,0,1,0,1) =          3 /         20 == 0.1500000000 =/= 0.1500000000
                     v1a(0,0,0,0,1) =          9 /         40 == 0.2250000000 =/= 0.2250000000
                     v1a(0,1,0,0,0) =          3 /         40 == 0.0750000000 =/= 0.0750000000

Now          0 of         32 variables and          0 of        809 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.300000 == 3 / 10.
