0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: 947bdb7-dirty]
0.00/0.00 c Copyright (c) 2002-2012 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-3691645-1338019048.opb>
0.00/0.00 c original problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 332 constraints
0.00/0.00 c problem read in 0.00
0.00/0.00 c No objective function, only one solution is needed.
0.00/0.00 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 252 impls, 0 clqs
0.00/0.02 c (round 2) 8 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 5244 impls, 0 clqs
0.00/0.02 c (round 3) 8 del vars, 8 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 5244 impls, 0 clqs
0.00/0.02 c (round 4) 8 del vars, 12 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 5244 impls, 0 clqs
0.00/0.02 c presolving (5 rounds):
0.00/0.02 c 8 deleted vars, 12 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 5244 implications, 0 cliques
0.00/0.02 c presolved problem has 212 variables (212 bin, 0 int, 0 impl, 0 cont) and 320 constraints
0.00/0.02 c 130 constraints of type <knapsack>
0.00/0.02 c 106 constraints of type <setppc>
0.00/0.02 c 84 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 2.1.1.4
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = 1797
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = 13950
0.00/0.02 c
0.00/0.02 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c limits/solutions = 1
0.00/0.02 c
0.00/0.02 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.02 c separating/maxrounds = 1
0.00/0.02 c
0.00/0.02 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/maxroundsroot = 5
0.00/0.02 c
0.00/0.02 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.02 c # [type: int, range: [1,2], default: 1]
0.00/0.02 c timing/clocktype = 2
0.00/0.02 c
0.00/0.02 c # belongs reading time to solving time?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c timing/reading = TRUE
0.00/0.02 c
0.00/0.02 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.02 c constraints/knapsack/disaggregation = FALSE
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/coefdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.02 c heuristics/crossover/freq = -1
0.00/0.02 c
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/crossover/nodesofs = 750
0.00/0.02 c
0.00/0.02 c # number of nodes without incumbent change that heuristic should wait
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.02 c heuristics/crossover/nwaitingnodes = 100
0.00/0.02 c
0.00/0.02 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.02 c # [type: real, range: [0,1], default: 0.1]
0.00/0.02 c heuristics/crossover/nodesquot = 0.15
0.00/0.02 c
0.00/0.02 c # minimum percentage of integer variables that have to be fixed
0.00/0.02 c # [type: real, range: [0,1], default: 0.666]
0.00/0.02 c heuristics/crossover/minfixingrate = 0.5
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/feaspump/freq = -1
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/fracdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/guideddiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/intshifting/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/linesearchdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/objpscostdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.02 c # [type: real, range: [0,1], default: 0.01]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/oneopt/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/pscostdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/rens/freq = -1
0.00/0.02 c
0.00/0.02 c # minimum percentage of integer variables that have to be fixable
0.00/0.02 c # [type: real, range: [0,1], default: 0.5]
0.00/0.02 c heuristics/rens/minfixingrate = 0.3
0.00/0.02 c
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/rens/nodesofs = 2000
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/rootsoldiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/rounding/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/shiftandpropagate/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/shifting/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/simplerounding/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/subnlp/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/trivial/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/trysol/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/undercover/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/veclendiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/zirounding/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c propagating/probing/maxprerounds = 0
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/cmir/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/flowcover/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/rapidlearning/freq = 0
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/indoneopt/freq = -1
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 c
0.00/0.02 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.02 c 0.0s| 1 | 0 | 99 | - |1460k| 0 | 57 | 212 | 320 | 212 | 320 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.08/0.12 c 0.1s| 1 | 0 | 216 | - |1882k| 0 | 112 | 212 | 339 | 212 | 466 | 146 | 0 | 0 | 0.000000e+00 | -- | Inf
0.08/0.17 c 0.2s| 1 | 0 | 285 | - |3183k| 0 | 125 | 212 | 339 | 212 | 569 | 249 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 320 | - |4196k| 0 | 125 | 212 | 339 | 212 | 583 | 263 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.3s| 1 | 0 | 357 | - |5463k| 0 | 127 | 212 | 339 | 212 | 597 | 277 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.49 c 0.3s| 1 | 0 | 453 | - |6753k| 0 | 128 | 212 | 339 | 212 | 599 | 279 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.49 c 0.5s| 1 | 2 | 453 | - |6753k| 0 | 128 | 212 | 339 | 212 | 599 | 279 | 0 | 9 | 0.000000e+00 | -- | Inf
0.99/1.07 c 1.1s| 100 | 25 | 1796 | 13.6 |6885k| 17 | 30 | 212 | 368 | 212 | 410 | 279 | 29 | 649 | 0.000000e+00 | -- | Inf
1.20/1.25 c 1.2s| 200 | 25 | 2450 | 10.0 |6914k| 18 | 27 | 212 | 428 | 212 | 410 | 279 | 89 | 835 | 0.000000e+00 | -- | Inf
1.29/1.36 c 1.4s| 300 | 29 | 3215 | 9.2 |6940k| 20 | 18 | 212 | 474 | 212 | 410 | 279 | 136 | 918 | 0.000000e+00 | -- | Inf
1.39/1.42 c 1.4s| 400 | 28 | 3892 | 8.6 |6958k| 20 | 21 | 212 | 522 | 212 | 410 | 279 | 184 | 951 | 0.000000e+00 | -- | Inf
1.39/1.48 c 1.5s| 500 | 29 | 4626 | 8.4 |6982k| 20 | 19 | 212 | 572 | 212 | 410 | 279 | 235 | 961 | 0.000000e+00 | -- | Inf
1.49/1.51 c * 1.5s| 575 | 0 | 5070 | 8.0 |6964k| 20 | - | 212 | 612 | 212 | 410 | 279 | 276 | 972 | 0.000000e+00 | 0.000000e+00 | 0.00%
1.49/1.51 c
1.49/1.51 c SCIP Status : problem is solved [optimal solution found]
1.49/1.51 c Solving Time (sec) : 1.51
1.49/1.51 c Solving Nodes : 575
1.49/1.51 c Primal Bound : +0.00000000000000e+00 (1 solutions)
1.49/1.51 c Dual Bound : +0.00000000000000e+00
1.49/1.51 c Gap : 0.00 %
1.49/1.51 s SATISFIABLE
1.49/1.51 v x219 -x220 -x217 x218 x215 -x216 x213 -x214 -x211 -x212 -x209 x210 -x207 -x208 -x205 -x206 x203 -x204 x201 -x202 x199 -x200 x197
1.49/1.51 v -x198 x195 -x196 -x193 -x194 x191 -x192 -x189 x190 -x187 x188 -x185 x186 -x183 x184 -x181 x182 -x179 x180 -x177 x178 -x175
1.49/1.51 v -x176 -x173 -x174 -x171 x172 -x169 x170 x167 -x168 x165 -x166 -x163 x164 -x161 x162 x159 -x160 -x157 x158 x155 -x156 x153 -x154
1.49/1.51 v x151 -x152 -x149 x150 -x147 x148 -x145 x146 x143 -x144 x141 -x142 -x139 x140 x137 -x138 x135 -x136 -x133 x134 -x131 x132 -x129
1.49/1.51 v x130 -x128 -x126 x124 x122 -x120 -x118 -x116 -x114 x112 -x110 -x108 x106 x104 -x102 -x100 -x98 -x96 -x94 -x92 -x90 -x88
1.49/1.51 v -x86 -x84 -x82 x80 -x78 x76 -x74 -x72 -x70 -x68 -x66 x64 -x62 -x60 x58 -x56 -x54 -x52 -x50 -x48 -x46 -x44 -x42 -x40 -x38 -x36
1.49/1.51 v -x34 -x32 -x30 -x28 -x26 -x24 -x22 -x20 -x18 -x16 -x14 -x12 -x10 -x8 -x6 -x4 -x2 -x127 -x125 -x123 -x121 -x119 -x117 -x115 -x113
1.49/1.51 v -x111 -x109 -x107 -x105 -x103 -x101 -x99 -x97 -x95 -x93 -x91 -x89 -x87 -x85 x83 x81 -x79 -x77 -x75 -x73 -x71 -x69 -x67 -x65
1.49/1.51 v -x63 -x61 -x59 -x57 -x55 -x53 -x51 -x49 -x47 -x45 -x43 -x41 -x39 x37 x35 -x33 -x31 -x29 -x27 -x25 -x23 -x21 x19 x17 -x15
1.49/1.51 v x13 -x11 -x9 -x7 x5 -x3 x1
1.49/1.51 c SCIP Status : problem is solved [optimal solution found]
1.49/1.51 c Total Time : 1.51
1.49/1.51 c solving : 1.51
1.49/1.51 c presolving : 0.01 (included in solving)
1.49/1.51 c reading : 0.00 (included in solving)
1.49/1.51 c copying : 0.01 (1 #copies) (minimal 0.01, maximal 0.01, average 0.01)
1.49/1.51 c Original Problem :
1.49/1.51 c Problem name : HOME/instance-3691645-1338019048.opb
1.49/1.51 c Variables : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.51 c Constraints : 332 initial, 332 maximal
1.49/1.51 c Objective sense : minimize
1.49/1.51 c Presolved Problem :
1.49/1.51 c Problem name : t_HOME/instance-3691645-1338019048.opb
1.49/1.51 c Variables : 212 (212 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.51 c Constraints : 320 initial, 612 maximal
1.49/1.51 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
1.49/1.51 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.49/1.51 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.49/1.51 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.49/1.51 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.49/1.51 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.49/1.51 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.49/1.51 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.49/1.51 c implics : 0.00 0.00 0 8 0 0 0 0 0 0 0
1.49/1.51 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.49/1.51 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.49/1.51 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.49/1.51 c knapsack : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.49/1.51 c setppc : 0.00 0.00 0 0 0 0 0 12 0 0 0
1.49/1.51 c linear : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.49/1.51 c logicor : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.49/1.51 c root node : - - 0 - - 0 - - - - -
1.49/1.51 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
1.49/1.51 c integral : 0 0 0 0 393 0 3 0 8 106 0 0 658
1.49/1.51 c knapsack : 130 130 5 2182 0 0 0 23547 249 5104 364 0 0
1.49/1.51 c setppc : 106 106 5 1896 0 0 0 5861 3 1560 0 0 0
1.49/1.51 c linear : 0+ 19 5 1145 0 0 0 3 3 25 0 0 0
1.49/1.51 c logicor : 84+ 357 5 1319 1 0 0 405 7 1393 0 0 0
1.49/1.51 c countsols : 0 0 0 0 1 0 2 0 0 0 0 0 0
1.49/1.51 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
1.49/1.51 c integral : 0.90 0.00 0.00 0.00 0.90 0.00 0.00 0.00
1.49/1.51 c knapsack : 0.05 0.00 0.00 0.04 0.00 0.00 0.00 0.01
1.49/1.51 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.49/1.51 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.49/1.51 c logicor : 0.01 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.49/1.51 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.49/1.51 c Propagators : #Propagate #ResProp Cutoffs DomReds
1.49/1.51 c rootredcost : 0 0 0 0
1.49/1.51 c pseudoobj : 0 0 0 0
1.49/1.51 c vbounds : 0 0 0 0
1.49/1.51 c redcost : 398 0 0 0
1.49/1.51 c probing : 0 0 0 0
1.49/1.51 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
1.49/1.51 c rootredcost : 0.00 0.00 0.00 0.00 0.00
1.49/1.51 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
1.49/1.51 c vbounds : 0.00 0.00 0.00 0.00 0.00
1.49/1.51 c redcost : 0.00 0.00 0.00 0.00 0.00
1.49/1.51 c probing : 0.00 0.00 0.00 0.00 0.00
1.49/1.51 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.49/1.51 c propagation : 0.03 262 188 1145 51.5 4 57.5 -
1.49/1.51 c infeasible LP : 0.00 25 0 0 0.0 0 0.0 0
1.49/1.51 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.51 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.51 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.49/1.51 c applied globally : - - - 273 15.9 - - -
1.49/1.51 c applied locally : - - - 3 70.7 - - -
1.49/1.51 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
1.49/1.51 c cut pool : 0.00 4 - - 40 - (maximal pool size: 1485)
1.49/1.51 c closecuts : 0.00 0.00 0 0 0 0 0
1.49/1.51 c impliedbounds : 0.00 0.00 5 0 0 418 0
1.49/1.51 c intobj : 0.00 0.00 0 0 0 0 0
1.49/1.51 c gomory : 0.08 0.00 5 0 0 50 0
1.49/1.51 c cgmip : 0.00 0.00 0 0 0 0 0
1.49/1.51 c strongcg : 0.10 0.00 5 0 0 1687 0
1.49/1.51 c cmir : 0.00 0.00 0 0 0 0 0
1.49/1.51 c flowcover : 0.00 0.00 0 0 0 0 0
1.49/1.51 c clique : 0.00 0.00 1 0 0 0 0
1.49/1.51 c zerohalf : 0.00 0.00 0 0 0 0 0
1.49/1.51 c mcf : 0.00 0.00 1 0 0 0 0
1.49/1.51 c oddcycle : 0.00 0.00 0 0 0 0 0
1.49/1.51 c rapidlearning : 0.08 0.00 1 0 0 0 19
1.49/1.51 c Pricers : ExecTime SetupTime Calls Vars
1.49/1.51 c problem variables: 0.00 - 0 0
1.49/1.51 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
1.49/1.51 c relpscost : 0.90 0.00 392 8 106 0 0 658
1.49/1.51 c pscost : 0.00 0.00 0 0 0 0 0 0
1.49/1.51 c inference : 0.00 0.00 0 0 0 0 0 0
1.49/1.51 c mostinf : 0.00 0.00 0 0 0 0 0 0
1.49/1.51 c leastinf : 0.00 0.00 0 0 0 0 0 0
1.49/1.51 c fullstrong : 0.00 0.00 0 0 0 0 0 0
1.49/1.51 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
1.49/1.51 c random : 0.00 0.00 0 0 0 0 0 0
1.49/1.51 c Primal Heuristics : ExecTime SetupTime Calls Found
1.49/1.51 c LP solutions : 0.00 - - 1
1.49/1.51 c pseudo solutions : 0.00 - - 0
1.49/1.51 c smallcard : 0.00 0.00 0 0
1.49/1.51 c trivial : 0.00 0.00 1 0
1.49/1.51 c shiftandpropagate: 0.00 0.00 0 0
1.49/1.51 c simplerounding : 0.00 0.00 0 0
1.49/1.51 c zirounding : 0.00 0.00 0 0
1.49/1.51 c rounding : 0.00 0.00 0 0
1.49/1.51 c shifting : 0.00 0.00 0 0
1.49/1.51 c intshifting : 0.00 0.00 0 0
1.49/1.51 c oneopt : 0.00 0.00 0 0
1.49/1.51 c twoopt : 0.00 0.00 0 0
1.49/1.51 c indtwoopt : 0.00 0.00 0 0
1.49/1.51 c indoneopt : 0.00 0.00 0 0
1.49/1.51 c fixandinfer : 0.00 0.00 0 0
1.49/1.51 c feaspump : 0.00 0.00 0 0
1.49/1.51 c clique : 0.00 0.00 0 0
1.49/1.51 c indrounding : 0.00 0.00 0 0
1.49/1.51 c indcoefdiving : 0.00 0.00 0 0
1.49/1.51 c coefdiving : 0.00 0.00 0 0
1.49/1.51 c pscostdiving : 0.00 0.00 0 0
1.49/1.51 c nlpdiving : 0.00 0.00 0 0
1.49/1.51 c fracdiving : 0.00 0.00 0 0
1.49/1.51 c veclendiving : 0.00 0.00 0 0
1.49/1.51 c intdiving : 0.00 0.00 0 0
1.49/1.51 c actconsdiving : 0.00 0.00 0 0
1.49/1.51 c objpscostdiving : 0.00 0.00 0 0
1.49/1.51 c rootsoldiving : 0.00 0.00 0 0
1.49/1.51 c linesearchdiving : 0.00 0.00 0 0
1.49/1.51 c guideddiving : 0.00 0.00 0 0
1.49/1.51 c octane : 0.00 0.00 0 0
1.49/1.51 c rens : 0.00 0.00 0 0
1.49/1.51 c rins : 0.00 0.00 0 0
1.49/1.51 c localbranching : 0.00 0.00 0 0
1.49/1.51 c mutation : 0.00 0.00 0 0
1.49/1.51 c crossover : 0.00 0.00 0 0
1.49/1.51 c dins : 0.00 0.00 0 0
1.49/1.51 c vbounds : 0.00 0.00 0 0
1.49/1.51 c undercover : 0.00 0.00 0 0
1.49/1.51 c subnlp : 0.00 0.00 0 0
1.49/1.51 c trysol : 0.00 0.00 0 0
1.49/1.51 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
1.49/1.51 c primal LP : 0.00 1 0 0.00 - 0.00 1
1.49/1.51 c dual LP : 0.21 423 5070 12.01 24422.44 0.00 1
1.49/1.51 c lex dual LP : 0.00 0 0 0.00 -
1.49/1.51 c barrier LP : 0.00 0 0 0.00 - 0.00 0
1.49/1.51 c diving/probing LP: 0.00 0 0 0.00 -
1.49/1.51 c strong branching : 0.89 972 17042 17.53 19183.12
1.49/1.51 c (at root node) : - 9 2068 229.78 -
1.49/1.51 c conflict analysis: 0.00 0 0 0.00 -
1.49/1.51 c B&B Tree :
1.49/1.51 c number of runs : 1
1.49/1.51 c nodes : 575
1.49/1.51 c nodes (total) : 575
1.49/1.51 c nodes left : 0
1.49/1.51 c max depth : 20
1.49/1.51 c max depth (total): 20
1.49/1.51 c backtracks : 119 (20.7%)
1.49/1.51 c delayed cutoffs : 56
1.49/1.51 c repropagations : 294 (1596 domain reductions, 50 cutoffs)
1.49/1.51 c avg switch length: 3.65
1.49/1.51 c switching time : 0.02
1.49/1.51 c Solution :
1.49/1.51 c Solutions found : 1 (1 improvements)
1.49/1.51 c First Solution : +0.00000000000000e+00 (in run 1, after 575 nodes, 1.51 seconds, depth 17, found by <relaxation>)
1.49/1.51 c Primal Bound : +0.00000000000000e+00 (in run 1, after 575 nodes, 1.51 seconds, depth 17, found by <relaxation>)
1.49/1.51 c Dual Bound : +0.00000000000000e+00
1.49/1.51 c Gap : 0.00 %
1.49/1.51 c Root Dual Bound : +0.00000000000000e+00
1.49/1.51 c Root Iterations : 453
1.49/1.52 c Time complete: 1.52.