MINOS 5.5: unbounded (or badly scaled) problem.
2 iterations
Nonlin evals: constrs = 22, Jac = 21.
Objective = find a feasible point.
x = -8582170
y = 6871540
z = -1710630