0.00/0.01 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [Expressions interpreter: NONE]
0.00/0.01 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01 c
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c reading problem <HOME/instance-2667534-1276448623.opb>
0.00/0.02 c original problem has 400 variables (400 bin, 0 int, 0 impl, 0 cont) and 520 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.00/0.03 c presolving:
0.00/0.03 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 408 impls, 0 clqs
0.00/0.05 c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 520 upgd conss, 408 impls, 0 clqs
0.00/0.06 c (0.0s) probing: 119/400 (29.8%) - 0 fixings, 0 aggregations, 8 implications, 0 bound changes
0.00/0.06 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.06 c presolving (3 rounds):
0.00/0.06 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
0.00/0.06 c 432 implications, 0 cliques
0.00/0.06 c presolved problem has 400 variables (400 bin, 0 int, 0 impl, 0 cont) and 520 constraints
0.00/0.06 c 520 constraints of type <logicor>
0.00/0.06 c transformed objective value is always integral (scale: 1)
0.00/0.06 c Presolving Time: 0.03
0.00/0.06 c - non default parameters ----------------------------------------------------------------------
0.00/0.06 c # SCIP version 1.2.1.2
0.00/0.06 c
0.00/0.06 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c conflict/interconss = 0
0.00/0.06 c
0.00/0.06 c # should binary conflicts be preferred?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c conflict/preferbinary = TRUE
0.00/0.06 c
0.00/0.06 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c constraints/agelimit = 1
0.00/0.06 c
0.00/0.06 c # should enforcement of pseudo solution be disabled?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/disableenfops = TRUE
0.00/0.06 c
0.00/0.06 c # frequency for displaying node information lines
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.06 c display/freq = 10000
0.00/0.06 c
0.00/0.06 c # maximal time in seconds to run
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/time = 1799.99
0.00/0.06 c
0.00/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/memory = 1620
0.00/0.06 c
0.00/0.06 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c lp/solvefreq = 0
0.00/0.06 c
0.00/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.00/0.06 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.06 c lp/pricing = a
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify inequalities
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/linear/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify knapsacks
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # priority of node selection rule <dfs> in standard mode
0.00/0.06 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.06 c nodeselection/dfs/stdpriority = 1000000
0.00/0.06 c
0.00/0.06 c -----------------------------------------------------------------------------------------------
0.00/0.06 c start solving
0.00/0.06 c
0.18/0.20 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.18/0.20 c 0.2s| 1 | 0 | 1173 | - |1814k| 0 | 339 | 400 | 520 | 400 | 520 | 0 | 0 | 0 | 1.263863e+02 | -- | Inf
0.69/0.70 c 0.7s| 1 | 0 | 2895 | - |4106k| 0 | 341 | 400 | 520 | 400 | 531 | 11 | 0 | 0 | 1.279667e+02 | -- | Inf
0.89/0.97 c 0.9s| 1 | 0 | 2994 | - |6857k| 0 | 344 | 400 | 520 | 400 | 533 | 13 | 0 | 0 | 1.281577e+02 | -- | Inf
1.19/1.25 c 1.2s| 1 | 0 | 3121 | - |9674k| 0 | 343 | 400 | 520 | 400 | 537 | 17 | 0 | 0 | 1.287166e+02 | -- | Inf
1.49/1.51 c 1.4s| 1 | 0 | 3225 | - | 12M| 0 | 352 | 400 | 520 | 400 | 541 | 21 | 0 | 0 | 1.289645e+02 | -- | Inf
1.69/1.79 c 1.7s| 1 | 0 | 3271 | - | 15M| 0 | 346 | 400 | 520 | 400 | 543 | 23 | 0 | 0 | 1.289826e+02 | -- | Inf
1.98/2.09 c 2.0s| 1 | 0 | 3319 | - | 18M| 0 | 348 | 400 | 520 | 400 | 544 | 24 | 0 | 0 | 1.290016e+02 | -- | Inf
2.38/2.40 c 2.3s| 1 | 0 | 3348 | - | 22M| 0 | 351 | 400 | 520 | 400 | 545 | 25 | 0 | 0 | 1.290038e+02 | -- | Inf
2.69/2.73 c 2.6s| 1 | 0 | 3402 | - | 25M| 0 | 352 | 400 | 520 | 400 | 546 | 26 | 0 | 0 | 1.290114e+02 | -- | Inf
2.98/3.06 c 3.0s| 1 | 0 | 3448 | - | 29M| 0 | 350 | 400 | 520 | 400 | 547 | 27 | 0 | 0 | 1.290144e+02 | -- | Inf
3.39/3.41 c 3.3s| 1 | 0 | 3507 | - | 33M| 0 | 351 | 400 | 520 | 400 | 548 | 28 | 0 | 0 | 1.290165e+02 | -- | Inf
3.69/3.72 c 3.6s| 1 | 0 | 3552 | - | 35M| 0 | 346 | 400 | 520 | 400 | 549 | 29 | 0 | 0 | 1.290180e+02 | -- | Inf
3.99/4.04 c 3.9s| 1 | 0 | 3601 | - | 36M| 0 | 347 | 400 | 520 | 400 | 550 | 30 | 0 | 0 | 1.290219e+02 | -- | Inf
4.30/4.39 c 4.3s| 1 | 0 | 3694 | - | 40M| 0 | 346 | 400 | 520 | 400 | 552 | 32 | 0 | 0 | 1.290441e+02 | -- | Inf
4.68/4.71 c 4.6s| 1 | 0 | 3751 | - | 42M| 0 | 349 | 400 | 520 | 400 | 554 | 34 | 0 | 0 | 1.290733e+02 | -- | Inf
4.99/5.03 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.99/5.03 c 4.9s| 1 | 0 | 3825 | - | 45M| 0 | 350 | 400 | 520 | 400 | 556 | 36 | 0 | 0 | 1.291080e+02 | -- | Inf
5.28/5.35 c 5.2s| 1 | 0 | 3867 | - | 49M| 0 | 343 | 400 | 520 | 400 | 550 | 38 | 0 | 0 | 1.291221e+02 | -- | Inf
5.59/5.67 c 5.5s| 1 | 0 | 3944 | - | 52M| 0 | 346 | 400 | 520 | 400 | 552 | 40 | 0 | 0 | 1.291495e+02 | -- | Inf
5.88/5.99 c 5.8s| 1 | 0 | 3994 | - | 56M| 0 | 349 | 400 | 520 | 400 | 553 | 41 | 0 | 0 | 1.291548e+02 | -- | Inf
6.29/6.33 c 6.2s| 1 | 0 | 4057 | - | 59M| 0 | 340 | 400 | 520 | 400 | 554 | 42 | 0 | 0 | 1.291633e+02 | -- | Inf
6.59/6.66 c 6.5s| 1 | 0 | 4109 | - | 62M| 0 | 345 | 400 | 520 | 400 | 556 | 44 | 0 | 0 | 1.291894e+02 | -- | Inf
6.78/6.82 c 6.7s| 1 | 0 | 4123 | - | 62M| 0 | 345 | 400 | 520 | 400 | 557 | 45 | 0 | 0 | 1.291982e+02 | -- | Inf
6.89/6.98 c 6.8s| 1 | 0 | 4162 | - | 62M| 0 | 340 | 400 | 520 | 400 | 555 | 46 | 0 | 0 | 1.292030e+02 | -- | Inf
9.79/9.80 c 9.6s| 1 | 2 | 4162 | - | 62M| 0 | 340 | 400 | 520 | 400 | 555 | 46 | 0 | 33 | 1.292030e+02 | -- | Inf
9.89/9.97 o 200
9.89/9.97 c * 9.8s| 482 | 4 | 4162 | 0.0 | 62M| 75 | - | 400 | 491 | 0 | 0 | 46 | 242 | 33 | 1.297934e+02 | 2.000000e+02 | 54.09%
9.99/10.01 c
9.99/10.01 c SCIP Status : problem is solved [optimal solution found]
9.99/10.01 c Solving Time (sec) : 9.79
9.99/10.01 c Solving Nodes : 607
9.99/10.01 c Primal Bound : +2.00000000000000e+02 (1 solutions)
9.99/10.01 c Dual Bound : +2.00000000000000e+02
9.99/10.01 c Gap : 0.00 %
9.99/10.02 s OPTIMUM FOUND
9.99/10.02 v -x400 x399 -x398 x397 -x396 x395 -x394 x393 -x392 x391 -x390 x389 x388 -x387 x386 -x385 -x384 x383 -x382 x381 x380 -x379 -x378
9.99/10.02 v x377 -x376 x375 -x374 x373 x372 -x371 x370 -x369 x368 -x367 -x366 x365 x364 -x363 -x362 x361 x360 -x359 -x358 x357 -x356 x355
9.99/10.02 v x354 -x353 x352 -x351 -x350 x349 x348 -x347 x346 -x345 -x344 x343 x342 -x341 x340 -x339 -x338 x337 -x336 x335 x334 -x333 -x332
9.99/10.02 v x331 x330 -x329 x328 -x327 -x326 x325 -x324 x323 x322 -x321 -x320 x319 -x318 x317 -x316 x315 x314 -x313 x312 -x311 -x310 x309
9.99/10.02 v x308 -x307 -x306 x305 -x304 x303 -x302 x301 x300 -x299 -x298 x297 x296 -x295 -x294 x293 x292 -x291 x290 -x289 -x288 x287
9.99/10.02 v -x286 x285 -x284 x283 x282 -x281 x280 -x279 -x278 x277 x276 -x275 -x274 x273 -x272 x271 x270 -x269 -x268 x267 x266 -x265 -x264
9.99/10.02 v x263 -x262 x261 x260 -x259 x258 -x257 -x256 x255 x254 -x253 -x252 x251 -x250 x249 -x248 x247 x246 -x245 x244 -x243 x242 -x241
9.99/10.02 v x240 -x239 -x238 x237 -x236 x235 -x234 x233 -x232 x231 -x230 x229 -x228 x227 x226 -x225 x224 -x223 -x222 x221 -x220 x219 -x218
9.99/10.02 v x217 -x216 x215 -x214 x213 x212 -x211 x210 -x209 x208 -x207 -x206 x205 x204 -x203 x202 -x201 -x200 x199 x198 -x197 -x196
9.99/10.02 v x195 -x194 x193 -x192 x191 -x190 x189 -x188 x187 x186 -x185 x184 -x183 -x182 x181 -x180 x179 -x178 x177 -x176 x175 -x174 x173
9.99/10.02 v x172 -x171 x170 -x169 -x168 x167 -x166 x165 x164 -x163 -x162 x161 x160 -x159 x158 -x157 -x156 x155 x154 -x153 -x152 x151 x150
9.99/10.02 v -x149 x148 -x147 -x146 x145 -x144 x143 x142 -x141 x140 -x139 x138 -x137 x136 -x135 x134 -x133 -x132 x131 x130 -x129 x128 -x127
9.99/10.02 v -x126 x125 -x124 x123 x122 -x121 x120 -x119 x118 -x117 x116 -x115 -x114 x113 -x112 x111 x110 -x109 x108 -x107 x106 -x105
9.99/10.02 v -x104 x103 x102 -x101 x100 -x99 x98 -x97 -x96 x95 -x94 x93 -x92 x91 x90 -x89 -x88 x87 x86 -x85 -x84 x83 x82 -x81 x80 -x79 -x78
9.99/10.02 v x77 -x76 x75 x74 -x73 x72 -x71 x70 -x69 x68 -x67 x66 -x65 -x64 x63 -x62 x61 -x60 x59 -x58 x57 -x56 x55 -x54 x53 -x52 x51 -x50
9.99/10.02 v x49 -x48 x47 -x46 x45 x44 -x43 x42 -x41 x40 -x39 x38 -x37 x36 -x35 -x34 x33 x32 -x31 x30 -x29 x28 -x27 -x26 x25 x24 -x23
9.99/10.02 v -x22 x21 -x20 x19 x18 -x17 -x16 x15 x14 -x13 x12 -x11 x10 -x9 -x8 x7 -x6 x5 x4 -x3 -x2 x1
9.99/10.02 c SCIP Status : problem is solved [optimal solution found]
9.99/10.02 c Solving Time : 9.79
9.99/10.02 c Original Problem :
9.99/10.02 c Problem name : HOME/instance-2667534-1276448623.opb
9.99/10.02 c Variables : 400 (400 binary, 0 integer, 0 implicit integer, 0 continuous)
9.99/10.02 c Constraints : 520 initial, 520 maximal
9.99/10.02 c Presolved Problem :
9.99/10.02 c Problem name : t_HOME/instance-2667534-1276448623.opb
9.99/10.02 c Variables : 400 (400 binary, 0 integer, 0 implicit integer, 0 continuous)
9.99/10.02 c Constraints : 520 initial, 566 maximal
9.99/10.02 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
9.99/10.02 c trivial : 0.00 0 0 0 0 0 0 0 0
9.99/10.02 c dualfix : 0.00 0 0 0 0 0 0 0 0
9.99/10.02 c boundshift : 0.00 0 0 0 0 0 0 0 0
9.99/10.02 c inttobinary : 0.00 0 0 0 0 0 0 0 0
9.99/10.02 c implics : 0.00 0 0 0 0 0 0 0 0
9.99/10.02 c probing : 0.01 0 0 0 0 0 0 0 0
9.99/10.02 c linear : 0.02 0 0 0 0 0 0 0 1
9.99/10.02 c logicor : 0.00 0 0 0 0 0 0 0 0
9.99/10.02 c root node : - 104 - - 104 - - - -
9.99/10.02 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
9.99/10.02 c integral : 0 0 0 1 0 0 0 0 0 2
9.99/10.02 c logicor : 520+ 23 4282 0 1 148 4869 0 0 0
9.99/10.02 c countsols : 0 0 0 0 1 0 0 0 0 0
9.99/10.02 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
9.99/10.02 c integral : 2.62 0.00 0.00 2.62 0.00
9.99/10.02 c logicor : 0.02 0.01 0.01 0.00 0.00
9.99/10.02 c countsols : 0.00 0.00 0.00 0.00 0.00
9.99/10.02 c Propagators : Time Calls Cutoffs DomReds
9.99/10.02 c vbounds : 0.00 2 0 0
9.99/10.02 c rootredcost : 0.00 1 0 0
9.99/10.02 c pseudoobj : 0.10 4710 0 0
9.99/10.02 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
9.99/10.02 c propagation : 0.00 148 146 146 3.8 148 3.3 -
9.99/10.02 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
9.99/10.02 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
9.99/10.02 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
9.99/10.02 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
9.99/10.02 c applied globally : - - - 294 3.6 - - -
9.99/10.02 c applied locally : - - - 0 0.0 - - -
9.99/10.02 c Separators : Time Calls Cutoffs DomReds Cuts Conss
9.99/10.02 c cut pool : 0.20 22 - - 878 - (maximal pool size: 5745)
9.99/10.02 c redcost : 0.00 23 0 0 0 0
9.99/10.02 c impliedbounds : 0.01 23 0 0 12 0
9.99/10.02 c intobj : 0.00 0 0 0 0 0
9.99/10.02 c cgmip : 0.00 0 0 0 0 0
9.99/10.02 c gomory : 2.70 23 0 0 172 0
9.99/10.02 c strongcg : 3.01 20 0 0 8670 0
9.99/10.02 c cmir : 0.06 10 0 0 0 0
9.99/10.02 c flowcover : 0.04 10 0 0 0 0
9.99/10.02 c clique : 0.00 1 0 0 0 0
9.99/10.02 c zerohalf : 0.00 0 0 0 0 0
9.99/10.02 c mcf : 0.01 1 0 0 0 0
9.99/10.02 c rapidlearning : 0.00 0 0 0 0 0
9.99/10.02 c Pricers : Time Calls Vars
9.99/10.02 c problem variables: 0.00 0 0
9.99/10.02 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
9.99/10.02 c relpscost : 2.62 1 0 0 0 0 2
9.99/10.02 c pscost : 0.00 0 0 0 0 0 0
9.99/10.02 c inference : 0.04 509 0 0 0 0 1018
9.99/10.02 c mostinf : 0.00 0 0 0 0 0 0
9.99/10.02 c leastinf : 0.00 0 0 0 0 0 0
9.99/10.02 c fullstrong : 0.00 0 0 0 0 0 0
9.99/10.02 c allfullstrong : 0.00 0 0 0 0 0 0
9.99/10.02 c random : 0.00 0 0 0 0 0 0
9.99/10.02 c Primal Heuristics : Time Calls Found
9.99/10.02 c LP solutions : 0.00 - 0
9.99/10.02 c pseudo solutions : 0.00 - 1
9.99/10.02 c oneopt : 0.00 0 0
9.99/10.02 c crossover : 0.00 0 0
9.99/10.02 c trivial : 0.00 2 0
9.99/10.02 c simplerounding : 0.00 0 0
9.99/10.02 c zirounding : 0.00 1 0
9.99/10.02 c rounding : 0.02 23 0
9.99/10.02 c shifting : 0.03 23 0
9.99/10.02 c intshifting : 0.00 0 0
9.99/10.02 c twoopt : 0.00 0 0
9.99/10.02 c fixandinfer : 0.00 0 0
9.99/10.02 c feaspump : 0.25 1 0
9.99/10.02 c coefdiving : 0.00 0 0
9.99/10.02 c pscostdiving : 0.00 0 0
9.99/10.02 c fracdiving : 0.00 0 0
9.99/10.02 c veclendiving : 0.00 0 0
9.99/10.02 c intdiving : 0.00 0 0
9.99/10.02 c actconsdiving : 0.00 0 0
9.99/10.02 c objpscostdiving : 0.00 0 0
9.99/10.02 c rootsoldiving : 0.00 0 0
9.99/10.02 c linesearchdiving : 0.00 0 0
9.99/10.02 c guideddiving : 0.00 0 0
9.99/10.02 c octane : 0.00 0 0
9.99/10.02 c rens : 0.00 0 0
9.99/10.02 c rins : 0.00 0 0
9.99/10.02 c localbranching : 0.00 0 0
9.99/10.02 c mutation : 0.00 0 0
9.99/10.02 c dins : 0.00 0 0
9.99/10.02 c undercover : 0.00 0 0
9.99/10.02 c nlp : 0.00 0 0
9.99/10.02 c trysol : 0.00 0 0
9.99/10.02 c LP : Time Calls Iterations Iter/call Iter/sec
9.99/10.02 c primal LP : 0.01 0 0 0.00 0.00
9.99/10.02 c dual LP : 0.54 23 2596 112.87 4807.41
9.99/10.02 c lex dual LP : 0.00 0 0 0.00 -
9.99/10.02 c barrier LP : 0.00 0 0 0.00 -
9.99/10.02 c diving/probing LP: 0.24 67 1566 23.37 6525.00
9.99/10.02 c strong branching : 2.62 33 8010 242.73 3057.25
9.99/10.02 c (at root node) : - 33 8010 242.73 -
9.99/10.02 c conflict analysis: 0.00 0 0 0.00 -
9.99/10.02 c B&B Tree :
9.99/10.02 c number of runs : 1
9.99/10.02 c nodes : 607
9.99/10.02 c nodes (total) : 607
9.99/10.02 c nodes left : 0
9.99/10.02 c max depth : 75
9.99/10.02 c max depth (total): 75
9.99/10.02 c backtracks : 66 (10.9%)
9.99/10.02 c delayed cutoffs : 414
9.99/10.02 c repropagations : 771 (2296 domain reductions, 52 cutoffs)
9.99/10.02 c avg switch length: 4.07
9.99/10.02 c switching time : 0.01
9.99/10.02 c Solution :
9.99/10.02 c Solutions found : 1 (1 improvements)
9.99/10.02 c First Solution : +2.00000000000000e+02 (in run 1, after 482 nodes, 9.75 seconds, depth 6, found by <relaxation>)
9.99/10.02 c Primal Bound : +2.00000000000000e+02 (in run 1, after 482 nodes, 9.75 seconds, depth 6, found by <relaxation>)
9.99/10.02 c Dual Bound : +2.00000000000000e+02
9.99/10.02 c Gap : 0.00 %
9.99/10.02 c Root Dual Bound : +1.29202951859788e+02
9.99/10.02 c Root Iterations : 4162
9.99/10.04 c Time complete: 10.03.