MINOS 5.5: optimal solution found.
110 iterations, objective 0
Nonlin evals: constrs = 199, Jac = 198.
Objective = find a feasible point.
x [*,*,0]
:      0          1          2          3           4          5       :=
0   3.74253    2.13529    0.247325   0.952738   0.0507684   2.87135
1   2.41807    1.70598    1.15829    0.565919   0.746909    3.40484
2   1.49579    1.37531    0.893446   1.07005    0.77928     4.38611
3   0.958829   1.17449    0.766592   0.777305   0.972736    5.35005
4   0.539068   0.540337   0.409686   0.74748    1.01944     6.74398

 [*,*,1]
:      0          1          2          3         4        :=
0   6.25747    4.12218    3.87485    2.92212   2.87135
1   1.32447    1.75378    0.842815   1.22963   0.533493
2   0.922273   1.25294    1.51778    1.01365   0.981274
3   0.536965   0.737789   0.864643   1.15739   0.963932
4   0.41976    1.05391    1.41082    1.44064   1.39394
5   0.539068   1.07941    1.48909    2.23657   3.25602
;