MINOS 5.5: optimal solution found.
94 iterations, objective 0
Nonlin evals: constrs = 350, Jac = 349.
Objective = find a feasible point.
x [*] :=
 1   -3.40629
 2   -0.596369
 3   -1.1912
 4   -4.62689
 5   -1.0011
 6   -4.44283
 7   -1.41264
 8  -21.6066
 9   -2.26867
10   -1.40346
;