0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: a3bf3a4-dirty]
0.00/0.00 c Copyright (c) 2002-2012 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-3717379-1338201304.wbo>
0.00/0.00 c original problem has 279 variables (279 bin, 0 int, 0 impl, 0 cont) and 128 constraints
0.00/0.00 c problem read in 0.00
0.00/0.00 o 6296
0.00/0.00 c feasible solution found by trivial heuristic, objective value 6.296000e+03
0.00/0.00 c presolving:
0.00/0.01 c (round 1) 0 del vars, 1 del conss, 0 add conss, 0 chg bounds, 27 chg sides, 54 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.01 c (round 2) 0 del vars, 1 del conss, 0 add conss, 127 chg bounds, 27 chg sides, 54 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.01 c (0.0s) probing: 51/279 (18.3%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.01 c (0.0s) probing aborted: 50/50 successive totally useless probings
0.00/0.01 c presolving (3 rounds):
0.00/0.01 c 0 deleted vars, 1 deleted constraints, 0 added constraints, 127 tightened bounds, 0 added holes, 27 changed sides, 54 changed coefficients
0.00/0.01 c 127 implications, 0 cliques
0.00/0.01 c presolved problem has 406 variables (279 bin, 0 int, 127 impl, 0 cont) and 254 constraints
0.00/0.01 c 127 constraints of type <linear>
0.00/0.01 c 127 constraints of type <indicator>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.01
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 2.1.1.4
0.00/0.01 c
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = 1797
0.00/0.01 c
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = 13950
0.00/0.01 c
0.00/0.01 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01 c # [type: int, range: [1,2], default: 1]
0.00/0.01 c timing/clocktype = 2
0.00/0.01 c
0.00/0.01 c # belongs reading time to solving time?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c timing/reading = TRUE
0.00/0.01 c
0.00/0.01 c # force restart if we have a max FS instance and gap is 1?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/indicator/forcerestart = TRUE
0.00/0.01 c
0.00/0.01 c # priority of branching rule <inference>
0.00/0.01 c # [type: int, range: [-536870912,536870911], default: 1000]
0.00/0.01 c branching/inference/priority = 1000000
0.00/0.01 c
0.00/0.01 c # frequency offset for calling primal heuristic <coefdiving>
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1]
0.00/0.01 c heuristics/coefdiving/freqofs = 0
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/shiftandpropagate/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/undercover/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/rapidlearning/freq = 0
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <indrounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c heuristics/indrounding/freq = 1
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.01 o 1312
0.00/0.01 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.01 c 6 0.0s| 1 | 0 | 0 | - |1147k| 0 | - | 406 | 254 | 0 | 0 | 0 | 0 | 0 | -- | 1.312000e+03 | Inf
0.00/0.01 o 249
0.00/0.01 c 6 0.0s| 1 | 0 | 0 | - |1154k| 0 | - | 406 | 254 | 0 | 0 | 0 | 0 | 0 | -- | 2.490000e+02 | Inf
0.00/0.02 c 0.0s| 1 | 0 | 83 | - |1444k| 0 | 2 | 406 | 254 | 406 | 254 | 0 | 0 | 0 | 0.000000e+00 | 2.490000e+02 | Inf
0.00/0.02 o 56
0.00/0.02 c s 0.0s| 1 | 0 | 83 | - |1458k| 0 | 2 | 406 | 254 | 406 | 254 | 0 | 0 | 0 | 0.000000e+00 | 5.600000e+01 | Inf
0.09/0.15 c 0.2s| 1 | 0 | 111 | - |1462k| 0 | 11 | 406 | 254 | 406 | 258 | 4 | 0 | 0 | 0.000000e+00 | 5.600000e+01 | Inf
0.09/0.15 c 0.2s| 1 | 0 | 111 | - |1446k| 0 | 11 | 406 | 254 | 406 | 258 | 4 | 0 | 0 | 0.000000e+00 | 5.600000e+01 | Inf
0.09/0.16 c 0.2s| 1 | 0 | 139 | - |1467k| 0 | 22 | 406 | 254 | 406 | 275 | 21 | 0 | 0 | 0.000000e+00 | 5.600000e+01 | Inf
0.09/0.17 c 0.2s| 1 | 0 | 174 | - |1514k| 0 | 30 | 406 | 254 | 406 | 291 | 37 | 0 | 0 | 0.000000e+00 | 5.600000e+01 | Inf
0.09/0.18 c 0.2s| 1 | 0 | 207 | - |1543k| 0 | 38 | 406 | 254 | 406 | 304 | 50 | 0 | 0 | 0.000000e+00 | 5.600000e+01 | Inf
0.18/0.20 c 0.2s| 1 | 0 | 296 | - |1585k| 0 | 40 | 406 | 254 | 406 | 318 | 64 | 0 | 0 | 0.000000e+00 | 5.600000e+01 | Inf
0.18/0.21 c 0.2s| 1 | 0 | 339 | - |1607k| 0 | 45 | 406 | 254 | 406 | 328 | 74 | 0 | 0 | 0.000000e+00 | 5.600000e+01 | Inf
0.18/0.28 c 0.3s| 1 | 2 | 1522 | - |1691k| 0 | 45 | 406 | 262 | 406 | 328 | 74 | 8 | 0 | 0.000000e+00 | 5.600000e+01 | Inf
0.18/0.28 c (run 1, node 1) restarting after 54 global fixings of integer variables
0.18/0.28 c
0.18/0.28 c (restart) converted 163 cuts from the global cut pool into linear constraints
0.18/0.28 c
0.29/0.40 c presolving:
0.29/0.40 c (round 1) 108 del vars, 108 del conss, 0 add conss, 54 chg bounds, 2 chg sides, 2 chg coeffs, 0 upgd conss, 127 impls, 0 clqs
0.29/0.40 c (round 2) 109 del vars, 109 del conss, 0 add conss, 55 chg bounds, 2 chg sides, 2 chg coeffs, 0 upgd conss, 213 impls, 0 clqs
0.29/0.40 c (round 3) 110 del vars, 111 del conss, 0 add conss, 56 chg bounds, 2 chg sides, 2 chg coeffs, 0 upgd conss, 216 impls, 0 clqs
0.29/0.40 c (round 4) 114 del vars, 116 del conss, 0 add conss, 58 chg bounds, 2 chg sides, 2 chg coeffs, 0 upgd conss, 216 impls, 0 clqs
0.29/0.40 c (round 5) 115 del vars, 119 del conss, 0 add conss, 59 chg bounds, 2 chg sides, 2 chg coeffs, 0 upgd conss, 225 impls, 0 clqs
0.29/0.40 c (round 6) 118 del vars, 123 del conss, 0 add conss, 60 chg bounds, 2 chg sides, 2 chg coeffs, 0 upgd conss, 228 impls, 0 clqs
0.29/0.40 c (round 7) 120 del vars, 126 del conss, 0 add conss, 60 chg bounds, 2 chg sides, 2 chg coeffs, 0 upgd conss, 231 impls, 0 clqs
0.29/0.40 c (round 8) 122 del vars, 128 del conss, 0 add conss, 60 chg bounds, 2 chg sides, 2 chg coeffs, 0 upgd conss, 231 impls, 0 clqs
0.29/0.40 c (round 9) 122 del vars, 128 del conss, 0 add conss, 60 chg bounds, 2 chg sides, 2 chg coeffs, 126 upgd conss, 231 impls, 0 clqs
0.29/0.40 c (round 10) 122 del vars, 130 del conss, 6 add conss, 60 chg bounds, 14 chg sides, 50 chg coeffs, 126 upgd conss, 239 impls, 0 clqs
0.29/0.40 c (round 11) 122 del vars, 136 del conss, 8 add conss, 60 chg bounds, 14 chg sides, 50 chg coeffs, 126 upgd conss, 239 impls, 0 clqs
0.29/0.40 c presolving (12 rounds):
0.29/0.40 c 122 deleted vars, 136 deleted constraints, 8 added constraints, 60 tightened bounds, 0 added holes, 14 changed sides, 50 changed coefficients
0.29/0.40 c 239 implications, 0 cliques
0.29/0.40 c presolved problem has 284 variables (215 bin, 0 int, 69 impl, 0 cont) and 297 constraints
0.29/0.40 c 69 constraints of type <varbound>
0.29/0.40 c 26 constraints of type <knapsack>
0.29/0.40 c 18 constraints of type <setppc>
0.29/0.40 c 2 constraints of type <and>
0.29/0.40 c 94 constraints of type <linear>
0.29/0.40 c 69 constraints of type <indicator>
0.29/0.40 c 12 constraints of type <logicor>
0.29/0.40 c 7 constraints of type <bounddisjunction>
0.29/0.40 c transformed objective value is always integral (scale: 1)
0.29/0.40 c Presolving Time: 0.02
0.29/0.40 c
0.29/0.40 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.40 c 0.3s| 1 | 0 | 1620 | - |1717k| 0 | 13 | 284 | 297 | 284 | 291 | 0 | 8 | 0 | 0.000000e+00 | 5.600000e+01 | Inf
0.29/0.40 c 0.3s| 1 | 0 | 1664 | - |1730k| 0 | 27 | 284 | 297 | 284 | 294 | 3 | 8 | 0 | 0.000000e+00 | 5.600000e+01 | Inf
0.29/0.40 c 0.3s| 1 | 2 | 1664 | - |1738k| 0 | 27 | 284 | 297 | 284 | 294 | 3 | 8 | 0 | 0.000000e+00 | 5.600000e+01 | Inf
0.29/0.40 o 52
0.29/0.40 c c 0.3s| 11 | 12 | 1949 | 133.5 |1807k| 10 | - | 284 | 297 | 284 | 224 | 4 | 8 | 0 | 0.000000e+00 | 5.200000e+01 | Inf
0.29/0.40 o 29
0.29/0.40 c 6 0.3s| 12 | 11 | 1949 | 122.3 |1801k| 11 | - | 284 | 297 | 0 | 0 | 4 | 8 | 0 | 0.000000e+00 | 2.900000e+01 | Inf
0.29/0.40 o 19
0.29/0.40 c 6 0.3s| 12 | 11 | 1984 | 125.2 |1800k| 11 | 15 | 284 | 297 | 284 | 224 | 4 | 8 | 0 | 0.000000e+00 | 1.900000e+01 | Inf
0.29/0.40 o 17
0.29/0.40 c p 0.3s| 15 | 12 | 2071 | 106.0 |1780k| 13 | - | 284 | 181 | 284 | 224 | 4 | 8 | 0 | 0.000000e+00 | 1.700000e+01 | Inf
0.29/0.40 o 9
0.29/0.40 c c 0.3s| 21 | 18 | 2206 | 82.1 |1789k| 13 | - | 284 | 133 | 284 | 223 | 4 | 9 | 0 | 0.000000e+00 | 9.000000e+00 | Inf
0.29/0.40 o 3
0.29/0.40 c c 0.4s| 26 | 19 | 2319 | 70.7 |1795k| 13 | - | 284 | 119 | 284 | 223 | 4 | 15 | 0 | 0.000000e+00 | 3.000000e+00 | Inf
0.29/0.40 c Forcing restart, since 63 binary variables among 69 have been fixed.
0.29/0.40 c (run 2, node 27) performing user restart
0.29/0.40 c
0.29/0.40 c (restart) converted 71 cuts from the global cut pool into linear constraints
0.29/0.40 c
0.29/0.40 c presolving:
0.29/0.40 c (round 1) 171 del vars, 94 del conss, 6 add conss, 11 chg bounds, 14 chg sides, 28 chg coeffs, 0 upgd conss, 281 impls, 0 clqs
0.29/0.40 c (round 2) 176 del vars, 105 del conss, 9 add conss, 12 chg bounds, 18 chg sides, 39 chg coeffs, 0 upgd conss, 309 impls, 0 clqs
0.29/0.40 c (round 3) 179 del vars, 112 del conss, 14 add conss, 12 chg bounds, 23 chg sides, 51 chg coeffs, 0 upgd conss, 319 impls, 0 clqs
0.29/0.40 c (round 4) 180 del vars, 118 del conss, 16 add conss, 12 chg bounds, 25 chg sides, 55 chg coeffs, 33 upgd conss, 321 impls, 0 clqs
0.29/0.40 c (round 5) 196 del vars, 127 del conss, 30 add conss, 12 chg bounds, 41 chg sides, 85 chg coeffs, 33 upgd conss, 364 impls, 0 clqs
0.29/0.40 c (round 6) 204 del vars, 142 del conss, 44 add conss, 12 chg bounds, 54 chg sides, 111 chg coeffs, 41 upgd conss, 384 impls, 0 clqs
0.29/0.40 c (round 7) 209 del vars, 158 del conss, 59 add conss, 12 chg bounds, 67 chg sides, 136 chg coeffs, 42 upgd conss, 396 impls, 0 clqs
0.29/0.40 c (round 8) 214 del vars, 174 del conss, 72 add conss, 12 chg bounds, 78 chg sides, 158 chg coeffs, 42 upgd conss, 412 impls, 0 clqs
0.29/0.40 c (round 9) 218 del vars, 190 del conss, 80 add conss, 12 chg bounds, 84 chg sides, 170 chg coeffs, 43 upgd conss, 420 impls, 0 clqs
0.29/0.40 c (round 10) 222 del vars, 201 del conss, 92 add conss, 12 chg bounds, 103 chg sides, 199 chg coeffs, 44 upgd conss, 434 impls, 0 clqs
0.29/0.40 c (round 11) 224 del vars, 214 del conss, 98 add conss, 12 chg bounds, 112 chg sides, 212 chg coeffs, 45 upgd conss, 438 impls, 0 clqs
0.29/0.40 c (round 12) 226 del vars, 226 del conss, 110 add conss, 12 chg bounds, 123 chg sides, 229 chg coeffs, 45 upgd conss, 444 impls, 0 clqs
0.29/0.40 c (round 13) 227 del vars, 238 del conss, 112 add conss, 12 chg bounds, 124 chg sides, 231 chg coeffs, 45 upgd conss, 446 impls, 0 clqs
0.29/0.40 c (round 14) 227 del vars, 246 del conss, 112 add conss, 12 chg bounds, 124 chg sides, 231 chg coeffs, 45 upgd conss, 446 impls, 0 clqs
0.29/0.40 c (round 15) 227 del vars, 250 del conss, 112 add conss, 12 chg bounds, 124 chg sides, 231 chg coeffs, 45 upgd conss, 446 impls, 0 clqs
0.29/0.40 c (round 16) 227 del vars, 250 del conss, 112 add conss, 15 chg bounds, 124 chg sides, 231 chg coeffs, 45 upgd conss, 446 impls, 0 clqs
0.29/0.40 c (round 17) 235 del vars, 260 del conss, 112 add conss, 20 chg bounds, 124 chg sides, 231 chg coeffs, 45 upgd conss, 446 impls, 0 clqs
0.29/0.40 c (round 18) 239 del vars, 267 del conss, 113 add conss, 20 chg bounds, 125 chg sides, 233 chg coeffs, 46 upgd conss, 450 impls, 0 clqs
0.29/0.40 c (round 19) 242 del vars, 277 del conss, 126 add conss, 20 chg bounds, 135 chg sides, 253 chg coeffs, 46 upgd conss, 478 impls, 0 clqs
0.29/0.40 c (round 20) 245 del vars, 286 del conss, 137 add conss, 20 chg bounds, 145 chg sides, 273 chg coeffs, 46 upgd conss, 496 impls, 0 clqs
0.29/0.40 c (round 21) 248 del vars, 297 del conss, 142 add conss, 20 chg bounds, 150 chg sides, 283 chg coeffs, 46 upgd conss, 504 impls, 0 clqs
0.29/0.40 c (round 22) 251 del vars, 304 del conss, 149 add conss, 20 chg bounds, 156 chg sides, 295 chg coeffs, 46 upgd conss, 516 impls, 0 clqs
0.29/0.40 c (round 23) 253 del vars, 310 del conss, 154 add conss, 20 chg bounds, 165 chg sides, 309 chg coeffs, 47 upgd conss, 526 impls, 0 clqs
0.29/0.40 c (round 24) 255 del vars, 318 del conss, 160 add conss, 20 chg bounds, 175 chg sides, 325 chg coeffs, 47 upgd conss, 544 impls, 0 clqs
0.29/0.40 c (round 25) 257 del vars, 326 del conss, 168 add conss, 20 chg bounds, 179 chg sides, 333 chg coeffs, 47 upgd conss, 550 impls, 0 clqs
0.29/0.40 c (round 26) 259 del vars, 335 del conss, 174 add conss, 20 chg bounds, 186 chg sides, 343 chg coeffs, 48 upgd conss, 556 impls, 0 clqs
0.29/0.40 c (round 27) 259 del vars, 347 del conss, 174 add conss, 20 chg bounds, 186 chg sides, 343 chg coeffs, 48 upgd conss, 556 impls, 0 clqs
0.29/0.40 c presolving (28 rounds):
0.29/0.40 c 259 deleted vars, 347 deleted constraints, 174 added constraints, 20 tightened bounds, 0 added holes, 186 changed sides, 343 changed coefficients
0.29/0.40 c 556 implications, 0 cliques
0.29/0.40 c presolved problem has 25 variables (25 bin, 0 int, 0 impl, 0 cont) and 17 constraints
0.29/0.40 c 14 constraints of type <knapsack>
0.29/0.40 c 1 constraints of type <setppc>
0.29/0.40 c 1 constraints of type <logicor>
0.29/0.40 c 1 constraints of type <bounddisjunction>
0.29/0.40 c transformed objective value is always integral (scale: 1)
0.29/0.40 c Presolving Time: 0.05
0.29/0.40 c
0.29/0.40 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.40 c 0.4s| 1 | 0 | 2351 | - |1413k| 0 | 6 | 25 | 17 | 25 | 15 | 0 | 16 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.29/0.40 c 0.4s| 1 | 0 | 2359 | - |1425k| 0 | 7 | 25 | 17 | 25 | 17 | 6 | 16 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.29/0.40 o 2
0.29/0.40 c c 0.4s| 1 | 0 | 2378 | - |1433k| 0 | - | 25 | 17 | 25 | 17 | 6 | 16 | 0 | 2.000000e+00 | 2.000000e+00 | 0.00%
0.29/0.40 c
0.29/0.40 c SCIP Status : problem is solved [optimal solution found]
0.29/0.40 c Solving Time (sec) : 0.39
0.29/0.40 c Solving Nodes : 1 (total of 29 nodes in 3 runs)
0.29/0.40 c Primal Bound : +2.00000000000000e+00 (22 solutions)
0.29/0.40 c Dual Bound : +2.00000000000000e+00
0.29/0.40 c Gap : 0.00 %
0.29/0.40 s OPTIMUM FOUND
0.29/0.40 v -x152 x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 x134 -x133 -x132 -x131
0.29/0.40 v -x130 -x129 -x128 -x127 -x126 x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 x116 -x115 x114 -x113 -x112 -x111 -x110
0.29/0.40 v -x109 x108 -x107 x106 x105 -x104 -x103 -x102 -x101 x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 x86
0.29/0.40 v -x85 x84 -x83 -x82 -x81 -x80 -x79 -x78 x77 -x76 x75 -x74 -x73 -x72 -x71 -x70 -x69 x68 -x67 x66 -x65 -x64 -x63 -x62 -x61 -x60
0.29/0.40 v x59 -x58 x57 -x56 -x55 -x54 -x53 -x52 x51 x50 x49 x48 x47 x46 x45 x44 x43 x42 x41 x40 x39 x38 x37 x36 x35 x34 x33 x32 -x31 -x30
0.29/0.40 v x29 x28 x27 x26 x25 x24 x23 x22 x21 x20 x19 x18 x17 x16 x15 x14 x13 x12 x11 -x10 x9 x8 x7 x6 x5 x4 x3 x2 x1
0.29/0.40 c SCIP Status : problem is solved [optimal solution found]
0.29/0.40 c Total Time : 0.39
0.29/0.40 c solving : 0.39
0.29/0.40 c presolving : 0.05 (included in solving)
0.29/0.40 c reading : 0.00 (included in solving)
0.29/0.40 c copying : 0.01 (2 #copies) (minimal 0.01, maximal 0.01, average 0.01)
0.29/0.40 c Original Problem :
0.29/0.40 c Problem name : HOME/instance-3717379-1338201304.wbo
0.29/0.40 c Variables : 279 (279 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.40 c Constraints : 128 initial, 128 maximal
0.29/0.40 c Objective sense : minimize
0.29/0.40 c Presolved Problem :
0.29/0.40 c Problem name : t_HOME/instance-3717379-1338201304.wbo
0.29/0.40 c Variables : 25 (25 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.40 c Constraints : 17 initial, 17 maximal
0.29/0.40 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.29/0.40 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.40 c trivial : 0.00 0.00 216 0 0 0 0 0 0 0 0
0.29/0.40 c dualfix : 0.00 0.00 16 0 0 0 0 0 0 0 0
0.29/0.40 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.40 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.40 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.40 c gateextraction : 0.00 0.00 0 0 0 0 0 6 2 0 0
0.29/0.40 c implics : 0.00 0.00 0 48 0 0 0 0 0 0 0
0.29/0.40 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.40 c pseudoobj : 0.00 0.00 0 0 0 3 0 0 0 0 0
0.29/0.40 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.40 c varbound : 0.00 0.00 0 0 0 10 0 14 0 0 0
0.29/0.40 c knapsack : 0.01 0.00 0 0 0 0 0 40 180 196 378
0.29/0.40 c setppc : 0.00 0.00 6 0 0 0 0 186 0 0 0
0.29/0.40 c and : 0.00 0.00 2 0 0 0 0 0 0 0 0
0.29/0.40 c linear : 0.01 0.00 76 12 0 193 0 154 0 31 69
0.29/0.40 c indicator : 0.00 0.00 4 0 0 0 0 69 0 0 0
0.29/0.40 c logicor : 0.01 0.00 1 0 0 0 0 7 0 0 0
0.29/0.40 c bounddisjunction : 0.00 0.00 0 0 0 1 0 8 0 0 0
0.29/0.40 c root node : - - 214 - - 214 - - - - -
0.29/0.40 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.29/0.40 c integral : 0 0 0 0 28 0 204 0 0 0 0 0 56
0.29/0.40 c knapsack : 14 14 2 254 0 0 158 17 3 39 16 0 0
0.29/0.40 c setppc : 1 1 2 182 0 0 34 1 0 34 0 0 0
0.29/0.40 c logicor : 1 1 2 54 0 0 15 0 0 3 0 0 0
0.29/0.40 c bounddisjunction : 1 1 0 36 0 0 0 3 0 1 0 0 0
0.29/0.40 c countsols : 0 0 0 0 0 0 56 0 0 0 0 0 0
0.29/0.40 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.29/0.40 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.40 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.40 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.40 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.40 c bounddisjunction : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.40 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.40 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.29/0.40 c rootredcost : 5 0 0 54
0.29/0.40 c pseudoobj : 319 6 0 35
0.29/0.40 c vbounds : 32 7 0 26
0.29/0.40 c redcost : 41 0 0 83
0.29/0.40 c probing : 0 0 0 0
0.29/0.40 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.29/0.40 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.29/0.40 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.29/0.40 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.29/0.40 c redcost : 0.00 0.00 0.00 0.00 0.00
0.29/0.40 c probing : 0.00 0.00 0.00 0.00 0.00
0.29/0.40 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.29/0.40 c propagation : 0.00 7 7 22 15.5 0 0.0 -
0.29/0.40 c infeasible LP : 0.00 2 2 3 1.7 1 8.0 0
0.29/0.40 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.40 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.40 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.29/0.40 c applied globally : - - - 16 13.5 - - -
0.29/0.40 c applied locally : - - - 0 0.0 - - -
0.29/0.40 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.29/0.40 c cut pool : 0.00 0 - - 0 - (maximal pool size: 14)
0.29/0.40 c closecuts : 0.00 0.00 0 0 0 0 0
0.29/0.40 c impliedbounds : 0.00 0.00 8 0 0 0 0
0.29/0.40 c intobj : 0.00 0.00 0 0 0 0 0
0.29/0.40 c gomory : 0.01 0.00 8 0 0 5 0
0.29/0.40 c cgmip : 0.00 0.00 0 0 0 0 0
0.29/0.40 c strongcg : 0.01 0.00 8 0 0 4 0
0.29/0.40 c cmir : 0.02 0.00 8 0 0 54 0
0.29/0.40 c flowcover : 0.02 0.00 8 0 0 135 0
0.29/0.40 c clique : 0.00 0.00 3 0 0 0 0
0.29/0.40 c zerohalf : 0.00 0.00 0 0 0 0 0
0.29/0.40 c mcf : 0.00 0.00 3 0 0 0 0
0.29/0.40 c oddcycle : 0.00 0.00 0 0 0 0 0
0.29/0.40 c rapidlearning : 0.13 0.00 1 0 0 0 0
0.29/0.40 c Pricers : ExecTime SetupTime Calls Vars
0.29/0.40 c problem variables: 0.00 - 0 0
0.29/0.40 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.29/0.40 c inference : 0.00 0.00 28 0 0 0 0 56
0.29/0.40 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.29/0.40 c pscost : 0.00 0.00 0 0 0 0 0 0
0.29/0.40 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.29/0.40 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.29/0.40 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.29/0.40 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.29/0.40 c random : 0.00 0.00 0 0 0 0 0 0
0.29/0.40 c Primal Heuristics : ExecTime SetupTime Calls Found
0.29/0.40 c LP solutions : 0.00 - - 0
0.29/0.40 c pseudo solutions : 0.00 - - 0
0.29/0.40 c oneopt : 0.00 0.00 5 0
0.29/0.40 c smallcard : 0.00 0.00 0 0
0.29/0.40 c trivial : 0.00 0.00 2 1
0.29/0.40 c shiftandpropagate: 0.00 0.00 0 0
0.29/0.40 c simplerounding : 0.00 0.00 37 0
0.29/0.40 c zirounding : 0.00 0.00 27 0
0.29/0.40 c rounding : 0.00 0.00 37 0
0.29/0.40 c shifting : 0.00 0.00 15 10
0.29/0.40 c intshifting : 0.00 0.00 0 0
0.29/0.40 c twoopt : 0.00 0.00 0 0
0.29/0.40 c indtwoopt : 0.00 0.00 0 0
0.29/0.40 c indoneopt : 0.01 0.00 9 4
0.29/0.40 c fixandinfer : 0.00 0.00 0 0
0.29/0.40 c feaspump : 0.00 0.00 0 0
0.29/0.40 c clique : 0.00 0.00 0 0
0.29/0.40 c indrounding : 0.00 0.00 27 0
0.29/0.40 c indcoefdiving : 0.00 0.00 0 0
0.29/0.40 c coefdiving : 0.06 0.00 5 4
0.29/0.40 c pscostdiving : 0.00 0.00 1 1
0.29/0.40 c nlpdiving : 0.00 0.00 0 0
0.29/0.40 c fracdiving : 0.00 0.00 1 0
0.29/0.40 c veclendiving : 0.00 0.00 0 0
0.29/0.40 c intdiving : 0.00 0.00 0 0
0.29/0.40 c actconsdiving : 0.00 0.00 0 0
0.29/0.40 c objpscostdiving : 0.00 0.00 0 0
0.29/0.40 c rootsoldiving : 0.00 0.00 0 0
0.29/0.40 c linesearchdiving : 0.00 0.00 0 0
0.29/0.40 c guideddiving : 0.00 0.00 0 0
0.29/0.40 c octane : 0.00 0.00 0 0
0.29/0.40 c rens : 0.02 0.00 1 0
0.29/0.40 c rins : 0.00 0.00 0 0
0.29/0.40 c localbranching : 0.00 0.00 0 0
0.29/0.40 c mutation : 0.00 0.00 0 0
0.29/0.40 c crossover : 0.00 0.00 0 0
0.29/0.40 c dins : 0.00 0.00 0 0
0.29/0.40 c vbounds : 0.00 0.00 0 0
0.29/0.40 c undercover : 0.00 0.00 0 0
0.29/0.40 c subnlp : 0.00 0.00 0 0
0.29/0.40 c trysol : 0.00 0.00 2 2
0.29/0.40 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.29/0.40 c primal LP : 0.00 2 0 0.00 - 0.00 2
0.29/0.40 c dual LP : 0.02 42 850 22.37 36299.97 0.00 4
0.29/0.40 c lex dual LP : 0.00 0 0 0.00 -
0.29/0.40 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.29/0.40 c diving/probing LP: 0.06 115 1528 13.29 27613.13
0.29/0.40 c strong branching : 0.00 0 0 0.00 -
0.29/0.40 c (at root node) : - 0 0 0.00 -
0.29/0.40 c conflict analysis: 0.00 0 0 0.00 -
0.29/0.40 c B&B Tree :
0.29/0.40 c number of runs : 3
0.29/0.40 c nodes : 1
0.29/0.40 c nodes (total) : 29
0.29/0.40 c nodes left : 0
0.29/0.40 c max depth : 0
0.29/0.40 c max depth (total): 13
0.29/0.40 c backtracks : 0 (0.0%)
0.29/0.40 c delayed cutoffs : 0
0.29/0.40 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.29/0.40 c avg switch length: 2.00
0.29/0.40 c switching time : 0.00
0.29/0.40 c Solution :
0.29/0.40 c Solutions found : 22 (11 improvements)
0.29/0.40 c First Solution : +6.29600000000000e+03 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.29/0.40 c Primal Bound : +2.00000000000000e+00 (in run 3, after 1 nodes, 0.39 seconds, depth 14, found by <coefdiving>)
0.29/0.40 c Dual Bound : +2.00000000000000e+00
0.29/0.40 c Gap : 0.00 %
0.29/0.40 c Root Dual Bound : +2.00000000000000e+00
0.29/0.40 c Root Iterations : 498
0.29/0.40 c Time complete: 0.39.