MINOS 5.5: unbounded (or badly scaled) problem.
14 iterations
Nonlin evals: constrs = 20, Jac = 19.
Objective = find a feasible point.
x3 = -2.65562
x4 = -0.0145987
y2 = -0.00125484
y3 = 4.04902
y4 = -4.34898
y5 = -0.587672
z2 = 6.85957
z3 = -1e+08
z4 = 35798700
z5 = 64201300