MINOS 5.5: optimal solution found.
85 iterations, objective 0
Nonlin evals: constrs = 159, Jac = 158.
Objective = find a feasible point.
x [*] :=
 1    0.800459
 2    0.900211
 3    0.955743
 4    0.0997033
 5    0.192534
 6    0.855861
 7  576.35
 8   76.3502
 9  500.966
10    0.771583
11   21.1654
12   77.3557
13    0.066395
;