MINOS 5.5: optimal solution found.
1 iterations, objective 0
Nonlin evals: constrs = 52, Jac = 51.
Objective = find a feasible point.
x1 = 2
x10 = 1
x2 = -5
x3 = -1
x4 = 5
x5 = -4
x6 = -3
x7 = 3
x8 = -2
x9 = 4