MINOS 5.5: MINOS 5.5: optimal solution found.
258 iterations, objective 0
Nonlin evals: constrs = 754, Jac = 753.
Objective = find a feasible point.
:        x            y         :=
1    -6.10018      7.77624
2    -7.3275       4.82298
3    -8.70141      1.97096
4    -6.54572      2.45196
5    -5.14416      5.06291
6    -1.84599      6.90743
7    -3.32056      5.63961
8    -0.494406     6.45869
9     1.35374      5.96636
10    3.81368      5.41216
11    1.75749      4.36832
12    5.32576      4.579
13    5.50757      4.18611
14    5.4837       3.50401
15    3.34744      3.70606
16    5.03371      2.90465
17    4.44415      2.3326
18    2.78771      2.68765
19   -0.0623793    3.89325
20   -0.806738     2.82367
21   -0.315658     1.72318
22    3.97684      1.48589
23    2.58295      0.638741
24    1.28365     -1.00239
25    3.14257     -1.84121
26    1.88135     -2.86352
27    0.642189    -3.22313
28    0.0363121   -1.85599
29   -0.151594    -0.745619
30   -2.84585      0.249167
31   -3.77412     -1.50257
32   -2.33749     -1.52677
33   -0.489052    -0.0537629
34   -2.77557     -2.66651
35   -1.15578     -3.13915
36   -0.397613    -4.00001
37   -0.108551    -4.97656
38   -0.972976    -6.14046
39   -1.63967     -7.10458
40   -1.94963     -5.73865
41   -1.69002     -4.61225
42   -0.0451589    0.312987
;