0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.00 c Copyright (c) 2002-2011 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-3453282-1307093813.opb>
0.00/0.01 c original problem has 363 variables (363 bin, 0 int, 0 impl, 0 cont) and 78 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 o 363
0.00/0.01 c feasible solution found by trivial heuristic, objective value 3.630000e+02
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 1 del vars, 12 del conss, 0 add conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.02 c (round 2) 1 del vars, 32 del conss, 0 add conss, 1 chg bounds, 20 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.02 c (round 3) 1 del vars, 32 del conss, 0 add conss, 1 chg bounds, 20 chg sides, 0 chg coeffs, 46 upgd conss, 0 impls, 0 clqs
0.00/0.02 c (0.0s) probing: 101/362 (27.9%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.02 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.02 c presolving (4 rounds):
0.00/0.02 c 1 deleted vars, 32 deleted constraints, 0 added constraints, 1 tightened bounds, 0 added holes, 20 changed sides, 0 changed coefficients
0.00/0.02 c 0 implications, 0 cliques
0.00/0.02 c presolved problem has 362 variables (362 bin, 0 int, 0 impl, 0 cont) and 46 constraints
0.00/0.02 c 46 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 2.0.1.4
0.00/0.02 c
0.00/0.02 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c conflict/interconss = 0
0.00/0.02 c
0.00/0.02 c # should binary conflicts be preferred?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c conflict/preferbinary = TRUE
0.00/0.02 c
0.00/0.02 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c constraints/agelimit = 1
0.00/0.02 c
0.00/0.02 c # should enforcement of pseudo solution be disabled?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/disableenfops = TRUE
0.00/0.02 c
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = 10000
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = 1800
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = 13950
0.00/0.02 c
0.00/0.02 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c lp/solvefreq = 0
0.00/0.02 c
0.00/0.02 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.00/0.02 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.02 c lp/pricing = a
0.00/0.02 c
0.00/0.02 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.02 c # [type: int, range: [1,2], default: 1]
0.00/0.02 c timing/clocktype = 2
0.00/0.02 c
0.00/0.02 c # belongs reading time to solving time?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c timing/reading = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/indicator/addCouplingCons = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # priority of node selection rule <dfs> in standard mode
0.00/0.02 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.02 c nodeselection/dfs/stdpriority = 1000000
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 c
0.00/0.03 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.03 c t 0.0s| 1 | 0 | 32 | - |1848k| 0 | 12 | 362 | 46 | 362 | 46 | 0 | 0 | 0 | 5.000000e+00 | 3.630000e+02 |7160.00%
0.00/0.03 o 13
0.00/0.03 c r 0.0s| 1 | 0 | 32 | - |1857k| 0 | 12 | 362 | 46 | 362 | 46 | 0 | 0 | 0 | 5.000000e+00 | 1.300000e+01 | 160.00%
0.00/0.03 o 12
0.00/0.03 c R 0.0s| 1 | 0 | 32 | - |1866k| 0 | 12 | 362 | 46 | 362 | 46 | 0 | 0 | 0 | 5.000000e+00 | 1.200000e+01 | 140.00%
0.00/0.03 o 11
0.00/0.03 c s 0.0s| 1 | 0 | 32 | - |1876k| 0 | 12 | 362 | 46 | 362 | 46 | 0 | 0 | 0 | 5.000000e+00 | 1.100000e+01 | 120.00%
0.00/0.03 c 0.0s| 1 | 0 | 34 | - |1977k| 0 | 13 | 362 | 46 | 362 | 47 | 1 | 0 | 0 | 5.000000e+00 | 1.100000e+01 | 120.00%
0.00/0.03 o 7
0.00/0.03 c b 0.0s| 1 | 0 | 34 | - |1986k| 0 | 13 | 362 | 46 | 362 | 47 | 1 | 0 | 0 | 5.000000e+00 | 7.000000e+00 | 40.00%
0.00/0.04 c 0.0s| 1 | 0 | 39 | - |2086k| 0 | 17 | 362 | 46 | 362 | 48 | 2 | 0 | 0 | 5.000000e+00 | 7.000000e+00 | 40.00%
0.00/0.05 c 0.1s| 1 | 0 | 41 | - |2270k| 0 | 18 | 362 | 46 | 362 | 49 | 3 | 0 | 0 | 5.000000e+00 | 7.000000e+00 | 40.00%
0.00/0.07 c 0.1s| 1 | 0 | 56 | - |2503k| 0 | 19 | 362 | 46 | 362 | 50 | 4 | 0 | 0 | 5.000000e+00 | 7.000000e+00 | 40.00%
0.00/0.08 c 0.1s| 1 | 0 | 70 | - |2545k| 0 | 17 | 362 | 46 | 362 | 51 | 5 | 0 | 0 | 5.000000e+00 | 7.000000e+00 | 40.00%
0.09/0.09 c 0.1s| 1 | 0 | 85 | - |2567k| 0 | 19 | 362 | 46 | 362 | 52 | 6 | 0 | 0 | 5.000000e+00 | 7.000000e+00 | 40.00%
0.09/0.11 o 6
0.09/0.11 c E 0.1s| 1 | 0 | 85 | - |2585k| 0 | 19 | 362 | 46 | 362 | 52 | 6 | 0 | 0 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.09/0.11 c 0.1s| 1 | 0 | 85 | - |2585k| 0 | 19 | 362 | 46 | 362 | 52 | 6 | 0 | 0 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.09/0.12 c 0.1s| 1 | 0 | 85 | - |2585k| 0 | 19 | 362 | 46 | 362 | 52 | 6 | 0 | 0 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.09/0.18 c 0.2s| 1 | 0 | 85 | - |2585k| 0 | - | 362 | 46 | 362 | 52 | 6 | 0 | 19 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.09/0.18 c (run 1, node 1) restarting after 137 global fixings of integer variables
0.09/0.18 c
0.09/0.18 c (restart) converted 6 cuts from the global cut pool into linear constraints
0.09/0.18 c
0.09/0.18 c presolving:
0.09/0.19 c (round 1) 137 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 6 upgd conss, 0 impls, 0 clqs
0.09/0.19 c presolving (2 rounds):
0.09/0.19 c 137 deleted vars, 1 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.19 c 0 implications, 0 cliques
0.09/0.19 c presolved problem has 225 variables (225 bin, 0 int, 0 impl, 0 cont) and 51 constraints
0.09/0.19 c 6 constraints of type <knapsack>
0.09/0.19 c 45 constraints of type <logicor>
0.09/0.19 c transformed objective value is always integral (scale: 1)
0.09/0.19 c Presolving Time: 0.02
0.09/0.19 c
0.09/0.19 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.19 c 0.2s| 1 | 0 | 215 | - |2069k| 0 | 21 | 225 | 51 | 225 | 51 | 0 | 0 | 19 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.09/0.19 o 6
0.09/0.19 c s 0.2s| 1 | 0 | 215 | - |2078k| 0 | 21 | 225 | 51 | 225 | 51 | 0 | 0 | 19 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.19/0.22 c 0.2s| 1 | 0 | 229 | - |2278k| 0 | 24 | 225 | 51 | 225 | 52 | 1 | 0 | 19 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.19/0.29 c 0.3s| 1 | 0 | 229 | - |2282k| 0 | - | 225 | 51 | 225 | 52 | 1 | 0 | 43 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.19/0.29 c (run 2, node 1) restarting after 67 global fixings of integer variables
0.19/0.29 c
0.19/0.29 c (restart) converted 1 cuts from the global cut pool into linear constraints
0.19/0.29 c
0.19/0.29 c presolving:
0.19/0.29 c (round 1) 67 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 0 impls, 0 clqs
0.19/0.29 c presolving (2 rounds):
0.19/0.29 c 67 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.19/0.29 c 0 implications, 0 cliques
0.19/0.29 c presolved problem has 158 variables (158 bin, 0 int, 0 impl, 0 cont) and 52 constraints
0.19/0.29 c 7 constraints of type <knapsack>
0.19/0.29 c 45 constraints of type <logicor>
0.19/0.29 c transformed objective value is always integral (scale: 1)
0.19/0.29 c Presolving Time: 0.02
0.19/0.29 c
0.19/0.29 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.29 c 0.3s| 1 | 0 | 264 | - |2002k| 0 | 10 | 158 | 52 | 158 | 52 | 0 | 0 | 43 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.29/0.31 c 0.3s| 1 | 0 | 268 | - |2093k| 0 | 11 | 158 | 52 | 158 | 53 | 1 | 0 | 43 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.29/0.32 c 0.3s| 1 | 0 | 287 | - |2098k| 0 | 17 | 158 | 52 | 158 | 53 | 1 | 0 | 54 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.29/0.32 o 6
0.29/0.32 c s 0.3s| 1 | 0 | 287 | - |2107k| 0 | 17 | 158 | 52 | 158 | 53 | 1 | 0 | 54 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.29/0.33 c 0.3s| 1 | 0 | 310 | - |2107k| 0 | 21 | 158 | 52 | 158 | 53 | 1 | 0 | 66 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.29/0.34 c 0.3s| 1 | 0 | 325 | - |2116k| 0 | 19 | 158 | 52 | 158 | 53 | 1 | 0 | 74 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.29/0.34 c 0.3s| 1 | 0 | 337 | - |2126k| 0 | 23 | 158 | 52 | 158 | 53 | 1 | 0 | 81 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.29/0.36 c 0.4s| 1 | 0 | 347 | - |2130k| 0 | 22 | 158 | 52 | 158 | 53 | 1 | 0 | 92 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.29/0.37 c 0.4s| 1 | 0 | 365 | - |2135k| 0 | 23 | 158 | 52 | 158 | 53 | 1 | 0 | 99 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.29/0.37 c 0.4s| 1 | 0 | 365 | - |2140k| 0 | - | 158 | 52 | 158 | 53 | 1 | 0 | 106 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.29/0.37 c (run 3, node 1) restarting after 34 global fixings of integer variables
0.29/0.37 c
0.29/0.37 c (restart) converted 1 cuts from the global cut pool into linear constraints
0.29/0.37 c
0.29/0.37 c presolving:
0.29/0.38 c (round 1) 34 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 0 impls, 0 clqs
0.29/0.38 c presolving (2 rounds):
0.29/0.38 c 34 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.38 c 0 implications, 0 cliques
0.29/0.38 c presolved problem has 124 variables (124 bin, 0 int, 0 impl, 0 cont) and 53 constraints
0.29/0.38 c 8 constraints of type <knapsack>
0.29/0.38 c 45 constraints of type <logicor>
0.29/0.38 c transformed objective value is always integral (scale: 1)
0.29/0.38 c Presolving Time: 0.02
0.29/0.38 c
0.29/0.38 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.38 c 0.4s| 1 | 0 | 379 | - |2005k| 0 | 11 | 124 | 53 | 124 | 53 | 0 | 0 | 106 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.29/0.39 c 0.4s| 1 | 0 | 389 | - |2151k| 0 | 15 | 124 | 53 | 124 | 54 | 1 | 0 | 106 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.29/0.39 o 6
0.29/0.39 c s 0.4s| 1 | 0 | 389 | - |2160k| 0 | 15 | 124 | 53 | 124 | 54 | 1 | 0 | 106 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.39/0.40 c 0.4s| 1 | 2 | 389 | - |2166k| 0 | 15 | 124 | 53 | 124 | 54 | 1 | 0 | 121 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.49/0.52 o 5
0.49/0.52 c * 0.5s| 1208 | 0 | 389 | 0.0 |2269k| 114 | - | 124 | 135 | 0 | 0 | 1 | 269 | 121 | 5.000000e+00 | 5.000000e+00 | 0.00%
0.49/0.52 c
0.49/0.52 c SCIP Status : problem is solved [optimal solution found]
0.49/0.52 c Solving Time (sec) : 0.52
0.49/0.52 c Solving Nodes : 1208 (total of 1211 nodes in 4 runs)
0.49/0.52 c Primal Bound : +5.00000000000000e+00 (34 solutions)
0.49/0.52 c Dual Bound : +5.00000000000000e+00
0.49/0.52 c Gap : 0.00 %
0.49/0.52 s OPTIMUM FOUND
0.49/0.52 v -x363 -x362 -x361 -x360 -x359 -x358 -x357 -x356 -x355 -x354 -x353 -x352 -x351 -x350 -x349 -x348 -x347 -x346 -x345 -x344 -x343 -x342
0.49/0.52 v -x341 -x340 -x339 -x338 -x337 -x336 -x335 -x334 -x333 -x332 -x331 -x330 -x329 -x328 -x327 -x326 -x325 -x324 -x323 -x322
0.49/0.52 v -x321 -x320 -x319 -x318 -x317 -x316 -x315 -x314 -x313 -x312 -x311 -x310 -x309 -x308 -x307 -x306 -x305 -x304 -x303 -x302 -x301
0.49/0.52 v -x300 -x299 -x298 -x297 -x296 -x295 -x294 -x293 -x292 -x291 -x290 -x289 -x288 -x287 -x286 -x285 -x284 -x283 -x282 -x281 -x280
0.49/0.52 v -x279 -x278 -x277 -x276 -x275 -x274 -x273 -x272 -x271 -x270 -x269 -x268 -x267 -x266 -x265 -x264 -x263 -x262 -x261 -x260 -x259
0.49/0.52 v -x258 -x257 -x256 -x255 -x254 -x253 -x252 -x251 -x250 -x249 -x248 -x247 -x246 -x245 -x244 -x243 -x242 -x241 -x240 -x239 -x238
0.49/0.52 v -x237 -x236 -x235 -x234 -x233 -x232 -x231 -x230 -x229 -x228 -x227 -x226 -x225 -x224 -x223 -x222 -x221 -x220 -x219 -x218 -x217
0.49/0.52 v -x216 -x215 -x214 -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 -x202 -x201 -x200 -x199 -x198 -x197
0.49/0.52 v -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176
0.49/0.52 v -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155
0.49/0.52 v -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134
0.49/0.52 v -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113
0.49/0.52 v -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91
0.49/0.52 v -x90 -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
0.49/0.52 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
0.49/0.52 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
0.49/0.52 v -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 x4 -x3 -x2 x1
0.49/0.52 c SCIP Status : problem is solved [optimal solution found]
0.49/0.52 c Total Time : 0.52
0.49/0.52 c solving : 0.52
0.49/0.52 c presolving : 0.02 (included in solving)
0.49/0.52 c reading : 0.01 (included in solving)
0.49/0.52 c Original Problem :
0.49/0.52 c Problem name : HOME/instance-3453282-1307093813.opb
0.49/0.52 c Variables : 363 (363 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.52 c Constraints : 78 initial, 78 maximal
0.49/0.52 c Presolved Problem :
0.49/0.52 c Problem name : t_HOME/instance-3453282-1307093813.opb
0.49/0.52 c Variables : 124 (124 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.52 c Constraints : 53 initial, 219 maximal
0.49/0.52 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.49/0.52 c trivial : 0.00 238 0 0 0 0 0 0 0 0
0.49/0.52 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.52 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.52 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.52 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.52 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.52 c knapsack : 0.01 0 0 0 0 0 0 0 0 0
0.49/0.52 c linear : 0.01 1 0 0 1 0 32 0 20 0
0.49/0.52 c logicor : 0.00 0 0 0 0 0 1 0 0 0
0.49/0.52 c root node : - 238 - - 238 - - - - -
0.49/0.52 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.49/0.52 c integral : 0 0 0 10 0 41 0 0 40 0 0 2
0.49/0.52 c knapsack : 8 3 3517 0 0 0 5 194 20 0 0 0
0.49/0.52 c logicor : 45+ 10 1396 0 0 33 1320 360 344 0 0 0
0.49/0.52 c countsols : 0 0 0 0 1 36 0 0 0 0 0 0
0.49/0.52 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.49/0.52 c integral : 0.19 0.00 0.00 0.19 0.00 0.00 0.00
0.49/0.52 c knapsack : 0.04 0.03 0.01 0.00 0.00 0.00 0.00
0.49/0.52 c logicor : 0.02 0.00 0.02 0.00 0.00 0.00 0.00
0.49/0.52 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.52 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.49/0.52 c vbounds : 0 0 0 0
0.49/0.52 c rootredcost : 0 0 0 0
0.49/0.52 c pseudoobj : 3731 5729 50 40543
0.49/0.52 c Propagator Timings : TotalTime Propagate Resprop
0.49/0.52 c vbounds : 0.00 0.00 0.00
0.49/0.52 c rootredcost : 0.00 0.00 0.00
0.49/0.52 c pseudoobj : 0.04 0.04 0.01
0.49/0.52 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.49/0.52 c propagation : 0.01 271 269 269 21.8 0 0.0 -
0.49/0.52 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.52 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.52 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.52 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.52 c applied globally : - - - 205 13.9 - - -
0.49/0.52 c applied locally : - - - 64 47.1 - - -
0.49/0.52 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.49/0.52 c cut pool : 0.00 0 - - 0 - (maximal pool size: 37)
0.49/0.52 c redcost : 0.00 10 0 198 0 0
0.49/0.52 c impliedbounds : 0.00 10 0 0 0 0
0.49/0.52 c intobj : 0.00 0 0 0 0 0
0.49/0.52 c gomory : 0.03 10 0 0 167 0
0.49/0.52 c cgmip : 0.00 0 0 0 0 0
0.49/0.52 c closecuts : 0.00 0 0 0 0 0
0.49/0.52 c strongcg : 0.03 10 0 0 132 0
0.49/0.52 c cmir : 0.00 10 0 0 0 0
0.49/0.52 c flowcover : 0.04 10 0 0 0 0
0.49/0.52 c clique : 0.00 4 0 0 0 0
0.49/0.52 c zerohalf : 0.00 0 0 0 0 0
0.49/0.52 c mcf : 0.00 4 0 0 0 0
0.49/0.52 c oddcycle : 0.00 0 0 0 0 0
0.49/0.52 c rapidlearning : 0.00 0 0 0 0 0
0.49/0.52 c Pricers : Time Calls Vars
0.49/0.52 c problem variables: 0.00 0 0
0.49/0.52 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.49/0.52 c relpscost : 0.19 10 0 40 0 0 2
0.49/0.52 c pscost : 0.00 0 0 0 0 0 0
0.49/0.52 c inference : 0.00 607 0 0 0 0 1214
0.49/0.52 c mostinf : 0.00 0 0 0 0 0 0
0.49/0.52 c leastinf : 0.00 0 0 0 0 0 0
0.49/0.52 c fullstrong : 0.00 0 0 0 0 0 0
0.49/0.52 c allfullstrong : 0.00 0 0 0 0 0 0
0.49/0.52 c random : 0.00 0 0 0 0 0 0
0.49/0.52 c Primal Heuristics : Time Calls Found
0.49/0.52 c LP solutions : 0.00 - 0
0.49/0.52 c pseudo solutions : 0.00 - 1
0.49/0.52 c crossover : 0.00 0 0
0.49/0.52 c oneopt : 0.00 5 1
0.49/0.52 c trivial : 0.00 2 1
0.49/0.52 c shiftandpropagate: 0.00 0 0
0.49/0.52 c simplerounding : 0.00 19 19
0.49/0.52 c zirounding : 0.00 2 2
0.49/0.52 c rounding : 0.00 19 1
0.49/0.52 c shifting : 0.00 19 8
0.49/0.52 c intshifting : 0.00 0 0
0.49/0.52 c twoopt : 0.00 0 0
0.49/0.52 c fixandinfer : 0.00 0 0
0.49/0.52 c feaspump : 0.00 0 0
0.49/0.52 c clique : 0.00 0 0
0.49/0.52 c coefdiving : 0.00 0 0
0.49/0.52 c pscostdiving : 0.00 0 0
0.49/0.52 c fracdiving : 0.00 0 0
0.49/0.52 c veclendiving : 0.00 0 0
0.49/0.52 c intdiving : 0.00 0 0
0.49/0.52 c actconsdiving : 0.00 0 0
0.49/0.52 c objpscostdiving : 0.00 0 0
0.49/0.52 c rootsoldiving : 0.00 0 0
0.49/0.52 c linesearchdiving : 0.00 0 0
0.49/0.52 c guideddiving : 0.00 0 0
0.49/0.52 c octane : 0.00 0 0
0.49/0.52 c rens : 0.02 1 1
0.49/0.52 c rins : 0.00 0 0
0.49/0.52 c localbranching : 0.00 0 0
0.49/0.52 c mutation : 0.00 0 0
0.49/0.52 c dins : 0.00 0 0
0.49/0.52 c vbounds : 0.00 0 0
0.49/0.52 c undercover : 0.00 0 0
0.49/0.52 c subnlp : 0.00 0 0
0.49/0.52 c trysol : 0.00 0 0
0.49/0.52 c LP : Time Calls Iterations Iter/call Iter/sec
0.49/0.52 c primal LP : 0.00 0 0 0.00 -
0.49/0.52 c dual LP : 0.01 19 389 20.47 30155.04
0.49/0.52 c lex dual LP : 0.00 0 0 0.00 -
0.49/0.52 c barrier LP : 0.00 0 0 0.00 -
0.49/0.52 c diving/probing LP: 0.00 0 0 0.00 -
0.49/0.52 c strong branching : 0.19 121 7106 58.73 36861.05
0.49/0.52 c (at root node) : - 121 7106 58.73 -
0.49/0.52 c conflict analysis: 0.00 0 0 0.00 -
0.49/0.52 c B&B Tree :
0.49/0.52 c number of runs : 4
0.49/0.52 c nodes : 1208
0.49/0.52 c nodes (total) : 1211
0.49/0.52 c nodes left : 0
0.49/0.52 c max depth : 114
0.49/0.52 c max depth (total): 114
0.49/0.52 c backtracks : 11 (0.9%)
0.49/0.52 c delayed cutoffs : 5
0.49/0.52 c repropagations : 1848 (608 domain reductions, 5 cutoffs)
0.49/0.52 c avg switch length: 4.62
0.49/0.52 c switching time : 0.04
0.49/0.52 c Solution :
0.49/0.52 c Solutions found : 34 (10 improvements)
0.49/0.52 c First Solution : +3.63000000000000e+02 (in run 1, after 0 nodes, 0.02 seconds, depth 0, found by <trivial>)
0.49/0.52 c Primal Bound : +5.00000000000000e+00 (in run 4, after 1208 nodes, 0.52 seconds, depth 17, found by <relaxation>)
0.49/0.52 c Dual Bound : +5.00000000000000e+00
0.49/0.52 c Gap : 0.00 %
0.49/0.52 c Root Dual Bound : +5.00000000000000e+00
0.49/0.52 c Root Iterations : 389
0.49/0.52 c Time complete: 0.52.
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL
This is runsolver version 3.3.0 (svn: 977)
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-3453282-1307093813/watcher-3453282-1307093813 -o /tmp/evaluation-result-3453282-1307093813/solver-3453282-1307093813 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3453282-1307093813.opb -t 1800 -m 15500
running on 4 cores: 0,2,4,6
Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 1900 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB
Current StackSize limit: 10240 KiB
[startup+0 s]
/proc/loadavg: 1.77 2.00 1.99 2/571 20807
/proc/meminfo: memFree=31929920/32950928 swapFree=43925852/67111528
[pid=20806] ppid=20803 vsize=17716 CPUtime=0.01 cores=0,2,4,6
/proc/20806/stat : 20806 (scip-2.0.1.4.li) R 20803 20806 20770 0 -1 4202496 3143 0 0 0 1 0 0 0 25 0 1 0 820980138 18141184 3095 33554432000 4194304 9128323 140734655340496 18446744073709551615 6886064 0 0 4096 16384 0 0 0 17 2 0 0 0
/proc/20806/statm: 4429 3102 467 1205 0 3220 0
[startup+0.0932339 s]
/proc/loadavg: 1.77 2.00 1.99 2/571 20807
/proc/meminfo: memFree=31929920/32950928 swapFree=43925852/67111528
[pid=20806] ppid=20803 vsize=22840 CPUtime=0.09 cores=0,2,4,6
/proc/20806/stat : 20806 (scip-2.0.1.4.li) R 20803 20806 20770 0 -1 4202496 4965 0 0 0 8 1 0 0 25 0 1 0 820980138 23388160 4625 33554432000 4194304 9128323 140734655340496 18446744073709551615 6295560 0 0 4096 16384 0 0 0 17 2 0 0 0
/proc/20806/statm: 5710 4625 662 1205 0 4501 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 22840
[startup+0.100233 s]
/proc/loadavg: 1.77 2.00 1.99 2/571 20807
/proc/meminfo: memFree=31929920/32950928 swapFree=43925852/67111528
[pid=20806] ppid=20803 vsize=28524 CPUtime=0.09 cores=0,2,4,6
/proc/20806/stat : 20806 (scip-2.0.1.4.li) R 20803 20806 20770 0 -1 4202496 6271 0 0 0 8 1 0 0 25 0 1 0 820980138 29208576 5932 33554432000 4194304 9128323 140734655340496 18446744073709551615 8009021 0 0 4096 16384 0 0 0 17 2 0 0 0
/proc/20806/statm: 7131 5948 669 1205 0 5922 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 28524
[startup+0.300196 s]
/proc/loadavg: 1.77 2.00 1.99 2/571 20807
/proc/meminfo: memFree=31929920/32950928 swapFree=43925852/67111528
[pid=20806] ppid=20803 vsize=25280 CPUtime=0.29 cores=0,2,4,6
/proc/20806/stat : 20806 (scip-2.0.1.4.li) R 20803 20806 20770 0 -1 4202496 8464 0 0 0 27 2 0 0 25 0 1 0 820980138 25886720 5275 33554432000 4194304 9128323 140734655340496 18446744073709551615 5141535 0 0 4096 16384 0 0 0 17 2 0 0 0
/proc/20806/statm: 6320 5275 717 1205 0 5111 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 25280
Solver just ended. Dumping a history of the last processes samples
[startup+0.50016 s]
/proc/loadavg: 1.77 2.00 1.99 2/571 20807
/proc/meminfo: memFree=31929920/32950928 swapFree=43925852/67111528
[pid=20806] ppid=20803 vsize=25668 CPUtime=0.49 cores=0,2,4,6
/proc/20806/stat : 20806 (scip-2.0.1.4.li) R 20803 20806 20770 0 -1 4202496 8577 0 0 0 45 4 0 0 25 0 1 0 820980138 26284032 5388 33554432000 4194304 9128323 140734655340496 18446744073709551615 6581536 0 0 4096 16384 0 0 0 17 2 0 0 0
/proc/20806/statm: 6417 5388 724 1205 0 5208 0
Current children cumulated CPU time (s) 0.49
Current children cumulated vsize (KiB) 25668
Child status: 0
Real time (s): 0.529379
CPU time (s): 0.529918
CPU user time (s): 0.487925
CPU system time (s): 0.041993
CPU usage (%): 100.102
Max. virtual memory (cumulated for all children) (KiB): 28524
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.487925
system time used= 0.041993
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 8582
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 5
involuntary context switches= 17
runsolver used 0.006998 second user time and 0.017997 second system time
The end