kirkwood:bin rlevinso$ ./scip
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 <scip.set> not found - using default parameters

SCIP> read mplan.lp   

read problem <mplan.lp>
============

original problem has 3396 variables (3396 bin, 0 int, 0 impl, 0 cont) and 204 constraints
SCIP> optimize

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 <setppc>
    183 constraints of type <linear>
transformed objective value is always integral (scale: 10000000)
Presolving Time: 0.35

 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 <knapsack>
     50 constraints of type <setppc>
    183 constraints of type <linear>
      8 constraints of type <logicor>
transformed objective value is always integral (scale: 10000000)
Presolving Time: 0.36
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.8s|     1 |     0 |  2970 |     - |    42M |   0 |1476 | 251 | 214 |   3 |  2 | 152 |   0 | 3.151899e+13 | 3.162183e+13 |   0.33%| unknown
  0.8s|     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
  0.9s|     1 |     0 |  3073 |     - |    42M |   0 |1476 | 266 | 221 |  10 |  9 | 167 |   0 | 3.151942e+13 | 3.162183e+13 |   0.32%| unknown
  0.9s|     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.8s|     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%
* 2.9s|     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.29
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 %