Welcome to IBM(R) ILOG(R) CPLEX(R) Interactive Optimizer Community Edition 12.9.0.0
  with Simplex, Mixed Integer & Barrier Optimizers
5725-A06 5725-A29 5724-Y48 5724-Y49 5724-Y54 5724-Y55 5655-Y21
Copyright IBM Corp. 1988, 2019.  All Rights Reserved.

Type 'help' for a list of available commands.
Type 'help' followed by a command name for more
information on commands.

CPLEX> New value for absolute objective gap: 0
CPLEX> New value for intensity for populating the MIP solution pool: 4
CPLEX> New value for solutions limit for each populate call: 10
CPLEX> New value for capacity of solution pool: 10
CPLEX> New value for variables to include in .sol and .mst files: 1
CPLEX> Problem 'reid.lp' read.
Read time = 0.01 sec. (0.00 ticks)
CPLEX> CPXPARAM_Output_WriteLevel                       1
CPXPARAM_MIP_Pool_Capacity                       10
CPXPARAM_MIP_Pool_Intensity                      4
CPXPARAM_MIP_Limits_Populate                     10
CPXPARAM_MIP_Pool_AbsGap                         0

Populate: phase I 
Found incumbent of value 0.000000 after 0.00 sec. (0.00 ticks)

Root node processing (before b&c):
  Real time             =    0.00 sec. (0.00 ticks)
Parallel b&c, 8 threads:
  Real time             =    0.00 sec. (0.00 ticks)
  Sync time (average)   =    0.00 sec.
  Wait time (average)   =    0.00 sec.
                          ------------
Total (root+branch&cut) =    0.00 sec. (0.00 ticks)

Populate: phase II 
Tried aggregator 2 times.
MIP Presolve eliminated 2 rows and 0 columns.
MIP Presolve modified 7 coefficients.
Aggregator did 6 substitutions.
Reduced MIP has 1 rows, 4 columns, and 4 nonzeros.
Reduced MIP has 4 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (0.02 ticks)
Probing time = 0.00 sec. (0.00 ticks)
Clique table members: 1.
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 8 threads.
Root relaxation solution time = 0.00 sec. (0.00 ticks)

        Nodes                                         Cuts/
   Node  Left     Objective  IInf  Best Integer    Best Bound    ItCnt     Gap

*     0+    0                            0.0000        0.0000             0.00%
      0     0        0.0000     0        0.0000        0.0000        0    0.00%
      0     2        0.0000     1        0.0000        0.0000        0    0.00%
Elapsed time = 0.02 sec. (0.03 ticks, tree = 0.02 MB, solutions = 2)

Root node processing (before b&c):
  Real time             =    0.01 sec. (0.03 ticks)
Parallel b&c, 8 threads:
  Real time             =    0.01 sec. (0.01 ticks)
  Sync time (average)   =    0.00 sec.
  Wait time (average)   =    0.00 sec.
                          ------------
Total (root+branch&cut) =    0.02 sec. (0.04 ticks)

Solution pool: 4 solutions saved.

Populate - Integer optimal solution:  Objective =  0.0000000000e+00
Current MIP best bound =  0.0000000000e+00 (gap = -0, 0.00%)
Solution time =    0.03 sec.  Iterations = 0  Nodes = 7
Deterministic time = 0.04 ticks  (1.45 ticks/sec)

CPLEX> Overwrite 'reid.sol' ['y' or 'n']: CPLEX>