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-2667354-1276322447.opb>
0.00/0.03 c original problem has 863 variables (863 bin, 0 int, 0 impl, 0 cont) and 646 constraints
0.00/0.03 c problem read
0.00/0.03 c No objective function, only one solution is needed.
0.00/0.03 c presolving settings loaded
0.00/0.04 c presolving:
0.00/0.09 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 646 upgd conss, 0 impls, 48 clqs
0.00/0.09 c presolving (2 rounds):
0.00/0.09 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.09 c 0 implications, 48 cliques
0.00/0.09 c presolved problem has 863 variables (863 bin, 0 int, 0 impl, 0 cont) and 646 constraints
0.00/0.09 c 48 constraints of type <setppc>
0.00/0.09 c 598 constraints of type <logicor>
0.00/0.09 c transformed objective value is always integral (scale: 1)
0.00/0.09 c Presolving Time: 0.03
0.00/0.09 c - non default parameters ----------------------------------------------------------------------
0.00/0.09 c # SCIP version 1.2.1.2
0.00/0.09 c
0.00/0.09 c # frequency for displaying node information lines
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.09 c display/freq = 10000
0.00/0.09 c
0.00/0.09 c # maximal time in seconds to run
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.09 c limits/time = 1799.98
0.00/0.09 c
0.00/0.09 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.09 c limits/memory = 1620
0.00/0.09 c
0.00/0.09 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.09 c limits/solutions = 1
0.00/0.09 c
0.00/0.09 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.09 c separating/maxrounds = 1
0.00/0.09 c
0.00/0.09 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.09 c separating/maxroundsroot = 5
0.00/0.09 c
0.00/0.09 c # should presolving try to simplify inequalities
0.00/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.09 c constraints/linear/simplifyinequalities = TRUE
0.00/0.09 c
0.00/0.09 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.09 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.09 c constraints/knapsack/disaggregation = FALSE
0.00/0.09 c
0.00/0.09 c # should presolving try to simplify knapsacks
0.00/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.09 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.09 c
0.00/0.09 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.09 c presolving/probing/maxrounds = 0
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/coefdiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.09 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.09 c heuristics/crossover/freq = -1
0.00/0.09 c
0.00/0.09 c # number of nodes added to the contingent of the total nodes
0.00/0.09 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.09 c heuristics/crossover/nodesofs = 750
0.00/0.09 c
0.00/0.09 c # number of nodes without incumbent change that heuristic should wait
0.00/0.09 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.09 c heuristics/crossover/nwaitingnodes = 100
0.00/0.09 c
0.00/0.09 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.09 c # [type: real, range: [0,1], default: 0.1]
0.00/0.09 c heuristics/crossover/nodesquot = 0.15
0.00/0.09 c
0.00/0.09 c # minimum percentage of integer variables that have to be fixed
0.00/0.09 c # [type: real, range: [0,1], default: 0.666]
0.00/0.09 c heuristics/crossover/minfixingrate = 0.5
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.09 c heuristics/feaspump/freq = -1
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/fracdiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.09 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/guideddiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.09 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.09 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/intshifting/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/linesearchdiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.09 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.09 c heuristics/nlp/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.09 c heuristics/objpscostdiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.09 c # [type: real, range: [0,1], default: 0.01]
0.00/0.09 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.09 c heuristics/oneopt/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/pscostdiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.09 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.09 c heuristics/rens/freq = -1
0.00/0.09 c
0.00/0.09 c # minimum percentage of integer variables that have to be fixable
0.00/0.09 c # [type: real, range: [0,1], default: 0.5]
0.00/0.09 c heuristics/rens/minfixingrate = 0.3
0.00/0.09 c
0.00/0.09 c # number of nodes added to the contingent of the total nodes
0.00/0.09 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.09 c heuristics/rens/nodesofs = 2000
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.09 c heuristics/rootsoldiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.09 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.09 c heuristics/rounding/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/shifting/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.09 c heuristics/simplerounding/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.09 c heuristics/trivial/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.09 c heuristics/trysol/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/veclendiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.09 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.09 c heuristics/zirounding/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.09 c separating/cmir/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.09 c separating/flowcover/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.09 c separating/rapidlearning/freq = 0
0.00/0.09 c
0.00/0.09 c -----------------------------------------------------------------------------------------------
0.00/0.09 c start solving
0.09/0.09 c
0.09/0.15 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.15 c 0.1s| 1 | 0 | 414 | - |3410k| 0 | 145 | 863 | 646 | 863 | 646 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.49 c 0.4s| 1 | 0 | 605 | - |4000k| 0 | 168 | 863 | 646 | 863 | 657 | 11 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.76 c 0.7s| 1 | 0 | 928 | - |4378k| 0 | 187 | 863 | 646 | 863 | 671 | 25 | 0 | 0 | 0.000000e+00 | -- | Inf
1.00/1.08 c 1.0s| 1 | 0 | 1285 | - |4926k| 0 | 171 | 863 | 646 | 863 | 685 | 39 | 0 | 0 | 0.000000e+00 | -- | Inf
1.29/1.37 c 1.3s| 1 | 0 | 1664 | - |5726k| 0 | 180 | 863 | 646 | 863 | 700 | 54 | 0 | 0 | 0.000000e+00 | -- | Inf
1.49/1.59 c 1.5s| 1 | 0 | 1989 | - |6043k| 0 | 150 | 863 | 646 | 863 | 713 | 67 | 0 | 0 | 0.000000e+00 | -- | Inf
1.69/1.79 c 1.7s| 1 | 2 | 1989 | - |6044k| 0 | 150 | 863 | 646 | 863 | 713 | 67 | 0 | 33 | 0.000000e+00 | -- | Inf
16.76/16.89 c *16.5s| 103 | 0 | 3536 | 15.2 |6359k| 41 | - | 863 | 646 | 863 | 673 | 67 | 0 |2033 | 0.000000e+00 | 0.000000e+00 | 0.00%
16.76/16.89 c
16.76/16.89 c SCIP Status : problem is solved [optimal solution found]
16.76/16.89 c Solving Time (sec) : 16.50
16.76/16.89 c Solving Nodes : 103
16.76/16.89 c Primal Bound : +0.00000000000000e+00 (1 solutions)
16.76/16.89 c Dual Bound : +0.00000000000000e+00
16.76/16.89 c Gap : 0.00 %
16.76/16.89 s SATISFIABLE
16.76/16.89 v -x299 -x297 -x288 -x286 -x283 -x281 -x291 -x70 -x52 -x51 -x292 -x65 -x294 -x290 -x224 -x223 -x221 -x214 -x207 -x204 -x420 -x417
16.76/16.89 v -x415 -x413 -x404 -x401 -x57 -x216 -x54 -x74 -x403 -x206 -x408 -x59 -x422 -x402 -x75 -x67 -x300 -x58 -x25 -x24 -x18 x17 -x16
16.76/16.89 v -x14 -x12 -x8 -x5 -x4 -x2 -x1 -x72 -x55 -x277 -x424 -x210 -x3 -x71 -x11 -x296 -x450 -x444 -x440 x439 -x437 -x436 -x435 -x431
16.76/16.89 v -x429 -x427 -x201 -x211 -x125 -x122 -x117 -x115 -x113 -x112 -x111 x106 -x104 -x101 -x525 -x522 -x520 -x519 -x518 -x514 -x510
16.76/16.89 v -x509 -x508 -x507 -x505 -x502 -x501 -x442 -x279 -x119 -x6 -x198 -x196 -x195 -x191 -x187 -x186 -x180 -x179 -x21 -x218 -x13 -x289
16.76/16.89 v x515 -x433 -x513 -x284 -x325 -x322 -x319 -x318 -x317 -x316 -x314 -x311 -x310 -x309 -x303 -x302 -x217 -x574 -x573 -x572 -x571
16.76/16.89 v -x569 -x568 -x566 -x564 -x563 -x562 -x560 -x558 -x556 -x555 -x553 -x552 x551 -x193 -x549 -x547 -x545 -x544 -x542 -x540 -x539
16.76/16.89 v -x538 -x537 -x536 -x535 -x534 -x530 -x529 -x528 -x526 -x68 -x105 -x511 -x524 -x9 -x69 -x565 -x116 -x546 -x407 -x178 -x567
16.76/16.89 v -x23 -x121 x183 -x446 -x375 -x374 x373 -x372 -x370 -x368 -x367 -x366 -x364 -x362 -x359 -x358 -x357 -x356 -x355 -x353 -x352 -x409
16.76/16.89 v -x441 -x62 -x434 -x56 -x63 -x307 -x22 -x189 -x360 -x7 -x278 -x107 -x500 -x499 -x497 -x495 -x494 -x493 -x492 -x491 -x488
16.76/16.89 v -x487 -x486 -x485 -x484 -x483 x482 -x481 -x480 -x478 -x477 -x190 -x506 -x249 -x248 -x247 -x246 -x244 -x243 -x242 -x241 -x239
16.76/16.89 v -x238 -x237 -x235 -x231 -x230 -x229 -x228 -x227 -x550 -x212 -x240 -x498 -x521 -x205 -x100 -x99 -x98 x96 -x94 -x93 -x92 -x90 -x87
16.76/16.89 v -x86 -x85 -x83 -x82 -x80 -x79 -x78 -x77 -x76 -x570 -x95 -x209 -x91 -x350 -x349 -x348 x347 -x346 -x344 -x343 -x341 -x340 -x339
16.76/16.89 v -x338 -x336 -x335 -x334 -x333 -x331 -x330 -x329 -x328 -x327 -x410 -x120 x280 -x369 -x194 -x175 -x173 -x172 -x171 -x170 x169
16.76/16.89 v -x168 -x167 -x165 -x164 -x163 -x161 -x160 -x159 -x157 -x153 -x152 -x151 -x449 -x517 -x15 -x174 -x363 -x181 -x308 -x337 -x324
16.76/16.89 v -x443 -x527 -x19 -x203 -x192 -x285 -x287 -x490 -x430 -x108 -x406 -x199 -x53 -x166 -x97 -x66 -x405 -x305 -x425 -x320 -x155
16.76/16.89 v x416 -x20 -x184 -x365 -x298 -x445 -x109 -x154 x60 -x81 -x215 -x428 -x213 -x225 -x419 -x123 -x282 -x400 -x398 -x397 -x396 -x394
16.76/16.89 v -x393 -x392 -x391 -x390 -x389 -x388 -x387 -x386 -x385 -x384 -x383 -x382 -x380 -x379 -x378 -x377 -x376 -x182 -x10 -x475 -x472
16.76/16.89 v -x471 -x470 -x469 -x468 -x467 -x466 -x465 -x463 -x461 -x460 -x459 -x458 -x457 -x456 -x453 -x452 -x451 -x354 -x479 -x791 -x790
16.76/16.89 v -x789 -x788 -x787 -x786 x785 -x784 -x783 -x782 -x781 -x780 -x219 -x523 -x414 -x412 -x84 -x250 -x532 -x64 -x418 -x114 -x89
16.76/16.89 v x202 -x245 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 x138 -x137 -x135 -x134 -x133 -x132 -x131
16.76/16.89 v -x130 -x129 -x128 -x127 -x126 -x276 x454 -x233 -x399 -x162 -x185 -x301 -x342 -x323 -x158 -x177 -x332 -x208 -x426 -x464 -x438
16.76/16.89 v -x533 -x447 x543 -x516 -x548 -x306 -x188 -x88 x395 -x731 -x730 -x729 -x728 -x727 -x726 -x725 -x724 -x723 -x722 x721 -x720 -x489
16.76/16.89 v -x361 -x411 -x321 -x476 -x685 -x684 -x683 -x682 -x681 -x680 -x679 -x678 x677 -x676 -x675 -x110 x743 -x742 -x741 -x740 -x739
16.76/16.89 v -x738 -x737 -x736 -x735 -x734 -x733 -x732 -x315 -x663 -x662 -x661 -x660 -x659 -x658 x657 -x656 -x655 -x654 -x653 -x345 -x220
16.76/16.89 v -x557 -x504 -x531 -x156 -x473 -x226 -x575 -x448 -x863 -x862 -x861 -x860 -x859 -x858 -x857 -x856 -x855 -x854 -x853 -x852 -x200
16.76/16.89 v -x496 -x73 -x118 -x779 -x778 -x777 -x776 -x775 -x774 -x773 x772 -x771 -x770 -x769 -x768 -x293 -x597 -x596 -x595 -x594 -x593
16.76/16.89 v x592 -x591 -x590 -x589 -x588 -x587 -x102 -x432 -x421 -x197 -x50 -x49 -x48 -x47 -x46 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37
16.76/16.89 v -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 x28 -x27 -x26 -x45 -x236 -x839 x838 -x837 -x836 -x835 -x834 -x833 -x832 -x831 -x830
16.76/16.89 v -x829 -x828 -x423 -x326 -x474 -x275 x274 -x273 -x272 -x271 -x270 -x269 -x268 -x266 -x265 -x264 -x263 -x262 -x261 -x260 -x259
16.76/16.89 v -x258 -x257 -x256 -x255 -x254 -x253 -x252 -x251 -x462 -x554 -x815 -x814 -x813 -x812 -x811 -x810 -x809 -x808 -x807 -x806 -x805
16.76/16.89 v x804 -x371 -x851 -x850 -x849 -x848 -x847 x846 -x845 -x844 -x843 -x842 -x841 -x840 -x124 -x767 -x766 x765 -x764 -x763 -x762 -x761
16.76/16.89 v -x760 -x759 -x758 -x757 -x756 -x267 -x61 -x827 -x826 -x825 -x824 -x823 -x822 -x821 -x820 -x819 x818 -x817 -x816 -x222 -x652
16.76/16.89 v -x651 -x650 -x649 -x648 -x647 -x646 -x645 -x644 -x643 x642 -x232 x312 -x707 -x706 -x705 -x704 -x703 -x702 -x701 x700 -x699
16.76/16.89 v -x698 -x697 -x512 -x503 -x619 x618 -x617 -x616 -x615 -x614 -x613 -x612 -x611 -x610 -x609 -x304 -x559 -x674 -x673 -x672 -x671
16.76/16.89 v x670 -x669 -x668 -x667 -x666 -x665 -x664 x234 -x755 -x754 -x753 -x752 x751 -x750 -x749 -x748 -x747 -x746 -x745 -x744 -x541
16.76/16.89 v -x351 -x136 -x630 -x629 x628 -x627 -x626 -x625 -x624 -x623 -x622 -x621 -x620 -x455 -x719 -x718 -x717 x716 -x715 -x714 -x713 -x712
16.76/16.89 v -x711 -x710 -x709 -x708 -x313 -x608 -x607 -x606 -x605 -x604 -x603 -x602 -x601 -x600 x599 -x598 -x103 -x696 -x695 -x694 -x693
16.76/16.89 v -x692 -x691 -x690 -x689 -x688 -x687 -x686 -x561 -x641 -x640 -x639 x638 -x637 -x636 -x635 -x634 -x633 -x632 -x631 -x381 -x803
16.76/16.89 v -x802 -x801 -x800 -x799 -x798 -x797 -x796 x795 -x794 -x793 -x792 -x295 x586 -x585 -x584 -x583 -x582 -x581 -x580 -x579 -x578
16.76/16.89 v -x577 -x576 -x176
16.76/16.89 c SCIP Status : problem is solved [optimal solution found]
16.76/16.89 c Solving Time : 16.50
16.76/16.89 c Original Problem :
16.76/16.89 c Problem name : HOME/instance-2667354-1276322447.opb
16.76/16.89 c Variables : 863 (863 binary, 0 integer, 0 implicit integer, 0 continuous)
16.76/16.89 c Constraints : 646 initial, 646 maximal
16.76/16.89 c Presolved Problem :
16.76/16.89 c Problem name : t_HOME/instance-2667354-1276322447.opb
16.76/16.89 c Variables : 863 (863 binary, 0 integer, 0 implicit integer, 0 continuous)
16.76/16.89 c Constraints : 646 initial, 646 maximal
16.76/16.89 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
16.76/16.89 c trivial : 0.00 0 0 0 0 0 0 0 0
16.76/16.89 c dualfix : 0.00 0 0 0 0 0 0 0 0
16.76/16.89 c boundshift : 0.00 0 0 0 0 0 0 0 0
16.76/16.89 c inttobinary : 0.00 0 0 0 0 0 0 0 0
16.76/16.89 c implics : 0.00 0 0 0 0 0 0 0 0
16.76/16.89 c probing : 0.00 0 0 0 0 0 0 0 0
16.76/16.89 c setppc : 0.00 0 0 0 0 0 0 0 0
16.76/16.89 c logicor : 0.01 0 0 0 0 0 0 0 0
16.76/16.89 c root node : - 0 - - 0 - - - -
16.76/16.89 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
16.76/16.89 c integral : 0 0 0 104 0 0 1 0 0 204
16.76/16.89 c setppc : 48 5 202 1 0 0 1768 0 0 0
16.76/16.89 c logicor : 598 5 78 1 0 0 24 0 0 0
16.76/16.89 c countsols : 0 0 0 1 0 0 0 0 0 0
16.76/16.89 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
16.76/16.89 c integral : 14.59 0.00 0.00 14.59 0.00
16.76/16.89 c setppc : 0.01 0.00 0.01 0.00 0.00
16.76/16.89 c logicor : 0.00 0.00 0.00 0.00 0.00
16.76/16.89 c countsols : 0.00 0.00 0.00 0.00 0.00
16.76/16.89 c Propagators : Time Calls Cutoffs DomReds
16.76/16.89 c vbounds : 0.00 1 0 0
16.76/16.89 c rootredcost : 0.00 0 0 0
16.76/16.89 c pseudoobj : 0.00 0 0 0
16.76/16.89 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
16.76/16.89 c propagation : 0.00 0 0 0 0.0 0 0.0 -
16.76/16.89 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
16.76/16.89 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
16.76/16.89 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
16.76/16.89 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
16.76/16.89 c applied globally : - - - 0 0.0 - - -
16.76/16.89 c applied locally : - - - 0 0.0 - - -
16.76/16.89 c Separators : Time Calls Cutoffs DomReds Cuts Conss
16.76/16.89 c cut pool : 0.00 4 - - 1 - (maximal pool size: 360)
16.76/16.89 c redcost : 0.00 107 0 0 0 0
16.76/16.89 c impliedbounds : 0.00 5 0 0 0 0
16.76/16.89 c intobj : 0.00 0 0 0 0 0
16.76/16.89 c cgmip : 0.00 0 0 0 0 0
16.76/16.89 c gomory : 0.46 5 0 0 1464 0
16.76/16.89 c strongcg : 0.47 5 0 0 2185 0
16.76/16.89 c cmir : 0.00 0 0 0 0 0
16.76/16.89 c flowcover : 0.00 0 0 0 0 0
16.76/16.89 c clique : 0.01 5 0 0 0 0
16.76/16.89 c zerohalf : 0.00 0 0 0 0 0
16.76/16.89 c mcf : 0.00 1 0 0 0 0
16.76/16.89 c rapidlearning : 0.04 1 0 0 0 0
16.76/16.89 c Pricers : Time Calls Vars
16.76/16.89 c problem variables: 0.00 0 0
16.76/16.89 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
16.76/16.89 c relpscost : 14.59 103 0 1 0 0 204
16.76/16.89 c pscost : 0.00 0 0 0 0 0 0
16.76/16.89 c inference : 0.00 0 0 0 0 0 0
16.76/16.89 c mostinf : 0.00 0 0 0 0 0 0
16.76/16.89 c leastinf : 0.00 0 0 0 0 0 0
16.76/16.89 c fullstrong : 0.00 0 0 0 0 0 0
16.76/16.89 c allfullstrong : 0.00 0 0 0 0 0 0
16.76/16.89 c random : 0.00 0 0 0 0 0 0
16.76/16.89 c Primal Heuristics : Time Calls Found
16.76/16.89 c LP solutions : 0.00 - 1
16.76/16.89 c pseudo solutions : 0.00 - 0
16.76/16.89 c trivial : 0.00 1 0
16.76/16.89 c simplerounding : 0.00 0 0
16.76/16.89 c zirounding : 0.00 0 0
16.76/16.89 c rounding : 0.00 0 0
16.76/16.89 c shifting : 0.00 0 0
16.76/16.89 c intshifting : 0.00 0 0
16.76/16.89 c oneopt : 0.00 0 0
16.76/16.89 c twoopt : 0.00 0 0
16.76/16.89 c fixandinfer : 0.00 0 0
16.76/16.89 c feaspump : 0.00 0 0
16.76/16.89 c coefdiving : 0.00 0 0
16.76/16.89 c pscostdiving : 0.00 0 0
16.76/16.89 c fracdiving : 0.00 0 0
16.76/16.89 c veclendiving : 0.00 0 0
16.76/16.89 c intdiving : 0.00 0 0
16.76/16.89 c actconsdiving : 0.00 0 0
16.76/16.89 c objpscostdiving : 0.00 0 0
16.76/16.89 c rootsoldiving : 0.00 0 0
16.76/16.89 c linesearchdiving : 0.00 0 0
16.76/16.89 c guideddiving : 0.00 0 0
16.76/16.89 c octane : 0.00 0 0
16.76/16.89 c rens : 0.00 0 0
16.76/16.89 c rins : 0.00 0 0
16.76/16.89 c localbranching : 0.00 0 0
16.76/16.89 c mutation : 0.00 0 0
16.76/16.89 c crossover : 0.00 0 0
16.76/16.89 c dins : 0.00 0 0
16.76/16.89 c undercover : 0.00 0 0
16.76/16.89 c nlp : 0.00 0 0
16.76/16.89 c trysol : 0.00 0 0
16.76/16.89 c LP : Time Calls Iterations Iter/call Iter/sec
16.76/16.89 c primal LP : 0.00 0 0 0.00 -
16.76/16.89 c dual LP : 0.72 109 3536 32.44 4911.11
16.76/16.89 c lex dual LP : 0.00 0 0 0.00 -
16.76/16.89 c barrier LP : 0.00 0 0 0.00 -
16.76/16.89 c diving/probing LP: 0.00 0 0 0.00 -
16.76/16.89 c strong branching : 14.57 2033 74415 36.60 5107.41
16.76/16.89 c (at root node) : - 33 813 24.64 -
16.76/16.89 c conflict analysis: 0.00 0 0 0.00 -
16.76/16.89 c B&B Tree :
16.76/16.89 c number of runs : 1
16.76/16.89 c nodes : 103
16.76/16.89 c nodes (total) : 103
16.76/16.89 c nodes left : 0
16.76/16.89 c max depth : 41
16.76/16.89 c max depth (total): 41
16.76/16.89 c backtracks : 5 (4.9%)
16.76/16.89 c delayed cutoffs : 0
16.76/16.89 c repropagations : 0 (0 domain reductions, 0 cutoffs)
16.76/16.89 c avg switch length: 2.14
16.76/16.89 c switching time : 0.00
16.76/16.89 c Solution :
16.76/16.89 c Solutions found : 1 (1 improvements)
16.76/16.89 c First Solution : +0.00000000000000e+00 (in run 1, after 103 nodes, 16.50 seconds, depth 41, found by <relaxation>)
16.76/16.89 c Primal Bound : +0.00000000000000e+00 (in run 1, after 103 nodes, 16.50 seconds, depth 41, found by <relaxation>)
16.76/16.89 c Dual Bound : +0.00000000000000e+00
16.76/16.89 c Gap : 0.00 %
16.76/16.89 c Root Dual Bound : +0.00000000000000e+00
16.76/16.89 c Root Iterations : 1989
16.86/16.91 c Time complete: 16.86.