MINOS 5.5: optimal solution found.
200 iterations, objective 0
Nonlin evals: constrs = 372, Jac = 371.
Objective = find a feasible point.
a = -1.07135
a32 = -0.503421
b = -0.0866831
b1 = -0.620682
b2 = 0.000895851
b3 = -0.538246
c2 = -0.329372
c3 = -0.69039