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-2666120-1276458516.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, 4 chg coeffs, 0 upgd conss, 432 impls, 0 clqs
0.00/0.05 c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 4 chg coeffs, 520 upgd conss, 432 impls, 0 clqs
0.00/0.05 c (0.0s) probing: 101/400 (25.2%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.05 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.05 c presolving (3 rounds):
0.00/0.05 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 4 changed coefficients
0.00/0.05 c 432 implications, 0 cliques
0.00/0.05 c presolved problem has 400 variables (400 bin, 0 int, 0 impl, 0 cont) and 520 constraints
0.00/0.05 c 520 constraints of type <logicor>
0.00/0.05 c transformed objective value is always integral (scale: 1)
0.00/0.05 c Presolving Time: 0.02
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c # SCIP version 1.2.1.2
0.00/0.05 c
0.00/0.05 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c conflict/interconss = 0
0.00/0.05 c
0.00/0.05 c # should binary conflicts be preferred?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c conflict/preferbinary = TRUE
0.00/0.05 c
0.00/0.05 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c constraints/agelimit = 1
0.00/0.05 c
0.00/0.05 c # should enforcement of pseudo solution be disabled?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/disableenfops = TRUE
0.00/0.05 c
0.00/0.05 c # frequency for displaying node information lines
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.05 c display/freq = 10000
0.00/0.05 c
0.00/0.05 c # maximal time in seconds to run
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/time = 1799.99
0.00/0.05 c
0.00/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/memory = 1620
0.00/0.05 c
0.00/0.05 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c lp/solvefreq = 0
0.00/0.05 c
0.00/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.00/0.05 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.05 c lp/pricing = a
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify inequalities
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/linear/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify knapsacks
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # priority of node selection rule <dfs> in standard mode
0.00/0.05 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.05 c nodeselection/dfs/stdpriority = 1000000
0.00/0.05 c
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c start solving
0.00/0.05 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 | 635 | - |1802k| 0 | 334 | 400 | 520 | 400 | 520 | 0 | 0 | 0 | 1.258087e+02 | -- | Inf
0.39/0.40 c 0.4s| 1 | 0 | 720 | - |4561k| 0 | 340 | 400 | 520 | 400 | 524 | 4 | 0 | 0 | 1.266626e+02 | -- | Inf
0.59/0.66 c 0.6s| 1 | 0 | 784 | - |7391k| 0 | 339 | 400 | 520 | 400 | 525 | 5 | 0 | 0 | 1.267256e+02 | -- | Inf
0.89/0.96 c 0.9s| 1 | 0 | 858 | - | 10M| 0 | 337 | 400 | 520 | 400 | 526 | 6 | 0 | 0 | 1.267552e+02 | -- | Inf
1.19/1.26 c 1.2s| 1 | 0 | 895 | - | 13M| 0 | 342 | 400 | 520 | 400 | 527 | 7 | 0 | 0 | 1.267595e+02 | -- | Inf
1.49/1.58 c 1.5s| 1 | 0 | 950 | - | 15M| 0 | 341 | 400 | 520 | 400 | 528 | 8 | 0 | 0 | 1.267683e+02 | -- | Inf
1.89/1.93 c 1.9s| 1 | 0 | 1049 | - | 18M| 0 | 345 | 400 | 520 | 400 | 530 | 10 | 0 | 0 | 1.268094e+02 | -- | Inf
2.20/2.25 c 2.2s| 1 | 0 | 1120 | - | 21M| 0 | 343 | 400 | 520 | 400 | 531 | 11 | 0 | 0 | 1.268221e+02 | -- | Inf
2.49/2.59 c 2.5s| 1 | 0 | 1224 | - | 24M| 0 | 344 | 400 | 520 | 400 | 532 | 12 | 0 | 0 | 1.268351e+02 | -- | Inf
2.89/2.90 c 2.8s| 1 | 0 | 1349 | - | 25M| 0 | 334 | 400 | 520 | 400 | 535 | 15 | 0 | 0 | 1.268940e+02 | -- | Inf
3.20/3.23 c 3.1s| 1 | 0 | 1487 | - | 28M| 0 | 337 | 400 | 520 | 400 | 538 | 18 | 0 | 0 | 1.270296e+02 | -- | Inf
3.49/3.54 c 3.5s| 1 | 0 | 1547 | - | 30M| 0 | 339 | 400 | 520 | 400 | 538 | 19 | 0 | 0 | 1.270787e+02 | -- | Inf
3.79/3.84 c 3.8s| 1 | 0 | 1588 | - | 33M| 0 | 338 | 400 | 520 | 400 | 539 | 20 | 0 | 0 | 1.270927e+02 | -- | Inf
4.09/4.16 c 4.1s| 1 | 0 | 1699 | - | 36M| 0 | 346 | 400 | 520 | 400 | 541 | 22 | 0 | 0 | 1.272220e+02 | -- | Inf
4.40/4.46 c 4.4s| 1 | 0 | 1749 | - | 39M| 0 | 342 | 400 | 520 | 400 | 543 | 24 | 0 | 0 | 1.272418e+02 | -- | Inf
4.69/4.79 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.69/4.79 c 4.7s| 1 | 0 | 1825 | - | 42M| 0 | 347 | 400 | 520 | 400 | 544 | 25 | 0 | 0 | 1.272847e+02 | -- | Inf
5.09/5.14 c 5.0s| 1 | 0 | 1899 | - | 46M| 0 | 343 | 400 | 520 | 400 | 545 | 26 | 0 | 0 | 1.272997e+02 | -- | Inf
5.40/5.50 c 5.4s| 1 | 0 | 1948 | - | 49M| 0 | 336 | 400 | 520 | 400 | 546 | 27 | 0 | 0 | 1.273077e+02 | -- | Inf
5.79/5.85 c 5.7s| 1 | 0 | 2013 | - | 52M| 0 | 344 | 400 | 520 | 400 | 547 | 28 | 0 | 0 | 1.273147e+02 | -- | Inf
6.19/6.21 c 6.1s| 1 | 0 | 2171 | - | 55M| 0 | 347 | 400 | 520 | 400 | 549 | 30 | 0 | 0 | 1.274507e+02 | -- | Inf
6.50/6.57 c 6.4s| 1 | 0 | 2247 | - | 59M| 0 | 343 | 400 | 520 | 400 | 550 | 31 | 0 | 0 | 1.274713e+02 | -- | Inf
6.69/6.73 c 6.6s| 1 | 0 | 2266 | - | 59M| 0 | 346 | 400 | 520 | 400 | 551 | 32 | 0 | 0 | 1.274734e+02 | -- | Inf
6.89/6.91 c 6.8s| 1 | 0 | 2292 | - | 59M| 0 | 348 | 400 | 520 | 400 | 552 | 33 | 0 | 0 | 1.274765e+02 | -- | Inf
8.19/8.22 c 8.1s| 1 | 2 | 2292 | - | 59M| 0 | 348 | 400 | 520 | 400 | 552 | 33 | 0 | 20 | 1.274765e+02 | -- | Inf
8.39/8.42 o 200
8.39/8.42 c * 8.2s| 594 | 1 | 2292 | 0.0 | 59M| 75 | - | 400 | 83 | 0 | 0 | 33 | 258 | 20 | 1.277452e+02 | 2.000000e+02 | 56.56%
8.39/8.42 c
8.39/8.42 c SCIP Status : problem is solved [optimal solution found]
8.39/8.42 c Solving Time (sec) : 8.24
8.39/8.42 c Solving Nodes : 594
8.39/8.42 c Primal Bound : +2.00000000000000e+02 (1 solutions)
8.39/8.42 c Dual Bound : +2.00000000000000e+02
8.39/8.42 c Gap : 0.00 %
8.39/8.42 s OPTIMUM FOUND
8.39/8.42 v x400 -x399 -x398 x397 -x396 x395 x394 -x393 -x392 x391 x390 -x389 x388 -x387 x386 -x385 -x384 x383 x382 -x381 x380 -x379 x378 -x377
8.39/8.42 v -x376 x375 x374 -x373 -x372 x371 -x370 x369 x368 -x367 -x366 x365 -x364 x363 x362 -x361 x360 -x359 x358 -x357 x356 -x355
8.39/8.42 v x354 -x353 -x352 x351 x350 -x349 x348 -x347 x346 -x345 x344 -x343 x342 -x341 -x340 x339 x338 -x337 -x336 x335 -x334 x333 -x332
8.39/8.42 v x331 -x330 x329 -x328 x327 x326 -x325 x324 -x323 -x322 x321 x320 -x319 x318 -x317 -x316 x315 x314 -x313 x312 -x311 -x310 x309
8.39/8.42 v x308 -x307 x306 -x305 x304 -x303 x302 -x301 -x300 x299 -x298 x297 -x296 x295 x294 -x293 x292 -x291 -x290 x289 x288 -x287
8.39/8.42 v -x286 x285 x284 -x283 x282 -x281 -x280 x279 -x278 x277 x276 -x275 x274 -x273 x272 -x271 -x270 x269 -x268 x267 x266 -x265 -x264
8.39/8.42 v x263 x262 -x261 x260 -x259 x258 -x257 -x256 x255 x254 -x253 x252 -x251 x250 -x249 -x248 x247 x246 -x245 x244 -x243 x242 -x241
8.39/8.42 v -x240 x239 -x238 x237 -x236 x235 -x234 x233 x232 -x231 -x230 x229 -x228 x227 x226 -x225 -x224 x223 -x222 x221 -x220 x219 x218
8.39/8.42 v -x217 -x216 x215 -x214 x213 -x212 x211 x210 -x209 x208 -x207 -x206 x205 -x204 x203 -x202 x201 x200 -x199 -x198 x197 -x196
8.39/8.42 v x195 x194 -x193 -x192 x191 x190 -x189 x188 -x187 x186 -x185 -x184 x183 x182 -x181 -x180 x179 x178 -x177 -x176 x175 -x174 x173
8.39/8.42 v -x172 x171 x170 -x169 -x168 x167 x166 -x165 x164 -x163 -x162 x161 -x160 x159 x158 -x157 x156 -x155 x154 -x153 x152 -x151 -x150
8.39/8.42 v x149 x148 -x147 x146 -x145 x144 -x143 x142 -x141 -x140 x139 -x138 x137 x136 -x135 x134 -x133 -x132 x131 -x130 x129 x128 -x127
8.39/8.42 v x126 -x125 -x124 x123 x122 -x121 -x120 x119 x118 -x117 -x116 x115 x114 -x113 -x112 x111 x110 -x109 x108 -x107 -x106 x105
8.39/8.42 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
8.39/8.42 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
8.39/8.42 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
8.39/8.42 v -x22 x21 x20 -x19 -x18 x17 -x16 x15 x14 -x13 x12 -x11 x10 -x9 -x8 x7 x6 -x5 -x4 x3 -x2 x1
8.39/8.42 c SCIP Status : problem is solved [optimal solution found]
8.39/8.42 c Solving Time : 8.24
8.39/8.42 c Original Problem :
8.39/8.42 c Problem name : HOME/instance-2666120-1276458516.opb
8.39/8.42 c Variables : 400 (400 binary, 0 integer, 0 implicit integer, 0 continuous)
8.39/8.42 c Constraints : 520 initial, 520 maximal
8.39/8.42 c Presolved Problem :
8.39/8.42 c Problem name : t_HOME/instance-2666120-1276458516.opb
8.39/8.42 c Variables : 400 (400 binary, 0 integer, 0 implicit integer, 0 continuous)
8.39/8.42 c Constraints : 520 initial, 548 maximal
8.39/8.42 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
8.39/8.42 c trivial : 0.00 0 0 0 0 0 0 0 0
8.39/8.42 c dualfix : 0.00 0 0 0 0 0 0 0 0
8.39/8.42 c boundshift : 0.00 0 0 0 0 0 0 0 0
8.39/8.42 c inttobinary : 0.00 0 0 0 0 0 0 0 0
8.39/8.42 c implics : 0.00 0 0 0 0 0 0 0 0
8.39/8.42 c probing : 0.00 0 0 0 0 0 0 0 0
8.39/8.42 c linear : 0.01 0 0 0 0 0 0 0 4
8.39/8.42 c logicor : 0.01 0 0 0 0 0 0 0 0
8.39/8.42 c root node : - 400 - - 400 - - - -
8.39/8.42 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
8.39/8.42 c integral : 0 0 0 1 0 0 0 0 0 2
8.39/8.42 c logicor : 520+ 23 3697 0 1 142 4127 0 0 0
8.39/8.42 c countsols : 0 0 0 0 1 0 0 0 0 0
8.39/8.42 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
8.39/8.42 c integral : 1.10 0.00 0.00 1.10 0.00
8.39/8.42 c logicor : 0.04 0.00 0.04 0.00 0.00
8.39/8.42 c countsols : 0.00 0.00 0.00 0.00 0.00
8.39/8.42 c Propagators : Time Calls Cutoffs DomReds
8.39/8.42 c vbounds : 0.00 2 0 0
8.39/8.42 c rootredcost : 0.00 0 0 0
8.39/8.42 c pseudoobj : 0.07 4102 0 0
8.39/8.42 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
8.39/8.42 c propagation : 0.01 142 142 142 3.4 116 3.1 -
8.39/8.42 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
8.39/8.42 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
8.39/8.42 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
8.39/8.42 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
8.39/8.42 c applied globally : - - - 258 3.3 - - -
8.39/8.42 c applied locally : - - - 0 0.0 - - -
8.39/8.42 c Separators : Time Calls Cutoffs DomReds Cuts Conss
8.39/8.42 c cut pool : 0.24 22 - - 441 - (maximal pool size: 5805)
8.39/8.42 c redcost : 0.00 23 0 0 0 0
8.39/8.42 c impliedbounds : 0.01 23 0 0 0 0
8.39/8.42 c intobj : 0.00 0 0 0 0 0
8.39/8.42 c cgmip : 0.00 0 0 0 0 0
8.39/8.42 c gomory : 2.81 23 0 0 120 0
8.39/8.42 c strongcg : 3.22 20 0 0 9156 0
8.39/8.42 c cmir : 0.04 10 0 0 0 0
8.39/8.42 c flowcover : 0.06 10 0 0 0 0
8.39/8.42 c clique : 0.00 1 0 0 0 0
8.39/8.42 c zerohalf : 0.00 0 0 0 0 0
8.39/8.42 c mcf : 0.00 1 0 0 0 0
8.39/8.42 c rapidlearning : 0.00 0 0 0 0 0
8.39/8.42 c Pricers : Time Calls Vars
8.39/8.42 c problem variables: 0.00 0 0
8.39/8.42 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
8.39/8.42 c relpscost : 1.10 1 0 0 0 0 2
8.39/8.42 c pscost : 0.00 0 0 0 0 0 0
8.39/8.42 c inference : 0.02 510 0 0 0 0 1020
8.39/8.42 c mostinf : 0.00 0 0 0 0 0 0
8.39/8.42 c leastinf : 0.00 0 0 0 0 0 0
8.39/8.42 c fullstrong : 0.00 0 0 0 0 0 0
8.39/8.42 c allfullstrong : 0.00 0 0 0 0 0 0
8.39/8.42 c random : 0.00 0 0 0 0 0 0
8.39/8.42 c Primal Heuristics : Time Calls Found
8.39/8.42 c LP solutions : 0.00 - 0
8.39/8.42 c pseudo solutions : 0.00 - 1
8.39/8.42 c oneopt : 0.00 0 0
8.39/8.42 c crossover : 0.00 0 0
8.39/8.42 c trivial : 0.00 2 0
8.39/8.42 c simplerounding : 0.00 0 0
8.39/8.42 c zirounding : 0.00 1 0
8.39/8.42 c rounding : 0.02 23 0
8.39/8.42 c shifting : 0.01 23 0
8.39/8.42 c intshifting : 0.00 0 0
8.39/8.42 c twoopt : 0.00 0 0
8.39/8.42 c fixandinfer : 0.00 0 0
8.39/8.42 c feaspump : 0.01 1 0
8.39/8.42 c coefdiving : 0.00 0 0
8.39/8.42 c pscostdiving : 0.00 0 0
8.39/8.42 c fracdiving : 0.00 0 0
8.39/8.42 c veclendiving : 0.00 0 0
8.39/8.42 c intdiving : 0.00 0 0
8.39/8.42 c actconsdiving : 0.00 0 0
8.39/8.42 c objpscostdiving : 0.00 0 0
8.39/8.42 c rootsoldiving : 0.00 0 0
8.39/8.42 c linesearchdiving : 0.00 0 0
8.39/8.42 c guideddiving : 0.00 0 0
8.39/8.42 c octane : 0.00 0 0
8.39/8.42 c rens : 0.01 0 0
8.39/8.42 c rins : 0.00 0 0
8.39/8.42 c localbranching : 0.00 0 0
8.39/8.42 c mutation : 0.00 0 0
8.39/8.42 c dins : 0.00 0 0
8.39/8.42 c undercover : 0.00 0 0
8.39/8.42 c nlp : 0.00 0 0
8.39/8.42 c trysol : 0.00 0 0
8.39/8.42 c LP : Time Calls Iterations Iter/call Iter/sec
8.39/8.42 c primal LP : 0.00 0 0 0.00 -
8.39/8.42 c dual LP : 0.44 23 2292 99.65 5209.09
8.39/8.42 c lex dual LP : 0.00 0 0 0.00 -
8.39/8.42 c barrier LP : 0.00 0 0 0.00 -
8.39/8.42 c diving/probing LP: 0.00 0 0 0.00 -
8.39/8.42 c strong branching : 1.10 20 5120 256.00 4654.55
8.39/8.42 c (at root node) : - 20 5120 256.00 -
8.39/8.42 c conflict analysis: 0.00 0 0 0.00 -
8.39/8.42 c B&B Tree :
8.39/8.42 c number of runs : 1
8.39/8.42 c nodes : 594
8.39/8.42 c nodes (total) : 594
8.39/8.42 c nodes left : 0
8.39/8.42 c max depth : 75
8.39/8.42 c max depth (total): 75
8.39/8.42 c backtracks : 68 (11.4%)
8.39/8.42 c delayed cutoffs : 429
8.39/8.42 c repropagations : 787 (1889 domain reductions, 60 cutoffs)
8.39/8.42 c avg switch length: 4.18
8.39/8.42 c switching time : 0.02
8.39/8.42 c Solution :
8.39/8.42 c Solutions found : 1 (1 improvements)
8.39/8.42 c First Solution : +2.00000000000000e+02 (in run 1, after 594 nodes, 8.24 seconds, depth 2, found by <relaxation>)
8.39/8.42 c Primal Bound : +2.00000000000000e+02 (in run 1, after 594 nodes, 8.24 seconds, depth 2, found by <relaxation>)
8.39/8.42 c Dual Bound : +2.00000000000000e+02
8.39/8.42 c Gap : 0.00 %
8.39/8.42 c Root Dual Bound : +1.27476479823005e+02
8.39/8.42 c Root Iterations : 2292
8.39/8.44 c Time complete: 8.43.