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

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

CPLEX> Selected objective sense:  MINIMIZE
Selected objective  name:  cost
Selected RHS        name:  rhs
Selected bound      name:  bnd
Problem 'in_i.mps.gz' read.
Read time =    0.31 sec.
CPLEX> 
Available MIP parameters:

cuts             set types of cuts used during mixed integer optimization
display          set level of mixed integer node display
interval         set interval for printing mixed integer node display
limits           set limits for mixed integer optimization
ordertype        set type of generated priority order
polishafter      set starting conditions for solution polishing
pool             set solution pool characteristics
strategy         set strategy for mixed integer optimization
tolerances       set tolerances for mixed integer optimization

MIP parameter to set: 
Available mixed integer limits:

aggforcut        set constraint aggregation limit for cut generation
auxrootthreads   set number of threads to use for auxiliary root tasks
cutpasses        set number of cutting plane passes
cutsfactor       set rows multiplier factor to limit cuts
eachcutlimit     set limit on number of cuts for each type per pass
gomorycand       set candidate limit for generating Gomory fractional cuts
gomorypass       set pass limit for generating Gomory fractional cuts
nodes            set branch and cut node limit
polishtime       set time limit for polishing best solution
populate         set solutions limit for each populate call
probetime        set time limit for probing
repairtries      set number of times to try repair heuristic
solutions        set mixed integer solutions limit
strongcand       set strong branching candidate limit
strongit         set strong branching iteration limit
submipnodelim    set sub-MIP node limit
treememory       set upper limit on size of tree in megabytes

Mixed integer limit to set: Present value for mixed integer solutions limit: 9223372036800000000
New value for mixed integer solutions limit: New value for mixed integer solutions limit: 1
CPLEX> Present value for time limit in seconds: 1e+75
New value for time limit in seconds: New value for time limit in seconds: 3600
CPLEX> Tried aggregator 2 times.
MIP Presolve eliminated 2465 rows and 128 columns.
MIP Presolve modified 33795 coefficients.
Aggregator did 71 substitutions.
Reduced MIP has 54286 rows, 13333 columns, and 582675 nonzeros.
Reduced MIP has 6464 binaries, 1 generals, 0 SOSs, and 0 indicators.
Probing fixed 29 vars, tightened 36 bounds.
Probing time =    0.55 sec.
Tried aggregator 1 time.
MIP Presolve eliminated 257 rows and 59 columns.
MIP Presolve modified 82 coefficients.
Reduced MIP has 54029 rows, 13274 columns, and 580587 nonzeros.
Reduced MIP has 6435 binaries, 1 generals, 0 SOSs, and 0 indicators.
Presolve time =    1.21 sec.
Found feasible solution after 1.25 sec.  Objective = 525000.0000

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

Solution pool: 1 solution saved.

MIP - Solution limit exceeded, integer feasible:  Objective =  5.2500000000e+05
Current MIP best bound is infinite.
Solution time =    1.25 sec.  Iterations = 0  Nodes = 0
Deterministic time = 1160.19 ticks  (928.70 ticks/sec)

CPLEX> 1.68user 0.04system 0:01.56elapsed 110%CPU (0avgtext+0avgdata 362736maxresident)k
0inputs+24outputs (0major+30264minor)pagefaults 0swaps