0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [Expressions interpreter: NONE]
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-2666104-1276448611.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.02 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.04/0.05 c (0.0s) probing: 119/400 (29.8%) - 0 fixings, 0 aggregations, 8 implications, 0 bound changes
0.04/0.05 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.04/0.05 c presolving (3 rounds):
0.04/0.05 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
0.04/0.05 c 432 implications, 0 cliques
0.04/0.05 c presolved problem has 400 variables (400 bin, 0 int, 0 impl, 0 cont) and 520 constraints
0.04/0.05 c 520 constraints of type <logicor>
0.04/0.05 c transformed objective value is always integral (scale: 1)
0.04/0.05 c Presolving Time: 0.03
0.04/0.05 c - non default parameters ----------------------------------------------------------------------
0.04/0.05 c # SCIP version 1.2.1.2
0.04/0.05 c
0.04/0.05 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.04/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.05 c conflict/interconss = 0
0.04/0.05 c
0.04/0.05 c # should binary conflicts be preferred?
0.04/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.05 c conflict/preferbinary = TRUE
0.04/0.05 c
0.04/0.05 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.04/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.04/0.05 c constraints/agelimit = 1
0.04/0.05 c
0.04/0.05 c # should enforcement of pseudo solution be disabled?
0.04/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.05 c constraints/disableenfops = TRUE
0.04/0.05 c
0.04/0.05 c # frequency for displaying node information lines
0.04/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.04/0.05 c display/freq = 10000
0.04/0.05 c
0.04/0.05 c # maximal time in seconds to run
0.04/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.04/0.05 c limits/time = 1799.99
0.04/0.05 c
0.04/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.04/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.04/0.05 c limits/memory = 1620
0.04/0.05 c
0.04/0.05 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.04/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.05 c lp/solvefreq = 0
0.04/0.05 c
0.04/0.05 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.04/0.05 c # [type: char, range: {lafpsqd}, default: l]
0.04/0.05 c lp/pricing = a
0.04/0.05 c
0.04/0.05 c # should presolving try to simplify inequalities
0.04/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.05 c constraints/linear/simplifyinequalities = TRUE
0.04/0.05 c
0.04/0.05 c # should presolving try to simplify knapsacks
0.04/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.04/0.05 c
0.04/0.05 c # priority of node selection rule <dfs> in standard mode
0.04/0.05 c # [type: int, range: [-536870912,536870911], default: 0]
0.04/0.05 c nodeselection/dfs/stdpriority = 1000000
0.04/0.05 c
0.04/0.05 c -----------------------------------------------------------------------------------------------
0.04/0.05 c start solving
0.04/0.06 c
0.09/0.12 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.12 c 0.1s| 1 | 0 | 627 | - |1814k| 0 | 338 | 400 | 520 | 400 | 520 | 0 | 0 | 0 | 1.263863e+02 | -- | Inf
0.29/0.38 c 0.3s| 1 | 0 | 830 | - |4132k| 0 | 339 | 400 | 520 | 400 | 531 | 11 | 0 | 0 | 1.278749e+02 | -- | Inf
0.59/0.66 c 0.6s| 1 | 0 | 909 | - |7113k| 0 | 344 | 400 | 520 | 400 | 533 | 13 | 0 | 0 | 1.280112e+02 | -- | Inf
0.89/0.97 c 0.9s| 1 | 0 | 1023 | - | 10M| 0 | 343 | 400 | 520 | 400 | 535 | 15 | 0 | 0 | 1.281842e+02 | -- | Inf
1.19/1.26 c 1.2s| 1 | 0 | 1096 | - | 13M| 0 | 348 | 400 | 520 | 400 | 538 | 18 | 0 | 0 | 1.283576e+02 | -- | Inf
1.49/1.55 c 1.5s| 1 | 0 | 1190 | - | 16M| 0 | 343 | 400 | 520 | 400 | 540 | 20 | 0 | 0 | 1.283883e+02 | -- | Inf
1.79/1.88 c 1.8s| 1 | 0 | 1286 | - | 19M| 0 | 345 | 400 | 520 | 400 | 543 | 23 | 0 | 0 | 1.284576e+02 | -- | Inf
2.10/2.20 c 2.1s| 1 | 0 | 1415 | - | 23M| 0 | 345 | 400 | 520 | 400 | 546 | 26 | 0 | 0 | 1.288137e+02 | -- | Inf
2.39/2.48 c 2.4s| 1 | 0 | 1596 | - | 25M| 0 | 343 | 400 | 520 | 400 | 552 | 32 | 0 | 0 | 1.294603e+02 | -- | Inf
2.69/2.74 c 2.7s| 1 | 0 | 1684 | - | 28M| 0 | 341 | 400 | 520 | 400 | 554 | 34 | 0 | 0 | 1.295893e+02 | -- | Inf
2.99/3.02 c 2.9s| 1 | 0 | 1779 | - | 30M| 0 | 337 | 400 | 520 | 400 | 556 | 36 | 0 | 0 | 1.296796e+02 | -- | Inf
3.20/3.30 c 3.2s| 1 | 0 | 1945 | - | 33M| 0 | 343 | 400 | 520 | 400 | 557 | 41 | 0 | 0 | 1.300950e+02 | -- | Inf
3.59/3.60 c 3.5s| 1 | 0 | 1985 | - | 36M| 0 | 343 | 400 | 520 | 400 | 558 | 42 | 0 | 0 | 1.301217e+02 | -- | Inf
3.89/3.93 c 3.8s| 1 | 0 | 2086 | - | 39M| 0 | 344 | 400 | 520 | 400 | 559 | 43 | 0 | 0 | 1.301453e+02 | -- | Inf
4.19/4.25 c 4.2s| 1 | 0 | 2138 | - | 43M| 0 | 345 | 400 | 520 | 400 | 560 | 44 | 0 | 0 | 1.301504e+02 | -- | Inf
4.59/4.60 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.59/4.60 c 4.5s| 1 | 0 | 2182 | - | 46M| 0 | 345 | 400 | 520 | 400 | 561 | 45 | 0 | 0 | 1.301520e+02 | -- | Inf
4.89/4.95 c 4.8s| 1 | 0 | 2242 | - | 48M| 0 | 344 | 400 | 520 | 400 | 562 | 46 | 0 | 0 | 1.301585e+02 | -- | Inf
5.18/5.27 c 5.2s| 1 | 0 | 2287 | - | 50M| 0 | 345 | 400 | 520 | 400 | 557 | 47 | 0 | 0 | 1.301611e+02 | -- | Inf
5.50/5.58 c 5.5s| 1 | 0 | 2336 | - | 51M| 0 | 346 | 400 | 520 | 400 | 558 | 48 | 0 | 0 | 1.301628e+02 | -- | Inf
5.79/5.88 c 5.8s| 1 | 0 | 2367 | - | 51M| 0 | 345 | 400 | 520 | 400 | 559 | 49 | 0 | 0 | 1.301636e+02 | -- | Inf
6.09/6.20 c 6.1s| 1 | 0 | 2430 | - | 51M| 0 | 348 | 400 | 520 | 400 | 560 | 50 | 0 | 0 | 1.301649e+02 | -- | Inf
10.29/10.37 c 10.1s| 1 | 2 | 2430 | - | 51M| 0 | 348 | 400 | 520 | 400 | 560 | 50 | 0 | 47 | 1.301649e+02 | -- | Inf
10.48/10.52 o 200
10.48/10.52 c *10.3s| 428 | 4 | 2430 | 0.0 | 51M| 71 | - | 400 | 404 | 0 | 0 | 50 | 178 | 47 | 1.304561e+02 | 2.000000e+02 | 53.31%
10.48/10.56 c
10.48/10.56 c SCIP Status : problem is solved [optimal solution found]
10.48/10.56 c Solving Time (sec) : 10.29
10.48/10.56 c Solving Nodes : 493
10.48/10.56 c Primal Bound : +2.00000000000000e+02 (1 solutions)
10.48/10.56 c Dual Bound : +2.00000000000000e+02
10.48/10.56 c Gap : 0.00 %
10.48/10.56 s OPTIMUM FOUND
10.48/10.56 v -x400 x399 -x398 x397 -x396 x395 -x394 x393 -x392 x391 -x390 x389 x388 -x387 x386 -x385 -x384 x383 -x382 x381 x380 -x379 -x378
10.48/10.56 v x377 -x376 x375 -x374 x373 x372 -x371 x370 -x369 x368 -x367 -x366 x365 x364 -x363 -x362 x361 x360 -x359 -x358 x357 -x356 x355
10.48/10.56 v x354 -x353 x352 -x351 -x350 x349 x348 -x347 x346 -x345 -x344 x343 x342 -x341 x340 -x339 -x338 x337 -x336 x335 x334 -x333 -x332
10.48/10.56 v x331 x330 -x329 x328 -x327 -x326 x325 -x324 x323 x322 -x321 -x320 x319 -x318 x317 -x316 x315 x314 -x313 x312 -x311 -x310 x309
10.48/10.56 v x308 -x307 -x306 x305 -x304 x303 -x302 x301 x300 -x299 -x298 x297 x296 -x295 -x294 x293 x292 -x291 x290 -x289 -x288 x287
10.48/10.56 v -x286 x285 -x284 x283 x282 -x281 x280 -x279 -x278 x277 x276 -x275 -x274 x273 -x272 x271 x270 -x269 -x268 x267 x266 -x265 -x264
10.48/10.56 v x263 -x262 x261 x260 -x259 x258 -x257 -x256 x255 x254 -x253 -x252 x251 -x250 x249 -x248 x247 x246 -x245 x244 -x243 x242 -x241
10.48/10.56 v x240 -x239 -x238 x237 -x236 x235 -x234 x233 -x232 x231 -x230 x229 -x228 x227 x226 -x225 x224 -x223 -x222 x221 -x220 x219 -x218
10.48/10.56 v x217 -x216 x215 -x214 x213 x212 -x211 x210 -x209 x208 -x207 -x206 x205 x204 -x203 x202 -x201 -x200 x199 x198 -x197 -x196
10.48/10.56 v x195 -x194 x193 -x192 x191 -x190 x189 -x188 x187 x186 -x185 x184 -x183 -x182 x181 -x180 x179 -x178 x177 -x176 x175 -x174 x173
10.48/10.56 v x172 -x171 x170 -x169 -x168 x167 -x166 x165 x164 -x163 -x162 x161 x160 -x159 x158 -x157 -x156 x155 x154 -x153 -x152 x151 x150
10.48/10.56 v -x149 x148 -x147 -x146 x145 -x144 x143 x142 -x141 x140 -x139 x138 -x137 x136 -x135 x134 -x133 -x132 x131 x130 -x129 x128 -x127
10.48/10.56 v -x126 x125 -x124 x123 x122 -x121 x120 -x119 x118 -x117 x116 -x115 -x114 x113 -x112 x111 x110 -x109 x108 -x107 x106 -x105
10.48/10.56 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
10.48/10.56 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
10.48/10.56 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
10.48/10.56 v -x22 x21 -x20 x19 x18 -x17 -x16 x15 x14 -x13 x12 -x11 x10 -x9 -x8 x7 -x6 x5 x4 -x3 -x2 x1
10.48/10.56 c SCIP Status : problem is solved [optimal solution found]
10.48/10.56 c Solving Time : 10.29
10.48/10.56 c Original Problem :
10.48/10.56 c Problem name : HOME/instance-2666104-1276448611.opb
10.48/10.56 c Variables : 400 (400 binary, 0 integer, 0 implicit integer, 0 continuous)
10.48/10.56 c Constraints : 520 initial, 520 maximal
10.48/10.56 c Presolved Problem :
10.48/10.56 c Problem name : t_HOME/instance-2666104-1276448611.opb
10.48/10.56 c Variables : 400 (400 binary, 0 integer, 0 implicit integer, 0 continuous)
10.48/10.56 c Constraints : 520 initial, 558 maximal
10.48/10.56 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
10.48/10.56 c trivial : 0.00 0 0 0 0 0 0 0 0
10.48/10.56 c dualfix : 0.00 0 0 0 0 0 0 0 0
10.48/10.56 c boundshift : 0.00 0 0 0 0 0 0 0 0
10.48/10.56 c inttobinary : 0.00 0 0 0 0 0 0 0 0
10.48/10.56 c implics : 0.00 0 0 0 0 0 0 0 0
10.48/10.56 c probing : 0.01 0 0 0 0 0 0 0 0
10.48/10.56 c linear : 0.01 0 0 0 0 0 0 0 1
10.48/10.56 c logicor : 0.00 0 0 0 0 0 0 0 0
10.48/10.56 c root node : - 238 - - 238 - - - -
10.48/10.56 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
10.48/10.56 c integral : 0 0 0 1 0 0 0 0 0 2
10.48/10.56 c logicor : 520+ 21 3727 0 1 115 4372 0 0 0
10.48/10.56 c countsols : 0 0 0 0 1 0 0 0 0 0
10.48/10.56 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
10.48/10.56 c integral : 3.88 0.00 0.00 3.88 0.00
10.48/10.56 c logicor : 0.02 0.00 0.02 0.00 0.00
10.48/10.56 c countsols : 0.00 0.00 0.00 0.00 0.00
10.48/10.56 c Propagators : Time Calls Cutoffs DomReds
10.48/10.56 c vbounds : 0.00 2 0 0
10.48/10.56 c rootredcost : 0.01 1 0 0
10.48/10.56 c pseudoobj : 0.07 3910 0 0
10.48/10.56 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
10.48/10.56 c propagation : 0.00 115 114 114 3.4 95 3.0 -
10.48/10.56 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
10.48/10.56 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
10.48/10.56 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
10.48/10.56 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
10.48/10.56 c applied globally : - - - 209 3.2 - - -
10.48/10.56 c applied locally : - - - 0 0.0 - - -
10.48/10.56 c Separators : Time Calls Cutoffs DomReds Cuts Conss
10.48/10.56 c cut pool : 0.21 20 - - 189 - (maximal pool size: 5342)
10.48/10.56 c redcost : 0.00 21 0 0 0 0
10.48/10.56 c impliedbounds : 0.00 21 0 0 10 0
10.48/10.56 c intobj : 0.00 0 0 0 0 0
10.48/10.56 c cgmip : 0.00 0 0 0 0 0
10.48/10.56 c gomory : 2.43 21 0 0 227 0
10.48/10.56 c strongcg : 2.94 20 0 0 8117 0
10.48/10.56 c cmir : 0.01 10 0 0 0 0
10.48/10.56 c flowcover : 0.09 10 0 0 0 0
10.48/10.56 c clique : 0.00 1 0 0 0 0
10.48/10.56 c zerohalf : 0.00 0 0 0 0 0
10.48/10.56 c mcf : 0.00 1 0 0 0 0
10.48/10.56 c rapidlearning : 0.00 0 0 0 0 0
10.48/10.56 c Pricers : Time Calls Vars
10.48/10.56 c problem variables: 0.00 0 0
10.48/10.56 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
10.48/10.56 c relpscost : 3.88 1 0 0 0 0 2
10.48/10.56 c pscost : 0.00 0 0 0 0 0 0
10.48/10.56 c inference : 0.03 425 0 0 0 0 850
10.48/10.56 c mostinf : 0.00 0 0 0 0 0 0
10.48/10.56 c leastinf : 0.00 0 0 0 0 0 0
10.48/10.56 c fullstrong : 0.00 0 0 0 0 0 0
10.48/10.56 c allfullstrong : 0.00 0 0 0 0 0 0
10.48/10.56 c random : 0.00 0 0 0 0 0 0
10.48/10.56 c Primal Heuristics : Time Calls Found
10.48/10.56 c LP solutions : 0.00 - 0
10.48/10.56 c pseudo solutions : 0.00 - 1
10.48/10.56 c oneopt : 0.00 0 0
10.48/10.56 c crossover : 0.00 0 0
10.48/10.56 c trivial : 0.00 2 0
10.48/10.56 c simplerounding : 0.00 0 0
10.48/10.56 c zirounding : 0.00 1 0
10.48/10.56 c rounding : 0.00 21 0
10.48/10.56 c shifting : 0.04 21 0
10.48/10.56 c intshifting : 0.00 0 0
10.48/10.56 c twoopt : 0.00 0 0
10.48/10.56 c fixandinfer : 0.00 0 0
10.48/10.56 c feaspump : 0.00 1 0
10.48/10.56 c coefdiving : 0.00 0 0
10.48/10.56 c pscostdiving : 0.00 0 0
10.48/10.56 c fracdiving : 0.00 0 0
10.48/10.56 c veclendiving : 0.00 0 0
10.48/10.56 c intdiving : 0.00 0 0
10.48/10.56 c actconsdiving : 0.00 0 0
10.48/10.56 c objpscostdiving : 0.00 0 0
10.48/10.56 c rootsoldiving : 0.00 0 0
10.48/10.56 c linesearchdiving : 0.00 0 0
10.48/10.56 c guideddiving : 0.00 0 0
10.48/10.56 c octane : 0.00 0 0
10.48/10.56 c rens : 0.01 0 0
10.48/10.56 c rins : 0.00 0 0
10.48/10.56 c localbranching : 0.00 0 0
10.48/10.56 c mutation : 0.00 0 0
10.48/10.56 c dins : 0.00 0 0
10.48/10.56 c undercover : 0.00 0 0
10.48/10.56 c nlp : 0.00 0 0
10.48/10.56 c trysol : 0.00 0 0
10.48/10.56 c LP : Time Calls Iterations Iter/call Iter/sec
10.48/10.56 c primal LP : 0.00 0 0 0.00 -
10.48/10.56 c dual LP : 0.44 21 2430 115.71 5522.73
10.48/10.56 c lex dual LP : 0.00 0 0 0.00 -
10.48/10.56 c barrier LP : 0.00 0 0 0.00 -
10.48/10.56 c diving/probing LP: 0.00 0 0 0.00 -
10.48/10.56 c strong branching : 3.88 47 17845 379.68 4599.23
10.48/10.56 c (at root node) : - 47 17845 379.68 -
10.48/10.56 c conflict analysis: 0.00 0 0 0.00 -
10.48/10.56 c B&B Tree :
10.48/10.56 c number of runs : 1
10.48/10.56 c nodes : 493
10.48/10.56 c nodes (total) : 493
10.48/10.56 c nodes left : 0
10.48/10.56 c max depth : 71
10.48/10.56 c max depth (total): 71
10.48/10.56 c backtracks : 56 (11.4%)
10.48/10.56 c delayed cutoffs : 360
10.48/10.56 c repropagations : 491 (2064 domain reductions, 49 cutoffs)
10.48/10.56 c avg switch length: 3.54
10.48/10.56 c switching time : 0.00
10.48/10.56 c Solution :
10.48/10.56 c Solutions found : 1 (1 improvements)
10.48/10.56 c First Solution : +2.00000000000000e+02 (in run 1, after 428 nodes, 10.26 seconds, depth 6, found by <relaxation>)
10.48/10.56 c Primal Bound : +2.00000000000000e+02 (in run 1, after 428 nodes, 10.26 seconds, depth 6, found by <relaxation>)
10.48/10.56 c Dual Bound : +2.00000000000000e+02
10.48/10.56 c Gap : 0.00 %
10.48/10.56 c Root Dual Bound : +1.30164901800204e+02
10.48/10.56 c Root Iterations : 2430
10.48/10.58 c Time complete: 10.57.