CPLEX 20.1.0.0: presolve=0

mipdisplay=2

feasibility=1e-5

cutpass=-1

iisfind=1

timelimit=3600

Clique table members: 1562.

MIP emphasis: balance optimality and feasibility.

MIP search method: dynamic search.

Parallel mode: deterministic, using up to 8 threads.

Root relaxation solution time = 1.66 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    infeasible                       5.38244e+07   110594         

Elapsed time = 76.00 sec. (47933.52 ticks, tree = 0.02 MB)



Root node processing (before b&c):

  Real time             =   12.98 sec. (8322.24 ticks)

Parallel b&c, 8 threads:

  Real time             =   63.05 sec. (39627.39 ticks)

  Sync time (average)   =   55.12 sec.

  Wait time (average)   =    0.00 sec.

                          ------------

Total (root+branch&cut) =   76.03 sec. (47949.62 ticks)



Non-minimal conflict: 35258 linear constraint(s)

                      8102 lower bound(s)

                      6974 upper bound(s)

Conflict computation time = 3608.39 sec.  Iterations = 0

Deterministic time = 655963.97 ticks  (181.79 ticks/sec)

CPLEX 20.1.0.0: integer infeasible.
110594 MIP simplex iterations
1 branch-and-bound nodes
Search for conflicts aborted because of time limit

No basis.