0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2665695-1276268857.opb>
0.00/0.02 c original problem has 316 variables (316 bin, 0 int, 0 impl, 0 cont) and 686 constraints
0.00/0.02 c problem read
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c presolving settings loaded
0.00/0.03 c presolving:
0.00/0.03 c (round 1) 3 del vars, 1 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 352 impls, 0 clqs
0.00/0.04 c (round 2) 15 del vars, 19 del conss, 13 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 352 impls, 0 clqs
0.00/0.04 c (round 3) 15 del vars, 31 del conss, 13 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 352 impls, 0 clqs
0.00/0.06 c (round 4) 15 del vars, 31 del conss, 13 chg bounds, 0 chg sides, 0 chg coeffs, 655 upgd conss, 352 impls, 0 clqs
0.00/0.08 c (round 5) 21 del vars, 31 del conss, 13 chg bounds, 0 chg sides, 0 chg coeffs, 655 upgd conss, 8648 impls, 6 clqs
0.00/0.08 c presolving (6 rounds):
0.00/0.08 c 21 deleted vars, 31 deleted constraints, 13 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.08 c 8648 implications, 6 cliques
0.00/0.08 c presolved problem has 295 variables (295 bin, 0 int, 0 impl, 0 cont) and 655 constraints
0.00/0.08 c 199 constraints of type <knapsack>
0.00/0.08 c 456 constraints of type <logicor>
0.00/0.08 c transformed objective value is always integral (scale: 1)
0.00/0.08 c Presolving Time: 0.04
0.00/0.08 c - non default parameters ----------------------------------------------------------------------
0.00/0.08 c # SCIP version 1.2.1.2
0.00/0.08 c
0.00/0.08 c # frequency for displaying node information lines
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.08 c display/freq = 10000
0.00/0.08 c
0.00/0.08 c # maximal time in seconds to run
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.08 c limits/time = 1799.99
0.00/0.08 c
0.00/0.08 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.08 c limits/memory = 1620
0.00/0.08 c
0.00/0.08 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.08 c limits/solutions = 1
0.00/0.08 c
0.00/0.08 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.08 c separating/maxrounds = 1
0.00/0.08 c
0.00/0.08 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.08 c separating/maxroundsroot = 5
0.00/0.08 c
0.00/0.08 c # should presolving try to simplify inequalities
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c constraints/linear/simplifyinequalities = TRUE
0.00/0.08 c
0.00/0.08 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.08 c constraints/knapsack/disaggregation = FALSE
0.00/0.08 c
0.00/0.08 c # should presolving try to simplify knapsacks
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.08 c
0.00/0.08 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.08 c presolving/probing/maxrounds = 0
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/coefdiving/freq = -1
0.00/0.08 c
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.08 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.08 c
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.08 c heuristics/crossover/freq = -1
0.00/0.08 c
0.00/0.08 c # number of nodes added to the contingent of the total nodes
0.00/0.08 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.08 c heuristics/crossover/nodesofs = 750
0.00/0.08 c
0.00/0.08 c # number of nodes without incumbent change that heuristic should wait
0.00/0.08 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.08 c heuristics/crossover/nwaitingnodes = 100
0.00/0.08 c
0.00/0.08 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.08 c # [type: real, range: [0,1], default: 0.1]
0.00/0.08 c heuristics/crossover/nodesquot = 0.15
0.00/0.08 c
0.00/0.08 c # minimum percentage of integer variables that have to be fixed
0.00/0.08 c # [type: real, range: [0,1], default: 0.666]
0.00/0.08 c heuristics/crossover/minfixingrate = 0.5
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.08 c heuristics/feaspump/freq = -1
0.00/0.08 c
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/fracdiving/freq = -1
0.00/0.08 c
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.08 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.08 c
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/guideddiving/freq = -1
0.00/0.08 c
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.08 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.08 c
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.08 c
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.08 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/intshifting/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/linesearchdiving/freq = -1
0.00/0.08 c
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.08 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.08 c
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.08 c heuristics/nlp/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.08 c heuristics/objpscostdiving/freq = -1
0.00/0.08 c
0.00/0.08 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.08 c # [type: real, range: [0,1], default: 0.01]
0.00/0.08 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.08 c
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.08 c heuristics/oneopt/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/pscostdiving/freq = -1
0.00/0.08 c
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.08 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.08 c
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.08 c heuristics/rens/freq = -1
0.00/0.08 c
0.00/0.08 c # minimum percentage of integer variables that have to be fixable
0.00/0.08 c # [type: real, range: [0,1], default: 0.5]
0.00/0.08 c heuristics/rens/minfixingrate = 0.3
0.00/0.08 c
0.00/0.08 c # number of nodes added to the contingent of the total nodes
0.00/0.08 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.08 c heuristics/rens/nodesofs = 2000
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.08 c heuristics/rootsoldiving/freq = -1
0.00/0.08 c
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.08 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.08 c
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.08 c heuristics/rounding/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/shifting/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.08 c heuristics/simplerounding/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.08 c heuristics/trivial/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.08 c heuristics/trysol/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/veclendiving/freq = -1
0.00/0.08 c
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.08 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.08 c
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.08 c heuristics/zirounding/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.08 c separating/cmir/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.08 c separating/flowcover/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.08 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.00/0.09 c
0.09/0.12 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.12 c 0.1s| 1 | 0 | 229 | - |2146k| 0 | 137 | 295 | 655 | 295 | 649 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.70/0.70 c 0.6s| 1 | 0 | 662 | - |5338k| 0 | 219 | 295 | 708 | 295 | 932 | 283 | 0 | 0 | 0.000000e+00 | -- | Inf
1.19/1.27 c 1.2s| 1 | 0 | 1293 | - |8741k| 0 | 224 | 295 | 708 | 295 |1076 | 427 | 0 | 0 | 0.000000e+00 | -- | Inf
1.79/1.84 c 1.8s| 1 | 0 | 1864 | - | 11M| 0 | 242 | 295 | 708 | 295 |1174 | 525 | 0 | 0 | 0.000000e+00 | -- | Inf
2.49/2.50 c 2.4s| 1 | 0 | 2551 | - | 14M| 0 | 244 | 295 | 708 | 295 |1270 | 621 | 0 | 0 | 0.000000e+00 | -- | Inf
3.30/3.33 c 3.2s| 1 | 0 | 3598 | - | 17M| 0 | 249 | 295 | 708 | 295 |1325 | 676 | 0 | 0 | 0.000000e+00 | -- | Inf
5.79/5.89 c 5.8s| 1 | 2 | 3598 | - | 17M| 0 | 249 | 295 | 708 | 295 |1325 | 676 | 0 | 9 | 0.000000e+00 | -- | Inf
24.19/24.24 c *23.7s| 973 | 0 | 25254 | 22.3 | 17M| 25 | - | 295 | 880 | 295 | 837 | 676 | 177 |1645 | 0.000000e+00 | 0.000000e+00 | 0.00%
24.19/24.24 c
24.19/24.24 c SCIP Status : problem is solved [optimal solution found]
24.19/24.24 c Solving Time (sec) : 23.73
24.19/24.24 c Solving Nodes : 973
24.19/24.24 c Primal Bound : +0.00000000000000e+00 (1 solutions)
24.19/24.24 c Dual Bound : +0.00000000000000e+00
24.19/24.24 c Gap : 0.00 %
24.19/24.24 s SATISFIABLE
24.19/24.24 v x315 -x316 x313 -x314 -x311 -x312 x309 -x310 x307 -x308 x305 -x306 x303 -x304 x301 -x302 x299 -x300 -x297 -x298 x295 -x296 x293
24.19/24.24 v -x294 x291 -x292 -x289 x290 x287 -x288 -x285 x286 x283 -x284 -x281 x282 x279 -x280 x277 -x278 x275 -x276 -x273 x274 -x271 x272
24.19/24.24 v -x269 x270 -x267 x268 -x265 -x266 -x263 -x264 -x261 -x262 -x259 -x260 -x257 x258 -x255 -x256 -x253 x254 -x251 x252 -x249 x250
24.19/24.24 v -x247 x248 -x245 x246 x243 -x244 -x241 x242 x239 -x240 x237 -x238 x235 -x236 x233 -x234 -x231 x232 -x229 x230 -x227 x228
24.19/24.24 v -x225 x226 -x223 x224 -x221 x222 -x219 x220 x217 -x218 x215 -x216 -x213 x214 -x211 x212 -x209 x210 -x207 x208 x205 -x206 x203
24.19/24.24 v -x204 x201 -x202 -x200 -x198 -x196 -x194 -x192 -x190 -x188 -x186 -x184 -x182 x180 -x178 x176 -x174 -x172 -x170 -x168 -x166 -x164
24.19/24.24 v -x162 x160 x158 -x156 x154 -x152 -x150 -x148 -x146 -x144 -x142 -x140 -x138 -x136 -x134 -x132 -x130 -x128 -x126 -x124 -x122
24.19/24.24 v -x120 -x118 -x116 -x114 -x112 -x110 -x108 -x106 -x104 -x102 -x100 -x98 -x96 -x94 -x92 -x90 -x88 -x86 -x84 -x82 -x80 -x78 -x76
24.19/24.24 v -x74 -x72 -x70 -x68 -x66 -x64 -x62 x60 -x58 x56 x54 -x52 -x50 -x48 -x46 -x44 -x42 -x40 x38 x36 x34 -x32 -x30 -x28 -x26 -x24
24.19/24.24 v -x22 x20 x18 x16 -x14 -x12 -x10 -x8 -x6 -x4 -x2 -x199 -x197 -x195 -x193 x191 -x189 x187 -x185 x183 -x181 -x179 -x177 -x175
24.19/24.24 v -x173 -x171 -x169 -x167 -x165 -x163 -x161 -x159 -x157 -x155 -x153 -x151 -x149 -x147 -x145 -x143 -x141 -x139 -x137 -x135 -x133
24.19/24.24 v -x131 x129 -x127 -x125 -x123 x121 -x119 -x117 -x115 -x113 x111 -x109 -x107 -x105 x103 x101 -x99 -x97 -x95 -x93 -x91 -x89 -x87
24.19/24.24 v x85 x83 x81 -x79 -x77 -x75 -x73 -x71 -x69 x67 -x65 x63 x61 -x59 -x57 -x55 -x53 -x51 -x49 -x47 -x45 -x43 -x41 -x39 -x37 -x35
24.19/24.24 v -x33 -x31 -x29 -x27 -x25 -x23 -x21 -x19 -x17 -x15 -x13 -x11 -x9 -x7 -x5 -x3 -x1
24.19/24.24 c SCIP Status : problem is solved [optimal solution found]
24.19/24.24 c Solving Time : 23.73
24.19/24.24 c Original Problem :
24.19/24.24 c Problem name : HOME/instance-2665695-1276268857.opb
24.19/24.24 c Variables : 316 (316 binary, 0 integer, 0 implicit integer, 0 continuous)
24.19/24.24 c Constraints : 686 initial, 686 maximal
24.19/24.24 c Presolved Problem :
24.19/24.24 c Problem name : t_HOME/instance-2665695-1276268857.opb
24.19/24.24 c Variables : 295 (295 binary, 0 integer, 0 implicit integer, 0 continuous)
24.19/24.24 c Constraints : 655 initial, 880 maximal
24.19/24.24 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
24.19/24.24 c trivial : 0.00 0 0 0 0 0 0 0 0
24.19/24.24 c dualfix : 0.01 0 0 0 0 0 0 0 0
24.19/24.24 c boundshift : 0.00 0 0 0 0 0 0 0 0
24.19/24.24 c inttobinary : 0.00 0 0 0 0 0 0 0 0
24.19/24.24 c implics : 0.00 0 8 0 0 0 0 0 0
24.19/24.24 c probing : 0.00 0 0 0 0 0 0 0 0
24.19/24.24 c knapsack : 0.01 0 0 0 0 0 0 0 0
24.19/24.24 c linear : 0.02 13 0 0 13 0 31 0 0
24.19/24.24 c logicor : 0.00 0 0 0 0 0 0 0 0
24.19/24.24 c root node : - 0 - - 0 - - - -
24.19/24.24 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
24.19/24.24 c integral : 0 0 0 648 0 28 214 0 0 1030
24.19/24.24 c knapsack : 199 5 3548 1 0 282 10762 760 0 0
24.19/24.24 c linear : 0+ 5 2546 0 0 2 56 0 0 0
24.19/24.24 c logicor : 456+ 5 2795 1 0 65 5813 0 0 0
24.19/24.24 c countsols : 0 0 0 1 0 0 0 0 0 0
24.19/24.24 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
24.19/24.24 c integral : 16.32 0.00 0.00 16.32 0.00
24.19/24.24 c knapsack : 0.17 0.03 0.14 0.00 0.00
24.19/24.24 c linear : 0.01 0.00 0.01 0.00 0.00
24.19/24.24 c logicor : 0.05 0.00 0.05 0.00 0.00
24.19/24.24 c countsols : 0.00 0.00 0.00 0.00 0.00
24.19/24.24 c Propagators : Time Calls Cutoffs DomReds
24.19/24.24 c vbounds : 0.00 1 0 0
24.19/24.24 c rootredcost : 0.00 0 0 0
24.19/24.24 c pseudoobj : 0.00 0 0 0
24.19/24.24 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
24.19/24.24 c propagation : 0.01 133 122 938 59.2 4 29.5 -
24.19/24.24 c infeasible LP : 0.03 99 0 0 0.0 0 0.0 0
24.19/24.24 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
24.19/24.24 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
24.19/24.24 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
24.19/24.24 c applied globally : - - - 173 13.0 - - -
24.19/24.24 c applied locally : - - - 4 77.2 - - -
24.19/24.24 c Separators : Time Calls Cutoffs DomReds Cuts Conss
24.19/24.24 c cut pool : 0.00 4 - - 53 - (maximal pool size: 2998)
24.19/24.24 c redcost : 0.00 579 0 0 0 0
24.19/24.24 c impliedbounds : 0.01 5 0 0 1304 0
24.19/24.24 c intobj : 0.00 0 0 0 0 0
24.19/24.24 c cgmip : 0.00 0 0 0 0 0
24.19/24.24 c gomory : 0.87 5 0 0 91 0
24.19/24.24 c strongcg : 0.65 5 0 0 2482 0
24.19/24.24 c cmir : 0.00 0 0 0 0 0
24.19/24.24 c flowcover : 0.00 0 0 0 0 0
24.19/24.24 c clique : 0.00 5 0 0 12 0
24.19/24.24 c zerohalf : 0.00 0 0 0 0 0
24.19/24.24 c mcf : 0.00 1 0 0 0 0
24.19/24.24 c rapidlearning : 0.17 1 0 0 0 53
24.19/24.24 c Pricers : Time Calls Vars
24.19/24.24 c problem variables: 0.00 0 0
24.19/24.24 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
24.19/24.24 c relpscost : 16.32 647 28 214 0 0 1030
24.19/24.24 c pscost : 0.00 0 0 0 0 0 0
24.19/24.24 c inference : 0.00 0 0 0 0 0 0
24.19/24.24 c mostinf : 0.00 0 0 0 0 0 0
24.19/24.24 c leastinf : 0.00 0 0 0 0 0 0
24.19/24.24 c fullstrong : 0.00 0 0 0 0 0 0
24.19/24.24 c allfullstrong : 0.00 0 0 0 0 0 0
24.19/24.24 c random : 0.00 0 0 0 0 0 0
24.19/24.24 c Primal Heuristics : Time Calls Found
24.19/24.24 c LP solutions : 0.00 - 1
24.19/24.24 c pseudo solutions : 0.00 - 0
24.19/24.24 c trivial : 0.00 1 0
24.19/24.24 c simplerounding : 0.00 0 0
24.19/24.24 c zirounding : 0.00 0 0
24.19/24.24 c rounding : 0.00 0 0
24.19/24.24 c shifting : 0.00 0 0
24.19/24.24 c intshifting : 0.00 0 0
24.19/24.24 c oneopt : 0.00 0 0
24.19/24.24 c twoopt : 0.00 0 0
24.19/24.24 c fixandinfer : 0.00 0 0
24.19/24.24 c feaspump : 0.00 0 0
24.19/24.24 c coefdiving : 0.00 0 0
24.19/24.24 c pscostdiving : 0.00 0 0
24.19/24.24 c fracdiving : 0.00 0 0
24.19/24.24 c veclendiving : 0.00 0 0
24.19/24.24 c intdiving : 0.00 0 0
24.19/24.24 c actconsdiving : 0.00 0 0
24.19/24.24 c objpscostdiving : 0.00 0 0
24.19/24.24 c rootsoldiving : 0.00 0 0
24.19/24.24 c linesearchdiving : 0.00 0 0
24.19/24.24 c guideddiving : 0.00 0 0
24.19/24.24 c octane : 0.00 0 0
24.19/24.24 c rens : 0.00 0 0
24.19/24.24 c rins : 0.00 0 0
24.19/24.24 c localbranching : 0.00 0 0
24.19/24.24 c mutation : 0.00 0 0
24.19/24.24 c crossover : 0.00 0 0
24.19/24.24 c dins : 0.00 0 0
24.19/24.24 c undercover : 0.00 0 0
24.19/24.24 c nlp : 0.00 0 0
24.19/24.24 c trysol : 0.00 0 0
24.19/24.24 c LP : Time Calls Iterations Iter/call Iter/sec
24.19/24.24 c primal LP : 0.00 0 0 0.00 -
24.19/24.24 c dual LP : 5.03 752 25254 33.58 5020.68
24.19/24.24 c lex dual LP : 0.00 0 0 0.00 -
24.19/24.24 c barrier LP : 0.00 0 0 0.00 -
24.19/24.24 c diving/probing LP: 0.00 0 0 0.00 -
24.19/24.24 c strong branching : 16.30 1645 82416 50.10 5056.20
24.19/24.24 c (at root node) : - 9 6687 743.00 -
24.19/24.24 c conflict analysis: 0.00 0 0 0.00 -
24.19/24.24 c B&B Tree :
24.19/24.24 c number of runs : 1
24.19/24.24 c nodes : 973
24.19/24.24 c nodes (total) : 973
24.19/24.24 c nodes left : 0
24.19/24.24 c max depth : 25
24.19/24.24 c max depth (total): 25
24.19/24.24 c backtracks : 163 (16.8%)
24.19/24.24 c delayed cutoffs : 21
24.19/24.24 c repropagations : 158 (1014 domain reductions, 19 cutoffs)
24.19/24.24 c avg switch length: 2.70
24.19/24.24 c switching time : 0.06
24.19/24.24 c Solution :
24.19/24.24 c Solutions found : 1 (1 improvements)
24.19/24.24 c First Solution : +0.00000000000000e+00 (in run 1, after 973 nodes, 23.72 seconds, depth 21, found by <relaxation>)
24.19/24.24 c Primal Bound : +0.00000000000000e+00 (in run 1, after 973 nodes, 23.72 seconds, depth 21, found by <relaxation>)
24.19/24.24 c Dual Bound : +0.00000000000000e+00
24.19/24.24 c Gap : 0.00 %
24.19/24.24 c Root Dual Bound : +0.00000000000000e+00
24.19/24.24 c Root Iterations : 3598
24.19/24.26 c Time complete: 24.25.