0.00/0.00 c SCIP version 10.0.0 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 8.0.0] [GitHash: 0408ae5eca]
0.00/0.00 c Copyright (c) 2002-2025 Zuse Institute Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c External libraries:
0.00/0.00 c SoPlex 8.0.0 Linear programming solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: 67f6a391]
0.00/0.00 c CppAD 20180000.0 Algorithmic Differentiation of C++ algorithms developed by B. Bell (github.com/coin-or/CppAD)
0.00/0.00 c AMPL/MP 4.0.0 AMPL .nl file reader library (github.com/ampl/mp)
0.00/0.00 c PaPILO 3.0.0 parallel presolve for integer and linear optimization (github.com/scipopt/papilo)
0.00/0.00 c bliss 0.77 Computing Graph Automorphisms by T. Junttila and P. Kaski (users.aalto.fi/~tjunttil/bliss)
0.00/0.00 c sassy 2.0 Symmetry preprocessor by Markus Anders (github.com/markusa4/sassy)
0.00/0.00 c
0.00/0.00 c reading problem <HOME/instance-4487631-1751317826.opb>
0.00/0.00 c original problem has 372 variables (372 bin, 0 int, 0 cont) and 772 constraints
0.00/0.00 c problem read in 0.004 seconds
0.00/0.00 o 372
0.00/0.00 c feasible solution found by trivial heuristic after 0.0 seconds, objective value 3.720000e+02
0.00/0.00 c presolving:
0.00/0.01 c (round 1, fast) 5 del vars, 128 del conss, 0 add conss, 5 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 3 clqs
0.00/0.01 c (0.0s) running MILP presolver
0.00/0.01 c (0.0s) MILP presolver (2 rounds): 0 aggregations, 0 fixings, 0 bound changes
0.00/0.01 c (round 2, exhaustive) 5 del vars, 147 del conss, 0 add conss, 5 chg bounds, 3 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 3 clqs
0.00/0.02 c (round 3, exhaustive) 5 del vars, 147 del conss, 0 add conss, 5 chg bounds, 3 chg sides, 0 chg coeffs, 622 upgd conss, 0 impls, 3 clqs
0.00/0.02 c (round 4, medium) 7 del vars, 149 del conss, 0 add conss, 5 chg bounds, 3 chg sides, 0 chg coeffs, 622 upgd conss, 0 impls, 1 clqs
0.00/0.02 c (round 5, exhaustive) 7 del vars, 149 del conss, 0 add conss, 5 chg bounds, 3 chg sides, 0 chg coeffs, 625 upgd conss, 0 impls, 1 clqs
0.00/0.02 c (round 6, exhaustive) 7 del vars, 242 del conss, 0 add conss, 5 chg bounds, 3 chg sides, 2 chg coeffs, 625 upgd conss, 0 impls, 1 clqs
0.00/0.02 c (round 7, fast) 16 del vars, 242 del conss, 0 add conss, 5 chg bounds, 3 chg sides, 2 chg coeffs, 625 upgd conss, 0 impls, 1 clqs
0.00/0.02 c (round 8, fast) 17 del vars, 242 del conss, 0 add conss, 5 chg bounds, 3 chg sides, 10 chg coeffs, 625 upgd conss, 0 impls, 2 clqs
0.00/0.02 c (round 9, fast) 18 del vars, 242 del conss, 0 add conss, 5 chg bounds, 3 chg sides, 11 chg coeffs, 625 upgd conss, 0 impls, 2 clqs
0.00/0.03 c (0.0s) running MILP presolver
0.00/0.03 c (0.0s) MILP presolver (2 rounds): 0 aggregations, 0 fixings, 0 bound changes
0.00/0.03 c (round 10, exhaustive) 18 del vars, 266 del conss, 0 add conss, 5 chg bounds, 3 chg sides, 12 chg coeffs, 625 upgd conss, 0 impls, 3 clqs
0.00/0.03 c (round 11, exhaustive) 85 del vars, 266 del conss, 0 add conss, 5 chg bounds, 3 chg sides, 12 chg coeffs, 625 upgd conss, 0 impls, 3 clqs
0.00/0.03 c (round 12, fast) 85 del vars, 341 del conss, 0 add conss, 5 chg bounds, 3 chg sides, 1658 chg coeffs, 625 upgd conss, 0 impls, 3 clqs
0.00/0.04 c (0.0s) running MILP presolver
0.00/0.04 c (0.0s) MILP presolver (2 rounds): 0 aggregations, 0 fixings, 0 bound changes
0.00/0.04 c (round 13, exhaustive) 85 del vars, 342 del conss, 0 add conss, 5 chg bounds, 3 chg sides, 1658 chg coeffs, 625 upgd conss, 0 impls, 3 clqs
0.00/0.04 c (0.0s) probing: 51/287 (17.8%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.04 c (0.0s) probing aborted: 50/50 successive totally useless probings
0.00/0.04 c (0.0s) symmetry computation started: requiring (bin +, int +, cont +), (fixed: bin -, int -, cont -)
0.00/0.04 c (0.0s) symmetry computation finished: 2 generators found (max: 1500, log10 of symmetry group size: 0.60) (symcode time: 0.00)
0.00/0.05 c dynamic symmetry handling statistics:
0.00/0.05 c orbitopal reduction: no components
0.00/0.05 c orbital reduction: no components
0.00/0.05 c lexicographic reduction: no permutations
0.00/0.05 c handled 2 out of 2 symmetry components
0.00/0.05 c (round 14, exhaustive) 85 del vars, 342 del conss, 2 add conss, 5 chg bounds, 3 chg sides, 1658 chg coeffs, 625 upgd conss, 0 impls, 5 clqs
0.00/0.05 c (round 15, exhaustive) 85 del vars, 342 del conss, 2 add conss, 5 chg bounds, 3 chg sides, 1658 chg coeffs, 627 upgd conss, 0 impls, 5 clqs
0.00/0.05 c (round 16, exhaustive) 85 del vars, 342 del conss, 2 add conss, 5 chg bounds, 3 chg sides, 1722 chg coeffs, 627 upgd conss, 0 impls, 5 clqs
0.00/0.05 c (round 17, fast) 87 del vars, 348 del conss, 2 add conss, 5 chg bounds, 3 chg sides, 1722 chg coeffs, 627 upgd conss, 0 impls, 3 clqs
0.00/0.05 c (0.1s) probing: 56/287 (19.5%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.05 c (0.1s) probing aborted: 50/50 successive totally useless probings
0.00/0.05 c presolving (18 rounds: 18 fast, 12 medium, 11 exhaustive):
0.00/0.05 c 87 deleted vars, 348 deleted constraints, 2 added constraints, 5 tightened bounds, 0 added holes, 3 changed sides, 1722 changed coefficients
0.00/0.05 c 0 implications, 3 cliques
0.00/0.05 c presolved problem has 285 variables (285 bin, 0 int, 0 cont) and 426 constraints
0.00/0.05 c presolved problem has 0 implied integral variables (0 bin, 0 int, 0 cont)
0.00/0.05 c 1 constraints of type <setppc>
0.00/0.05 c 425 constraints of type <logicor>
0.00/0.05 c transformed objective value is always integral (scale: 1)
0.00/0.05 c Presolving Time: 0.05
0.00/0.05 c
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c
0.00/0.05 c # SCIP version 10.0.0
0.00/0.05 c
0.00/0.05 c # maximal time in seconds to run
0.00/0.05 c # [type: real, advanced: FALSE, range: [0,1e+20], default: 1e+20]
0.00/0.05 c limits/time = 3596.999004
0.00/0.05 c
0.00/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05 c # [type: real, advanced: FALSE, range: [0,8796093022207], default: 8796093022207]
0.00/0.05 c limits/memory = 27900
0.00/0.05 c
0.00/0.05 c # belongs reading time to solving time?
0.00/0.05 c # [type: bool, advanced: FALSE, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c timing/reading = TRUE
0.00/0.05 c
0.00/0.05 c # maximum allowed 'intsize' (i.e. the number of bits required to represent the sum of absolute values of all integers that appear in a constraint or objective function) or -1 for unlimited
0.00/0.05 c # [type: int, advanced: TRUE, range: [-1,2147483647], default: -1]
0.00/0.05 c reading/opbreader/maxintsize = 47
0.00/0.05 c
0.00/0.05 c # timing when propagator should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP, 15:ALWAYS))
0.00/0.05 c # [type: int, advanced: TRUE, range: [0,15], default: 15]
0.00/0.05 c propagating/genvbounds/timingmask = 0
0.00/0.05 c
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c
0.00/0.05 o 291
0.00/0.05 c time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl.
0.00/0.05 c t 0.1s| 1 | 0 | 0 | - | trivial| 0 | 285 | 426 | 0 | 0 | 0 | 0 | 0 | 7.000000e+00 | 2.910000e+02 |4057.14%| unknown
0.00/0.05 o 271
0.00/0.05 c t 0.1s| 1 | 0 | 0 | - | trivial| 0 | 285 | 426 | 0 | 0 | 0 | 0 | 0 | 7.000000e+00 | 2.710000e+02 |3771.43%| unknown
0.00/0.05 o 33
0.00/0.05 c p 0.1s| 1 | 0 | 0 | - | locks| 0 | 285 | 426 | 426 | 0 | 0 | 0 | 0 | 7.000000e+00 | 3.300000e+01 | 371.43%| unknown
0.00/0.05 o 31
0.00/0.05 c i 0.1s| 1 | 0 | 0 | - | oneopt| 0 | 285 | 426 | 426 | 0 | 0 | 0 | 0 | 7.000000e+00 | 3.100000e+01 | 342.86%| unknown
0.00/0.06 c 0.1s| 1 | 0 | 73 | - | 11M | 0 | 285 | 426 | 426 | 0 | 0 | 0 | 0 | 2.475000e+01 | 3.100000e+01 | 25.25%| unknown
0.09/0.10 c 0.1s| 1 | 0 | 100 | - | 13M | 0 | 285 | 426 | 431 | 5 | 1 | 0 | 0 | 2.500000e+01 | 3.100000e+01 | 24.00%| unknown
0.09/0.18 c 0.2s| 1 | 0 | 117 | - | 16M | 0 | 285 | 426 | 432 | 6 | 2 | 0 | 0 | 2.500000e+01 | 3.100000e+01 | 24.00%| unknown
0.20/0.25 c 0.3s| 1 | 0 | 150 | - | 21M | 0 | 285 | 426 | 436 | 10 | 3 | 0 | 0 | 2.500000e+01 | 3.100000e+01 | 24.00%| unknown
0.20/0.29 c 0.3s| 1 | 0 | 177 | - | 23M | 0 | 285 | 426 | 441 | 15 | 4 | 0 | 0 | 2.500000e+01 | 3.100000e+01 | 24.00%| unknown
0.30/0.36 c 0.4s| 1 | 0 | 200 | - | 28M | 0 | 285 | 426 | 444 | 18 | 5 | 0 | 0 | 2.500000e+01 | 3.100000e+01 | 24.00%| unknown
0.39/0.44 c 0.4s| 1 | 0 | 220 | - | 32M | 0 | 285 | 426 | 446 | 20 | 6 | 0 | 0 | 2.500000e+01 | 3.100000e+01 | 24.00%| unknown
0.49/0.52 c 0.5s| 1 | 0 | 236 | - | 36M | 0 | 285 | 426 | 448 | 22 | 7 | 0 | 0 | 2.500000e+01 | 3.100000e+01 | 24.00%| unknown
0.49/0.58 c 0.6s| 1 | 0 | 257 | - | 41M | 0 | 285 | 426 | 449 | 23 | 8 | 0 | 0 | 2.500000e+01 | 3.100000e+01 | 24.00%| unknown
0.59/0.67 c 0.7s| 1 | 0 | 270 | - | 43M | 0 | 285 | 426 | 451 | 25 | 9 | 0 | 0 | 2.500000e+01 | 3.100000e+01 | 24.00%| unknown
0.69/0.75 c 0.8s| 1 | 0 | 292 | - | 45M | 0 | 285 | 426 | 453 | 27 | 10 | 0 | 0 | 2.500000e+01 | 3.100000e+01 | 24.00%| unknown
0.69/0.75 c time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl.
0.69/0.75 c 0.8s| 1 | 0 | 315 | - | 46M | 0 | 285 | 426 | 457 | 32 | 11 | 0 | 0 | 2.500000e+01 | 3.100000e+01 | 24.00%| unknown
0.69/0.76 o 28
0.69/0.76 c o 0.8s| 1 | 0 | 434 | - |feaspump| 0 | 285 | 426 | 457 | 32 | 11 | 0 | 0 | 2.500000e+01 | 2.800000e+01 | 12.00%| unknown
0.69/0.77 c 0.8s| 1 | 0 | 434 | - | 46M | 0 | 285 | 426 | 457 | 32 | 11 | 0 | 0 | 2.500000e+01 | 2.800000e+01 | 12.00%| unknown
0.69/0.77 o 26
0.69/0.77 c i 0.8s| 1 | 0 | 434 | - | oneopt| 0 | 285 | 426 | 457 | 32 | 11 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%| unknown
0.69/0.77 c 0.8s| 1 | 0 | 469 | - | 46M | 0 | 285 | 426 | 459 | 34 | 12 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%| unknown
0.69/0.78 c 0.8s| 1 | 0 | 469 | - | 46M | 0 | 285 | 426 | 315 | 34 | 12 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%| unknown
0.69/0.78 c 0.8s| 1 | 0 | 474 | - | 46M | 0 | 285 | 426 | 316 | 35 | 13 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%| unknown
0.69/0.78 c (run 1, node 1) restarting after 118 global fixings of integer variables
0.69/0.78 c
0.69/0.78 c (restart) converted 34 cuts from the global cut pool into linear constraints
0.69/0.78 c
0.69/0.79 c presolving:
0.69/0.79 c (round 1, fast) 120 del vars, 162 del conss, 0 add conss, 1 chg bounds, 1 chg sides, 2589 chg coeffs, 0 upgd conss, 0 impls, 3 clqs
0.69/0.79 c (round 2, fast) 121 del vars, 162 del conss, 0 add conss, 1 chg bounds, 1 chg sides, 2590 chg coeffs, 0 upgd conss, 0 impls, 3 clqs
0.69/0.79 c (round 3, fast) 121 del vars, 162 del conss, 0 add conss, 1 chg bounds, 1 chg sides, 2591 chg coeffs, 0 upgd conss, 0 impls, 3 clqs
0.69/0.79 c (0.8s) running MILP presolver
0.69/0.79 c (0.8s) MILP presolver (2 rounds): 0 aggregations, 0 fixings, 0 bound changes
0.69/0.79 c (round 4, exhaustive) 121 del vars, 169 del conss, 0 add conss, 1 chg bounds, 8 chg sides, 2591 chg coeffs, 0 upgd conss, 0 impls, 3 clqs
0.69/0.79 c (round 5, exhaustive) 121 del vars, 169 del conss, 0 add conss, 1 chg bounds, 8 chg sides, 2591 chg coeffs, 23 upgd conss, 0 impls, 3 clqs
0.69/0.79 c (round 6, exhaustive) 121 del vars, 178 del conss, 0 add conss, 1 chg bounds, 8 chg sides, 2598 chg coeffs, 23 upgd conss, 0 impls, 3 clqs
0.69/0.79 c (round 7, fast) 121 del vars, 179 del conss, 0 add conss, 1 chg bounds, 8 chg sides, 2598 chg coeffs, 23 upgd conss, 0 impls, 3 clqs
0.69/0.79 c (round 8, exhaustive) 134 del vars, 179 del conss, 0 add conss, 1 chg bounds, 8 chg sides, 2598 chg coeffs, 23 upgd conss, 0 impls, 2 clqs
0.69/0.79 c (round 9, fast) 134 del vars, 192 del conss, 0 add conss, 1 chg bounds, 8 chg sides, 2703 chg coeffs, 23 upgd conss, 0 impls, 2 clqs
0.69/0.79 c (round 10, fast) 136 del vars, 192 del conss, 0 add conss, 1 chg bounds, 8 chg sides, 2703 chg coeffs, 23 upgd conss, 0 impls, 2 clqs
0.69/0.79 c (round 11, fast) 136 del vars, 192 del conss, 0 add conss, 1 chg bounds, 8 chg sides, 2705 chg coeffs, 23 upgd conss, 0 impls, 2 clqs
0.78/0.80 c (round 12, exhaustive) 149 del vars, 192 del conss, 0 add conss, 1 chg bounds, 8 chg sides, 2705 chg coeffs, 23 upgd conss, 0 impls, 2 clqs
0.78/0.80 c (round 13, fast) 149 del vars, 207 del conss, 0 add conss, 1 chg bounds, 8 chg sides, 2882 chg coeffs, 23 upgd conss, 0 impls, 2 clqs
0.78/0.80 c (0.8s) running MILP presolver
0.78/0.80 c (0.8s) MILP presolver found nothing
0.78/0.80 c presolving (14 rounds: 14 fast, 6 medium, 6 exhaustive):
0.78/0.80 c 149 deleted vars, 207 deleted constraints, 0 added constraints, 1 tightened bounds, 0 added holes, 8 changed sides, 2882 changed coefficients
0.78/0.80 c 0 implications, 2 cliques
0.78/0.80 c presolved problem has 136 variables (136 bin, 0 int, 0 cont) and 253 constraints
0.78/0.80 c presolved problem has 0 implied integral variables (0 bin, 0 int, 0 cont)
0.78/0.80 c 11 constraints of type <knapsack>
0.78/0.80 c 2 constraints of type <linear>
0.78/0.80 c 240 constraints of type <logicor>
0.78/0.80 c transformed objective value is always integral (scale: 1)
0.78/0.80 c Presolving Time: 0.06
0.78/0.80 c transformed 1/10 original solutions to the transformed problem space
0.78/0.80 c
0.78/0.80 c time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl.
0.78/0.80 c 0.8s| 1 | 0 | 590 | - | 43M | 0 | 136 | 253 | 253 | 0 | 0 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%| unknown
0.78/0.80 c 0.8s| 1 | 0 | 590 | - | 43M | 0 | 136 | 253 | 234 | 0 | 0 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%| unknown
0.78/0.84 c 0.8s| 1 | 0 | 598 | - | 43M | 0 | 136 | 418 | 236 | 2 | 1 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%| unknown
0.78/0.85 c 0.9s| 1 | 0 | 619 | - | 43M | 0 | 136 | 417 | 238 | 4 | 2 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%| unknown
0.78/0.87 c 0.9s| 1 | 0 | 625 | - | 44M | 0 | 136 | 417 | 240 | 6 | 3 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%| unknown
0.88/0.90 c 0.9s| 1 | 0 | 647 | - | 44M | 0 | 136 | 417 | 241 | 7 | 4 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%| unknown
0.88/0.92 c 0.9s| 1 | 0 | 655 | - | 44M | 0 | 136 | 417 | 242 | 8 | 5 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%| unknown
0.88/0.94 c 0.9s| 1 | 0 | 664 | - | 44M | 0 | 136 | 417 | 243 | 9 | 6 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%| unknown
0.88/0.95 c 1.0s| 1 | 0 | 683 | - | 44M | 0 | 136 | 417 | 245 | 11 | 7 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%| unknown
0.88/0.97 c 1.0s| 1 | 0 | 695 | - | 44M | 0 | 136 | 417 | 248 | 14 | 8 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%| unknown
0.88/0.98 c 1.0s| 1 | 0 | 712 | - | 45M | 0 | 136 | 417 | 249 | 15 | 9 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%| unknown
0.88/1.00 c 1.0s| 1 | 0 | 746 | - | 46M | 0 | 136 | 417 | 251 | 17 | 10 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%| unknown
0.99/1.00 c 1.0s| 1 | 0 | 761 | - | 46M | 0 | 136 | 408 | 253 | 19 | 11 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%| unknown
0.99/1.01 c (run 2, node 1) restarting after 20 global fixings of integer variables
0.99/1.01 c
0.99/1.01 c (restart) converted 19 cuts from the global cut pool into linear constraints
0.99/1.01 c
0.99/1.01 c presolving:
0.99/1.02 c (round 1, fast) 20 del vars, 9 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 267 chg coeffs, 0 upgd conss, 0 impls, 3 clqs
0.99/1.02 c (round 2, exhaustive) 20 del vars, 12 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 267 chg coeffs, 0 upgd conss, 0 impls, 3 clqs
0.99/1.02 c (round 3, exhaustive) 20 del vars, 12 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 267 chg coeffs, 176 upgd conss, 0 impls, 3 clqs
0.99/1.02 c (round 4, exhaustive) 20 del vars, 44 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 270 chg coeffs, 176 upgd conss, 0 impls, 3 clqs
0.99/1.02 c (round 5, fast) 22 del vars, 47 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 270 chg coeffs, 176 upgd conss, 0 impls, 3 clqs
0.99/1.02 c (round 6, fast) 22 del vars, 47 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 272 chg coeffs, 176 upgd conss, 0 impls, 3 clqs
0.99/1.02 c (1.0s) running MILP presolver
0.99/1.02 c (1.0s) MILP presolver found nothing
0.99/1.02 c (round 7, exhaustive) 26 del vars, 47 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 272 chg coeffs, 176 upgd conss, 0 impls, 3 clqs
0.99/1.02 c (round 8, fast) 26 del vars, 209 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 280 chg coeffs, 176 upgd conss, 0 impls, 3 clqs
0.99/1.02 c (1.0s) running MILP presolver
0.99/1.02 c (1.0s) MILP presolver found nothing
0.99/1.02 c (round 9, exhaustive) 28 del vars, 209 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 280 chg coeffs, 176 upgd conss, 0 impls, 3 clqs
0.99/1.02 c (round 10, fast) 28 del vars, 213 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 285 chg coeffs, 176 upgd conss, 0 impls, 3 clqs
0.99/1.02 c presolving (11 rounds: 11 fast, 6 medium, 6 exhaustive):
0.99/1.02 c 28 deleted vars, 213 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 285 changed coefficients
0.99/1.02 c 0 implications, 3 cliques
0.99/1.02 c presolved problem has 108 variables (108 bin, 0 int, 0 cont) and 214 constraints
0.99/1.02 c presolved problem has 0 implied integral variables (0 bin, 0 int, 0 cont)
0.99/1.02 c 20 constraints of type <knapsack>
0.99/1.02 c 7 constraints of type <linear>
0.99/1.02 c 187 constraints of type <logicor>
0.99/1.02 c transformed objective value is always integral (scale: 1)
0.99/1.02 c Presolving Time: 0.07
0.99/1.02 c transformed 2/15 original solutions to the transformed problem space
0.99/1.02 c
0.99/1.03 c time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl.
0.99/1.03 c 1.0s| 1 | 0 | 908 | - | 46M | 0 | 108 | 214 | 212 | 0 | 0 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%| unknown
0.99/1.03 c 1.0s| 1 | 0 | 908 | - | 46M | 0 | 108 | 214 | 195 | 0 | 0 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%| unknown
0.99/1.04 c 1.0s| 1 | 0 | 933 | - | 46M | 0 | 108 | 214 | 198 | 3 | 1 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%| unknown
0.99/1.05 c 1.1s| 1 | 0 | 955 | - | 46M | 0 | 108 | 214 | 200 | 5 | 2 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%| unknown
0.99/1.05 o 25
0.99/1.05 c * 1.1s| 1 | 0 | 955 | - | LP | 0 | 108 | 214 | 200 | 5 | 3 | 0 | 0 | 2.500000e+01 | 2.500000e+01 | 0.00%| unknown
0.99/1.05 c
0.99/1.05 c SCIP Status : problem is solved [optimal solution found]
0.99/1.05 c Solving Time (sec) : 1.06
0.99/1.05 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
0.99/1.05 c Primal Bound : +2.50000000000000e+01 (18 solutions)
0.99/1.05 c Dual Bound : +2.50000000000000e+01
0.99/1.05 c Gap : 0.00 %
0.99/1.05 s OPTIMUM FOUND
0.99/1.05 v -x1 -x2 -x3 -x4 -x5 -x6 -x7 -x8 -x9 -x10 -x11 -x12 -x13 -x14 -x15 -x16 x17 -x18 -x19 -x20 -x21 -x22 -x23 -x24 -x25 -x26 -x27 -x28
0.99/1.05 v -x29 -x30 -x31 -x32 -x33 -x34 -x35 -x36 -x37 -x38 -x39 -x40 -x41 -x42 x43 -x44 -x45 -x46 -x47 -x48 -x49 -x50 -x51 -x52 x53 -x54
0.99/1.05 v -x55 -x56 -x57 -x58 -x59 -x60 -x61 -x62 -x63 -x64 -x65 -x66 -x67 -x68 -x69 -x70 -x71 -x72 -x73 -x74 -x75 -x76 -x77 -x78 -x79 -x80
0.99/1.05 v -x81 -x82 x83 -x84 -x85 -x86 -x87 -x88 -x89 -x90 -x91 -x92 -x93 -x94 -x95 -x96 -x97 -x98 -x99 -x100 -x101 -x102 x103 -x104 -x105
0.99/1.05 v -x106 -x107 -x108 -x109 -x110 -x111 -x112 -x113 -x114 -x115 -x116 -x117 -x118 -x119 x120 -x121 -x122 -x123 -x124 -x125 -x126 -x127
0.99/1.05 v -x128 -x129 -x130 -x131 -x132 -x133 -x134 -x135 -x136 -x137 -x138 -x139 -x140 -x141 -x142 -x143 -x144 -x145 -x146 -x147 -x148 -x149
0.99/1.05 v -x150 -x151 -x152 -x153 -x154 -x155 -x156 -x157 -x158 -x159 -x160 -x161 -x162 -x163 -x164 -x165 -x166 -x167 -x168 -x169 -x170 -x171
0.99/1.05 v x172 -x173 -x174 -x175 -x176 -x177 -x178 -x179 -x180 -x181 -x182 -x183 -x184 -x185 -x186 -x187 -x188 -x189 -x190 -x191 -x192 -x193
0.99/1.05 v x194 -x195 -x196 -x197 -x198 -x199 -x200 -x201 -x202 -x203 -x204 -x205 -x206 -x207 -x208 -x209 -x210 -x211 -x212 -x213 x214 -x215
0.99/1.05 v x216 -x217 -x218 -x219 -x220 -x221 -x222 -x223 -x224 -x225 -x226 -x227 -x228 -x229 -x230 -x231 x232 -x233 -x234 -x235 -x236 -x237
0.99/1.05 v -x238 -x239 -x240 -x241 -x242 -x243 -x244 -x245 -x246 -x247 -x248 -x249 -x250 -x251 -x252 -x253 -x254 -x255 -x256 -x257 -x258 -x259
0.99/1.05 v -x260 -x261 -x262 -x263 -x264 x265 -x266 -x267 -x268 -x269 -x270 -x271 -x272 -x273 -x274 -x275 -x276 -x277 -x278 -x279 -x280 -x281
0.99/1.05 v -x282 -x283 -x284 -x285 -x286 x287 -x288 -x289 -x290 -x291 -x292 -x293 -x294 x295 -x296 -x297 -x298 -x299 -x300 -x301 -x302 -x303
0.99/1.05 v -x304 -x305 -x306 -x307 -x308 -x309 -x310 -x311 -x312 -x313 x314 -x315 -x316 -x317 -x318 x319 x320 -x321 x322 -x323 -x324 -x325
0.99/1.05 v -x326 x327 -x328 -x329 x330 -x331 -x332 -x333 -x334 -x335 -x336 -x337 -x338 -x339 x340 -x341 -x342 -x343 -x344 -x345 -x346 -x347
0.99/1.05 v -x348 -x349 -x350 -x351 -x352 -x353 -x354 -x355 -x356 -x357 -x358 -x359 x360 -x361 -x362 -x363 -x364 x365 x366 -x367 -x368 -x369
0.99/1.05 v x370 -x371 -x372
0.99/1.05 c SCIP Status : problem is solved [optimal solution found]
0.99/1.05 c Total Time : 1.06
0.99/1.05 c solving : 1.06
0.99/1.05 c presolving : 0.07 (included in solving)
0.99/1.05 c reading : 0.00 (included in solving)
0.99/1.05 c copying : 0.01 (4 #copies) (minimal 0.00, maximal 0.00, average 0.00)
0.99/1.05 c Original Problem :
0.99/1.05 c Problem name : HOME/instance-4487631-1751317826.opb
0.99/1.05 c Variables : 372 (372 binary, 0 integer, 0 continuous)
0.99/1.05 c implied integral : 0 (0 binary, 0 integer, 0 continuous)
0.99/1.05 c Constraints : 772 initial, 772 maximal
0.99/1.05 c Objective : minimize, 372 non-zeros (abs.min = 1, abs.max = 1)
0.99/1.05 c Presolved Problem :
0.99/1.05 c Problem name : t_HOME/instance-4487631-1751317826.opb
0.99/1.05 c Variables : 108 (108 binary, 0 integer, 0 continuous)
0.99/1.05 c implied integral : 0 (0 binary, 0 integer, 0 continuous)
0.99/1.05 c Constraints : 214 initial, 214 maximal
0.99/1.05 c Objective : minimize, 107 non-zeros (abs.min = 1, abs.max = 1)
0.99/1.05 c Nonzeros : 2902 constraint, 6 clique table
0.99/1.05 c Presolvers : ExecTime SetupTime Calls FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.99/1.05 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c domcol : 0.00 0.00 9 99 0 0 0 0 0 0 0 0
0.99/1.05 c dualagg : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c dualcomp : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c dualinfer : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c dualsparsify : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.99/1.05 c gateextraction : 0.00 0.00 13 0 0 0 0 0 0 0 0 0
0.99/1.05 c implics : 0.00 0.00 24 0 0 0 0 0 0 0 0 0
0.99/1.05 c implint : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c milp : 0.01 0.00 7 0 0 0 0 0 0 0 0 0
0.99/1.05 c qpkktref : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c redvub : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c sparsify : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
0.99/1.05 c stuffing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c trivial : 0.00 0.00 43 138 0 0 0 0 0 0 0 0
0.99/1.05 c tworowbnd : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c dualfix : 0.00 0.00 43 3 0 0 0 0 0 0 0 0
0.99/1.05 c genvbounds : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c probing : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
0.99/1.05 c pseudoobj : 0.00 0.00 7 0 0 0 0 0 0 0 0 0
0.99/1.05 c symmetry : 0.00 0.00 1 0 0 0 0 0 0 2 0 0
0.99/1.05 c vbounds : 0.00 0.00 5 0 0 0 0 0 0 0 0 0
0.99/1.05 c knapsack : 0.00 0.00 40 0 0 0 0 0 0 0 0 0
0.99/1.05 c setppc : 0.00 0.00 51 0 2 0 0 0 5 0 0 0
0.99/1.05 c linear : 0.01 0.00 47 6 0 0 6 0 159 0 13 9
0.99/1.05 c logicor : 0.03 0.00 77 16 0 0 0 0 604 0 0 4880
0.99/1.05 c components : 0.00 0.00 3 0 0 0 0 0 0 0 0 0
0.99/1.05 c root node : - - - 154 - - 154 - - - - -
0.99/1.05 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoRelax #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Applied Conss Children
0.99/1.05 c integral : 0 0 0 0 0 0 0 64 0 0 0 0 0 0 0
0.99/1.05 c knapsack : 20 20 14 497 0 0 0 0 0 0 0 4 0 0 0
0.99/1.05 c linear : 7 7 15 488 0 0 0 3 0 0 0 10 0 0 0
0.99/1.05 c logicor : 187 187 26 348 0 0 0 52 0 0 0 1 0 0 0
0.99/1.05 c fixedvar : 0 0 0 0 0 0 0 23 0 0 0 0 0 0 0
0.99/1.05 c countsols : 0 0 0 0 0 0 0 23 0 0 0 0 0 0 0
0.99/1.05 c components : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS EnfoRelax Check ResProp SB-Prop
0.99/1.05 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.05 c knapsack : 0.03 0.00 0.02 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.05 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.05 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.05 c fixedvar : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.05 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.05 c components : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.05 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.99/1.05 c dualfix : 8 0 0 0
0.99/1.05 c genvbounds : 0 0 0 0
0.99/1.05 c nlobbt : 0 0 0 0
0.99/1.05 c obbt : 0 0 0 0
0.99/1.05 c probing : 0 0 0 0
0.99/1.05 c pseudoobj : 52 0 0 0
0.99/1.05 c redcost : 41 0 0 154
0.99/1.05 c rootredcost : 0 0 0 0
0.99/1.05 c symmetry : 0 0 0 0
0.99/1.05 c vbounds : 22 0 0 0
0.99/1.05 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp SB-Prop
0.99/1.05 c dualfix : 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.05 c genvbounds : 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.05 c nlobbt : 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.05 c obbt : 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.05 c probing : 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.05 c pseudoobj : 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.05 c redcost : 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.05 c rootredcost : 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.05 c symmetry : 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.05 c vbounds : 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.05 c Symmetry :
0.99/1.05 c #affected vars : 4 (4 bin, 0 int, 0 cont)
0.99/1.05 c orbitopal red. : 0 reductions applied, 0 cutoffs
0.99/1.05 c orbital reduction: 0 reductions applied, 0 cutoffs
0.99/1.05 c lexicographic red: 0 reductions applied, 0 cutoffs
0.99/1.05 c shadow tree time : 0.00 s
0.99/1.05 c Conflict Analysis : Time Calls Success DomReds Conflicts Literals Reconvs ReconvLits Dualrays Nonzeros LP Iters (pool size: [10000,10000])
0.99/1.05 c propagation : 0.00 0 0 - 0 0.0 0 0.0 - - -
0.99/1.05 c infeasible LP : 0.00 0 0 - 0 0.0 0 0.0 0 0.0 0
0.99/1.05 c bound exceed. LP : 0.00 0 0 - 0 0.0 0 0.0 0 0.0 0
0.99/1.05 c strong branching : 0.00 0 0 - 0 0.0 0 0.0 - - 0
0.99/1.05 c pseudo solution : 0.00 0 0 - 0 0.0 0 0.0 - - -
0.99/1.05 c applied globally : 0.00 - - 0 0 0.0 - - 0 - -
0.99/1.05 c applied locally : - - - 0 0 0.0 - - 0 - -
0.99/1.05 c Separators : ExecTime SetupTime Calls RootCalls Cutoffs DomReds FoundCuts ViaPoolAdd DirectAdd Applied ViaPoolApp DirectApp Conss
0.99/1.05 c cut pool : 0.01 - 49 49 - - 1774 2365 - - - - - (maximal pool size: 971)
0.99/1.05 c aggregation : 0.05 0.00 25 25 0 0 2 3 0 0 0 0 0
0.99/1.05 c > cmir : - - - - - - - 0 0 0 0 0 -
0.99/1.05 c > flowcover : - - - - - - - 0 0 0 0 0 -
0.99/1.05 c > knapsackcover : - - - - - - - 3 0 0 0 0 -
0.99/1.05 c cgmip : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c clique : 0.00 0.00 25 25 0 0 0 0 0 0 0 0 0
0.99/1.05 c closecuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c convexproj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c disjunctive : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c eccuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c gauge : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c gomory : 0.79 0.00 22 22 0 0 1732 2302 0 33 33 0 0
0.99/1.05 c > gomorymi : - - - - - - - 1159 0 17 17 0 -
0.99/1.05 c > strongcg : - - - - - - - 1143 0 16 16 0 -
0.99/1.05 c impliedbounds : 0.00 0.00 25 25 0 0 0 0 0 0 0 0 0
0.99/1.05 c interminor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c intobj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c lagromory : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c mcf : 0.00 0.00 3 3 0 0 0 0 0 0 0 0 0
0.99/1.05 c minor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c mixing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c multilinear : 0.00 0.00 26 26 0 0 0 0 0 0 0 0 0
0.99/1.05 c oddcycle : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.99/1.05 c rapidlearning : 0.02 0.00 1 1 0 0 0 0 0 0 0 0 165
0.99/1.05 c rlt : 0.00 0.00 23 23 0 0 0 0 0 0 0 0 0
0.99/1.05 c zerohalf : 0.01 0.00 25 25 0 0 40 60 0 26 26 0 0
0.99/1.05 c Cutselectors : ExecTime SetupTime Calls RootCalls Selected Forced Filtered RootSelec RootForc RootFilt
0.99/1.05 c hybrid : 0.00 0.00 26 26 59 0 2321 59 0 2321
0.99/1.05 c ensemble : 0.00 0.00 0 0 0 0 0 0 0 0
0.99/1.05 c dynamic : 0.00 0.00 0 0 0 0 0 0 0 0
0.99/1.05 c Pricers : ExecTime SetupTime Calls Vars
0.99/1.05 c problem variables: 0.00 - 0 0
0.99/1.05 c Branching Rules : ExecTime SetupTime BranchLP BranchExt BranchPS Cutoffs DomReds Cuts Conss Children
0.99/1.05 c allfullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
0.99/1.05 c cloud : 0.00 0.00 0 0 0 0 0 0 0 0
0.99/1.05 c distribution : 0.00 0.00 0 0 0 0 0 0 0 0
0.99/1.05 c fullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
0.99/1.05 c gomory : 0.00 0.00 0 0 0 0 0 0 0 0
0.99/1.05 c inference : 0.00 0.00 0 0 0 0 0 0 0 0
0.99/1.05 c leastinf : 0.00 0.00 0 0 0 0 0 0 0 0
0.99/1.05 c lookahead : 0.00 0.00 0 0 0 0 0 0 0 0
0.99/1.05 c mostinf : 0.00 0.00 0 0 0 0 0 0 0 0
0.99/1.05 c multaggr : 0.00 0.00 0 0 0 0 0 0 0 0
0.99/1.05 c nodereopt : 0.00 0.00 0 0 0 0 0 0 0 0
0.99/1.05 c pscost : 0.00 0.00 0 0 0 0 0 0 0 0
0.99/1.05 c random : 0.00 0.00 0 0 0 0 0 0 0 0
0.99/1.05 c relpscost : 0.00 0.00 0 0 0 0 0 0 0 0
0.99/1.05 c vanillafullstrong: 0.00 0.00 0 0 0 0 0 0 0 0
0.99/1.05 c Primal Heuristics : ExecTime SetupTime Calls Found Best
0.99/1.05 c LP solutions : 0.00 - - 1 1
0.99/1.05 c relax solutions : 0.00 - - 0 0
0.99/1.05 c pseudo solutions : 0.00 - - 0 0
0.99/1.05 c strong branching : 0.00 - - 0 0
0.99/1.05 c actconsdiving : 0.00 0.00 0 0 0
0.99/1.05 c adaptivediving : 0.00 0.00 0 0 0
0.99/1.05 c alns : 0.00 0.00 1 0 0
0.99/1.05 c bound : 0.00 0.00 0 0 0
0.99/1.05 c clique : 0.00 0.00 1 0 0
0.99/1.05 c coefdiving : 0.00 0.00 0 0 0
0.99/1.05 c completesol : 0.00 0.00 0 0 0
0.99/1.05 c conflictdiving : 0.00 0.00 0 0 0
0.99/1.05 c crossover : 0.00 0.00 0 0 0
0.99/1.05 c dins : 0.00 0.00 0 0 0
0.99/1.05 c distributiondivin: 0.00 0.00 0 0 0
0.99/1.05 c dks : 0.00 0.00 0 0 0
0.99/1.05 c dps : 0.00 0.00 0 0 0
0.99/1.05 c dualval : 0.00 0.00 0 0 0
0.99/1.05 c farkasdiving : 0.00 0.00 0 0 0
0.99/1.05 c feaspump : 0.00 0.00 1 1 1
0.99/1.05 c fixandinfer : 0.00 0.00 0 0 0
0.99/1.05 c fracdiving : 0.00 0.00 0 0 0
0.99/1.05 c gins : 0.00 0.00 0 0 0
0.99/1.05 c guideddiving : 0.00 0.00 0 0 0
0.99/1.05 c indicator : 0.00 0.00 0 0 0
0.99/1.05 c indicatordiving : 0.00 0.00 0 0 0
0.99/1.05 c intdiving : 0.00 0.00 0 0 0
0.99/1.05 c intshifting : 0.00 0.00 0 0 0
0.99/1.05 c linesearchdiving : 0.00 0.00 0 0 0
0.99/1.05 c localbranching : 0.00 0.00 0 0 0
0.99/1.05 c locks : 0.00 0.00 1 1 1
0.99/1.05 c lpface : 0.00 0.00 0 0 0
0.99/1.05 c mpec : 0.00 0.00 0 0 0
0.99/1.05 c multistart : 0.00 0.00 0 0 0
0.99/1.05 c mutation : 0.00 0.00 0 0 0
0.99/1.05 c nlpdiving : 0.00 0.00 0 0 0
0.99/1.05 c objpscostdiving : 0.00 0.00 0 0 0
0.99/1.05 c octane : 0.00 0.00 0 0 0
0.99/1.05 c ofins : 0.00 0.00 0 0 0
0.99/1.05 c oneopt : 0.00 0.00 2 2 2
0.99/1.05 c padm : 0.00 0.00 0 0 0
0.99/1.05 c proximity : 0.00 0.00 0 0 0
0.99/1.05 c pscostdiving : 0.00 0.00 0 0 0
0.99/1.05 c randrounding : 0.01 0.00 29 0 0
0.99/1.05 c rens : 0.01 0.00 2 2 0
0.99/1.05 c reoptsols : 0.00 0.00 0 0 0
0.99/1.05 c repair : 0.00 0.00 0 0 0
0.99/1.05 c rins : 0.00 0.00 0 0 0
0.99/1.05 c rootsoldiving : 0.00 0.00 0 0 0
0.99/1.05 c rounding : 0.00 0.00 29 0 0
0.99/1.05 c scheduler : 0.00 0.00 0 0 0
0.99/1.05 c shiftandpropagate: 0.00 0.00 0 0 0
0.99/1.05 c shifting : 0.00 0.00 29 0 0
0.99/1.05 c simplerounding : 0.00 0.00 30 0 0
0.99/1.05 c subnlp : 0.00 0.00 0 0 0
0.99/1.05 c trivial : 0.00 0.00 6 10 3
0.99/1.05 c trivialnegation : 0.00 0.00 0 0 0
0.99/1.05 c trustregion : 0.00 0.00 0 0 0
0.99/1.05 c trysol : 0.00 0.00 0 0 0
0.99/1.05 c twoopt : 0.00 0.00 0 0 0
0.99/1.05 c undercover : 0.00 0.00 0 0 0
0.99/1.05 c vbounds : 0.00 0.00 0 0 0
0.99/1.05 c veclendiving : 0.00 0.00 0 0 0
0.99/1.05 c zeroobj : 0.00 0.00 0 0 0
0.99/1.05 c zirounding : 0.00 0.00 2 0 0
0.99/1.05 c other solutions : - - - 0 -
0.99/1.05 c LNS (Scheduler) : Calls SetupTime SolveTime SolveNodes Sols Best Exp3 Exp3-IX EpsGreedy UCB TgtFixRate Opt Inf Node Stal Sol Usr Othr Actv
0.99/1.05 c rens : 0 0.00 0.00 0 0 0 0.00000 0.12500 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
0.99/1.05 c rins : 0 0.00 0.00 0 0 0 0.00000 0.12500 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
0.99/1.05 c mutation : 0 0.00 0.00 0 0 0 0.00000 0.12500 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
0.99/1.05 c localbranching : 0 0.00 0.00 0 0 0 0.00000 0.12500 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
0.99/1.05 c crossover : 0 0.00 0.00 0 0 0 0.00000 0.12500 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
0.99/1.05 c proximity : 0 0.00 0.00 0 0 0 0.00000 0.12500 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
0.99/1.05 c zeroobjective : 0 0.00 0.00 0 0 0 0.00000 0.12500 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
0.99/1.05 c dins : 0 0.00 0.00 0 0 0 0.00000 0.12500 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
0.99/1.05 c trustregion : 0 0.00 0.00 0 0 0 0.00000 0.00000 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 0
0.99/1.05 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It ItLimit
0.99/1.05 c primal LP : 0.00 1 0 0.00 - 0.00 1
0.99/1.05 c dual LP : 0.02 32 822 28.34 44096.35 0.00 3
0.99/1.05 c lex dual LP : 0.00 0 0 0.00 -
0.99/1.05 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.99/1.05 c resolve instable : 0.00 0 0 0.00 -
0.99/1.05 c diving/probing LP: 0.00 3 133 44.33 -
0.99/1.05 c strong branching : 0.00 0 0 0.00 - - - 0
0.99/1.05 c (at root node) : - 0 0 0.00 -
0.99/1.05 c conflict analysis: 0.00 0 0 0.00 -
0.99/1.05 c Relaxators : Time Calls Cutoffs ImprBounds ImprTime ReducedDom Separated AddedConss
0.99/1.05 c benders : 0.00 0 0 0 0.00 0 0 0
0.99/1.05 c B&B Tree :
0.99/1.05 c number of runs : 3
0.99/1.05 c nodes : 1 (0 internal, 1 leaves)
0.99/1.05 c feasible leaves : 0
0.99/1.05 c infeas. leaves : 0
0.99/1.05 c objective leaves : 0
0.99/1.05 c nodes (total) : 3 (0 internal, 3 leaves)
0.99/1.05 c nodes left : 0
0.99/1.05 c max depth : 0
0.99/1.05 c max depth (total): 0
0.99/1.05 c backtracks : 0 (0.0%)
0.99/1.05 c early backtracks : 0 (0.0%)
0.99/1.05 c nodes exc. ref. : 0 (0.0%)
0.99/1.05 c delayed cutoffs : 0
0.99/1.05 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.99/1.05 c avg switch length: 2.00
0.99/1.05 c switching time : 0.00
0.99/1.05 c Root Node :
0.99/1.05 c First LP value : +2.47500000000000e+01
0.99/1.05 c First LP Iters : 73 (85280.37 Iter/sec)
0.99/1.05 c First LP Time : 0.00
0.99/1.05 c Final Dual Bound : +2.50000000000000e+01
0.99/1.05 c Final Root Iters : 836
0.99/1.05 c Root LP Estimate : +2.50000000000000e+01
0.99/1.05 c Solution :
0.99/1.05 c Solutions found : 18 (8 improvements)
0.99/1.05 c First Solution : +3.72000000000000e+02 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.99/1.05 c Gap First Sol. : infinite
0.99/1.05 c Gap Last Sol. : 0.00 %
0.99/1.05 c Primal Bound : +2.50000000000000e+01 (in run 3, after 1 nodes, 1.06 seconds, depth 0, found by <relaxation>)
0.99/1.05 c Dual Bound : +2.50000000000000e+01
0.99/1.05 c Gap : 0.00 %
0.99/1.05 c Integrals : Total Avg%
0.99/1.05 c primal-dual : 20.56 19.48
0.99/1.05 c primal-ref : - - (not evaluated)
0.99/1.05 c dual-ref : - - (not evaluated)
0.99/1.06 c Time complete (sec): 1.055