Solver command line: ['/home/sedghani/baron-lin64/baron', '/tmp/tmpw2eqym11.pyomo.bar']

===========================================================================
 BARON version 22.3.21. Built: LNX-64 Mon Mar 21 21:01:23 EDT 2022

 BARON is a product of The Optimization Firm.
 For information on BARON, see https://minlp.com/about-baron
 Licensee: Danilo Ardagna at Politecnico di Milano, danilo.ardagna@polimi.it.

 If you use this software, please cite publications from
 https://minlp.com/baron-publications, such as: 

 Khajavirad, A. and N. V. Sahinidis,
 A hybrid LP/NLP paradigm for global optimization relaxations,
 Mathematical Programming Computation, 10, 383-421, 2018.
===========================================================================
 This BARON run may utilize the following subsolver(s)
 For LP/MIP/QP: CLP/CBC                                         
 For NLP: IPOPT, FILTERSQP
===========================================================================
 Doing local search
 Unable to find/load CPLEX library libcplex.so: cannot open shared object file: No such file or directory
 Unable to find/load CPLEX library libcplex2010.so: cannot open shared object file: No such file or directory
 Solving bounding LP
 Preprocessing found feasible solution with value -2396595549.83     
 Starting multi-start local search
 Estimated remaining time for local search is 1338 secs
 Done with local search
===========================================================================
  Iteration    Open nodes         Time (s)    Lower bound      Upper bound
          1+            1          3061.58   -0.239660E+10      699.847    
          1+            1          3091.83   -0.239660E+10      699.847    
          1+            1          3121.83   -0.239660E+10      699.847    
          1             1          3600.14   -0.239660E+10      648.342    

                    *** Max. allowable time exceeded ***      

 Wall clock time:                  3600.14
 Total CPU time used:              3732.31

 Total no. of BaR iterations:       1
 Best solution found at node:      -1
 Max. no. of nodes in memory:       1
 
 All done
===========================================================================

