MINOS 5.5: optimal solution found.
1 iterations, objective 0
Nonlin evals: constrs = 5, Jac = 4.
Objective = find a feasible point.
x = 0.52886

t [*] :=
 1  0.0803491
 2  0.338987
 3  0.393032
 4  0.428296
 5  0.423134
 6  0.185246
 7  0.0226722
 8  0.265725
 9  0.179256
10  0.121613
11  0.136352
12  0.0469473
13  0.413162
14  0.165335
15  0.525771
16  0.226738
17  0.0787573
18  0.358738
19  0.258888
;