MINOS 5.5: optimal solution found.
6 iterations, objective 0
Nonlin evals: constrs = 12, Jac = 11.
Objective = find a feasible point.
x1 = 0.779008
x10 = 1
x2 = 4.33908
x3 = 9.34873
x4 = 9.78828
x5 = 0.0120632
x6 = -0.0471639
x7 = -0.399652
x8 = -0.00189503
x9 = 0.146701