0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2702882-1278575760.opb>
0.02/0.04 c original problem has 2892 variables (2892 bin, 0 int, 0 impl, 0 cont) and 3094 constraints
0.02/0.04 c problem read
0.02/0.04 c No objective function, only one solution is needed.
0.02/0.04 c presolving settings loaded
0.02/0.08 c presolving:
0.09/0.18 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 601 upgd conss, 20336 impls, 400 clqs
0.19/0.26 c presolving (2 rounds):
0.19/0.26 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.19/0.26 c 20336 implications, 400 cliques
0.19/0.26 c presolved problem has 2892 variables (2892 bin, 0 int, 0 impl, 0 cont) and 3094 constraints
0.19/0.26 c 1 constraints of type <knapsack>
0.19/0.26 c 600 constraints of type <setppc>
0.19/0.26 c 2492 constraints of type <and>
0.19/0.26 c 1 constraints of type <linear>
0.19/0.26 c transformed objective value is always integral (scale: 1)
0.19/0.26 c Presolving Time: 0.19
0.19/0.26 c - non default parameters ----------------------------------------------------------------------
0.19/0.26 c # SCIP version 1.2.1.3
0.19/0.26 c
0.19/0.26 c # frequency for displaying node information lines
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 100]
0.19/0.26 c display/freq = 10000
0.19/0.26 c
0.19/0.26 c # maximal time in seconds to run
0.19/0.26 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.26 c limits/time = 1789.97
0.19/0.26 c
0.19/0.26 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.19/0.26 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.26 c limits/memory = 1620
0.19/0.26 c
0.19/0.26 c # solving stops, if the given number of solutions were found (-1: no limit)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.26 c limits/solutions = 1
0.19/0.26 c
0.19/0.26 c # maximal number of separation rounds per node (-1: unlimited)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 5]
0.19/0.26 c separating/maxrounds = 1
0.19/0.26 c
0.19/0.26 c # maximal number of separation rounds in the root node (-1: unlimited)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.26 c separating/maxroundsroot = 5
0.19/0.26 c
0.19/0.26 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.19/0.26 c # [type: int, range: [1,2], default: 1]
0.19/0.26 c timing/clocktype = 2
0.19/0.26 c
0.19/0.26 c # should presolving try to simplify inequalities
0.19/0.26 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.26 c constraints/linear/simplifyinequalities = TRUE
0.19/0.26 c
0.19/0.26 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.19/0.26 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.26 c constraints/indicator/addCouplingCons = TRUE
0.19/0.26 c
0.19/0.26 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.19/0.26 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.19/0.26 c constraints/knapsack/disaggregation = FALSE
0.19/0.26 c
0.19/0.26 c # should presolving try to simplify knapsacks
0.19/0.26 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.26 c constraints/knapsack/simplifyinequalities = TRUE
0.19/0.26 c
0.19/0.26 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.26 c presolving/probing/maxrounds = 0
0.19/0.26 c
0.19/0.26 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.26 c heuristics/coefdiving/freq = -1
0.19/0.26 c
0.19/0.26 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.26 c heuristics/coefdiving/maxlpiterquot = 0.075
0.19/0.26 c
0.19/0.26 c # additional number of allowed LP iterations
0.19/0.26 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.26 c heuristics/coefdiving/maxlpiterofs = 1500
0.19/0.26 c
0.19/0.26 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 30]
0.19/0.26 c heuristics/crossover/freq = -1
0.19/0.26 c
0.19/0.26 c # number of nodes added to the contingent of the total nodes
0.19/0.26 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.19/0.26 c heuristics/crossover/nodesofs = 750
0.19/0.26 c
0.19/0.26 c # number of nodes without incumbent change that heuristic should wait
0.19/0.26 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.19/0.26 c heuristics/crossover/nwaitingnodes = 100
0.19/0.26 c
0.19/0.26 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.19/0.26 c # [type: real, range: [0,1], default: 0.1]
0.19/0.26 c heuristics/crossover/nodesquot = 0.15
0.19/0.26 c
0.19/0.26 c # minimum percentage of integer variables that have to be fixed
0.19/0.26 c # [type: real, range: [0,1], default: 0.666]
0.19/0.26 c heuristics/crossover/minfixingrate = 0.5
0.19/0.26 c
0.19/0.26 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.26 c heuristics/feaspump/freq = -1
0.19/0.26 c
0.19/0.26 c # additional number of allowed LP iterations
0.19/0.26 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.26 c heuristics/feaspump/maxlpiterofs = 2000
0.19/0.26 c
0.19/0.26 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.26 c heuristics/fracdiving/freq = -1
0.19/0.26 c
0.19/0.26 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.26 c heuristics/fracdiving/maxlpiterquot = 0.075
0.19/0.26 c
0.19/0.26 c # additional number of allowed LP iterations
0.19/0.26 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.26 c heuristics/fracdiving/maxlpiterofs = 1500
0.19/0.26 c
0.19/0.26 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.26 c heuristics/guideddiving/freq = -1
0.19/0.26 c
0.19/0.26 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.26 c heuristics/guideddiving/maxlpiterquot = 0.075
0.19/0.26 c
0.19/0.26 c # additional number of allowed LP iterations
0.19/0.26 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.26 c heuristics/guideddiving/maxlpiterofs = 1500
0.19/0.26 c
0.19/0.26 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.26 c heuristics/intdiving/maxlpiterquot = 0.075
0.19/0.26 c
0.19/0.26 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.26 c heuristics/intshifting/freq = -1
0.19/0.26 c
0.19/0.26 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.26 c heuristics/linesearchdiving/freq = -1
0.19/0.26 c
0.19/0.26 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.26 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.19/0.26 c
0.19/0.26 c # additional number of allowed LP iterations
0.19/0.26 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.26 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.19/0.26 c
0.19/0.26 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.26 c heuristics/nlp/freq = -1
0.19/0.26 c
0.19/0.26 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.26 c heuristics/objpscostdiving/freq = -1
0.19/0.26 c
0.19/0.26 c # maximal fraction of diving LP iterations compared to total iteration number
0.19/0.26 c # [type: real, range: [0,1], default: 0.01]
0.19/0.26 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.19/0.26 c
0.19/0.26 c # additional number of allowed LP iterations
0.19/0.26 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.26 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.19/0.26 c
0.19/0.26 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.26 c heuristics/oneopt/freq = -1
0.19/0.26 c
0.19/0.26 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.26 c heuristics/pscostdiving/freq = -1
0.19/0.26 c
0.19/0.26 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.26 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.19/0.26 c
0.19/0.26 c # additional number of allowed LP iterations
0.19/0.26 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.26 c heuristics/pscostdiving/maxlpiterofs = 1500
0.19/0.26 c
0.19/0.26 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.26 c heuristics/rens/freq = -1
0.19/0.26 c
0.19/0.26 c # minimum percentage of integer variables that have to be fixable
0.19/0.26 c # [type: real, range: [0,1], default: 0.5]
0.19/0.26 c heuristics/rens/minfixingrate = 0.3
0.19/0.26 c
0.19/0.26 c # number of nodes added to the contingent of the total nodes
0.19/0.26 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.19/0.26 c heuristics/rens/nodesofs = 2000
0.19/0.26 c
0.19/0.26 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.26 c heuristics/rootsoldiving/freq = -1
0.19/0.26 c
0.19/0.26 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.19/0.26 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.19/0.26 c
0.19/0.26 c # additional number of allowed LP iterations
0.19/0.26 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.26 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.19/0.26 c
0.19/0.26 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.26 c heuristics/rounding/freq = -1
0.19/0.26 c
0.19/0.26 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.26 c heuristics/shifting/freq = -1
0.19/0.26 c
0.19/0.26 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.26 c heuristics/simplerounding/freq = -1
0.19/0.26 c
0.19/0.26 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.26 c heuristics/trivial/freq = -1
0.19/0.26 c
0.19/0.26 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.26 c heuristics/trysol/freq = -1
0.19/0.26 c
0.19/0.26 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.26 c heuristics/veclendiving/freq = -1
0.19/0.26 c
0.19/0.26 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.26 c heuristics/veclendiving/maxlpiterquot = 0.075
0.19/0.26 c
0.19/0.26 c # additional number of allowed LP iterations
0.19/0.26 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.26 c heuristics/veclendiving/maxlpiterofs = 1500
0.19/0.26 c
0.19/0.26 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.26 c heuristics/zirounding/freq = -1
0.19/0.26 c
0.19/0.26 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.26 c separating/cmir/freq = -1
0.19/0.26 c
0.19/0.26 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.26 c separating/flowcover/freq = -1
0.19/0.26 c
0.19/0.26 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.19/0.26 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.26 c separating/rapidlearning/freq = 0
0.19/0.26 c
0.19/0.26 c -----------------------------------------------------------------------------------------------
0.19/0.26 c start solving
0.19/0.26 c
0.49/0.53 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.53 c 0.5s| 1 | 0 | 615 | - | 12M| 0 | 309 |2892 |3094 |2892 |5586 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
3.39/3.46 c 3.4s| 1 | 0 | 757 | - | 15M| 0 | 308 |2892 |3094 |2892 |5617 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
5.09/5.16 c 5.1s| 1 | 0 | 931 | - | 17M| 0 | 313 |2892 |3094 |2892 |5633 | 47 | 0 | 0 | 0.000000e+00 | -- | Inf
7.49/7.60 c 7.6s| 1 | 0 | 1023 | - | 19M| 0 | 321 |2892 |3094 |2892 |5650 | 64 | 0 | 0 | 0.000000e+00 | -- | Inf
8.79/8.82 c 8.8s| 1 | 0 | 1073 | - | 21M| 0 | 324 |2892 |3094 |2892 |5660 | 74 | 0 | 0 | 0.000000e+00 | -- | Inf
10.09/10.11 c 10.1s| 1 | 0 | 1191 | - | 23M| 0 | 323 |2892 |3094 |2892 |5667 | 81 | 0 | 0 | 0.000000e+00 | -- | Inf
14.30/14.39 c 14.3s| 1 | 2 | 1191 | - | 23M| 0 | 323 |2892 |3094 |2892 |5667 | 81 | 0 | 11 | 0.000000e+00 | -- | Inf
41.36/41.46 c *41.4s| 97 | 0 | 6954 | 60.0 | 23M| 77 | - |2892 |3108 |2892 |1310 |1201 | 14 |1178 | 0.000000e+00 | 0.000000e+00 | 0.00%
41.36/41.47 c
41.36/41.47 c SCIP Status : problem is solved [optimal solution found]
41.36/41.47 c Solving Time (sec) : 41.42
41.36/41.47 c Solving Nodes : 97
41.36/41.47 c Primal Bound : +0.00000000000000e+00 (1 solutions)
41.36/41.47 c Dual Bound : +0.00000000000000e+00
41.36/41.47 c Gap : 0.00 %
41.36/41.47 s SATISFIABLE
41.36/41.47 v -x337 -x271 x243 -x325 -x375 -x334 x247 -x395 -x360 -x303 x396 x330 -x295 -x298 -x296 -x256 -x244 -x394 -x313 -x328 -x326 -x258
41.36/41.47 v -x377 -x287 -x227 -x249 -x251 -x289 -x263 -x381 -x308 -x302 -x286 -x388 -x226 -x348 -x354 -x364 -x230 -x301 -x266 x314 -x352
41.36/41.47 v -x272 -x365 -x223 -x312 -x290 -x281 -x240 -x220 -x279 -x327 -x353 x216 -x339 -x241 -x341 -x267 x372 -x268 -x399 -x217 x323 -x345
41.36/41.47 v -x340 -x285 -x269 -x292 -x351 x213 -x305 -x232 -x333 -x382 -x342 -x306 -x336 x275 x393 -x390 x273 -x233 -x284 -x212 x347
41.36/41.47 v -x283 -x384 -x355 x239 -x215 -x319 x309 -x356 -x209 -x260 -x242 -x224 -x218 -x252 -x304 -x282 -x277 -x254 x234 x386 x207 -x371
41.36/41.47 v -x288 x311 x391 -x369 -x318 -x257 x317 x206 x379 -x359 x338 -x235 -x363 -x349 x324 x361 -x367 -x400 -x246 x205 -x344 -x321
41.36/41.47 v -x293 -x259 -x208 -x276 -x315 -x357 -x366 x261 -x307 -x329 x385 -x237 x236 -x358 x398 x378 x253 -x397 x362 -x383 -x387 x203
41.36/41.47 v -x335 -x310 -x274 -x270 -x248 -x225 -x204 x214 -x297 x231 -x211 -x392 -x316 x370 -x373 -x202 -x332 -x322 -x300 -x280 -x245 -x229
41.36/41.47 v x219 -x210 -x331 -x368 -x374 -x255 -x250 -x238 -x294 -x350 -x380 -x343 -x201 -x264 -x222 -x221 -x228 -x346 -x278 -x265 -x299
41.36/41.47 v -x262 -x376 x389 -x320 -x291 -x200 -x199 -x198 -x197 -x196 x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185
41.36/41.47 v -x184 -x183 -x182 -x181 -x180 -x179 -x178 x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164
41.36/41.47 v -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 x150 -x149 x148 -x147 -x146 -x145 -x144 x143
41.36/41.47 v -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 x126 -x125 -x124 -x123 -x122
41.36/41.47 v -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 x104 -x103 -x102 -x101
41.36/41.47 v -x100 -x99 -x98 -x97 x96 -x95 x94 -x93 -x92 -x91 -x90 x89 -x88 -x87 x86 -x85 x84 -x83 x82 x81 -x80 x79 -x78 x77 x76 -x75 -x74
41.36/41.47 v -x73 -x72 x71 -x70 x69 -x68 -x67 x66 -x65 -x64 x63 x62 -x61 -x60 -x59 x58 -x57 -x56 -x55 x54 -x53 x52 x51 x50 -x49 -x48 -x47
41.36/41.47 v -x46 -x45 -x44 -x43 x42 x41 -x40 -x39 -x38 -x37 -x36 x35 -x34 x33 -x32 -x31 -x30 x29 -x28 -x27 x26 x25 -x24 x23 -x22 -x21 x20
41.36/41.47 v -x19 x18 x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 x1
41.36/41.47 c SCIP Status : problem is solved [optimal solution found]
41.36/41.47 c Solving Time : 41.42
41.36/41.47 c Original Problem :
41.36/41.47 c Problem name : HOME/instance-2702882-1278575760.opb
41.36/41.47 c Variables : 2892 (2892 binary, 0 integer, 0 implicit integer, 0 continuous)
41.36/41.47 c Constraints : 3094 initial, 3094 maximal
41.36/41.47 c Presolved Problem :
41.36/41.47 c Problem name : t_HOME/instance-2702882-1278575760.opb
41.36/41.47 c Variables : 2892 (2892 binary, 0 integer, 0 implicit integer, 0 continuous)
41.36/41.47 c Constraints : 3094 initial, 3108 maximal
41.36/41.47 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
41.36/41.47 c trivial : 0.00 0 0 0 0 0 0 0 0
41.36/41.47 c dualfix : 0.00 0 0 0 0 0 0 0 0
41.36/41.47 c boundshift : 0.00 0 0 0 0 0 0 0 0
41.36/41.47 c inttobinary : 0.00 0 0 0 0 0 0 0 0
41.36/41.47 c implics : 0.00 0 0 0 0 0 0 0 0
41.36/41.47 c probing : 0.00 0 0 0 0 0 0 0 0
41.36/41.47 c knapsack : 0.01 0 0 0 0 0 0 0 0
41.36/41.47 c setppc : 0.01 0 0 0 0 0 0 0 0
41.36/41.47 c and : 0.13 0 0 0 0 0 0 0 0
41.36/41.47 c linear : 0.03 0 0 0 0 0 0 0 0
41.36/41.47 c logicor : 0.00 0 0 0 0 0 0 0 0
41.36/41.47 c root node : - 0 - - 0 - - - -
41.36/41.47 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
41.36/41.47 c integral : 0 0 0 112 0 0 24 0 0 182
41.36/41.47 c knapsack : 1 5 322 3 0 0 0 0 0 0
41.36/41.47 c setppc : 600 5 322 3 0 4 274 0 0 0
41.36/41.47 c and : 2492 97 318 3 0 0 2651 1153 0 0
41.36/41.47 c linear : 1 5 318 1 0 0 0 0 0 0
41.36/41.47 c logicor : 0+ 0 6 0 0 0 5 0 0 0
41.36/41.47 c countsols : 0 0 0 1 0 0 0 0 0 0
41.36/41.47 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
41.36/41.47 c integral : 28.17 0.00 0.00 28.17 0.00
41.36/41.47 c knapsack : 0.05 0.05 0.01 0.00 0.00
41.36/41.47 c setppc : 0.01 0.00 0.01 0.00 0.00
41.36/41.47 c and : 0.13 0.10 0.03 0.00 0.00
41.36/41.47 c linear : 0.01 0.00 0.01 0.00 0.00
41.36/41.47 c logicor : 0.00 0.00 0.00 0.00 0.00
41.36/41.47 c countsols : 0.00 0.00 0.00 0.00 0.00
41.36/41.47 c Propagators : Time Calls Cutoffs DomReds
41.36/41.47 c vbounds : 0.00 1 0 0
41.36/41.47 c rootredcost : 0.00 0 0 0
41.36/41.47 c pseudoobj : 0.00 0 0 0
41.36/41.47 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
41.36/41.47 c propagation : 0.00 4 4 4 3.0 0 0.0 -
41.36/41.47 c infeasible LP : 0.00 1 1 35 100.4 0 0.0 0
41.36/41.47 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
41.36/41.47 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
41.36/41.47 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
41.36/41.47 c applied globally : - - - 14 72.6 - - -
41.36/41.47 c applied locally : - - - 0 0.0 - - -
41.36/41.47 c Separators : Time Calls Cutoffs DomReds Cuts Conss
41.36/41.48 c cut pool : 0.01 4 - - 1 - (maximal pool size: 1008)
41.36/41.48 c redcost : 0.02 97 0 0 0 0
41.36/41.48 c impliedbounds : 0.00 5 0 0 85 0
41.36/41.48 c intobj : 0.00 0 0 0 0 0
41.36/41.48 c cgmip : 0.00 0 0 0 0 0
41.36/41.48 c gomory : 5.83 5 0 0 171 0
41.36/41.48 c strongcg : 2.39 5 0 0 2500 0
41.36/41.48 c cmir : 0.00 0 0 0 0 0
41.36/41.48 c flowcover : 0.00 0 0 0 0 0
41.36/41.48 c clique : 0.05 5 0 0 31 0
41.36/41.48 c zerohalf : 0.00 0 0 0 0 0
41.36/41.48 c mcf : 0.01 1 0 0 0 0
41.36/41.48 c rapidlearning : 0.58 1 0 0 0 0
41.36/41.48 c Pricers : Time Calls Vars
41.36/41.48 c problem variables: 0.00 0 0
41.36/41.48 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
41.36/41.48 c relpscost : 28.17 109 0 24 0 0 182
41.36/41.48 c pscost : 0.00 0 0 0 0 0 0
41.36/41.48 c inference : 0.00 0 0 0 0 0 0
41.36/41.48 c mostinf : 0.00 0 0 0 0 0 0
41.36/41.48 c leastinf : 0.00 0 0 0 0 0 0
41.36/41.48 c fullstrong : 0.00 0 0 0 0 0 0
41.36/41.48 c allfullstrong : 0.00 0 0 0 0 0 0
41.36/41.48 c random : 0.00 0 0 0 0 0 0
41.36/41.48 c Primal Heuristics : Time Calls Found
41.36/41.48 c LP solutions : 0.00 - 1
41.36/41.48 c pseudo solutions : 0.00 - 0
41.36/41.48 c trivial : 0.00 1 0
41.36/41.48 c simplerounding : 0.00 0 0
41.36/41.48 c zirounding : 0.00 0 0
41.36/41.48 c rounding : 0.00 0 0
41.36/41.48 c shifting : 0.00 0 0
41.36/41.48 c intshifting : 0.00 0 0
41.36/41.48 c oneopt : 0.00 0 0
41.36/41.48 c twoopt : 0.00 0 0
41.36/41.48 c fixandinfer : 0.00 0 0
41.36/41.48 c feaspump : 0.00 0 0
41.36/41.48 c coefdiving : 0.00 0 0
41.36/41.48 c pscostdiving : 0.00 0 0
41.36/41.48 c fracdiving : 0.00 0 0
41.36/41.48 c veclendiving : 0.00 0 0
41.36/41.48 c intdiving : 0.00 0 0
41.36/41.48 c actconsdiving : 0.00 0 0
41.36/41.48 c objpscostdiving : 0.00 0 0
41.36/41.48 c rootsoldiving : 0.00 0 0
41.36/41.48 c linesearchdiving : 0.00 0 0
41.36/41.48 c guideddiving : 0.00 0 0
41.36/41.48 c octane : 0.00 0 0
41.36/41.48 c rens : 0.00 0 0
41.36/41.48 c rins : 0.00 0 0
41.36/41.48 c localbranching : 0.00 0 0
41.36/41.48 c mutation : 0.00 0 0
41.36/41.48 c crossover : 0.00 0 0
41.36/41.48 c dins : 0.00 0 0
41.36/41.48 c undercover : 0.00 0 0
41.36/41.48 c nlp : 0.00 0 0
41.36/41.48 c trysol : 0.00 0 0
41.36/41.48 c LP : Time Calls Iterations Iter/call Iter/sec
41.36/41.48 c primal LP : 0.14 0 0 0.00 0.00
41.36/41.48 c dual LP : 3.32 205 6954 33.92 2094.80
41.36/41.48 c lex dual LP : 0.00 0 0 0.00 -
41.36/41.48 c barrier LP : 0.00 0 0 0.00 -
41.36/41.48 c diving/probing LP: 0.00 0 0 0.00 -
41.36/41.48 c strong branching : 28.15 1178 54920 46.62 1950.88
41.36/41.48 c (at root node) : - 11 4027 366.09 -
41.36/41.48 c conflict analysis: 0.00 0 0 0.00 -
41.36/41.48 c B&B Tree :
41.36/41.48 c number of runs : 1
41.36/41.48 c nodes : 97
41.36/41.48 c nodes (total) : 97
41.36/41.48 c nodes left : 0
41.36/41.48 c max depth : 77
41.36/41.48 c max depth (total): 77
41.36/41.48 c backtracks : 1 (1.0%)
41.36/41.48 c delayed cutoffs : 0
41.36/41.48 c repropagations : 67 (47 domain reductions, 0 cutoffs)
41.36/41.48 c avg switch length: 3.28
41.36/41.48 c switching time : 0.20
41.36/41.48 c Solution :
41.36/41.48 c Solutions found : 1 (1 improvements)
41.36/41.48 c First Solution : +0.00000000000000e+00 (in run 1, after 97 nodes, 41.41 seconds, depth 77, found by <relaxation>)
41.36/41.48 c Primal Bound : +0.00000000000000e+00 (in run 1, after 97 nodes, 41.41 seconds, depth 77, found by <relaxation>)
41.36/41.48 c Dual Bound : +0.00000000000000e+00
41.36/41.48 c Gap : 0.00 %
41.36/41.48 c Root Dual Bound : +0.00000000000000e+00
41.36/41.48 c Root Iterations : 1191
41.45/41.52 c Time complete: 41.48.