kirkwood:bin rlevinso$ ./scip -f mplan.lp SCIP version 8.0.0 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 6.0.0] [GitHash: a740f0891e] Copyright (C) 2002-2021 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB) External libraries: SoPlex 6.0.0 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: 71a5873d] CppAD 20180000.0 Algorithmic Differentiation of C++ algorithms developed by B. Bell (github.com/coin-or/CppAD) ZLIB 1.2.11 General purpose compression library by J. Gailly and M. Adler (zlib.net) GMP 6.2.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) ZIMPL 3.5.1 Zuse Institute Mathematical Programming Language developed by T. Koch (zimpl.zib.de) AMPL/MP 4e2d45c4 AMPL .nl file reader library (github.com/ampl/mp) PaPILO 2.0.0 parallel presolve for integer and linear optimization (github.com/scipopt/papilo) [GitHash: 76cafc1] bliss 0.73p Computing Graph Automorphism Groups by T. Junttila and P. Kaski (www.tcs.hut.fi/Software/bliss/) user parameter file not found - using default parameters read problem ============ original problem has 3396 variables (3396 bin, 0 int, 0 impl, 0 cont) and 204 constraints solve problem ============= presolving: (0.0s) running MILP presolver (0.0s) MILP presolver found nothing (round 1, exhaustive) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 21 upgd conss, 0 impls, 21 clqs (round 2, medium) 21 del vars, 0 del conss, 0 add conss, 0 chg bounds, 21 chg sides, 21 chg coeffs, 21 upgd conss, 0 impls, 21 clqs (0.4s) probing: 1000/3375 (29.6%) - 0 fixings, 0 aggregations, 275868 implications, 0 bound changes (0.4s) probing: 1001/3375 (29.7%) - 0 fixings, 0 aggregations, 276130 implications, 0 bound changes (0.4s) probing aborted: 1000/1000 successive useless probings (0.4s) symmetry computation started: requiring (bin +, int -, cont +), (fixed: bin -, int +, cont -) (0.4s) no symmetry present presolving (3 rounds: 3 fast, 3 medium, 2 exhaustive): 21 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 21 changed sides, 21 changed coefficients 0 implications, 8113 cliques presolved problem has 3375 variables (3375 bin, 0 int, 0 impl, 0 cont) and 204 constraints 21 constraints of type 183 constraints of type transformed objective value is always integral (scale: 10000000) Presolving Time: 0.37 time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl. t 0.4s| 1 | 0 | 0 | - | trivial| 0 |3375 | 204 | 0 | 0 | 0 | 0 | 0 |-4.230038e+15 | 6.300630e+13 | Inf | unknown p 0.4s| 1 | 0 | 190 | - | vbounds| 0 |3375 | 215 | 204 | 0 | 0 | 10 | 0 |-4.230038e+15 | 3.757534e+13 | Inf | unknown 0.5s| 1 | 0 | 547 | - | 38M | 0 |3375 | 299 | 204 | 0 | 0 | 94 | 0 | 3.151755e+13 | 3.757534e+13 | 19.22%| unknown 0.5s| 1 | 0 | 570 | - | 40M | 0 |3375 | 301 | 206 | 2 | 1 | 96 | 0 | 3.151795e+13 | 3.757534e+13 | 19.22%| unknown 0.5s| 1 | 0 | 582 | - | 40M | 0 |3375 | 303 | 207 | 3 | 2 | 98 | 0 | 3.151814e+13 | 3.757534e+13 | 19.22%| unknown 0.5s| 1 | 0 | 606 | - | 40M | 0 |3375 | 306 | 208 | 4 | 3 | 101 | 0 | 3.151852e+13 | 3.757534e+13 | 19.22%| unknown 0.5s| 1 | 0 | 623 | - | 40M | 0 |3375 | 311 | 209 | 5 | 4 | 106 | 0 | 3.151863e+13 | 3.757534e+13 | 19.22%| unknown d 0.6s| 1 | 0 | 1472 | - |farkasdi| 0 |3375 | 314 | 209 | 0 | 6 | 109 | 0 | 3.151863e+13 | 3.162183e+13 | 0.33%| unknown 0.8s| 1 | 0 | 2490 | - | 41M | 0 |3375 | 346 | 209 | 5 | 6 | 141 | 0 | 3.151863e+13 | 3.162183e+13 | 0.33%| unknown 0.8s| 1 | 0 | 2490 | - | 41M | 0 |3375 | 349 | 209 | 5 | 6 | 144 | 0 | 3.151863e+13 | 3.162183e+13 | 0.33%| unknown 0.8s| 1 | 0 | 2509 | - | 41M | 0 |3375 | 238 | 211 | 7 | 7 | 144 | 0 | 3.151869e+13 | 3.162183e+13 | 0.33%| unknown (run 1, node 1) restarting after 1899 global fixings of integer variables (restart) converted 7 cuts from the global cut pool into linear constraints presolving: (round 1, fast) 1899 del vars, 2 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 107 chg coeffs, 0 upgd conss, 0 impls, 50 clqs (0.8s) running MILP presolver (0.8s) MILP presolver found nothing (round 2, exhaustive) 1899 del vars, 2 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 107 chg coeffs, 7 upgd conss, 0 impls, 50 clqs presolving (3 rounds: 3 fast, 2 medium, 2 exhaustive): 1899 deleted vars, 2 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 107 changed coefficients 0 implications, 50 cliques presolved problem has 1476 variables (1476 bin, 0 int, 0 impl, 0 cont) and 248 constraints 7 constraints of type 50 constraints of type 183 constraints of type 8 constraints of type transformed objective value is always integral (scale: 10000000) Presolving Time: 0.38 transformed 2/4 original solutions to the transformed problem space time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl. 0.8s| 1 | 0 | 2920 | - | 41M | 0 |1476 | 248 | 211 | 0 | 0 | 149 | 0 | 3.151869e+13 | 3.162183e+13 | 0.33%| unknown 0.8s| 1 | 0 | 2940 | - | 42M | 0 |1476 | 249 | 212 | 1 | 1 | 150 | 0 | 3.151874e+13 | 3.162183e+13 | 0.33%| unknown 0.9s| 1 | 0 | 2970 | - | 42M | 0 |1476 | 251 | 214 | 3 | 2 | 152 | 0 | 3.151899e+13 | 3.162183e+13 | 0.33%| unknown 0.9s| 1 | 0 | 2970 | - | 42M | 0 |1476 | 252 | 214 | 3 | 2 | 153 | 0 | 3.151899e+13 | 3.162183e+13 | 0.33%| unknown 0.9s| 1 | 0 | 2988 | - | 42M | 0 |1476 | 252 | 216 | 5 | 3 | 153 | 0 | 3.151904e+13 | 3.162183e+13 | 0.33%| unknown 0.9s| 1 | 0 | 3007 | - | 42M | 0 |1476 | 253 | 217 | 6 | 4 | 154 | 0 | 3.151911e+13 | 3.162183e+13 | 0.33%| unknown 0.9s| 1 | 0 | 3024 | - | 42M | 0 |1476 | 259 | 218 | 7 | 5 | 160 | 0 | 3.151918e+13 | 3.162183e+13 | 0.33%| unknown 0.9s| 1 | 0 | 3045 | - | 42M | 0 |1476 | 263 | 219 | 8 | 6 | 164 | 0 | 3.151930e+13 | 3.162183e+13 | 0.33%| unknown 0.9s| 1 | 0 | 3064 | - | 42M | 0 |1476 | 265 | 220 | 9 | 7 | 166 | 0 | 3.151939e+13 | 3.162183e+13 | 0.32%| unknown 0.9s| 1 | 0 | 3064 | - | 42M | 0 |1476 | 266 | 220 | 9 | 7 | 167 | 0 | 3.151939e+13 | 3.162183e+13 | 0.32%| unknown 1.0s| 1 | 0 | 3073 | - | 42M | 0 |1476 | 266 | 221 | 10 | 9 | 167 | 0 | 3.151942e+13 | 3.162183e+13 | 0.32%| unknown 1.0s| 1 | 0 | 3083 | - | 42M | 0 |1476 | 268 | 222 | 11 | 10 | 169 | 0 | 3.151945e+13 | 3.162183e+13 | 0.32%| unknown 1.0s| 1 | 0 | 3113 | - | 42M | 0 |1476 | 270 | 224 | 13 | 11 | 171 | 0 | 3.151949e+13 | 3.162183e+13 | 0.32%| unknown 1.5s| 1 | 2 | 4817 | - | 42M | 0 |1476 | 285 | 224 | 13 | 11 | 186 | 34 | 3.151984e+13 | 3.162183e+13 | 0.32%| unknown * 1.9s| 3 | 2 | 5377 |1442.7 |strongbr| 2 |1476 | 285 | 219 | 13 | 1 | 186 | 89 | 3.151984e+13 | 3.155156e+13 | 0.10%| unknown time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl. * 2.6s| 7 | 2 | 6147 | 728.3 |strongbr| 4 |1476 | 362 | 219 | 13 | 21 | 266 | 233 | 3.151984e+13 | 3.154832e+13 | 0.09%| 14.56% * 2.7s| 8 | 1 | 6234 | 648.1 |strongbr| 4 |1476 | 366 | 219 | 13 | 1 | 271 | 252 | 3.151984e+13 | 3.153704e+13 | 0.05%| 16.85% * 3.0s| 8 | 1 | 6328 | 659.9 |strongbr| 4 |1476 | 388 | 219 | 13 | 8 | 294 | 297 | 3.151984e+13 | 3.153519e+13 | 0.05%| 16.85% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 6.45 Solving Nodes : 91 (total of 92 nodes in 2 runs) Primal Bound : +3.15351900000000e+13 (10 solutions) Dual Bound : +3.15351900000000e+13 Gap : 0.00 % primal solution (original space): ================================= objective value: 31535190000000 x.1.14.12 1 (obj:1501350000000) x.2.19.16 1 (obj:1501370000000) x.3.13.8 1 (obj:1503460000000) x.6.17.9 1 (obj:1501090000000) x.7.11.8 1 (obj:1501250000000) x.8.7.3 1 (obj:1500430000000) x.9.6.4 1 (obj:1500260000000) x.10.20.16 1 (obj:1502060000000) x.11.7.5 1 (obj:1510340000000) x.12.4.1 1 (obj:1502020000000) x.13.15.3 1 (obj:1500260000000) x.14.18.1 1 (obj:1500250000000) x.15.21.13 1 (obj:1501990000000) x.16.10.2 1 (obj:1500750000000) x.17.18.6 1 (obj:1501060000000) x.18.17.14 1 (obj:1502720000000) x.19.20.2 1 (obj:1500320000000) x.20.19.10 1 (obj:1502560000000) x.21.15.5 1 (obj:1500430000000) x.4.12.9 1 (obj:1500890000000) x.5.21.11 1 (obj:1500330000000) Statistics ========== SCIP Status : problem is solved [optimal solution found] Total Time : 6.46 solving : 6.45 presolving : 0.38 (included in solving) reading : 0.01 copying : 0.01 (3 #copies) (minimal 0.00, maximal 0.00, average 0.00) Original Problem : Problem name : mplan.lp Variables : 3396 (3396 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 204 initial, 204 maximal Objective : minimize, 3396 non-zeros (abs.min = 1.50025e+12, abs.max = 3.0003e+12) Presolved Problem : Problem name : t_mplan.lp Variables : 1476 (1476 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 248 initial, 523 maximal Objective : minimize, 1476 non-zeros (abs.min = 139253, abs.max = 150005) Nonzeros : 6600 constraint, 531 clique table Presolvers : ExecTime SetupTime Calls FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 domcol : 0.00 0.00 2 0 0 0 0 0 0 0 0 0 dualagg : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 dualcomp : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 dualinfer : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 dualsparsify : 0.00 0.00 1 0 0 0 0 0 0 0 0 0 gateextraction : 0.00 0.00 2 0 0 0 0 0 0 0 0 0 implics : 0.00 0.00 5 0 0 0 0 0 0 0 0 0 inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 milp : 0.01 0.00 2 0 0 0 0 0 0 0 0 0 qpkktref : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 redvub : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 sparsify : 0.01 0.00 1 0 0 0 0 0 0 0 0 0 stuffing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 trivial : 0.00 0.00 6 1899 0 0 0 0 0 0 0 0 tworowbnd : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 dualfix : 0.00 0.00 6 0 0 0 0 0 0 0 0 0 genvbounds : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 probing : 0.33 0.00 1 0 0 0 0 0 0 0 0 0 pseudoobj : 0.00 0.00 1 0 0 0 0 0 0 0 0 0 symmetry : 0.00 0.00 1 0 0 0 0 0 0 0 0 0 vbounds : 0.00 0.00 2 0 0 0 0 0 0 0 0 0 knapsack : 0.00 0.00 3 0 0 0 0 0 0 0 0 0 setppc : 0.00 0.00 12 0 21 0 0 0 2 0 21 21 linear : 0.00 0.00 10 0 0 0 0 0 0 0 0 0 logicor : 0.00 0.00 6 0 0 0 0 0 0 0 0 107 benders : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 components : 0.00 0.00 2 0 0 0 0 0 0 0 0 0 root node : - - - 3240 - - 3240 - - - - - Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoRelax #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Applied Conss Children benderslp : 0 0 0 0 114 0 0 22 0 0 0 0 0 0 0 integral : 0 0 0 0 114 0 0 22 0 1 290 0 0 284 90 knapsack : 7+ 8 10 4378 0 0 0 0 476 0 82 0 0 0 0 setppc : 50+ 78 16 12578 0 0 0 15 7822 2 1014 0 0 0 0 linear : 183 183 16 12578 0 0 0 12 4493 71 4669 0 0 0 0 logicor : 8+ 289 16 1488 0 0 0 0 28 7 5 0 0 0 0 benders : 0 0 0 0 0 0 0 13 0 0 0 0 0 0 0 countsols : 0 0 0 0 0 0 0 13 0 0 0 0 0 0 0 components : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS EnfoRelax Check ResProp SB-Prop benderslp : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 integral : 4.92 0.00 0.00 0.00 4.92 0.00 0.00 0.00 0.00 0.00 knapsack : 0.05 0.00 0.02 0.01 0.00 0.00 0.00 0.00 0.00 0.02 setppc : 0.03 0.00 0.00 0.01 0.00 0.00 0.00 0.00 0.00 0.02 linear : 0.24 0.00 0.04 0.14 0.00 0.00 0.00 0.00 0.00 0.06 logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 benders : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 components : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 Propagators : #Propagate #ResProp Cutoffs DomReds dualfix : 6 0 0 0 genvbounds : 0 0 0 0 nlobbt : 0 0 0 0 obbt : 0 0 0 0 probing : 0 0 0 0 pseudoobj : 904 0 0 0 redcost : 459 0 0 7398 rootredcost : 5 0 0 792 symmetry : 0 0 0 0 vbounds : 1385 0 0 0 Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp SB-Prop dualfix : 0.00 0.00 0.00 0.00 0.00 0.00 genvbounds : 0.00 0.00 0.00 0.00 0.00 0.00 nlobbt : 0.00 0.00 0.00 0.00 0.00 0.00 obbt : 0.00 0.00 0.00 0.00 0.00 0.00 probing : 0.33 0.00 0.33 0.00 0.00 0.00 pseudoobj : 0.00 0.00 0.00 0.00 0.00 0.00 redcost : 0.02 0.00 0.00 0.02 0.00 0.00 rootredcost : 0.00 0.00 0.00 0.00 0.00 0.00 symmetry : 0.00 0.00 0.00 0.00 0.00 0.00 vbounds : 0.00 0.00 0.00 0.00 0.00 0.00 Conflict Analysis : Time Calls Success DomReds Conflicts Literals Reconvs ReconvLits Dualrays Nonzeros LP Iters (pool size: [10000,10000]) propagation : 0.00 68 66 - 98 40.6 143 5.1 - - - infeasible LP : 0.00 1 1 - 3 16.3 0 0.0 1 125.0 0 bound exceed. LP : 0.27 280 122 - 364 47.2 0 0.0 11 35.4 1660 strong branching : 0.00 0 0 - 0 0.0 0 0.0 - - 0 pseudo solution : 0.00 0 0 - 0 0.0 0 0.0 - - - applied globally : 0.01 - - 4 514 25.7 - - 12 - - applied locally : - - - 0 0 0.0 - - 0 - - Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Applied Conss cut pool : 0.00 41 - - 21 - - (maximal pool size: 23) aggregation : 0.05 0.00 26 0 0 0 0 0 > cmir : - - - - - - 0 - > flowcover : - - - - - - 0 - > knapsackcover : - - - - - - 0 - cgmip : 0.00 0.00 0 0 0 0 0 0 clique : 0.02 0.00 16 0 0 0 0 0 closecuts : 0.00 0.00 0 0 0 0 0 0 convexproj : 0.00 0.00 0 0 0 0 0 0 disjunctive : 0.00 0.00 0 0 0 0 0 0 eccuts : 0.00 0.00 0 0 0 0 0 0 gauge : 0.00 0.00 0 0 0 0 0 0 gomory : 0.03 0.00 23 0 0 0 0 0 > gomorymi : - - - - - - 0 - > strongcg : - - - - - - 0 - impliedbounds : 0.00 0.00 26 0 0 0 0 0 interminor : 0.00 0.00 0 0 0 0 0 0 intobj : 0.00 0.00 0 0 0 0 0 0 mcf : 0.00 0.00 2 0 0 0 0 0 minor : 0.00 0.00 0 0 0 0 0 0 mixing : 0.00 0.00 0 0 0 0 0 0 oddcycle : 0.00 0.00 0 0 0 0 0 0 rapidlearning : 0.00 0.00 0 0 0 0 0 0 rlt : 0.00 0.00 16 0 0 0 0 0 zerohalf : 0.07 0.00 23 0 0 30 28 0 Cutselectors : ExecTime SetupTime hybrid : 0.00 0.00 Pricers : ExecTime SetupTime Calls Vars problem variables: 0.00 - 0 0 Branching Rules : ExecTime SetupTime BranchLP BranchExt BranchPS Cutoffs DomReds Cuts Conss Children allfullstrong : 0.00 0.00 0 0 0 0 0 0 0 0 cloud : 0.00 0.00 0 0 0 0 0 0 0 0 distribution : 0.00 0.00 0 0 0 0 0 0 0 0 fullstrong : 0.00 0.00 0 0 0 0 0 0 0 0 inference : 0.00 0.00 0 0 0 0 0 0 0 0 leastinf : 0.00 0.00 0 0 0 0 0 0 0 0 lookahead : 0.00 0.00 0 0 0 0 0 0 0 0 mostinf : 0.00 0.00 0 0 0 0 0 0 0 0 multaggr : 0.00 0.00 0 0 0 0 0 0 0 0 nodereopt : 0.00 0.00 0 0 0 0 0 0 0 0 pscost : 0.00 0.00 0 0 0 0 0 0 0 0 random : 0.00 0.00 0 0 0 0 0 0 0 0 relpscost : 4.92 0.00 114 0 0 1 290 0 288 90 vanillafullstrong: 0.00 0.00 0 0 0 0 0 0 0 0 Primal Heuristics : ExecTime SetupTime Calls Found Best LP solutions : 0.00 - - 0 0 relax solutions : 0.00 - - 0 0 pseudo solutions : 0.00 - - 0 0 strong branching : 0.00 - - 4 4 actconsdiving : 0.00 0.00 0 0 0 adaptivediving : 0.00 0.00 0 0 0 alns : 0.02 0.00 1 0 0 bound : 0.00 0.00 0 0 0 clique : 0.01 0.00 1 0 0 coefdiving : 0.00 0.00 0 0 0 completesol : 0.00 0.00 0 0 0 conflictdiving : 0.17 0.00 2 0 0 crossover : 0.00 0.00 0 0 0 dins : 0.00 0.00 0 0 0 distributiondivin: 0.00 0.00 0 0 0 dps : 0.00 0.00 0 0 0 dualval : 0.00 0.00 0 0 0 farkasdiving : 0.10 0.00 2 1 1 feaspump : 0.01 0.00 1 0 0 fixandinfer : 0.00 0.00 0 0 0 fracdiving : 0.00 0.00 0 0 0 gins : 0.00 0.00 0 0 0 guideddiving : 0.00 0.00 0 0 0 indicator : 0.00 0.00 0 0 0 intdiving : 0.00 0.00 0 0 0 intshifting : 0.00 0.00 0 0 0 linesearchdiving : 0.00 0.00 0 0 0 localbranching : 0.00 0.00 0 0 0 locks : 0.02 0.00 1 0 0 lpface : 0.00 0.00 0 0 0 mpec : 0.00 0.00 0 0 0 multistart : 0.00 0.00 0 0 0 mutation : 0.00 0.00 0 0 0 nlpdiving : 0.00 0.00 0 0 0 objpscostdiving : 0.00 0.00 0 0 0 octane : 0.00 0.00 0 0 0 ofins : 0.00 0.00 0 0 0 oneopt : 0.00 0.00 5 0 0 padm : 0.00 0.00 0 0 0 proximity : 0.00 0.00 0 0 0 pscostdiving : 0.00 0.00 0 0 0 randrounding : 0.02 0.00 20 0 0 rens : 0.02 0.00 2 0 0 reoptsols : 0.00 0.00 0 0 0 repair : 0.00 0.00 0 0 0 rins : 0.00 0.00 0 0 0 rootsoldiving : 0.00 0.00 0 0 0 rounding : 0.01 0.00 112 0 0 shiftandpropagate: 0.00 0.00 0 0 0 shifting : 0.00 0.00 30 3 0 simplerounding : 0.00 0.00 0 0 0 subnlp : 0.00 0.00 0 0 0 trivial : 0.00 0.00 2 1 1 trivialnegation : 0.00 0.00 0 0 0 trustregion : 0.00 0.00 0 0 0 trysol : 0.00 0.00 0 0 0 twoopt : 0.00 0.00 0 0 0 undercover : 0.00 0.00 0 0 0 vbounds : 0.04 0.00 2 1 1 veclendiving : 0.00 0.00 0 0 0 zeroobj : 0.00 0.00 0 0 0 zirounding : 0.00 0.00 46 0 0 other solutions : - - - 0 - Diving (single) : Calls Nodes LP Iters Backtracks Conflicts MinDepth MaxDepth AvgDepth RoundSols NLeafSols MinSolDpt MaxSolDpt AvgSolDpt actconsdiving : 0 - - - - - - - - - - - - coefdiving : 0 - - - - - - - - - - - - conflictdiving : 2 74 1741 25 47 25 26 25.5 0 - - - - distributiondivin: 0 - - - - - - - - - - - - farkasdiving : 2 19 1481 1 9 10 10 10.0 0 1 10 10 10.0 fracdiving : 0 - - - - - - - - - - - - guideddiving : 0 - - - - - - - - - - - - linesearchdiving : 0 - - - - - - - - - - - - pscostdiving : 0 - - - - - - - - - - - - veclendiving : 0 - - - - - - - - - - - - Diving (adaptive) : Calls Nodes LP Iters Backtracks Conflicts MinDepth MaxDepth AvgDepth RoundSols NLeafSols MinSolDpt MaxSolDpt AvgSolDpt actconsdiving : 0 - - - - - - - - - - - - coefdiving : 0 - - - - - - - - - - - - conflictdiving : 0 - - - - - - - - - - - - distributiondivin: 0 - - - - - - - - - - - - farkasdiving : 0 - - - - - - - - - - - - fracdiving : 0 - - - - - - - - - - - - guideddiving : 0 - - - - - - - - - - - - linesearchdiving : 0 - - - - - - - - - - - - pscostdiving : 0 - - - - - - - - - - - - veclendiving : 0 - - - - - - - - - - - - Neighborhoods : Calls SetupTime SolveTime SolveNodes Sols Best Exp3 EpsGreedy UCB TgtFixRate Opt Inf Node Stal Sol Usr Othr Actv rens : 0 0.00 0.00 0 0 0 0.00000 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1 rins : 0 0.00 0.00 0 0 0 0.00000 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1 mutation : 0 0.00 0.00 0 0 0 0.00000 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1 localbranching : 0 0.00 0.00 0 0 0 0.00000 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1 crossover : 0 0.00 0.00 0 0 0 0.00000 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1 proximity : 1 0.01 0.01 1 0 0 0.00000 -1.00000 1.00000 0.700 0 1 0 0 0 0 0 1 zeroobjective : 0 0.00 0.00 0 0 0 0.00000 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1 dins : 0 0.00 0.00 0 0 0 0.00000 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1 trustregion : 0 0.00 0.00 0 0 0 0.00000 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 0 LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It ItLimit primal LP : 0.00 3 0 0.00 - 0.00 3 dual LP : 0.36 374 7680 46.55 21284.20 0.05 209 lex dual LP : 0.00 0 0 0.00 - barrier LP : 0.00 0 0 0.00 - 0.00 0 resolve instable : 0.00 0 0 0.00 - diving/probing LP: 0.22 65 3986 61.32 17991.02 strong branching : 4.37 783 113121 144.47 25865.52 - - 1 (at root node) : - 34 9273 272.74 - conflict analysis: 0.08 166 1660 10.00 21549.21 B&B Tree : number of runs : 2 nodes : 91 (45 internal, 46 leaves) feasible leaves : 0 infeas. leaves : 5 objective leaves : 41 nodes (total) : 92 (45 internal, 47 leaves) nodes left : 0 max depth : 29 max depth (total): 29 backtracks : 9 (9.9%) early backtracks : 0 (0.0%) nodes exc. ref. : 0 (0.0%) delayed cutoffs : 0 repropagations : 61 (26 domain reductions, 0 cutoffs) avg switch length: 11.47 switching time : 0.01 Estim. Tree Size : 91 Estimation Tree : 91 nodes (91 visited, 45 internal, 46 leaves, 0 open), weight: 1.0000 completed 0.9997 Estimations : estim value trend resolution smooth wbe : 91 - - - - tree-profile : -1 - - - - gap : 91 1.00000 0.00038 1 90 tree-weight : 91 1.00000 0.00017 1 91 leaf-frequency : 91 0.50000 0.00058 1 160 ssg : 102 0.00049 -0.00009 1 101 open-nodes : 91 0.00000 -0.09839 1 138 Root Node : First LP value : +3.15175502173913e+13 First LP Iters : 350 (22663.99 Iter/sec) First LP Time : 0.02 Final Dual Bound : +3.15198397660699e+13 Final Root Iters : 1049 Root LP Estimate : +3.15393854545884e+13 Solution : Solutions found : 10 (7 improvements) First Solution : +6.30063000000000e+13 (in run 1, after 1 nodes, 0.38 seconds, depth 0, found by ) Gap First Sol. : infinite Gap Last Sol. : 0.05 % Primal Bound : +3.15351900000000e+13 (in run 2, after 8 nodes, 3.01 seconds, depth 6, found by ) Dual Bound : +3.15351900000000e+13 Gap : 0.00 % Integrals : Total Avg% primal-dual : 49.93 7.74 primal-ref : - - (not evaluated) dual-ref : - - (not evaluated) kirkwood:bin rlevinso$