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-2666087-1276429139.opb>
0.00/0.02 c original problem has 400 variables (400 bin, 0 int, 0 impl, 0 cont) and 600 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, 600 upgd conss, 408 impls, 0 clqs
0.00/0.06 c (0.0s) probing: 101/400 (25.2%) - 0 fixings, 0 aggregations, 0 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 408 implications, 0 cliques
0.00/0.06 c presolved problem has 400 variables (400 bin, 0 int, 0 impl, 0 cont) and 600 constraints
0.00/0.06 c 600 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.09/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.09/0.20 c 0.2s| 1 | 0 | 840 | - |1852k| 0 | 400 | 400 | 600 | 400 | 600 | 0 | 0 | 0 | 1.335397e+02 | -- | Inf
0.49/0.56 c 0.5s| 1 | 0 | 861 | - |6864k| 0 | 397 | 400 | 600 | 400 | 602 | 2 | 0 | 0 | 1.336064e+02 | -- | Inf
0.89/0.93 c 0.9s| 1 | 0 | 902 | - | 11M| 0 | 397 | 400 | 600 | 400 | 603 | 3 | 0 | 0 | 1.337022e+02 | -- | Inf
1.29/1.31 c 1.3s| 1 | 0 | 935 | - | 16M| 0 | 397 | 400 | 600 | 400 | 604 | 4 | 0 | 0 | 1.337634e+02 | -- | Inf
1.69/1.71 c 1.6s| 1 | 0 | 971 | - | 21M| 0 | 398 | 400 | 600 | 400 | 606 | 6 | 0 | 0 | 1.338049e+02 | -- | Inf
2.10/2.14 c 2.1s| 1 | 0 | 1013 | - | 26M| 0 | 396 | 400 | 600 | 400 | 607 | 7 | 0 | 0 | 1.338258e+02 | -- | Inf
2.49/2.57 c 2.5s| 1 | 0 | 1063 | - | 30M| 0 | 397 | 400 | 600 | 400 | 609 | 9 | 0 | 0 | 1.338844e+02 | -- | Inf
2.89/2.99 c 2.9s| 1 | 0 | 1095 | - | 33M| 0 | 397 | 400 | 600 | 400 | 610 | 10 | 0 | 0 | 1.339331e+02 | -- | Inf
3.39/3.41 c 3.3s| 1 | 0 | 1118 | - | 36M| 0 | 396 | 400 | 600 | 400 | 611 | 11 | 0 | 0 | 1.339776e+02 | -- | Inf
3.79/3.80 c 3.7s| 1 | 0 | 1152 | - | 38M| 0 | 395 | 400 | 600 | 400 | 612 | 12 | 0 | 0 | 1.340079e+02 | -- | Inf
4.19/4.24 c 4.2s| 1 | 0 | 1196 | - | 43M| 0 | 397 | 400 | 600 | 400 | 613 | 13 | 0 | 0 | 1.340212e+02 | -- | Inf
4.59/4.67 c 4.6s| 1 | 0 | 1233 | - | 47M| 0 | 396 | 400 | 600 | 400 | 613 | 14 | 0 | 0 | 1.340241e+02 | -- | Inf
4.99/5.06 c 5.0s| 1 | 0 | 1272 | - | 48M| 0 | 395 | 400 | 600 | 400 | 614 | 15 | 0 | 0 | 1.340366e+02 | -- | Inf
5.39/5.43 c 5.3s| 1 | 0 | 1296 | - | 49M| 0 | 396 | 400 | 600 | 400 | 615 | 16 | 0 | 0 | 1.340448e+02 | -- | Inf
5.69/5.79 c 5.7s| 1 | 0 | 1333 | - | 49M| 0 | 397 | 400 | 600 | 400 | 616 | 17 | 0 | 0 | 1.340608e+02 | -- | Inf
6.09/6.16 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
6.09/6.16 c 6.1s| 1 | 0 | 1375 | - | 49M| 0 | 394 | 400 | 600 | 400 | 617 | 18 | 0 | 0 | 1.340679e+02 | -- | Inf
6.49/6.52 c 6.4s| 1 | 0 | 1409 | - | 49M| 0 | 395 | 400 | 600 | 400 | 618 | 19 | 0 | 0 | 1.340701e+02 | -- | Inf
6.88/6.90 c 6.8s| 1 | 0 | 1442 | - | 50M| 0 | 395 | 400 | 600 | 400 | 617 | 20 | 0 | 0 | 1.340747e+02 | -- | Inf
8.49/8.54 c 8.4s| 1 | 2 | 1442 | - | 50M| 0 | 395 | 400 | 600 | 400 | 617 | 20 | 0 | 19 | 1.340747e+02 | -- | Inf
8.70/8.76 o 200
8.70/8.76 c * 8.6s| 613 | 8 | 1442 | 0.0 | 50M| 53 | - | 400 | 614 | 0 | 0 | 20 | 449 | 19 | 1.343174e+02 | 2.000000e+02 | 48.90%
9.29/9.36 c
9.29/9.36 c SCIP Status : problem is solved [optimal solution found]
9.29/9.36 c Solving Time (sec) : 9.11
9.29/9.36 c Solving Nodes : 2032
9.29/9.36 c Primal Bound : +2.00000000000000e+02 (1 solutions)
9.29/9.36 c Dual Bound : +2.00000000000000e+02
9.29/9.36 c Gap : 0.00 %
9.29/9.36 s OPTIMUM FOUND
9.29/9.36 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
9.29/9.36 v -x376 x375 x374 -x373 x372 -x371 x370 -x369 -x368 x367 -x366 x365 x364 -x363 -x362 x361 x360 -x359 x358 -x357 x356 -x355
9.29/9.36 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.29/9.36 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.29/9.36 v -x308 x307 -x306 x305 x304 -x303 x302 -x301 x300 -x299 x298 -x297 -x296 x295 -x294 x293 -x292 x291 x290 -x289 -x288 x287
9.29/9.36 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.29/9.36 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.29/9.36 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.29/9.36 v x217 x216 -x215 -x214 x213 x212 -x211 -x210 x209 -x208 x207 x206 -x205 x204 -x203 x202 -x201 x200 -x199 x198 -x197 -x196
9.29/9.36 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.29/9.36 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.29/9.36 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.29/9.36 v -x126 x125 x124 -x123 -x122 x121 -x120 x119 x118 -x117 x116 -x115 x114 -x113 x112 -x111 -x110 x109 -x108 x107 -x106 x105
9.29/9.36 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.29/9.36 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.29/9.36 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.29/9.36 v x22 -x21 -x20 x19 -x18 x17 x16 -x15 x14 -x13 -x12 x11 x10 -x9 x8 -x7 x6 -x5 x4 -x3 x2 -x1
9.29/9.36 c SCIP Status : problem is solved [optimal solution found]
9.29/9.36 c Solving Time : 9.11
9.29/9.36 c Original Problem :
9.29/9.36 c Problem name : HOME/instance-2666087-1276429139.opb
9.29/9.36 c Variables : 400 (400 binary, 0 integer, 0 implicit integer, 0 continuous)
9.29/9.36 c Constraints : 600 initial, 600 maximal
9.29/9.36 c Presolved Problem :
9.29/9.36 c Problem name : t_HOME/instance-2666087-1276429139.opb
9.29/9.36 c Variables : 400 (400 binary, 0 integer, 0 implicit integer, 0 continuous)
9.29/9.36 c Constraints : 600 initial, 641 maximal
9.29/9.36 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
9.29/9.36 c trivial : 0.00 0 0 0 0 0 0 0 0
9.29/9.36 c dualfix : 0.00 0 0 0 0 0 0 0 0
9.29/9.36 c boundshift : 0.00 0 0 0 0 0 0 0 0
9.29/9.36 c inttobinary : 0.00 0 0 0 0 0 0 0 0
9.29/9.36 c implics : 0.00 0 0 0 0 0 0 0 0
9.29/9.36 c probing : 0.01 0 0 0 0 0 0 0 0
9.29/9.36 c linear : 0.01 0 0 0 0 0 0 0 1
9.29/9.36 c logicor : 0.01 0 0 0 0 0 0 0 0
9.29/9.36 c root node : - 71 - - 71 - - - -
9.29/9.36 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
9.29/9.36 c integral : 0 0 0 1 0 0 0 0 0 2
9.29/9.36 c logicor : 600+ 18 15265 0 1 739 22538 0 0 0
9.29/9.36 c countsols : 0 0 0 0 1 0 0 0 0 0
9.29/9.36 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
9.29/9.36 c integral : 1.22 0.00 0.00 1.22 0.00
9.29/9.36 c logicor : 0.09 0.00 0.09 0.00 0.00
9.29/9.36 c countsols : 0.00 0.00 0.00 0.00 0.00
9.29/9.36 c Propagators : Time Calls Cutoffs DomReds
9.29/9.36 c vbounds : 0.02 2 0 0
9.29/9.36 c rootredcost : 0.00 1 0 0
9.29/9.36 c pseudoobj : 0.36 17152 0 0
9.29/9.36 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
9.29/9.36 c propagation : 0.00 739 735 735 3.9 730 3.4 -
9.29/9.36 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
9.29/9.36 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
9.29/9.36 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
9.29/9.36 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
9.29/9.36 c applied globally : - - - 1465 3.6 - - -
9.29/9.36 c applied locally : - - - 0 0.0 - - -
9.29/9.36 c Separators : Time Calls Cutoffs DomReds Cuts Conss
9.29/9.36 c cut pool : 0.17 17 - - 169 - (maximal pool size: 4266)
9.29/9.36 c redcost : 0.00 18 0 0 0 0
9.29/9.36 c impliedbounds : 0.00 18 0 0 0 0
9.29/9.36 c intobj : 0.00 0 0 0 0 0
9.29/9.36 c cgmip : 0.00 0 0 0 0 0
9.29/9.36 c gomory : 3.08 18 0 0 8 0
9.29/9.36 c strongcg : 3.35 18 0 0 4758 0
9.29/9.36 c cmir : 0.06 10 0 0 0 0
9.29/9.36 c flowcover : 0.05 10 0 0 0 0
9.29/9.36 c clique : 0.00 1 0 0 0 0
9.29/9.36 c zerohalf : 0.00 0 0 0 0 0
9.29/9.36 c mcf : 0.00 1 0 0 0 0
9.29/9.36 c rapidlearning : 0.00 0 0 0 0 0
9.29/9.36 c Pricers : Time Calls Vars
9.29/9.36 c problem variables: 0.00 0 0
9.29/9.36 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
9.29/9.36 c relpscost : 1.22 1 0 0 0 0 2
9.29/9.36 c pscost : 0.00 0 0 0 0 0 0
9.29/9.36 c inference : 0.08 1601 0 0 0 0 3202
9.29/9.36 c mostinf : 0.00 0 0 0 0 0 0
9.29/9.36 c leastinf : 0.00 0 0 0 0 0 0
9.29/9.36 c fullstrong : 0.00 0 0 0 0 0 0
9.29/9.36 c allfullstrong : 0.00 0 0 0 0 0 0
9.29/9.36 c random : 0.00 0 0 0 0 0 0
9.29/9.36 c Primal Heuristics : Time Calls Found
9.29/9.36 c LP solutions : 0.00 - 0
9.29/9.36 c pseudo solutions : 0.00 - 1
9.29/9.36 c oneopt : 0.00 0 0
9.29/9.36 c crossover : 0.00 0 0
9.29/9.36 c trivial : 0.00 2 0
9.29/9.36 c simplerounding : 0.00 0 0
9.29/9.36 c zirounding : 0.00 1 0
9.29/9.36 c rounding : 0.00 18 0
9.29/9.36 c shifting : 0.02 18 0
9.29/9.36 c intshifting : 0.00 0 0
9.29/9.36 c twoopt : 0.00 0 0
9.29/9.36 c fixandinfer : 0.00 0 0
9.29/9.36 c feaspump : 0.00 1 0
9.29/9.36 c coefdiving : 0.00 0 0
9.29/9.36 c pscostdiving : 0.00 0 0
9.29/9.36 c fracdiving : 0.00 0 0
9.29/9.36 c veclendiving : 0.00 0 0
9.29/9.36 c intdiving : 0.00 0 0
9.29/9.36 c actconsdiving : 0.00 0 0
9.29/9.36 c objpscostdiving : 0.00 0 0
9.29/9.36 c rootsoldiving : 0.00 0 0
9.29/9.36 c linesearchdiving : 0.00 0 0
9.29/9.36 c guideddiving : 0.00 0 0
9.29/9.36 c octane : 0.00 0 0
9.29/9.36 c rens : 0.00 0 0
9.29/9.36 c rins : 0.00 0 0
9.29/9.36 c localbranching : 0.00 0 0
9.29/9.36 c mutation : 0.00 0 0
9.29/9.36 c dins : 0.00 0 0
9.29/9.36 c undercover : 0.00 0 0
9.29/9.36 c nlp : 0.00 0 0
9.29/9.36 c trysol : 0.00 0 0
9.29/9.36 c LP : Time Calls Iterations Iter/call Iter/sec
9.29/9.36 c primal LP : 0.02 0 0 0.00 0.00
9.29/9.36 c dual LP : 0.36 18 1442 80.11 4005.56
9.29/9.36 c lex dual LP : 0.00 0 0 0.00 -
9.29/9.36 c barrier LP : 0.00 0 0 0.00 -
9.29/9.36 c diving/probing LP: 0.00 0 0 0.00 -
9.29/9.36 c strong branching : 1.22 19 4524 238.11 3708.20
9.29/9.36 c (at root node) : - 19 4524 238.11 -
9.29/9.36 c conflict analysis: 0.00 0 0 0.00 -
9.29/9.36 c B&B Tree :
9.29/9.36 c number of runs : 1
9.29/9.36 c nodes : 2032
9.29/9.36 c nodes (total) : 2032
9.29/9.36 c nodes left : 0
9.29/9.36 c max depth : 53
9.29/9.36 c max depth (total): 53
9.29/9.36 c backtracks : 363 (17.9%)
9.29/9.36 c delayed cutoffs : 1173
9.29/9.36 c repropagations : 2765 (10379 domain reductions, 310 cutoffs)
9.29/9.36 c avg switch length: 4.03
9.29/9.36 c switching time : 0.08
9.29/9.36 c Solution :
9.29/9.36 c Solutions found : 1 (1 improvements)
9.29/9.36 c First Solution : +2.00000000000000e+02 (in run 1, after 613 nodes, 8.59 seconds, depth 12, found by <relaxation>)
9.29/9.36 c Primal Bound : +2.00000000000000e+02 (in run 1, after 613 nodes, 8.59 seconds, depth 12, found by <relaxation>)
9.29/9.36 c Dual Bound : +2.00000000000000e+02
9.29/9.36 c Gap : 0.00 %
9.29/9.36 c Root Dual Bound : +1.34074720901516e+02
9.29/9.36 c Root Iterations : 1442
9.29/9.38 c Time complete: 9.37.