CPLEX 20.1.0.0: presolve=0

mipdisplay=2

iisfind=1

feasibility=1e-5

Clique table members: 72078.

MIP emphasis: balance optimality and feasibility.

MIP search method: dynamic search.

Parallel mode: deterministic, using up to 8 threads.

Root relaxation solution time = 1.67 sec. (1786.91 ticks)



        Nodes                                         Cuts/

   Node  Left     Objective  IInf  Best Integer    Best Bound    ItCnt     Gap



      0     0   5.38244e+07  2294                 5.38244e+07      161         

      0     0        cutoff                                       9556         

Elapsed time = 75.02 sec. (34508.82 ticks, tree = 0.01 MB)



Clique cuts applied:  24

Cover cuts applied:  323

Implied bound cuts applied:  379

Flow cuts applied:  320

Mixed integer rounding cuts applied:  2326

Gomory fractional cuts applied:  63



Root node processing (before b&c):

  Real time             =   75.03 sec. (34511.22 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) =   75.03 sec. (34511.22 ticks)

Problem is feasible; no conflict available.

CPLEX 20.1.0.0: integer infeasible.
9556 MIP simplex iterations
0 branch-and-bound nodes
Surprise values mc = 0, nc = 0 from CPXrefineconflict.
Return 1719 from CPXgetconflict.
No basis.