Welcome to IBM(R) ILOG(R) CPLEX(R) Interactive Optimizer 20.1.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, 2020. 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 'tortoise.lp' read. Read time = 0.21 sec. (24.59 ticks) CPLEX> Version identifier: 20.1.0.0 | 2020-11-10 | 9bedb6d68 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 Tried aggregator 2 times. MIP Presolve eliminated 525 rows and 28116 columns. MIP Presolve modified 123223 coefficients. Aggregator did 5 substitutions. Reduced MIP has 1018 rows, 19536 columns, and 712399 nonzeros. Reduced MIP has 19536 binaries, 0 generals, 0 SOSs, and 0 indicators. Presolve time = 1.28 sec. (1814.46 ticks) Tried aggregator 1 time. MIP Presolve eliminated 63 rows and 3465 columns. MIP Presolve modified 12570 coefficients. Reduced MIP has 938 rows, 16071 columns, and 584496 nonzeros. Reduced MIP has 16071 binaries, 0 generals, 0 SOSs, and 0 indicators. Presolve time = 0.45 sec. (714.82 ticks) Tried aggregator 2 times. MIP Presolve eliminated 77 rows and 2903 columns. MIP Presolve modified 12802 coefficients. Aggregator did 1 substitutions. Reduced MIP has 846 rows, 13167 columns, and 477168 nonzeros. Reduced MIP has 13167 binaries, 0 generals, 0 SOSs, and 0 indicators. Presolve time = 0.40 sec. (610.41 ticks) Probing fixed 9971 vars, tightened 0 bounds. Probing time = 0.85 sec. (489.30 ticks) Cover probing fixed 791 vars, tightened 5 bounds. Clique table members: 5265. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 8 threads. Root relaxation solution time = 0.01 sec. (12.68 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0 0 integral 0 0.0000 0.0000 51 0.00% Root node processing (before b&c): Real time = 4.24 sec. (4832.78 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) = 4.24 sec. (4832.78 ticks) Populate: phase II MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 8 threads. Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 2 0.0000 1 0.0000 0.0000 51 0.00% Elapsed time = 4.29 sec. (4885.14 ticks, tree = 0.02 MB, solutions = 1) Root node processing (before b&c): Real time = 0.03 sec. (49.10 ticks) Parallel b&c, 8 threads: Real time = 0.15 sec. (162.00 ticks) Sync time (average) = 0.09 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 0.19 sec. (211.10 ticks) Solution pool: 2 solutions saved. Populate - Integer optimal solution: Objective = 0.0000000000e+00 Current MIP best bound = 0.0000000000e+00 (gap = -0, 0.00%) Solution time = 4.43 sec. Iterations = 819 Nodes = 179 Deterministic time = 5044.33 ticks (1138.81 ticks/sec) CPLEX> Solution pool written to file 'tortoise.sol'. CPLEX>