MINOS 5.5: MINOS 5.5: optimal solution found.
0 iterations, objective 0
Nonlin evals: constrs = 3, Jac = 2.
Objective = find a feasible point.
x [*] :=
 1 -5.4966e-05   14  0            27  0            40 -8.8262e-06
 2  0            15  0            28  0            41  0
 3  0            16  0            29  0            42  0
 4  0            17  0            30  0            43 -1.9873e-06
 5  0            18  8.3681e-06   31  0            44  0
 6  6.1561e-06   19  0            32  0            45  7.422e-06
 7  0            20  4.3809e-05   33 -4.5616e-06   46  8.2308e-07
 8  0            21  0            34  7.3117e-07   47 -3.0424e-06
 9  0            22  3.9248e-05   35  9.3168e-06   48  1.5119e-05
10  0            23  0            36  0            49  0
11  0            24  0            37  1.5812e-05   50  0
12  4.7652e-05   25  0            38  0
13 -4.5551e-05   26  0            39 -3.9611e-06
;