Couenne  --  an Open-Source solver for Mixed Integer Nonlinear Optimization
Mailing list: couenne@list.coin-or.org
Instructions: http://www.coin-or.org/Couenne
couenne: 
ANALYSIS TEST: NLP0012I 
              Num      Status      Obj             It       time                 Location
NLP0014I             1         OPT -1.0849625       16 0
Coin0506I Presolve 0 (-39) rows, 0 (-33) columns and 0 (-85) elements
Clp0000I Optimal - objective value -9.99e+12
Clp0006I 0  Obj -9.99e+12
Clp0029I End of values pass after 2 iterations
Clp0006I 2  Obj -9.99e+12
Clp0006I 2  Obj -9.99e+12
Clp0000I Optimal - objective value -9.99e+12
Clp0032I Optimal objective -9.99e+12 - 2 iterations time 0.012, Presolve 0.00
Clp0006I 0  Obj -9.99e+12 Primal inf 9.99e+12 (1)
Clp0006I 12  Obj -249906.45
Clp0006I 13  Obj -9.99e+12
Clp0006I 13  Obj -9.99e+12 Primal inf 3.3986176e+20 (18)
Clp0006I 21  Obj -9.99e+12 Primal inf 77.299858 (2)
Clp0006I 22  Obj -9.99e+12
Clp0006I 24  Obj -9.99e+12 Primal inf 9.74779e+12 (8)
Clp0006I 27  Obj -9.99e+12 Primal inf 2086.5531 (5)
Clp0006I 28  Obj -9.99e+12
Clp0000I Optimal - objective value -9.99e+12
Cbc0012I Integer solution of -1.0849625 found by Couenne Rounding NLP after 0 iterations and 0 nodes (0.00 seconds)
Error in an AMPL evaluation. Run with "halt_on_ampl_error yes" to see details.
Error in an AMPL evaluation. Run with "halt_on_ampl_error yes" to see details.
Error in an AMPL evaluation. Run with "halt_on_ampl_error yes" to see details.
Error in an AMPL evaluation. Run with "halt_on_ampl_error yes" to see details.
Error in an AMPL evaluation. Run with "halt_on_ampl_error yes" to see details.
NLP0014I             2         OPT -9.172451e+18      135 0.09
Clp0000I Optimal - objective value -9.99e+12
Cbc0031I 9 added rows had average density of 2.4444444
Cbc0013I At root node, 9 cuts changed objective from -9.99e+12 to -3.428131 in 10 passes
Cbc0014I Cut generator 0 (Couenne convexifier cuts) - 50 row cuts average 2.3 elements, 12 column cuts (21 active)
Cbc0010I After 0 nodes, 1 on tree, -1.0849625 best solution, best possible -3.428131 (4.63 seconds)
Cbc0010I After 100 nodes, 25 on tree, -1.0849625 best solution, best possible -1.5047131 (4.94 seconds)
Cbc0010I After 200 nodes, 37 on tree, -1.0849625 best solution, best possible -1.282858 (5.05 seconds)
Cbc0010I After 300 nodes, 57 on tree, -1.0849625 best solution, best possible -1.2280013 (5.14 seconds)
Cbc0010I After 400 nodes, 65 on tree, -1.0849625 best solution, best possible -1.1793666 (5.23 seconds)
Cbc0010I After 500 nodes, 70 on tree, -1.0849625 best solution, best possible -1.1476144 (5.33 seconds)
Cbc0010I After 600 nodes, 90 on tree, -1.0849625 best solution, best possible -1.1396781 (5.43 seconds)
Cbc0010I After 700 nodes, 99 on tree, -1.0849625 best solution, best possible -1.1171843 (5.53 seconds)
Cbc0010I After 800 nodes, 94 on tree, -1.0849625 best solution, best possible -1.1061288 (5.62 seconds)
Cbc0010I After 900 nodes, 105 on tree, -1.0849625 best solution, best possible -1.1027489 (5.70 seconds)
Cbc0010I After 1000 nodes, 93 on tree, -1.0849625 best solution, best possible -1.095165 (5.81 seconds)
Cbc0010I After 1100 nodes, 88 on tree, -1.0849625 best solution, best possible -1.0922739 (5.91 seconds)
Cbc0010I After 1200 nodes, 82 on tree, -1.0849625 best solution, best possible -1.0900263 (6.00 seconds)
Cbc0010I After 1300 nodes, 80 on tree, -1.0849625 best solution, best possible -1.0882161 (6.10 seconds)
Cbc0010I After 1400 nodes, 77 on tree, -1.0849625 best solution, best possible -1.0870274 (6.18 seconds)
Cbc0010I After 1500 nodes, 77 on tree, -1.0849625 best solution, best possible -1.0862907 (6.27 seconds)
Cbc0010I After 1600 nodes, 75 on tree, -1.0849625 best solution, best possible -1.0857371 (6.37 seconds)
Cbc0010I After 1700 nodes, 71 on tree, -1.0849625 best solution, best possible -1.0854196 (6.44 seconds)
Cbc0010I After 1800 nodes, 70 on tree, -1.0849625 best solution, best possible -1.0852395 (6.53 seconds)
Cbc0010I After 1900 nodes, 73 on tree, -1.0849625 best solution, best possible -1.0851378 (6.63 seconds)
Cbc0010I After 2000 nodes, 63 on tree, -1.0849625 best solution, best possible -1.0850429 (6.72 seconds)
Cbc0010I After 2100 nodes, 45 on tree, -1.0849625 best solution, best possible -1.0850023 (6.82 seconds)
Cbc0010I After 2200 nodes, 22 on tree, -1.0849625 best solution, best possible -1.0849821 (6.90 seconds)
Cbc0001I Search completed - best objective -1.084962515146028, took 21571 iterations and 2250 nodes (6.96 seconds)
Cbc0035I Maximum depth 41, 0 variables fixed on reduced cost

 	"Finished"
Total time:                                  6.97s (6.97s in branch-and-bound)
Lower bound:                             -1.08497
Upper bound:                             -1.08497  (gap: 0.00%)
Branch-and-bound nodes:                      2250

couenne: Optimal
d1 = 0.500151
d2 = 0.499111
s1 = 1.58527
s2 = 0.58411
r1 = 1.58432
r2 = 0.586192