0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
0.00/0.00 c Copyright (c) 2002-2010 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-2704538-1278561444.opb>
0.02/0.03 c original problem has 363 variables (363 bin, 0 int, 0 impl, 0 cont) and 78 constraints
0.02/0.03 c problem read
0.02/0.03 c presolving settings loaded
0.02/0.04 o 363
0.02/0.04 c feasible solution found by trivial heuristic, objective value 3.630000e+02
0.02/0.04 c presolving:
0.02/0.05 c (round 1) 1 del vars, 12 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.02/0.05 c (round 2) 1 del vars, 32 del conss, 1 chg bounds, 20 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.02/0.06 c (round 3) 1 del vars, 32 del conss, 1 chg bounds, 20 chg sides, 0 chg coeffs, 46 upgd conss, 0 impls, 0 clqs
0.02/0.06 c (0.0s) probing: 101/362 (27.9%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.02/0.06 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.02/0.06 c presolving (4 rounds):
0.02/0.06 c 1 deleted vars, 32 deleted constraints, 1 tightened bounds, 0 added holes, 20 changed sides, 0 changed coefficients
0.02/0.06 c 0 implications, 0 cliques
0.02/0.06 c presolved problem has 362 variables (362 bin, 0 int, 0 impl, 0 cont) and 46 constraints
0.02/0.06 c 46 constraints of type <logicor>
0.02/0.06 c transformed objective value is always integral (scale: 1)
0.02/0.06 c Presolving Time: 0.02
0.02/0.06 c - non default parameters ----------------------------------------------------------------------
0.02/0.06 c # SCIP version 1.2.1.3
0.02/0.06 c
0.02/0.06 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.06 c conflict/interconss = 0
0.02/0.06 c
0.02/0.06 c # should binary conflicts be preferred?
0.02/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.06 c conflict/preferbinary = TRUE
0.02/0.06 c
0.02/0.06 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.06 c constraints/agelimit = 1
0.02/0.06 c
0.02/0.06 c # should enforcement of pseudo solution be disabled?
0.02/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.06 c constraints/disableenfops = TRUE
0.02/0.06 c
0.02/0.06 c # frequency for displaying node information lines
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.06 c display/freq = 10000
0.02/0.06 c
0.02/0.06 c # maximal time in seconds to run
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.06 c limits/time = 1789.98
0.02/0.06 c
0.02/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.06 c limits/memory = 1620
0.02/0.06 c
0.02/0.06 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.06 c lp/solvefreq = 0
0.02/0.06 c
0.02/0.06 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.02/0.06 c # [type: char, range: {lafpsqd}, default: l]
0.02/0.06 c lp/pricing = a
0.02/0.06 c
0.02/0.06 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.02/0.06 c # [type: int, range: [1,2], default: 1]
0.02/0.06 c timing/clocktype = 2
0.02/0.06 c
0.02/0.06 c # should presolving try to simplify inequalities
0.02/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.06 c constraints/linear/simplifyinequalities = TRUE
0.02/0.06 c
0.02/0.06 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.02/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.06 c constraints/indicator/addCouplingCons = TRUE
0.02/0.06 c
0.02/0.06 c # should presolving try to simplify knapsacks
0.02/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.06 c
0.02/0.06 c # priority of node selection rule <dfs> in standard mode
0.02/0.06 c # [type: int, range: [-536870912,536870911], default: 0]
0.02/0.06 c nodeselection/dfs/stdpriority = 1000000
0.02/0.06 c
0.02/0.06 c -----------------------------------------------------------------------------------------------
0.02/0.06 c start solving
0.02/0.06 c
0.02/0.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.02/0.07 c t 0.0s| 1 | 0 | 32 | - |1864k| 0 | 12 | 362 | 46 | 362 | 46 | 0 | 0 | 0 | 5.000000e+00 | 3.630000e+02 |7160.00%
0.02/0.07 o 13
0.02/0.07 c r 0.0s| 1 | 0 | 32 | - |1873k| 0 | 12 | 362 | 46 | 362 | 46 | 0 | 0 | 0 | 5.000000e+00 | 1.300000e+01 | 160.00%
0.02/0.07 o 12
0.02/0.07 c R 0.0s| 1 | 0 | 32 | - |1882k| 0 | 12 | 362 | 46 | 362 | 46 | 0 | 0 | 0 | 5.000000e+00 | 1.200000e+01 | 140.00%
0.02/0.07 o 11
0.02/0.07 c s 0.0s| 1 | 0 | 32 | - |1891k| 0 | 12 | 362 | 46 | 362 | 46 | 0 | 0 | 0 | 5.000000e+00 | 1.100000e+01 | 120.00%
0.02/0.09 c 0.1s| 1 | 0 | 34 | - |1992k| 0 | 13 | 362 | 46 | 362 | 47 | 1 | 0 | 0 | 5.000000e+00 | 1.100000e+01 | 120.00%
0.02/0.09 o 7
0.02/0.09 c b 0.1s| 1 | 0 | 34 | - |2001k| 0 | 13 | 362 | 46 | 362 | 47 | 1 | 0 | 0 | 5.000000e+00 | 7.000000e+00 | 40.00%
0.09/0.11 c 0.1s| 1 | 0 | 40 | - |2101k| 0 | 17 | 362 | 46 | 362 | 48 | 2 | 0 | 0 | 5.000000e+00 | 7.000000e+00 | 40.00%
0.09/0.14 c 0.1s| 1 | 0 | 48 | - |2340k| 0 | 16 | 362 | 46 | 362 | 49 | 3 | 0 | 0 | 5.000000e+00 | 7.000000e+00 | 40.00%
0.09/0.17 c 0.1s| 1 | 0 | 64 | - |2444k| 0 | 20 | 362 | 46 | 362 | 50 | 4 | 0 | 0 | 5.000000e+00 | 7.000000e+00 | 40.00%
0.19/0.21 c 0.2s| 1 | 0 | 144 | - |2468k| 0 | 25 | 362 | 46 | 362 | 51 | 5 | 0 | 0 | 5.000000e+00 | 7.000000e+00 | 40.00%
0.19/0.29 o 6
0.19/0.29 c E 0.3s| 1 | 0 | 144 | - |2484k| 0 | 25 | 362 | 46 | 362 | 51 | 5 | 0 | 0 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.19/0.29 c 0.3s| 1 | 0 | 144 | - |2484k| 0 | 25 | 362 | 46 | 362 | 51 | 5 | 0 | 0 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.29/0.33 c 0.3s| 1 | 0 | 144 | - |2484k| 0 | 25 | 362 | 46 | 362 | 51 | 5 | 0 | 0 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.49/0.55 c 0.5s| 1 | 0 | 144 | - |2484k| 0 | - | 362 | 46 | 362 | 51 | 5 | 0 | 25 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.49/0.55 c (run 1, node 1) restarting after 137 global fixings of integer variables
0.49/0.55 c
0.49/0.55 c (restart) converted 5 cuts from the global cut pool into linear constraints
0.49/0.55 c
0.49/0.55 c presolving:
0.49/0.56 c (round 1) 137 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 5 upgd conss, 0 impls, 0 clqs
0.49/0.56 c presolving (2 rounds):
0.49/0.56 c 137 deleted vars, 1 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.49/0.56 c 0 implications, 0 cliques
0.49/0.56 c presolved problem has 225 variables (225 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.49/0.56 c 5 constraints of type <knapsack>
0.49/0.56 c 45 constraints of type <logicor>
0.49/0.56 c transformed objective value is always integral (scale: 1)
0.49/0.56 c Presolving Time: 0.03
0.49/0.56 c
0.49/0.57 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.57 c 0.5s| 1 | 0 | 212 | - |2047k| 0 | 17 | 225 | 50 | 225 | 50 | 0 | 0 | 25 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.59/0.62 c 0.6s| 1 | 0 | 251 | - |2072k| 0 | 17 | 225 | 50 | 225 | 51 | 1 | 0 | 25 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.69/0.72 c 0.7s| 1 | 2 | 251 | - |2081k| 0 | 17 | 225 | 50 | 225 | 51 | 1 | 0 | 42 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.69/0.72 c (run 2, node 1) restarting after 64 global fixings of integer variables
0.69/0.72 c
0.69/0.72 c (restart) converted 1 cuts from the global cut pool into linear constraints
0.69/0.72 c
0.69/0.72 c presolving:
0.69/0.72 c (round 1) 64 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 0 impls, 0 clqs
0.69/0.73 c presolving (2 rounds):
0.69/0.73 c 64 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.69/0.73 c 0 implications, 0 cliques
0.69/0.73 c presolved problem has 161 variables (161 bin, 0 int, 0 impl, 0 cont) and 51 constraints
0.69/0.73 c 6 constraints of type <knapsack>
0.69/0.73 c 45 constraints of type <logicor>
0.69/0.73 c transformed objective value is always integral (scale: 1)
0.69/0.73 c Presolving Time: 0.04
0.69/0.73 c
0.69/0.73 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.69/0.73 c 0.7s| 1 | 0 | 302 | - |1994k| 0 | 13 | 161 | 51 | 161 | 51 | 0 | 0 | 42 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.69/0.77 c 0.7s| 1 | 0 | 328 | - |2049k| 0 | 21 | 161 | 51 | 161 | 52 | 1 | 0 | 42 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.79/0.86 c 0.8s| 1 | 2 | 328 | - |2055k| 0 | 21 | 161 | 51 | 161 | 52 | 1 | 0 | 63 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.79/0.86 c (run 3, node 1) restarting after 29 global fixings of integer variables
0.79/0.86 c
0.79/0.86 c (restart) converted 1 cuts from the global cut pool into linear constraints
0.79/0.86 c
0.79/0.86 c presolving:
0.79/0.86 c (round 1) 29 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 0 impls, 0 clqs
0.79/0.87 c presolving (2 rounds):
0.79/0.87 c 29 deleted vars, 2 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.79/0.87 c 0 implications, 0 cliques
0.79/0.87 c presolved problem has 132 variables (132 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.79/0.87 c 7 constraints of type <knapsack>
0.79/0.87 c 43 constraints of type <logicor>
0.79/0.87 c transformed objective value is always integral (scale: 1)
0.79/0.87 c Presolving Time: 0.05
0.79/0.87 c
0.79/0.87 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.79/0.87 c 0.8s| 1 | 0 | 380 | - |1960k| 0 | 18 | 132 | 50 | 132 | 50 | 0 | 0 | 63 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.89/0.90 c 0.9s| 1 | 0 | 394 | - |1974k| 0 | 20 | 132 | 50 | 132 | 51 | 1 | 0 | 63 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.89/0.99 c 1.0s| 1 | 0 | 416 | - |1978k| 0 | 13 | 132 | 50 | 132 | 51 | 1 | 0 | 83 | 5.000000e+00 | 6.000000e+00 | 20.00%
1.00/1.02 c 1.0s| 1 | 0 | 425 | - |1983k| 0 | 18 | 132 | 50 | 132 | 51 | 1 | 0 | 89 | 5.000000e+00 | 6.000000e+00 | 20.00%
1.00/1.05 c 1.0s| 1 | 0 | 432 | - |1988k| 0 | 18 | 132 | 50 | 132 | 51 | 1 | 0 | 96 | 5.000000e+00 | 6.000000e+00 | 20.00%
1.00/1.06 c 1.0s| 1 | 2 | 432 | - |1993k| 0 | 18 | 132 | 50 | 132 | 51 | 1 | 0 | 100 | 5.000000e+00 | 6.000000e+00 | 20.00%
1.00/1.06 c (run 4, node 1) restarting after 7 global fixings of integer variables
1.00/1.06 c
1.00/1.07 c presolving:
1.00/1.07 c (round 1) 7 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
1.00/1.07 c presolving (2 rounds):
1.00/1.07 c 7 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.00/1.07 c 0 implications, 0 cliques
1.00/1.07 c presolved problem has 125 variables (125 bin, 0 int, 0 impl, 0 cont) and 50 constraints
1.00/1.07 c 7 constraints of type <knapsack>
1.00/1.07 c 43 constraints of type <logicor>
1.00/1.07 c transformed objective value is always integral (scale: 1)
1.00/1.07 c Presolving Time: 0.06
1.00/1.07 c
1.00/1.08 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.00/1.08 c 1.0s| 1 | 0 | 483 | - |1974k| 0 | 16 | 125 | 50 | 125 | 50 | 0 | 0 | 100 | 5.000000e+00 | 6.000000e+00 | 20.00%
1.00/1.08 o 6
1.00/1.08 c s 1.0s| 1 | 0 | 483 | - |1983k| 0 | 16 | 125 | 50 | 125 | 50 | 0 | 0 | 100 | 5.000000e+00 | 6.000000e+00 | 20.00%
1.00/1.10 c 1.1s| 1 | 0 | 509 | - |1992k| 0 | 18 | 125 | 50 | 125 | 51 | 1 | 0 | 100 | 5.000000e+00 | 6.000000e+00 | 20.00%
1.09/1.17 c 1.1s| 1 | 2 | 509 | - |2002k| 0 | 18 | 125 | 50 | 125 | 51 | 1 | 0 | 118 | 5.000000e+00 | 6.000000e+00 | 20.00%
1.69/1.80 o 5
1.69/1.80 c * 1.8s| 3952 | 0 | 509 | 0.0 |2058k| 121 | - | 125 | 50 | 0 | 0 | 1 | 958 | 118 | 5.000000e+00 | 5.000000e+00 | 0.00%
1.69/1.80 c
1.69/1.80 c SCIP Status : problem is solved [optimal solution found]
1.69/1.80 c Solving Time (sec) : 1.77
1.69/1.80 c Solving Nodes : 3952 (total of 3956 nodes in 5 runs)
1.69/1.80 c Primal Bound : +5.00000000000000e+00 (33 solutions)
1.69/1.80 c Dual Bound : +5.00000000000000e+00
1.69/1.80 c Gap : 0.00 %
1.79/1.80 s OPTIMUM FOUND
1.79/1.80 v -x363 -x362 -x361 -x360 -x359 -x358 -x357 -x356 -x355 -x354 -x353 -x352 -x351 -x350 -x349 -x348 -x347 -x346 -x345 -x344 -x343 -x342
1.79/1.80 v -x341 -x340 -x339 -x338 -x337 -x336 -x335 -x334 -x333 -x332 -x331 -x330 -x329 -x328 -x327 -x326 -x325 -x324 -x323 -x322
1.79/1.80 v -x321 -x320 -x319 -x318 -x317 -x316 -x315 -x314 -x313 -x312 -x311 -x310 -x309 -x308 -x307 -x306 -x305 -x304 -x303 -x302 -x301
1.79/1.80 v -x300 -x299 -x298 -x297 -x296 -x295 -x294 -x293 -x292 -x291 -x290 -x289 -x288 -x287 -x286 -x285 -x284 -x283 -x282 -x281 -x280
1.79/1.80 v -x279 -x278 -x277 -x276 -x275 x274 -x273 -x272 -x271 -x270 -x269 -x268 -x267 -x266 -x265 -x264 -x263 -x262 -x261 -x260 -x259
1.79/1.80 v -x258 -x257 -x256 -x255 -x254 -x253 -x252 -x251 -x250 -x249 -x248 -x247 -x246 -x245 -x244 -x243 -x242 -x241 -x240 -x239 -x238
1.79/1.80 v -x237 -x236 x235 -x234 -x233 -x232 -x231 -x230 -x229 -x228 -x227 -x226 -x225 -x224 -x223 -x222 -x221 x220 -x219 -x218 -x217
1.79/1.80 v -x216 -x215 -x214 -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 -x202 -x201 -x200 -x199 -x198 -x197 -x196
1.79/1.80 v -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175
1.79/1.80 v -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154
1.79/1.80 v -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134
1.79/1.80 v -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113
1.79/1.80 v -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90
1.79/1.80 v -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 x71 -x70 -x69 -x68 -x67 -x66 -x65
1.79/1.80 v -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40
1.79/1.80 v -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15
1.79/1.80 v -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 x1
1.79/1.80 c SCIP Status : problem is solved [optimal solution found]
1.79/1.80 c Solving Time : 1.77
1.79/1.80 c Original Problem :
1.79/1.80 c Problem name : HOME/instance-2704538-1278561444.opb
1.79/1.80 c Variables : 363 (363 binary, 0 integer, 0 implicit integer, 0 continuous)
1.79/1.80 c Constraints : 78 initial, 78 maximal
1.79/1.80 c Presolved Problem :
1.79/1.80 c Problem name : t_HOME/instance-2704538-1278561444.opb
1.79/1.80 c Variables : 125 (125 binary, 0 integer, 0 implicit integer, 0 continuous)
1.79/1.80 c Constraints : 50 initial, 57 maximal
1.79/1.80 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.79/1.80 c trivial : 0.00 237 0 0 0 0 0 0 0
1.79/1.80 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.79/1.80 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.79/1.80 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.79/1.80 c implics : 0.00 0 0 0 0 0 0 0 0
1.79/1.80 c probing : 0.00 0 0 0 0 0 0 0 0
1.79/1.80 c knapsack : 0.02 0 0 0 0 0 0 0 0
1.79/1.80 c linear : 0.01 1 0 0 1 0 32 20 0
1.79/1.80 c logicor : 0.01 0 0 0 0 0 3 0 0
1.79/1.80 c root node : - 237 - - 237 - - - -
1.79/1.80 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.79/1.80 c integral : 0 0 0 8 0 0 10 0 0 8
1.79/1.80 c knapsack : 7 4 6748 0 0 101 20 0 0 0
1.79/1.80 c logicor : 43+ 11 4020 0 0 1517 1255 0 0 0
1.79/1.80 c countsols : 0 0 0 0 1 0 0 0 0 0
1.79/1.80 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.79/1.80 c integral : 0.62 0.00 0.00 0.62 0.00
1.79/1.80 c knapsack : 0.28 0.07 0.21 0.00 0.00
1.79/1.80 c logicor : 0.04 0.00 0.04 0.00 0.00
1.79/1.80 c countsols : 0.00 0.00 0.00 0.00 0.00
1.79/1.80 c Propagators : Time Calls Cutoffs DomReds
1.79/1.80 c vbounds : 0.00 6 0 0
1.79/1.80 c rootredcost : 0.00 0 0 0
1.79/1.80 c pseudoobj : 0.16 7075 319 56693
1.79/1.80 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.79/1.80 c propagation : 0.04 958 958 958 46.4 1 92.0 -
1.79/1.80 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.79/1.80 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.79/1.80 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.79/1.80 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.79/1.80 c applied globally : - - - 122 28.2 - - -
1.79/1.80 c applied locally : - - - 836 49.1 - - -
1.79/1.80 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.79/1.80 c cut pool : 0.00 0 - - 0 - (maximal pool size: 2)
1.79/1.80 c redcost : 0.00 11 0 227 0 0
1.79/1.80 c impliedbounds : 0.00 11 0 0 0 0
1.79/1.80 c intobj : 0.00 0 0 0 0 0
1.79/1.80 c cgmip : 0.00 0 0 0 0 0
1.79/1.80 c gomory : 0.07 11 0 0 61 0
1.79/1.80 c strongcg : 0.07 11 0 0 49 0
1.79/1.80 c cmir : 0.01 11 0 0 0 0
1.79/1.80 c flowcover : 0.09 11 0 0 0 0
1.79/1.80 c clique : 0.00 5 0 0 0 0
1.79/1.80 c zerohalf : 0.00 0 0 0 0 0
1.79/1.80 c mcf : 0.00 5 0 0 0 0
1.79/1.80 c rapidlearning : 0.00 0 0 0 0 0
1.79/1.80 c Pricers : Time Calls Vars
1.79/1.80 c problem variables: 0.00 0 0
1.79/1.80 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.79/1.80 c relpscost : 0.62 8 0 10 0 0 8
1.79/1.80 c pscost : 0.00 0 0 0 0 0 0
1.79/1.80 c inference : 0.02 2062 0 0 0 0 4124
1.79/1.80 c mostinf : 0.00 0 0 0 0 0 0
1.79/1.80 c leastinf : 0.00 0 0 0 0 0 0
1.79/1.80 c fullstrong : 0.00 0 0 0 0 0 0
1.79/1.80 c allfullstrong : 0.00 0 0 0 0 0 0
1.79/1.80 c random : 0.00 0 0 0 0 0 0
1.79/1.80 c Primal Heuristics : Time Calls Found
1.79/1.80 c LP solutions : 0.00 - 0
1.79/1.80 c pseudo solutions : 0.00 - 1
1.79/1.80 c crossover : 0.00 0 0
1.79/1.80 c oneopt : 0.00 4 1
1.79/1.80 c trivial : 0.00 2 3
1.79/1.80 c simplerounding : 0.00 17 17
1.79/1.80 c zirounding : 0.00 2 2
1.79/1.80 c rounding : 0.00 17 1
1.79/1.80 c shifting : 0.00 17 7
1.79/1.80 c intshifting : 0.00 0 0
1.79/1.80 c twoopt : 0.00 0 0
1.79/1.80 c fixandinfer : 0.00 0 0
1.79/1.80 c feaspump : 0.00 0 0
1.79/1.80 c coefdiving : 0.00 0 0
1.79/1.80 c pscostdiving : 0.00 0 0
1.79/1.80 c fracdiving : 0.00 0 0
1.79/1.80 c veclendiving : 0.00 0 0
1.79/1.80 c intdiving : 0.00 0 0
1.79/1.80 c actconsdiving : 0.00 0 0
1.79/1.80 c objpscostdiving : 0.00 0 0
1.79/1.80 c rootsoldiving : 0.00 0 0
1.79/1.80 c linesearchdiving : 0.00 0 0
1.79/1.80 c guideddiving : 0.00 0 0
1.79/1.80 c octane : 0.00 0 0
1.79/1.80 c rens : 0.05 1 1
1.79/1.80 c rins : 0.00 0 0
1.79/1.80 c localbranching : 0.00 0 0
1.79/1.80 c mutation : 0.00 0 0
1.79/1.80 c dins : 0.00 0 0
1.79/1.80 c undercover : 0.00 0 0
1.79/1.80 c nlp : 0.00 0 0
1.79/1.80 c trysol : 0.00 0 0
1.79/1.80 c LP : Time Calls Iterations Iter/call Iter/sec
1.79/1.80 c primal LP : 0.00 0 0 0.00 -
1.79/1.80 c dual LP : 0.03 17 509 29.94 15424.71
1.79/1.80 c lex dual LP : 0.00 0 0 0.00 -
1.79/1.80 c barrier LP : 0.00 0 0 0.00 -
1.79/1.80 c diving/probing LP: 0.00 0 0 0.00 -
1.79/1.80 c strong branching : 0.62 118 8790 74.49 14087.28
1.79/1.80 c (at root node) : - 118 8790 74.49 -
1.79/1.80 c conflict analysis: 0.00 0 0 0.00 -
1.79/1.80 c B&B Tree :
1.79/1.80 c number of runs : 5
1.79/1.80 c nodes : 3952
1.79/1.80 c nodes (total) : 3956
1.79/1.80 c nodes left : 0
1.79/1.80 c max depth : 121
1.79/1.80 c max depth (total): 121
1.79/1.80 c backtracks : 1821 (46.1%)
1.79/1.80 c delayed cutoffs : 67
1.79/1.80 c repropagations : 1401 (1428 domain reductions, 49 cutoffs)
1.79/1.80 c avg switch length: 2.45
1.79/1.80 c switching time : 0.10
1.79/1.80 c Solution :
1.79/1.80 c Solutions found : 33 (8 improvements)
1.79/1.80 c First Solution : +3.63000000000000e+02 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
1.79/1.80 c Primal Bound : +5.00000000000000e+00 (in run 5, after 3952 nodes, 1.77 seconds, depth 111, found by <relaxation>)
1.79/1.80 c Dual Bound : +5.00000000000000e+00
1.79/1.80 c Gap : 0.00 %
1.79/1.80 c Root Dual Bound : +5.00000000000000e+00
1.79/1.80 c Root Iterations : 509
1.79/1.81 c Time complete: 1.8.