MINOS 5.5: optimal solution found.
137 iterations, objective 0
Nonlin evals: constrs = 344, Jac = 343.
Objective = find a feasible point.
x [*] :=
 1  -1.20003
 2   1
 3   0.00227459
 4   1.43601
 5   0.979667
 6   1
 7   0.97968
 8  -0.00406015
 9   0.979677
10   2.06212
;