MINOS 5.5: optimal solution found.
5 iterations, objective 0
Nonlin evals: constrs = 25, Jac = 24.
Objective = find a feasible point.
x [*] :=
 1  -0.477429
 2  -0.477446
 3  -0.52041
 4  -0.558777
 5  -0.593114
 6  -0.625071
 7  -0.623199
 8  -0.62135
 9  -0.620414
10  -0.586438
;