0.00/0.00 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.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-2667627-1276592105.opb>
0.00/0.02 c original problem has 515 variables (515 bin, 0 int, 0 impl, 0 cont) and 559 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.00/0.03 o 515
0.00/0.03 c feasible solution found by trivial heuristic, objective value 5.150000e+02
0.00/0.03 c presolving:
0.00/0.03 c (round 1) 6 del vars, 6 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 110 impls, 0 clqs
0.00/0.04 c (round 2) 13 del vars, 15 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 110 impls, 0 clqs
0.00/0.04 c (round 3) 14 del vars, 16 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 110 impls, 0 clqs
0.00/0.05 c (round 4) 14 del vars, 155 del conss, 0 chg bounds, 136 chg sides, 0 chg coeffs, 0 upgd conss, 110 impls, 0 clqs
0.00/0.05 c (round 5) 25 del vars, 165 del conss, 0 chg bounds, 136 chg sides, 0 chg coeffs, 0 upgd conss, 110 impls, 0 clqs
0.00/0.05 c (round 6) 35 del vars, 197 del conss, 0 chg bounds, 136 chg sides, 0 chg coeffs, 0 upgd conss, 110 impls, 0 clqs
0.00/0.05 c (round 7) 38 del vars, 199 del conss, 0 chg bounds, 136 chg sides, 0 chg coeffs, 0 upgd conss, 110 impls, 0 clqs
0.00/0.05 c (round 8) 40 del vars, 203 del conss, 0 chg bounds, 136 chg sides, 0 chg coeffs, 0 upgd conss, 110 impls, 0 clqs
0.00/0.06 c (round 9) 40 del vars, 203 del conss, 0 chg bounds, 136 chg sides, 0 chg coeffs, 356 upgd conss, 110 impls, 0 clqs
0.00/0.07 c (0.0s) probing: 101/475 (21.3%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.07 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.07 c presolving (10 rounds):
0.00/0.07 c 40 deleted vars, 203 deleted constraints, 0 tightened bounds, 0 added holes, 136 changed sides, 0 changed coefficients
0.00/0.07 c 110 implications, 0 cliques
0.00/0.07 c presolved problem has 475 variables (475 bin, 0 int, 0 impl, 0 cont) and 356 constraints
0.00/0.07 c 356 constraints of type <logicor>
0.00/0.07 c transformed objective value is always integral (scale: 1)
0.00/0.07 c Presolving Time: 0.02
0.00/0.07 c - non default parameters ----------------------------------------------------------------------
0.00/0.07 c # SCIP version 1.2.1.2
0.00/0.07 c
0.00/0.07 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c conflict/interconss = 0
0.00/0.07 c
0.00/0.07 c # should binary conflicts be preferred?
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c conflict/preferbinary = TRUE
0.00/0.07 c
0.00/0.07 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c constraints/agelimit = 1
0.00/0.07 c
0.00/0.07 c # should enforcement of pseudo solution be disabled?
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/disableenfops = TRUE
0.00/0.07 c
0.00/0.07 c # frequency for displaying node information lines
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.07 c display/freq = 10000
0.00/0.07 c
0.00/0.07 c # maximal time in seconds to run
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/time = 1799.99
0.00/0.07 c
0.00/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/memory = 1620
0.00/0.07 c
0.00/0.07 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c lp/solvefreq = 0
0.00/0.07 c
0.00/0.07 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.07 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.07 c lp/pricing = a
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify inequalities
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/linear/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify knapsacks
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # priority of node selection rule <dfs> in standard mode
0.00/0.07 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.07 c nodeselection/dfs/stdpriority = 1000000
0.00/0.07 c
0.00/0.07 c -----------------------------------------------------------------------------------------------
0.00/0.07 c start solving
0.00/0.07 c
0.00/0.07 o 494
0.00/0.07 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.07 c t 0.0s| 1 | 0 | 0 | - |1371k| 0 | - | 475 | 356 | 0 | 0 | 0 | 0 | 0 | -- | 4.940000e+02 | Inf
0.00/0.07 o 141
0.00/0.07 c b 0.0s| 1 | 0 | 0 | - |1698k| 0 | - | 475 | 356 | 475 | 356 | 0 | 0 | 0 | -- | 1.410000e+02 | Inf
0.09/0.11 c 0.1s| 1 | 0 | 539 | - |1691k| 0 | 72 | 475 | 356 | 475 | 356 | 0 | 0 | 0 | 1.121111e+02 | 1.410000e+02 | 25.77%
0.09/0.19 c 0.1s| 1 | 0 | 583 | - |2159k| 0 | 108 | 475 | 356 | 475 | 358 | 2 | 0 | 0 | 1.123939e+02 | 1.410000e+02 | 25.45%
0.19/0.29 c 0.2s| 1 | 0 | 640 | - |2600k| 0 | 127 | 475 | 356 | 475 | 359 | 3 | 0 | 0 | 1.124901e+02 | 1.410000e+02 | 25.34%
0.39/0.43 c 0.4s| 1 | 0 | 667 | - |3007k| 0 | 114 | 475 | 356 | 475 | 361 | 5 | 0 | 0 | 1.126154e+02 | 1.410000e+02 | 25.20%
0.49/0.53 c 0.5s| 1 | 0 | 693 | - |3292k| 0 | 153 | 475 | 356 | 475 | 362 | 6 | 0 | 0 | 1.130000e+02 | 1.410000e+02 | 24.78%
0.59/0.65 c 0.6s| 1 | 0 | 694 | - |3475k| 0 | 0 | 475 | 356 | 475 | 363 | 7 | 0 | 0 | 1.130000e+02 | 1.410000e+02 | 24.78%
0.59/0.65 o 113
0.59/0.65 c * 0.6s| 1 | 0 | 694 | - |3482k| 0 | - | 475 | 356 | 475 | 363 | 7 | 0 | 0 | 1.130000e+02 | 1.130000e+02 | 0.00%
0.59/0.65 c
0.59/0.65 c SCIP Status : problem is solved [optimal solution found]
0.59/0.65 c Solving Time (sec) : 0.60
0.59/0.65 c Solving Nodes : 1
0.59/0.65 c Primal Bound : +1.13000000000000e+02 (10 solutions)
0.59/0.65 c Dual Bound : +1.13000000000000e+02
0.59/0.65 c Gap : 0.00 %
0.59/0.65 s OPTIMUM FOUND
0.59/0.65 v -x515 -x514 -x513 -x512 -x511 -x510 x509 -x508 -x507 -x506 x505 -x504 -x503 -x502 -x501 -x500 -x499 -x498 -x497 -x496 x495 -x494
0.59/0.65 v -x493 -x492 -x491 -x490 -x489 -x488 x487 x486 -x485 -x484 -x483 -x482 -x481 -x480 x479 x478 -x477 x476 -x475 -x474 x473 -x472
0.59/0.65 v -x471 -x470 -x469 x468 x467 -x466 -x465 -x464 -x463 -x462 -x461 -x460 -x459 -x458 -x457 -x456 x455 -x454 -x453 -x452 -x451
0.59/0.65 v x450 x449 -x448 x447 -x446 -x445 x444 -x443 -x442 -x441 x440 -x439 -x438 -x437 -x436 -x435 x434 -x433 -x432 x431 -x430 x429
0.59/0.65 v -x428 x427 -x426 -x425 -x424 -x423 -x422 -x421 -x420 -x419 x418 -x417 x416 -x415 -x414 -x413 -x412 -x411 -x410 -x409 -x408 -x407
0.59/0.65 v x406 -x405 -x404 x403 -x402 -x401 -x400 -x399 -x398 -x397 -x396 x395 x394 -x393 -x392 x391 -x390 -x389 -x388 x387 -x386 -x385
0.59/0.65 v x384 -x383 -x382 -x381 x380 -x379 -x378 -x377 x376 -x375 -x374 -x373 -x372 -x371 -x370 -x369 -x368 -x367 -x366 -x365 -x364
0.59/0.65 v -x363 -x362 -x361 -x360 -x359 -x358 -x357 -x356 -x355 -x354 -x353 -x352 -x351 -x350 x349 -x348 -x347 x346 x345 -x344 -x343
0.59/0.65 v -x342 -x341 -x340 -x339 -x338 -x337 -x336 -x335 x334 -x333 x332 -x331 x330 -x329 -x328 -x327 -x326 -x325 x324 x323 x322 x321
0.59/0.65 v -x320 x319 x318 -x317 -x316 x315 -x314 -x313 -x312 x311 -x310 -x309 -x308 -x307 -x306 -x305 -x304 -x303 -x302 x301 -x300 x299
0.59/0.65 v -x298 -x297 -x296 -x295 -x294 -x293 -x292 x291 -x290 -x289 -x288 x287 x286 -x285 -x284 -x283 -x282 x281 x280 -x279 x278 -x277
0.59/0.65 v -x276 x275 -x274 x273 -x272 -x271 -x270 -x269 -x268 -x267 -x266 x265 -x264 x263 -x262 -x261 -x260 -x259 -x258 x257 -x256 -x255
0.59/0.65 v x254 -x253 -x252 -x251 -x250 -x249 x248 -x247 -x246 -x245 -x244 -x243 -x242 x241 x240 -x239 -x238 -x237 -x236 -x235 -x234
0.59/0.65 v -x233 -x232 -x231 -x230 -x229 -x228 -x227 -x226 x225 -x224 -x223 -x222 -x221 -x220 -x219 -x218 -x217 -x216 -x215 -x214 x213
0.59/0.65 v -x212 -x211 x210 -x209 -x208 x207 x206 x205 -x204 x203 x202 -x201 -x200 -x199 -x198 -x197 -x196 -x195 -x194 x193 -x192 x191
0.59/0.65 v -x190 -x189 x188 -x187 -x186 x185 -x184 -x183 -x182 -x181 -x180 -x179 x178 -x177 -x176 -x175 x174 -x173 -x172 -x171 -x170 -x169
0.59/0.65 v x168 -x167 x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 x152 -x151 -x150 -x149 x148
0.59/0.65 v x147 -x146 -x145 x144 -x143 x142 x141 x140 x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 x128 -x127 -x126
0.59/0.65 v -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 x117 -x116 -x115 -x114 -x113 x112 -x111 -x110 x109 x108 -x107 -x106 -x105 -x104
0.59/0.65 v -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
0.59/0.65 v x78 -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
0.59/0.65 v -x52 -x51 -x50 -x49 -x48 x47 -x46 -x45 -x44 x43 -x42 -x41 -x40 -x39 x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 x29 -x28
0.59/0.65 v x27 x26 -x25 -x24 x23 -x22 x21 x20 -x19 -x18 -x17 x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 x4 x3 -x2 x1
0.59/0.65 c SCIP Status : problem is solved [optimal solution found]
0.59/0.65 c Solving Time : 0.60
0.59/0.65 c Original Problem :
0.59/0.65 c Problem name : HOME/instance-2667627-1276592105.opb
0.59/0.65 c Variables : 515 (515 binary, 0 integer, 0 implicit integer, 0 continuous)
0.59/0.65 c Constraints : 559 initial, 559 maximal
0.59/0.65 c Presolved Problem :
0.59/0.65 c Problem name : t_HOME/instance-2667627-1276592105.opb
0.59/0.65 c Variables : 475 (475 binary, 0 integer, 0 implicit integer, 0 continuous)
0.59/0.65 c Constraints : 356 initial, 356 maximal
0.59/0.65 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.59/0.65 c trivial : 0.00 0 0 0 0 0 0 0 0
0.59/0.65 c dualfix : 0.00 21 0 0 0 0 0 0 0
0.59/0.65 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.59/0.65 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.59/0.65 c implics : 0.00 0 0 0 0 0 0 0 0
0.59/0.65 c probing : 0.01 0 0 0 0 0 0 0 0
0.59/0.65 c linear : 0.01 0 19 0 0 0 203 136 0
0.59/0.65 c logicor : 0.00 0 0 0 0 0 0 0 0
0.59/0.65 c root node : - 0 - - 0 - - - -
0.59/0.65 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.59/0.65 c integral : 0 0 0 1 0 0 0 0 0 0
0.59/0.65 c logicor : 356 6 106 1 0 0 0 0 0 0
0.59/0.65 c countsols : 0 0 0 1 0 0 0 0 0 0
0.59/0.65 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.59/0.65 c integral : 0.00 0.00 0.00 0.00 0.00
0.59/0.65 c logicor : 0.00 0.00 0.00 0.00 0.00
0.59/0.65 c countsols : 0.00 0.00 0.00 0.00 0.00
0.59/0.65 c Propagators : Time Calls Cutoffs DomReds
0.59/0.65 c vbounds : 0.00 2 0 0
0.59/0.65 c rootredcost : 0.00 0 0 0
0.59/0.65 c pseudoobj : 0.00 6 0 0
0.59/0.65 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.59/0.65 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.59/0.65 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.59/0.65 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.59/0.65 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.59/0.65 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.59/0.65 c applied globally : - - - 0 0.0 - - -
0.59/0.65 c applied locally : - - - 0 0.0 - - -
0.59/0.65 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.59/0.65 c cut pool : 0.00 5 - - 94 - (maximal pool size: 216)
0.59/0.65 c redcost : 0.00 6 0 0 0 0
0.59/0.65 c impliedbounds : 0.00 5 0 0 0 0
0.59/0.65 c intobj : 0.00 0 0 0 0 0
0.59/0.65 c cgmip : 0.00 0 0 0 0 0
0.59/0.65 c gomory : 0.25 5 0 0 613 0
0.59/0.65 c strongcg : 0.17 5 0 0 542 0
0.59/0.65 c cmir : 0.05 5 0 0 0 0
0.59/0.65 c flowcover : 0.02 5 0 0 0 0
0.59/0.65 c clique : 0.00 1 0 0 0 0
0.59/0.65 c zerohalf : 0.00 0 0 0 0 0
0.59/0.65 c mcf : 0.00 1 0 0 0 0
0.59/0.65 c rapidlearning : 0.00 0 0 0 0 0
0.59/0.65 c Pricers : Time Calls Vars
0.59/0.65 c problem variables: 0.00 0 0
0.59/0.65 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.59/0.65 c pscost : 0.00 0 0 0 0 0 0
0.59/0.65 c inference : 0.00 0 0 0 0 0 0
0.59/0.65 c mostinf : 0.00 0 0 0 0 0 0
0.59/0.65 c leastinf : 0.00 0 0 0 0 0 0
0.59/0.65 c fullstrong : 0.00 0 0 0 0 0 0
0.59/0.65 c allfullstrong : 0.00 0 0 0 0 0 0
0.59/0.65 c random : 0.00 0 0 0 0 0 0
0.59/0.65 c relpscost : 0.00 0 0 0 0 0 0
0.59/0.65 c Primal Heuristics : Time Calls Found
0.59/0.65 c LP solutions : 0.00 - 1
0.59/0.65 c pseudo solutions : 0.00 - 0
0.59/0.65 c crossover : 0.00 0 0
0.59/0.65 c oneopt : 0.00 2 1
0.59/0.65 c trivial : 0.00 2 3
0.59/0.65 c simplerounding : 0.00 5 5
0.59/0.65 c zirounding : 0.00 0 0
0.59/0.65 c rounding : 0.00 5 0
0.59/0.65 c shifting : 0.01 5 0
0.59/0.65 c intshifting : 0.00 0 0
0.59/0.65 c twoopt : 0.00 0 0
0.59/0.65 c fixandinfer : 0.00 0 0
0.59/0.65 c feaspump : 0.00 0 0
0.59/0.65 c coefdiving : 0.00 0 0
0.59/0.65 c pscostdiving : 0.00 0 0
0.59/0.65 c fracdiving : 0.00 0 0
0.59/0.65 c veclendiving : 0.00 0 0
0.59/0.65 c intdiving : 0.00 0 0
0.59/0.65 c actconsdiving : 0.00 0 0
0.59/0.65 c objpscostdiving : 0.00 0 0
0.59/0.65 c rootsoldiving : 0.00 0 0
0.59/0.65 c linesearchdiving : 0.00 0 0
0.59/0.65 c guideddiving : 0.00 0 0
0.59/0.65 c octane : 0.00 0 0
0.59/0.65 c rens : 0.00 0 0
0.59/0.65 c rins : 0.00 0 0
0.59/0.65 c localbranching : 0.00 0 0
0.59/0.65 c mutation : 0.00 0 0
0.59/0.65 c dins : 0.00 0 0
0.59/0.65 c undercover : 0.00 0 0
0.59/0.65 c nlp : 0.00 0 0
0.59/0.65 c trysol : 0.00 0 0
0.59/0.65 c LP : Time Calls Iterations Iter/call Iter/sec
0.59/0.65 c primal LP : 0.00 0 0 0.00 -
0.59/0.65 c dual LP : 0.05 6 694 115.67 13880.00
0.59/0.65 c lex dual LP : 0.00 0 0 0.00 -
0.59/0.65 c barrier LP : 0.00 0 0 0.00 -
0.59/0.65 c diving/probing LP: 0.00 0 0 0.00 -
0.59/0.65 c strong branching : 0.00 0 0 0.00 -
0.59/0.65 c (at root node) : - 0 0 0.00 -
0.59/0.65 c conflict analysis: 0.00 0 0 0.00 -
0.59/0.65 c B&B Tree :
0.59/0.65 c number of runs : 1
0.59/0.65 c nodes : 1
0.59/0.65 c nodes (total) : 1
0.59/0.65 c nodes left : 0
0.59/0.65 c max depth : 0
0.59/0.65 c max depth (total): 0
0.59/0.65 c backtracks : 0 (0.0%)
0.59/0.65 c delayed cutoffs : 0
0.59/0.65 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.59/0.65 c avg switch length: 2.00
0.59/0.65 c switching time : 0.00
0.59/0.65 c Solution :
0.59/0.65 c Solutions found : 10 (4 improvements)
0.59/0.65 c First Solution : +5.15000000000000e+02 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.59/0.65 c Primal Bound : +1.13000000000000e+02 (in run 1, after 1 nodes, 0.60 seconds, depth 0, found by <relaxation>)
0.59/0.65 c Dual Bound : +1.13000000000000e+02
0.59/0.65 c Gap : 0.00 %
0.59/0.65 c Root Dual Bound : +1.13000000000000e+02
0.59/0.65 c Root Iterations : 694
0.59/0.66 c Time complete: 0.66.