0.00/0.04 c SCIP version 1.1.0.7
0.00/0.04 c LP-Solver SoPlex 1.4.1
0.00/0.04 c user parameter file <scip.set> not found - using default parameters
0.00/0.04 c read problem <HOME/instance-1884657-1245259898.opb>
0.00/0.04 c original problem has 525 variables (525 bin, 0 int, 0 impl, 0 cont) and 2336 constraints
0.00/0.05 c No objective function, only one solution is needed.
0.00/0.05 c start presolving problem
0.00/0.05 c presolving:
0.04/0.07 c (round 1) 179 del vars, 132 del conss, 27 chg bounds, 0 chg sides, 6 chg coeffs, 0 upgd conss, 10658 impls, 0 clqs
0.04/0.08 c (round 2) 201 del vars, 894 del conss, 63 chg bounds, 56 chg sides, 150 chg coeffs, 0 upgd conss, 12700 impls, 0 clqs
0.04/0.08 c (round 3) 233 del vars, 1026 del conss, 63 chg bounds, 56 chg sides, 150 chg coeffs, 0 upgd conss, 12732 impls, 0 clqs
0.09/0.13 c (round 4) 234 del vars, 1089 del conss, 63 chg bounds, 68 chg sides, 150 chg coeffs, 0 upgd conss, 12732 impls, 0 clqs
0.09/0.18 c (round 5) 234 del vars, 1122 del conss, 63 chg bounds, 68 chg sides, 150 chg coeffs, 1247 upgd conss, 12732 impls, 0 clqs
0.09/0.18 c presolving (6 rounds):
0.09/0.18 c 234 deleted vars, 1122 deleted constraints, 63 tightened bounds, 0 added holes, 68 changed sides, 150 changed coefficients
0.09/0.18 c 12732 implications, 0 cliques
0.09/0.18 c presolved problem has 291 variables (291 bin, 0 int, 0 impl, 0 cont) and 1214 constraints
0.09/0.18 c 1214 constraints of type <logicor>
0.09/0.18 c transformed objective value is always integral (scale: 1)
0.09/0.18 c Presolving Time: 0.13
0.09/0.18 c PURESAT
0.09/0.18 c -----------------------------------------------------------------------------------------------
0.09/0.18 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.18 c separating/flowcover/freq = c -1
0.09/0.18 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.18 c separating/cmir/freq = c -1
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/veclendiving/maxlpiterofs = c 1500
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.09/0.18 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/veclendiving/freq = c -1
0.09/0.18 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/simplerounding/freq = c -1
0.09/0.18 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/shifting/freq = c -1
0.09/0.18 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/rounding/freq = c -1
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.18 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.09/0.18 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.18 c heuristics/rootsoldiving/freq = c -1
0.09/0.18 c # number of nodes added to the contingent of the total nodes
0.09/0.18 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.18 c heuristics/rens/nodesofs = c 2000
0.09/0.18 c # minimum percentage of integer variables that have to be fixable
0.09/0.18 c # [type: real, range: [0,1], default: 0.5]
0.09/0.18 c heuristics/rens/minfixingrate = c 0.3
0.09/0.18 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.18 c heuristics/rens/freq = c -1
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.09/0.18 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/pscostdiving/freq = c -1
0.09/0.18 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/oneopt/freq = c -1
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.09/0.18 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.18 c # [type: real, range: [0,1], default: 0.01]
0.09/0.18 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.09/0.18 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.18 c heuristics/objpscostdiving/freq = c -1
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.09/0.18 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/linesearchdiving/freq = c -1
0.09/0.18 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/intshifting/freq = c -1
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/intdiving/maxlpiterquot = c 0.075
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/guideddiving/maxlpiterofs = c 1500
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.09/0.18 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/guideddiving/freq = c -1
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/fracdiving/maxlpiterofs = c 1500
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.09/0.18 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/fracdiving/freq = c -1
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/feaspump/maxlpiterofs = c 2000
0.09/0.18 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.18 c heuristics/feaspump/freq = c -1
0.09/0.18 c # minimum percentage of integer variables that have to be fixed
0.09/0.18 c # [type: real, range: [0,1], default: 0.666]
0.09/0.18 c heuristics/crossover/minfixingrate = c 0.5
0.09/0.18 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.18 c # [type: real, range: [0,1], default: 0.1]
0.09/0.18 c heuristics/crossover/nodesquot = c 0.15
0.09/0.18 c # number of nodes without incumbent change that heuristic should wait
0.09/0.18 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.18 c heuristics/crossover/nwaitingnodes = c 100
0.09/0.18 c # number of nodes added to the contingent of the total nodes
0.09/0.18 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.18 c heuristics/crossover/nodesofs = c 750
0.09/0.18 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.18 c heuristics/crossover/freq = c -1
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/coefdiving/maxlpiterofs = c 1500
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.09/0.18 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/coefdiving/freq = c -1
0.09/0.18 c # priority of node selection rule <dfs> in standard mode
0.09/0.18 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.18 c nodeselection/dfs/stdpriority = c 1000000
0.09/0.18 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c presolving/probing/maxrounds = c 0
0.09/0.18 c # should presolving try to simplify knapsacks
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.18 c constraints/knapsack/simplifyinequalities = c TRUE
0.09/0.18 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.18 c constraints/knapsack/disaggregation = c FALSE
0.09/0.18 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c constraints/knapsack/maxnumcardlift = c 0
0.09/0.18 c # should presolving try to simplify inequalities
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.18 c constraints/linear/simplifyinequalities = c TRUE
0.09/0.18 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c separating/maxroundsroot = c 5
0.09/0.18 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.18 c separating/maxrounds = c 1
0.09/0.18 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.18 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.18 c lp/pricing = c a
0.09/0.18 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c lp/solvefreq = c 0
0.09/0.18 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c limits/solutions = c 1
0.09/0.18 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.18 c limits/memory = c 1620
0.09/0.18 c # maximal time in seconds to run
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.18 c limits/time = c 1791
0.09/0.18 c # frequency for displaying node information lines
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.18 c display/freq = c 10000
0.09/0.18 c # should enforcement of pseudo solution be disabled?
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.18 c constraints/disableenfops = c TRUE
0.09/0.18 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.18 c constraints/agelimit = c 1
0.09/0.18 c # should binary conflicts be preferred?
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.18 c conflict/preferbinary = c TRUE
0.09/0.18 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c conflict/interconss = c 0
0.09/0.18 c -----------------------------------------------------------------------------------------------
0.09/0.18 c start solving problem
0.09/0.18 c
0.19/0.23 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.23 c 0.2s| 1 | 0 | 374 |3073k| 0 | 116 | 291 |1214 |1214 | 291 |1214 | 0 | 0 | 0 | 1.062500e+02 | -- | Inf
0.29/0.30 c 0.2s| 1 | 0 | 448 |3196k| 0 | 122 | 291 |1214 |1214 | 291 |1226 | 12 | 0 | 0 | 1.102750e+02 | -- | Inf
0.29/0.36 c 0.3s| 1 | 0 | 520 |3272k| 0 | 133 | 291 |1214 |1214 | 291 |1240 | 26 | 0 | 0 | 1.147564e+02 | -- | Inf
0.39/0.44 c 0.4s| 1 | 0 | 614 |3513k| 0 | 157 | 291 |1214 |1214 | 291 |1250 | 36 | 0 | 0 | 1.183500e+02 | -- | Inf
0.48/0.52 c 0.5s| 1 | 0 | 704 |3830k| 0 | 158 | 291 |1214 |1214 | 291 |1265 | 51 | 0 | 0 | 1.213435e+02 | -- | Inf
0.59/0.62 c 0.6s| 1 | 0 | 795 |4270k| 0 | 172 | 291 |1214 |1214 | 291 |1276 | 62 | 0 | 0 | 1.241885e+02 | -- | Inf
1.99/2.03 c 2.0s| 1 | 2 | 795 |4271k| 0 | 172 | 291 |1214 |1214 | 291 |1276 | 62 | 0 | 17 | 1.241885e+02 | -- | Inf
1.99/2.07 c * 2.0s| 72 | 7 | 795 |4398k| 15 | - | 291 |1227 | 193 | 0 | 0 | 62 | 61 | 17 | 2.022500e+02 | 2.440000e+02 | 20.64%
1.99/2.07 c
1.99/2.07 c SCIP Status : solving was interrupted [solution limit reached]
1.99/2.07 c Solving Time (sec) : 2.00
1.99/2.07 c Solving Nodes : 72
1.99/2.07 c Primal Bound : +2.44000000000000e+02 (1 solutions)
1.99/2.07 c Dual Bound : +2.02250000000000e+02
1.99/2.07 c Gap : 20.64 %
1.99/2.07 c NODE 72
1.99/2.07 c DUAL BOUND 202.25
1.99/2.07 c PRIMAL BOUND 244
1.99/2.07 c GAP 0.206428
1.99/2.07 s SATISFIABLE
1.99/2.07 v x14 -x18 -x19 x24 -x28 -x30 x20 -x38 x21 -x41 x25 -x43 x49 -x55 x56 -x4 -x36 -x46 -x54 x3 x35 -x60 -x63 -x69 x73 -x78 x80 x71 -x85
1.99/2.07 v x72 -x87 x76 x92 x94 -x66 -x84 -x89 x97 x65 x82 x98 -x100 -x101 -x103 -x105 -x106 -x109 -x110 -x112 -x113 x114 -x115 x107
1.99/2.07 v x108 x111 -x104 -x117 -x121 x124 x102 x116 x148 x149 x153 -x164 -x167 -x176 -x142 -x162 x184 -x170 -x178 x141 x160 -x165 x168
1.99/2.07 v -x193 -x197 x194 x206 -x192 x195 x199 x198 -x212 -x166 -x215 -x169 -x189 x217 -x205 -x173 -x208 -x213 x187 x203 -x179 x181
1.99/2.07 v x182 -x211 -x221 x185 x214 x190 -x226 -x229 x222 x223 x235 x225 -x241 x227 x230 -x219 -x234 -x240 x244 x218 x232 -x249 -x250
1.99/2.07 v x258 -x247 x251 x256 x257 -x264 -x228 x259 -x266 -x231 x268 x233 -x236 x238 -x239 -x263 -x253 -x271 -x262 x242 x265 -x267 -x269
1.99/2.07 v x252 x261 x246 -x277 x280 x286 -x293 x284 x278 x285 x281 x287 -x300 x301 -x276 -x294 -x299 x304 x275 x292 x308 -x298 x302
1.99/2.07 v x315 -x279 x318 x282 -x320 x283 x312 -x288 x313 x290 x316 -x291 x314 -x323 x295 x317 x297 -x310 -x321 -x324 x326 x309 x319 x188
1.99/2.07 v x180 x207 x204 x224 -x202 x220 x339 x245 x237 x340 x260 x255 x343 x273 -x254 x270 -x336 -x349 x296 -x350 -x356 x335 x348 x289
1.99/2.07 v x311 x307 x325 -x305 x322 x96 x177 x243 x362 x303 x363 x366 x355 x378 -x377 -x361 -x370 -x372 -x376 x360 x369 -x384 -x380
1.99/2.07 v -x391 x386 x387 x393 -x392 x388 -x394 -x398 -x396 x122 -x383 -x390 x119 -x397 x400 x382 x389 -x404 -x407 -x411 -x410 -x413 -x418
1.99/2.07 v -x415 x408 -x123 x409 x412 -x120 x125 -x118 x371 -x403 -x419 -x420 -x421 x402 x417 -x422 x427 x423 x432 -x428 x430 x431
1.99/2.07 v x434 -x437 x440 -x438 -x442 -x445 -x444 -x426 -x436 -x439 x441 x425 x435 x134 -x128 -x452 -x456 -x459 -x457 x450 -x461 x451 -x465
1.99/2.07 v -x463 x455 -x143 -x129 x375 x146 -x449 -x460 -x466 x467 x448 x458 x468 x126 -x379 x447 -x359 x401 x475 x474 x478 -x476 x5
1.99/2.07 v -x29 x6 x8 -x40 -x9 -x484 x11 -x45 x12 -x31 x127 x34 -x58 -x39 x99 x486 x42 -x485 -x44 x50 x57 -x83 x327 -x59 x81 -x272 -x487
1.99/2.07 v -x61 x88 x306 x68 -x86 -x216 -x70 -x95 x248 x74 x93 -x183 -x489 -x488 x159 -x152 -x490 -x493 -x495 -x494 -x496 -x498 -x497
1.99/2.07 v x161 -x156 -x163 x147 -x405 -x406 -x140 -x150 -x154 x145 -x157 -x139 -x151 -x155 x144 -x158 -x453 -x454 -x186 -x196 -x200 x191
1.99/2.07 v -x201 -x334 -x341 -x344 x338 -x346 -x333 -x342 -x345 x337 -x347 -x491 -x492 -x358 -x365 -x367 x357 -x368 -x62 x130 -x381 -x385
1.99/2.07 v -x131 x133 -x395 -x399 -x135 -x137 -x414 -x416 x274 -x328 x171 -x429 x433 x174 -x329 x330 x172 -x443 -x446 -x175 -x331 -x332
1.99/2.07 v -x209 -x462 -x464 -x210 x424 -x469 x351 -x477 x479 x353 -x470 x471 x352 -x480 -x481 -x354 -x472 -x473 -x373 -x482 -x483
1.99/2.07 v -x374 x501 x502 x503 -x500 -x505 x506 -x507 x499 x504 x136 -x1 x7 -x23 x510 -x27 x511 -x33 x512 -x48 x364 -x52 -x509 -x514 -x515
1.99/2.07 v -x516 x508 x513 -x132 -x10 -x2 x16 -x64 x67 x15 -x22 -x26 -x32 -x75 x519 -x37 -x77 x520 -x13 -x79 x521 x17 x90 x47 x53 -x91
1.99/2.07 v -x51 -x518 -x523 x524 -x525 x517 x522 x138
1.99/2.07 c SCIP Status : solving was interrupted [solution limit reached]
1.99/2.07 c Solving Time : 2.00
1.99/2.07 c Original Problem :
1.99/2.07 c Problem name : HOME/instance-1884657-1245259898.opb
1.99/2.07 c Variables : 525 (525 binary, 0 integer, 0 implicit integer, 0 continuous)
1.99/2.07 c Constraints : 2336 initial, 2336 maximal
1.99/2.07 c Presolved Problem :
1.99/2.07 c Problem name : t_HOME/instance-1884657-1245259898.opb
1.99/2.07 c Variables : 291 (291 binary, 0 integer, 0 implicit integer, 0 continuous)
1.99/2.07 c Constraints : 1214 initial, 1231 maximal
1.99/2.07 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.99/2.07 c trivial : 0.00 34 0 0 0 0 0 0 0
1.99/2.07 c dualfix : 0.00 1 0 0 0 0 0 0 0
1.99/2.07 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.99/2.07 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.99/2.07 c implics : 0.00 0 160 0 0 0 0 0 0
1.99/2.07 c probing : 0.00 0 0 0 0 0 0 0 0
1.99/2.07 c linear : 0.08 29 10 0 63 0 1089 68 150
1.99/2.07 c logicor : 0.04 0 0 0 0 0 33 0 0
1.99/2.07 c root node : - 76 - - 76 - - - -
1.99/2.07 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.99/2.07 c integral : 0 0 0 1 0 0 0 0 0 2
1.99/2.07 c logicor : 1214+ 5 529 0 1 36 2330 0 0 0
1.99/2.07 c countsols : 0 0 0 0 1 0 0 0 0 0
1.99/2.07 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.99/2.07 c integral : 1.40 0.00 0.00 1.40 0.00
1.99/2.07 c logicor : 0.01 0.00 0.01 0.00 0.00
1.99/2.07 c countsols : 0.00 0.00 0.00 0.00 0.00
1.99/2.07 c Propagators : Time Calls Cutoffs DomReds
1.99/2.07 c rootredcost : 0.00 0 0 0
1.99/2.07 c pseudoobj : 0.01 574 0 0
1.99/2.07 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.99/2.07 c propagation : 0.00 36 28 28 4.0 33 4.4 -
1.99/2.07 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.99/2.07 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.99/2.07 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.99/2.07 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.99/2.07 c applied globally : - - - 61 4.2 - - -
1.99/2.07 c applied locally : - - - 0 0.0 - - -
1.99/2.07 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.99/2.07 c cut pool : 0.00 4 - - 63 - (maximal pool size: 909)
1.99/2.07 c redcost : 0.00 5 0 0 0 0
1.99/2.07 c impliedbounds : 0.00 5 0 0 0 0
1.99/2.07 c intobj : 0.00 0 0 0 0 0
1.99/2.07 c gomory : 0.15 5 0 0 2500 0
1.99/2.07 c strongcg : 0.14 5 0 0 2500 0
1.99/2.07 c cmir : 0.00 0 0 0 0 0
1.99/2.07 c flowcover : 0.00 0 0 0 0 0
1.99/2.07 c clique : 0.00 5 0 0 27 0
1.99/2.07 c zerohalf : 0.00 0 0 0 0 0
1.99/2.07 c mcf : 0.00 1 0 0 0 0
1.99/2.07 c Pricers : Time Calls Vars
1.99/2.07 c problem variables: 0.00 0 0
1.99/2.07 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.99/2.07 c relpscost : 1.40 1 0 0 0 0 2
1.99/2.07 c pscost : 0.00 0 0 0 0 0 0
1.99/2.07 c inference : 0.00 49 0 0 0 0 98
1.99/2.07 c mostinf : 0.00 0 0 0 0 0 0
1.99/2.07 c leastinf : 0.00 0 0 0 0 0 0
1.99/2.07 c fullstrong : 0.00 0 0 0 0 0 0
1.99/2.07 c allfullstrong : 0.00 0 0 0 0 0 0
1.99/2.07 c random : 0.00 0 0 0 0 0 0
1.99/2.07 c Primal Heuristics : Time Calls Found
1.99/2.07 c LP solutions : 0.00 - 0
1.99/2.07 c pseudo solutions : 0.00 - 1
1.99/2.07 c simplerounding : 0.00 0 0
1.99/2.07 c rounding : 0.00 0 0
1.99/2.07 c shifting : 0.00 0 0
1.99/2.07 c intshifting : 0.00 0 0
1.99/2.07 c oneopt : 0.00 0 0
1.99/2.07 c fixandinfer : 0.00 0 0
1.99/2.07 c feaspump : 0.00 0 0
1.99/2.07 c coefdiving : 0.00 0 0
1.99/2.07 c pscostdiving : 0.00 0 0
1.99/2.07 c fracdiving : 0.00 0 0
1.99/2.07 c veclendiving : 0.00 0 0
1.99/2.07 c intdiving : 0.00 0 0
1.99/2.07 c actconsdiving : 0.00 0 0
1.99/2.07 c objpscostdiving : 0.00 0 0
1.99/2.07 c rootsoldiving : 0.00 0 0
1.99/2.07 c linesearchdiving : 0.00 0 0
1.99/2.07 c guideddiving : 0.00 0 0
1.99/2.07 c octane : 0.00 0 0
1.99/2.07 c rens : 0.00 0 0
1.99/2.07 c rins : 0.00 0 0
1.99/2.07 c localbranching : 0.00 0 0
1.99/2.07 c mutation : 0.00 0 0
1.99/2.07 c crossover : 0.00 0 0
1.99/2.07 c dins : 0.00 0 0
1.99/2.07 c LP : Time Calls Iterations Iter/call Iter/sec
1.99/2.07 c primal LP : 0.00 0 0 0.00 -
1.99/2.07 c dual LP : 0.12 6 795 132.50 6625.00
1.99/2.07 c barrier LP : 0.00 0 0 0.00 -
1.99/2.07 c diving/probing LP: 0.00 0 0 0.00 -
1.99/2.07 c strong branching : 1.40 17 5691 334.76 4065.00
1.99/2.07 c (at root node) : - 17 5691 334.76 -
1.99/2.07 c conflict analysis: 0.00 0 0 0.00 -
1.99/2.07 c B&B Tree :
1.99/2.07 c number of runs : 1
1.99/2.07 c nodes : 72
1.99/2.07 c nodes (total) : 72
1.99/2.07 c nodes left : 7
1.99/2.07 c max depth : 15
1.99/2.07 c max depth (total): 15
1.99/2.07 c backtracks : 20 (27.8%)
1.99/2.07 c delayed cutoffs : 21
1.99/2.07 c repropagations : 62 (738 domain reductions, 15 cutoffs)
1.99/2.07 c avg switch length: 2.85
1.99/2.07 c switching time : 0.00
1.99/2.07 c Solution :
1.99/2.07 c Solutions found : 1 (1 improvements)
1.99/2.07 c Primal Bound : +2.44000000000000e+02 (in run 1, after 72 nodes, 2.00 seconds, depth 10, found by <relaxation>)
1.99/2.07 c Dual Bound : +2.02250000000000e+02
1.99/2.07 c Gap : 20.64 %
1.99/2.07 c Root Dual Bound : +1.24188517091960e+02
1.99/2.08 c Time complete: 2.08.