T SUM NUM_NODES 7404
T SUM NUM_PRUNES 7
T SUM SEARCH_TIME 0.254958

Solving normal LP:
Solving with simplex method...done!
CPXlpopt ended with status 0!
CPXlpopt ended with lpstat 1!
Obj: w = 1 / 5 == 0.200000
Assigning optimum fraction and reducing LP.
temp_error_term = 0.0000001000
num_rounded = 9, num_remaining = 32
                                  w =          1 /          5 == 0.2000000000 =/= 0.2000000000
                     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,0,1,1,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) =         -1 /          5 == -0.2000000000 =/= -0.2000000000
                     v1a(1,0,1,1,1) =         -6 /          5 == -1.2000000000 =/= -1.2000000000
                     v1a(1,1,1,1,0) =          2 /          5 == 0.4000000000 =/= 0.4000000000
                     v1a(1,0,0,1,1) =         -3 /          5 == -0.6000000000 =/= -0.6000000000
                     v1a(1,0,1,1,0) =         -1 /          5 == -0.2000000000 =/= -0.2000000000
                     v1a(1,0,1,0,1) =         -3 /          5 == -0.6000000000 =/= -0.6000000000
                     v1a(1,1,0,1,0) =          1 /          5 == 0.2000000000 =/= 0.2000000000
                     v1a(1,0,0,0,1) =         -3 /          5 == -0.6000000000 =/= -0.6000000000
                     v1a(1,0,0,1,0) =         -1 /          5 == -0.2000000000 =/= -0.2000000000
                     v1a(1,0,1,0,0) =         -2 /          5 == -0.4000000000 =/= -0.4000000000
                     v1a(1,1,0,0,0) =          2 /          5 == 0.4000000000 =/= 0.4000000000
                     v1a(1,0,0,0,0) =         -1 /          5 == -0.2000000000 =/= -0.2000000000
                     v1a(0,1,1,1,1) =          1 /         20 == 0.0500000000 =/= 0.0500000000
                     v1a(0,0,1,1,1) =          1 /         10 == 0.1000000000 =/= 0.1000000000
                     v1a(0,1,0,1,1) =          1 /          5 == 0.2000000000 =/= 0.2000000000
                     v1a(0,1,1,0,1) =         -1 /          5 == -0.2000000000 =/= -0.2000000000
                     v1a(0,1,1,1,0) =          1 /         10 == 0.1000000000 =/= 0.1000000000
                     v1a(0,0,0,1,1) =          1 /         10 == 0.1000000000 =/= 0.1000000000
                     v1a(0,1,0,0,1) =          1 /          5 == 0.2000000000 =/= 0.2000000000
                     v1a(0,1,1,0,0) =         -1 /         10 == -0.1000000000 =/= -0.1000000000
                     v1a(0,0,1,0,1) =          1 /         10 == 0.1000000000 =/= 0.1000000000
                     v1a(0,0,0,0,1) =          1 /         10 == 0.1000000000 =/= 0.1000000000
                     v1a(0,1,0,0,0) =          1 /         10 == 0.1000000000 =/= 0.1000000000

Now          0 of         32 variables and          0 of        865 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.200000 == 1 / 5.
