MINOS 5.5: infeasible problem (or bad starting guess).
36 iterations
Nonlin evals: constrs = 18, Jac = 17.
Objective = find a feasible point.
X1 = 0.909987
X2 = 1.12112
X3 = 0
X4 = 0
X5 = 9.84078
X6 = 0
X7 = 0
X8 = 0
X9 = 0
Y0 = -0.0201065
Y1 = 0
Y2 = 0