MINOS 5.5: optimal solution found.
12 iterations, objective 0
Nonlin evals: constrs = 30, Jac = 29.
Objective = find a feasible point.
x1 = 6
x2 = 2.8815
x3 = 0.392709
x4 = 0.3607
x5 = 6.80272
x6 = 5.98917
x7 = 1
x8 = 0.317609