MINOS 5.5: unbounded (or badly scaled) problem.
6 iterations
Nonlin evals: constrs = 2, Jac = 1.
Objective = find a feasible point.
x1 = 2.07652
x2 = -0.397188
x3 = 2.54555
y1 = 0
y2 = 4.54542
y3 = -0.203557
z1 = 0.122118
z2 = 0
z3 = 0