MINOS 5.5: infeasible problem (or bad starting guess).
113 iterations
Nonlin evals: constrs = 134, Jac = 133.
Objective = find a feasible point.
K = 0.305
x0 = 1
x1 = 0.8475
x2 = 0.8475
x3 = 0.8475
x4 = 0.8475
y0 = 0
y1 = 1
y2 = 1
y3 = -1
y4 = 1
z0 = 0
z1 = 1
z2 = 1
z3 = 1
z4 = -1