0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [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-2663972-1276642754.opb>
0.00/0.04 c original problem has 572 variables (572 bin, 0 int, 0 impl, 0 cont) and 1850 constraints
0.00/0.04 c problem read
0.00/0.04 c presolving settings loaded
0.00/0.04 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.00/0.05 o 160
0.00/0.05 c feasible solution found by trivial heuristic, objective value 1.600000e+02
0.00/0.05 c presolving:
0.00/0.07 c (round 1) 85 del vars, 149 del conss, 21 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 12280 impls, 0 clqs
0.09/0.11 c (round 2) 85 del vars, 149 del conss, 21 chg bounds, 0 chg sides, 0 chg coeffs, 1685 upgd conss, 12280 impls, 0 clqs
0.09/0.12 c (round 3) 85 del vars, 149 del conss, 21 chg bounds, 0 chg sides, 0 chg coeffs, 1701 upgd conss, 12280 impls, 0 clqs
0.09/0.17 c (0.1s) probing: 144/487 (29.6%) - 0 fixings, 4 aggregations, 52 implications, 0 bound changes
0.09/0.17 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.09/0.17 c (round 4) 89 del vars, 149 del conss, 21 chg bounds, 0 chg sides, 0 chg coeffs, 1701 upgd conss, 12328 impls, 0 clqs
0.09/0.19 c (0.1s) probing: 154/487 (31.6%) - 0 fixings, 4 aggregations, 52 implications, 0 bound changes
0.09/0.19 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.09/0.19 c presolving (5 rounds):
0.09/0.19 c 89 deleted vars, 149 deleted constraints, 21 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.19 c 12328 implications, 0 cliques
0.09/0.19 c presolved problem has 483 variables (483 bin, 0 int, 0 impl, 0 cont) and 1701 constraints
0.09/0.19 c 1701 constraints of type <logicor>
0.09/0.19 c transformed objective value is always integral (scale: 1)
0.09/0.19 c Presolving Time: 0.12
0.09/0.19 c - non default parameters ----------------------------------------------------------------------
0.09/0.19 c # SCIP version 1.2.1.2
0.09/0.19 c
0.09/0.19 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.19 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.19 c conflict/interconss = 0
0.09/0.19 c
0.09/0.19 c # should binary conflicts be preferred?
0.09/0.19 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.19 c conflict/preferbinary = TRUE
0.09/0.19 c
0.09/0.19 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.19 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.19 c constraints/agelimit = 1
0.09/0.19 c
0.09/0.19 c # should enforcement of pseudo solution be disabled?
0.09/0.19 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.19 c constraints/disableenfops = TRUE
0.09/0.19 c
0.09/0.19 c # frequency for displaying node information lines
0.09/0.19 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.19 c display/freq = 10000
0.09/0.19 c
0.09/0.19 c # maximal time in seconds to run
0.09/0.19 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.19 c limits/time = 1799.96
0.09/0.19 c
0.09/0.19 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.19 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.19 c limits/memory = 1620
0.09/0.19 c
0.09/0.19 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.19 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.19 c lp/solvefreq = -1
0.09/0.19 c
0.09/0.19 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.09/0.19 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.19 c lp/pricing = a
0.09/0.19 c
0.09/0.19 c # should presolving try to simplify inequalities
0.09/0.19 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.19 c constraints/linear/simplifyinequalities = TRUE
0.09/0.19 c
0.09/0.19 c # should presolving try to simplify knapsacks
0.09/0.19 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.19 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.19 c
0.09/0.19 c # priority of node selection rule <dfs> in standard mode
0.09/0.19 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.19 c nodeselection/dfs/stdpriority = 1000000
0.09/0.19 c
0.09/0.19 c -----------------------------------------------------------------------------------------------
0.09/0.19 c start solving
0.09/0.19 c
0.09/0.19 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.19 c t 0.1s| 1 | 2 | 0 | - |3017k| 0 | - | 483 |1701 | 0 | 0 | 0 | 0 | 0 | 2.100000e+01 | 1.600000e+02 | 661.90%
0.19/0.22 o 27
0.19/0.22 c * 0.1s| 292 | 264 | 0 | 0.0 |3107k| 291 | - | 483 |1701 | 0 | 0 | 0 | 0 | 0 | 2.100000e+01 | 2.700000e+01 | 28.57%
0.19/0.22 o 26
0.19/0.22 c * 0.1s| 302 | 263 | 0 | 0.0 |3113k| 291 | - | 483 |1701 | 0 | 0 | 0 | 0 | 0 | 2.100000e+01 | 2.600000e+01 | 23.81%
0.59/0.67 o 25
0.59/0.67 c * 0.6s| 2019 | 250 | 0 | 0.0 |3189k| 291 | - | 483 |1890 | 0 | 0 | 0 |1340 | 0 | 2.100000e+01 | 2.500000e+01 | 19.05%
1.00/1.10 o 24
1.00/1.10 c * 1.0s| 3434 | 216 | 0 | 0.0 |3214k| 291 | - | 483 |1959 | 0 | 0 | 0 |2235 | 0 | 2.100000e+01 | 2.400000e+01 | 14.29%
1.59/1.65 c
1.59/1.65 c SCIP Status : problem is solved [optimal solution found]
1.59/1.65 c Solving Time (sec) : 1.46
1.59/1.65 c Solving Nodes : 4185
1.59/1.65 c Primal Bound : +2.40000000000000e+01 (6 solutions)
1.59/1.65 c Dual Bound : +2.40000000000000e+01
1.59/1.65 c Gap : 0.00 %
1.59/1.65 s OPTIMUM FOUND
1.59/1.65 v -x568 -x567 -x566 -x565 -x564 -x563 -x562 -x559 -x558 -x557 -x556 -x555 -x554 -x553 -x552 -x551 -x550 -x549 -x548 -x547 -x546 -x545
1.59/1.65 v -x544 -x543 -x542 -x541 -x538 -x535 -x534 -x533 -x532 -x531 -x530 -x527 -x526 -x525 -x524 -x523 -x522 -x521 -x520 -x517
1.59/1.65 v -x516 -x515 -x514 -x513 -x512 -x509 -x508 -x507 -x506 -x505 -x504 -x503 -x502 -x501 -x500 -x499 -x498 -x497 -x496 -x495 -x494
1.59/1.65 v x493 -x490 -x489 -x488 -x487 -x486 -x485 -x484 -x483 -x482 -x481 -x480 -x479 -x478 -x477 -x476 -x475 -x472 -x468 -x461 -x460
1.59/1.65 v -x457 -x456 -x455 -x454 -x453 -x450 -x449 -x448 -x447 -x446 -x445 -x442 -x436 -x432 -x431 -x428 -x425 -x424 -x423 -x422 -x421
1.59/1.65 v -x420 -x419 -x416 -x412 -x411 -x410 -x405 -x404 -x403 -x402 -x401 -x400 -x399 -x398 -x397 -x396 -x395 -x394 -x393 -x392 -x391
1.59/1.65 v -x390 -x389 -x386 -x385 -x384 -x383 -x382 -x381 -x408 -x380 -x379 -x378 -x377 -x376 -x375 -x374 -x528 -x373 -x372 -x371 -x370
1.59/1.65 v -x369 x368 -x365 -x364 -x363 -x359 -x356 -x355 -x354 -x353 -x429 -x361 -x352 -x351 -x350 -x357 -x349 -x348 -x518 -x347 -x346
1.59/1.65 v -x345 -x344 -x343 -x342 -x341 -x340 -x339 -x338 -x335 -x334 -x333 -x332 -x331 -x329 -x326 -x325 -x324 -x323 -x318 -x317 -x314
1.59/1.65 v -x310 -x307 -x304 -x426 -x303 -x301 -x299 -x298 -x296 -x295 -x294 -x470 -x440 -x293 -x312 -x292 -x305 -x291 -x290 -x288
1.59/1.65 v -x458 -x287 -x286 -x285 -x284 -x308 -x283 -x281 -x280 -x278 -x277 -x434 -x276 -x275 -x466 -x274 -x273 -x271 -x267 -x266 x265
1.59/1.65 v -x259 -x258 -x257 -x256 x255 -x252 -x242 -x240 -x234 -x233 x232 -x229 -x228 -x227 -x226 -x225 -x224 -x250 -x221 -x220 -x217 x210
1.59/1.65 v -x200 -x196 -x190 -x187 -x186 -x185 -x181 -x180 -x173 -x170 -x169 -x168 -x167 x166 -x160 -x159 -x156 -x155 -x178 -x154 -x153
1.59/1.65 v -x152 -x147 -x144 -x143 -x138 -x133 -x132 -x131 -x198 -x130 -x129 -x128 -x124 -x123 -x122 -x118 -x116 -x110 -x109 -x108 -x107
1.59/1.65 v -x106 -x105 -x188 -x104 -x100 -x99 -x98 -x96 -x560 -x539 -x536 -x95 -x94 -x93 -x510 -x491 -x473 -x92 -x91 -x90 -x89 -x88
1.59/1.65 v -x87 -x86 -x85 -x451 -x443 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x417 -x414 -x77 -x76 -x387 -x366 -x75 -x74 -x73 -x336 -x72 -x71
1.59/1.65 v -x321 -x70 -x69 -x68 -x67 -x66 -x315 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x52 -x263 -x51 -x253 -x50
1.59/1.65 v -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x230 -x222 -x218 -x215 -x40 -x208 -x34 -x33 -x32 -x31 -x30 -x29 -x27 -x26 -x25
1.59/1.65 v -x194 -x24 -x23 -x183 -x22 -x21 -x20 -x171 x164 -x19 -x157 -x150 -x18 -x145 -x141 -x136 -x17 -x126 -x120 -x16 -x15 -x14 -x13
1.59/1.65 v -x102 -x572 -x571 -x570 -x569 -x561 -x540 -x537 -x529 -x519 -x511 -x492 -x474 -x471 -x469 -x467 -x465 -x464 -x463 -x462 -x459
1.59/1.65 v -x452 -x444 -x441 -x439 -x438 -x437 -x435 -x433 -x430 -x427 -x418 -x415 -x413 -x409 -x407 -x406 -x388 -x367 -x362 -x360 -x358
1.59/1.65 v -x337 -x330 -x328 -x327 -x322 -x320 -x319 -x316 -x313 -x311 -x309 -x306 -x302 -x300 -x297 -x289 -x282 -x279 -x272 -x270 -x269
1.59/1.65 v -x268 -x264 -x262 -x261 -x260 -x254 -x251 -x249 -x248 -x247 -x246 -x245 -x244 -x243 -x241 -x239 -x238 -x237 -x236 -x235
1.59/1.65 v -x231 -x223 -x219 -x216 -x214 -x213 -x212 x211 -x209 -x207 -x206 -x205 -x204 -x203 -x202 -x201 -x199 -x197 -x195 x193 -x192 -x191
1.59/1.65 v -x189 -x184 -x182 -x179 -x177 -x176 -x175 -x174 -x172 x165 -x163 -x162 -x161 -x158 -x151 -x149 -x148 -x146 -x142 -x140 -x139
1.59/1.65 v -x137 -x135 -x134 -x127 -x125 -x121 -x119 -x117 -x115 -x114 -x113 -x112 -x111 -x103 x101 x97 x53 x39 x38 x37 x36 x35 x28
1.59/1.65 v x12 x11 x10 x9 x8 x7 x6 x5 x4 x3 x2 x1
1.59/1.65 c SCIP Status : problem is solved [optimal solution found]
1.59/1.65 c Solving Time : 1.46
1.59/1.65 c Original Problem :
1.59/1.65 c Problem name : HOME/instance-2663972-1276642754.opb
1.59/1.65 c Variables : 572 (572 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.65 c Constraints : 1850 initial, 1850 maximal
1.59/1.65 c Presolved Problem :
1.59/1.65 c Problem name : t_HOME/instance-2663972-1276642754.opb
1.59/1.65 c Variables : 483 (483 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.65 c Constraints : 1701 initial, 1985 maximal
1.59/1.65 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.59/1.65 c trivial : 0.00 0 0 0 0 0 0 0 0
1.59/1.65 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.59/1.65 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.59/1.65 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.59/1.65 c implics : 0.00 0 0 0 0 0 0 0 0
1.59/1.65 c probing : 0.04 0 4 0 0 0 0 0 0
1.59/1.65 c linear : 0.04 21 64 0 21 0 149 0 0
1.59/1.65 c logicor : 0.04 0 0 0 0 0 0 0 0
1.59/1.65 c root node : - 443 - - 443 - - - -
1.59/1.65 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.59/1.65 c integral : 0 0 0 0 0 0 0 0 0 0
1.59/1.65 c logicor : 1701+ 0 10293 0 4 1933 50880 0 0 0
1.59/1.65 c countsols : 0 0 0 0 4 0 0 0 0 0
1.59/1.65 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.59/1.65 c integral : 0.00 0.00 0.00 0.00 0.00
1.59/1.65 c logicor : 0.33 0.00 0.33 0.00 0.00
1.59/1.65 c countsols : 0.00 0.00 0.00 0.00 0.00
1.59/1.65 c Propagators : Time Calls Cutoffs DomReds
1.59/1.65 c vbounds : 0.00 2 0 0
1.59/1.65 c rootredcost : 0.01 0 0 0
1.59/1.65 c pseudoobj : 0.36 19289 258 113862
1.59/1.65 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.59/1.65 c propagation : 0.11 2191 2189 2189 33.4 612 21.5 -
1.59/1.65 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.65 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.65 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.65 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.59/1.65 c applied globally : - - - 2317 18.7 - - -
1.59/1.65 c applied locally : - - - 427 88.0 - - -
1.59/1.65 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.59/1.65 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.59/1.65 c redcost : 0.00 0 0 0 0 0
1.59/1.65 c impliedbounds : 0.00 0 0 0 0 0
1.59/1.65 c intobj : 0.00 0 0 0 0 0
1.59/1.65 c cgmip : 0.00 0 0 0 0 0
1.59/1.65 c gomory : 0.00 0 0 0 0 0
1.59/1.65 c strongcg : 0.00 0 0 0 0 0
1.59/1.65 c cmir : 0.00 0 0 0 0 0
1.59/1.65 c flowcover : 0.00 0 0 0 0 0
1.59/1.65 c clique : 0.00 0 0 0 0 0
1.59/1.65 c zerohalf : 0.00 0 0 0 0 0
1.59/1.65 c mcf : 0.00 0 0 0 0 0
1.59/1.65 c rapidlearning : 0.00 0 0 0 0 0
1.59/1.65 c Pricers : Time Calls Vars
1.59/1.65 c problem variables: 0.00 0 0
1.59/1.65 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.59/1.65 c relpscost : 0.00 0 0 0 0 0 0
1.59/1.65 c pscost : 0.00 0 0 0 0 0 0
1.59/1.65 c inference : 0.13 3095 0 0 0 0 6190
1.59/1.65 c mostinf : 0.00 0 0 0 0 0 0
1.59/1.65 c leastinf : 0.00 0 0 0 0 0 0
1.59/1.65 c fullstrong : 0.00 0 0 0 0 0 0
1.59/1.65 c allfullstrong : 0.00 0 0 0 0 0 0
1.59/1.65 c random : 0.00 0 0 0 0 0 0
1.59/1.65 c Primal Heuristics : Time Calls Found
1.59/1.65 c LP solutions : 0.00 - 0
1.59/1.65 c pseudo solutions : 0.00 - 4
1.59/1.65 c oneopt : 0.01 0 0
1.59/1.65 c trivial : 0.00 2 2
1.59/1.65 c simplerounding : 0.00 0 0
1.59/1.65 c zirounding : 0.00 0 0
1.59/1.65 c rounding : 0.00 0 0
1.59/1.65 c shifting : 0.00 0 0
1.59/1.65 c intshifting : 0.00 0 0
1.59/1.65 c twoopt : 0.00 0 0
1.59/1.65 c fixandinfer : 0.00 0 0
1.59/1.65 c feaspump : 0.00 0 0
1.59/1.65 c coefdiving : 0.00 0 0
1.59/1.65 c pscostdiving : 0.00 0 0
1.59/1.65 c fracdiving : 0.00 0 0
1.59/1.65 c veclendiving : 0.00 0 0
1.59/1.65 c intdiving : 0.00 0 0
1.59/1.65 c actconsdiving : 0.00 0 0
1.59/1.65 c objpscostdiving : 0.00 0 0
1.59/1.65 c rootsoldiving : 0.00 0 0
1.59/1.65 c linesearchdiving : 0.00 0 0
1.59/1.65 c guideddiving : 0.00 0 0
1.59/1.65 c octane : 0.00 0 0
1.59/1.65 c rens : 0.00 0 0
1.59/1.65 c rins : 0.00 0 0
1.59/1.65 c localbranching : 0.00 0 0
1.59/1.65 c mutation : 0.00 0 0
1.59/1.65 c crossover : 0.00 0 0
1.59/1.65 c dins : 0.00 0 0
1.59/1.65 c undercover : 0.00 0 0
1.59/1.65 c nlp : 0.00 0 0
1.59/1.65 c trysol : 0.00 0 0
1.59/1.65 c LP : Time Calls Iterations Iter/call Iter/sec
1.59/1.65 c primal LP : 0.00 0 0 0.00 -
1.59/1.65 c dual LP : 0.00 0 0 0.00 -
1.59/1.65 c lex dual LP : 0.00 0 0 0.00 -
1.59/1.65 c barrier LP : 0.00 0 0 0.00 -
1.59/1.65 c diving/probing LP: 0.00 0 0 0.00 -
1.59/1.65 c strong branching : 0.00 0 0 0.00 -
1.59/1.65 c (at root node) : - 0 0 0.00 -
1.59/1.65 c conflict analysis: 0.00 0 0 0.00 -
1.59/1.65 c B&B Tree :
1.59/1.65 c number of runs : 1
1.59/1.65 c nodes : 4185
1.59/1.65 c nodes (total) : 4185
1.59/1.65 c nodes left : 0
1.59/1.65 c max depth : 291
1.59/1.65 c max depth (total): 291
1.59/1.65 c backtracks : 1760 (42.1%)
1.59/1.65 c delayed cutoffs : 1949
1.59/1.65 c repropagations : 9871 (60407 domain reductions, 1105 cutoffs)
1.59/1.65 c avg switch length: 5.82
1.59/1.65 c switching time : 0.24
1.59/1.65 c Solution :
1.59/1.65 c Solutions found : 6 (5 improvements)
1.59/1.65 c First Solution : +1.60000000000000e+02 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
1.59/1.65 c Primal Bound : +2.40000000000000e+01 (in run 1, after 3434 nodes, 0.96 seconds, depth 238, found by <relaxation>)
1.59/1.65 c Dual Bound : +2.40000000000000e+01
1.59/1.65 c Gap : 0.00 %
1.59/1.65 c Root Dual Bound : +2.10000000000000e+01
1.59/1.65 c Root Iterations : 0
1.59/1.66 c Time complete: 1.65.