Bonmin 1.8.8 using Cbc 2.10.5 and Ipopt 3.12.13
bonmin: bonmin.algorithm=B-OA


******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
 Ipopt is released as open source code under the Eclipse Public License (EPL).
         For more information visit http://projects.coin-or.org/Ipopt
******************************************************************************

NLP0012I 
              Num      Status      Obj             It       time                 Location
NLP0014I             1         OPT 0        5 0.00524     build initial OA
NLP0014I             2      INFEAS 0.024970779        6 0.011611     OA decomposition
OA0008I OA  converged in 0.018601 seconds found solution of value 1e+50 (lower bound 1e+50 ).
OA0010I Performed 1 iterations, explored 0 branch-and-bound nodes in total
Cbc0031I 9 added rows had average density of 2
Cbc0013I At root node, 9 cuts changed objective from 0 to 0 in 2 passes
Cbc0014I Cut generator 0 (Outer Approximation decomposition.) - 9 row cuts average 2.0 elements, 0 column cuts (0 active)
Cbc0014I Cut generator 1 (Outer Approximation feasibility check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active)
Cbc0014I Cut generator 2 (Outer Approximation strong branching solution check.) - 0 row cuts average 0.0 elements, 0 column cuts (0 active)
Cbc0001I Search completed - best objective 1e+50, took 9 iterations and 0 nodes (0.02 seconds)
Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost
 Outer Approximation decomposition. was tried 2 times and created 9 cuts of which 0 were active after adding rounds of cuts

 	"Finished"