MINOS 5.5: optimal solution found.
293 iterations, objective 0
Nonlin evals: constrs = 685, Jac = 684.
Objective = find a feasible point.
:       x           y        :=
0    0           0
1    0.110925   -0.866225
2    0.232851   -1.64383
3    0.367072   -2.33817
4    0.53469    -2.94116
5    0.796899   -3.42231
6    1.28967    -3.48941
7    1.57796    -3.03441
8    1.75376    -2.4462
9    1.88945    -1.76635
10   2          -1
;

t [*] :=
 1  0.426085
 2  0.339894
 3  0.259978
 4  0.178637
 5  0.10075
 6  0.0501083
 7  0.0914244
 8  0.166712
 9  0.246039
10  0.327072
;