MINOS 5.5: unbounded (or badly scaled) problem.
80 iterations
Nonlin evals: constrs = 180, Jac = 179.
Objective = find a feasible point.
x1 = -1.69578
x2 = 195.434
x3 = 0
x4 = 0
x5 = 0
x6 = 0
x7 = 1.34789
x8 = -15.294
x9 = 174.194