MINOS 5.5: optimal solution found.
27 iterations, objective 0
Nonlin evals: constrs = 48, Jac = 47.
Objective = find a feasible point.
x1 = 41.9858
x2 = 265.21
x3 = 358.448
x4 = 416.402
x5 = 67.0813
x6 = 0.219362