0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
0.00/0.00 c Copyright (c) 2002-2011 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-3489154-1307751992.opb>
0.00/0.02 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 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.02 c presolving:
0.00/0.04 c (round 1) 0 del vars, 143 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.00/0.04 c (round 2) 0 del vars, 143 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.00/0.05 c (round 3) 0 del vars, 264 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.00/0.05 c presolving (4 rounds):
0.00/0.05 c 0 deleted vars, 264 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.05 c 242 implications, 22 cliques
0.00/0.05 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2443 constraints
0.00/0.05 c 1 constraints of type <knapsack>
0.00/0.05 c 22 constraints of type <setppc>
0.00/0.05 c 2420 constraints of type <logicor>
0.00/0.05 c transformed objective value is always integral (scale: 1)
0.00/0.05 c Presolving Time: 0.03
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c # SCIP version 2.0.1.5
0.00/0.05 c
0.00/0.05 c # frequency for displaying node information lines
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.05 c display/freq = 10000
0.00/0.05 c
0.00/0.05 c # maximal time in seconds to run
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/time = 1797
0.00/0.05 c
0.00/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/memory = 13950
0.00/0.05 c
0.00/0.05 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c limits/solutions = 1
0.00/0.05 c
0.00/0.05 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.05 c separating/maxrounds = 1
0.00/0.05 c
0.00/0.05 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/maxroundsroot = 5
0.00/0.05 c
0.00/0.05 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.05 c # [type: int, range: [1,2], default: 1]
0.00/0.05 c timing/clocktype = 2
0.00/0.05 c
0.00/0.05 c # belongs reading time to solving time?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c timing/reading = TRUE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify inequalities
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/linear/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/indicator/addCouplingCons = TRUE
0.00/0.05 c
0.00/0.05 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.05 c constraints/knapsack/disaggregation = FALSE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify knapsacks
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c presolving/probing/maxrounds = 0
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/coefdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.05 c heuristics/crossover/freq = -1
0.00/0.05 c
0.00/0.05 c # number of nodes added to the contingent of the total nodes
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.05 c heuristics/crossover/nodesofs = 750
0.00/0.05 c
0.00/0.05 c # number of nodes without incumbent change that heuristic should wait
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.05 c heuristics/crossover/nwaitingnodes = 100
0.00/0.05 c
0.00/0.05 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.05 c # [type: real, range: [0,1], default: 0.1]
0.00/0.05 c heuristics/crossover/nodesquot = 0.15
0.00/0.05 c
0.00/0.05 c # minimum percentage of integer variables that have to be fixed
0.00/0.05 c # [type: real, range: [0,1], default: 0.666]
0.00/0.05 c heuristics/crossover/minfixingrate = 0.5
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/feaspump/freq = -1
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/fracdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/guideddiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/intshifting/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/linesearchdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/objpscostdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.05 c # [type: real, range: [0,1], default: 0.01]
0.00/0.05 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/oneopt/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/pscostdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/rens/freq = -1
0.00/0.05 c
0.00/0.05 c # minimum percentage of integer variables that have to be fixable
0.00/0.05 c # [type: real, range: [0,1], default: 0.5]
0.00/0.05 c heuristics/rens/minfixingrate = 0.3
0.00/0.05 c
0.00/0.05 c # number of nodes added to the contingent of the total nodes
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.05 c heuristics/rens/nodesofs = 2000
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/rootsoldiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.05 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/rounding/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/shiftandpropagate/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/shifting/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/simplerounding/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/subnlp/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/trivial/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/trysol/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/undercover/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/veclendiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/zirounding/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c separating/cmir/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c separating/flowcover/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/rapidlearning/freq = 0
0.00/0.05 c
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c start solving
0.00/0.05 c
0.00/0.06 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.06 c 0.1s| 1 | 0 | 76 | - |3825k| 0 | 36 | 231 |2443 | 231 |2443 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.08/0.15 c 0.1s| 1 | 0 | 90 | - |4124k| 0 | 43 | 231 |2490 | 231 |2454 | 11 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 105 | - |4571k| 0 | 46 | 231 |2490 | 231 |2458 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
0.28/0.32 c 0.3s| 1 | 0 | 111 | - |4866k| 0 | 45 | 231 |2490 | 231 |2460 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.45 c 0.4s| 1 | 0 | 129 | - |5133k| 0 | 46 | 231 |2490 | 231 |2463 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.57 c 0.6s| 1 | 0 | 151 | - |5403k| 0 | 50 | 231 |2490 | 231 |2467 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.65 c 0.7s| 1 | 2 | 151 | - |5404k| 0 | 50 | 231 |2490 | 231 |2467 | 24 | 0 | 9 | 0.000000e+00 | -- | Inf
3.39/3.42 c * 3.4s| 27 | 0 | 1728 | 60.7 |5567k| 11 | - | 231 |2491 | 231 |2451 | 24 | 1 | 435 | 0.000000e+00 | 0.000000e+00 | 0.00%
3.39/3.42 c
3.39/3.42 c SCIP Status : problem is solved [optimal solution found]
3.39/3.42 c Solving Time (sec) : 3.42
3.39/3.42 c Solving Nodes : 27
3.39/3.42 c Primal Bound : +0.00000000000000e+00 (1 solutions)
3.39/3.42 c Dual Bound : +0.00000000000000e+00
3.39/3.42 c Gap : 0.00 %
3.39/3.42 s SATISFIABLE
3.39/3.42 v -x221 -x211 -x201 x191 -x181 -x171 -x161 -x151 -x141 -x131 -x231 -x210 x200 -x190 -x180 -x170 -x160 -x150 -x140 -x130 -x230 x220
3.39/3.42 v -x199 -x189 -x179 -x169 -x159 -x149 -x139 -x129 -x229 -x219 -x209 -x188 -x178 -x168 -x158 x148 -x138 -x128 -x228 -x218 -x208
3.39/3.42 v -x198 -x177 -x167 -x157 -x147 x137 -x127 -x227 -x217 -x207 -x197 -x187 x166 -x156 -x146 -x136 -x126 -x226 -x216 -x206 -x196
3.39/3.42 v -x186 -x176 -x155 -x145 -x135 x125 -x225 -x215 x205 -x195 -x185 -x175 -x165 -x144 -x134 -x124 -x224 -x214 -x204 -x194 -x184
3.39/3.42 v x174 -x164 -x154 -x133 -x123 -x223 -x213 -x203 -x193 -x183 -x173 -x163 x153 -x143 -x122 x222 -x212 -x202 -x192 -x182 -x172 -x162
3.39/3.42 v -x152 -x142 -x132 -x121 -x120 -x119 -x118 -x117 -x116 x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104
3.39/3.42 v -x103 -x102 -x101 x100 x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 x84 -x83 -x82 -x81 -x80
3.39/3.42 v -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 x59 -x58 -x57 -x56 -x55 -x54
3.39/3.42 v x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 x30 -x29
3.39/3.42 v -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x11 -x21 -x10 -x20 -x9 -x19 -x8 -x18 -x7 -x17 x6 -x16 -x5 -x15 -x4 x14 -x3 -x13 -x2 -x12
3.39/3.42 v -x1
3.39/3.42 c SCIP Status : problem is solved [optimal solution found]
3.39/3.42 c Total Time : 3.42
3.39/3.42 c solving : 3.42
3.39/3.42 c presolving : 0.03 (included in solving)
3.39/3.42 c reading : 0.02 (included in solving)
3.39/3.42 c Original Problem :
3.39/3.42 c Problem name : HOME/instance-3489154-1307751992.opb
3.39/3.42 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
3.39/3.42 c Constraints : 2707 initial, 2707 maximal
3.39/3.42 c Presolved Problem :
3.39/3.42 c Problem name : t_HOME/instance-3489154-1307751992.opb
3.39/3.42 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
3.39/3.42 c Constraints : 2443 initial, 2491 maximal
3.39/3.42 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
3.39/3.42 c trivial : 0.00 0 0 0 0 0 0 0 0 0
3.39/3.42 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
3.39/3.42 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
3.39/3.42 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
3.39/3.42 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
3.39/3.42 c implics : 0.00 0 0 0 0 0 0 0 0 0
3.39/3.42 c probing : 0.00 0 0 0 0 0 0 0 0 0
3.39/3.42 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
3.39/3.42 c setppc : 0.00 0 0 0 0 0 121 0 0 0
3.39/3.42 c linear : 0.01 0 0 0 0 0 143 0 0 0
3.39/3.42 c logicor : 0.01 0 0 0 0 0 0 0 0 0
3.39/3.42 c root node : - 0 - - 0 - - - - -
3.39/3.42 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
3.39/3.42 c integral : 0 0 0 71 0 3 0 4 111 0 0 40
3.39/3.42 c knapsack : 1 5 115 0 0 0 0 0 141 0 0 0
3.39/3.42 c setppc : 22 5 123 0 0 0 36 0 118 0 0 0
3.39/3.42 c linear : 0+ 5 85 0 0 0 0 0 0 0 0 0
3.39/3.42 c logicor : 2420+ 5 96 1 0 0 36 1 227 0 0 0
3.39/3.42 c countsols : 0 0 0 1 0 2 0 0 0 0 0 0
3.39/3.42 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
3.39/3.42 c integral : 2.65 0.00 0.00 2.65 0.00 0.00 0.00
3.39/3.42 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
3.39/3.42 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
3.39/3.42 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
3.39/3.42 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
3.39/3.42 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
3.39/3.42 c Propagators : #Propagate #Resprop Cutoffs DomReds
3.39/3.42 c vbounds : 0 0 0 0
3.39/3.42 c rootredcost : 0 0 0 0
3.39/3.42 c pseudoobj : 0 0 0 0
3.39/3.42 c Propagator Timings : TotalTime Propagate Resprop
3.39/3.42 c vbounds : 0.00 0.00 0.00
3.39/3.42 c rootredcost : 0.00 0.00 0.00
3.39/3.42 c pseudoobj : 0.00 0.00 0.00
3.39/3.42 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.39/3.42 c propagation : 0.00 1 1 2 32.0 0 0.0 -
3.39/3.42 c infeasible LP : 0.00 1 0 0 0.0 0 0.0 0
3.39/3.42 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.39/3.42 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.39/3.42 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.39/3.42 c applied globally : - - - 1 29.0 - - -
3.39/3.42 c applied locally : - - - 0 0.0 - - -
3.39/3.42 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.39/3.42 c cut pool : 0.00 4 - - 122 - (maximal pool size: 501)
3.39/3.42 c redcost : 0.00 31 0 0 0 0
3.39/3.42 c impliedbounds : 0.00 5 0 0 0 0
3.39/3.42 c intobj : 0.00 0 0 0 0 0
3.39/3.42 c gomory : 0.26 5 0 0 1251 0
3.39/3.42 c cgmip : 0.00 0 0 0 0 0
3.39/3.42 c closecuts : 0.00 0 0 0 0 0
3.39/3.42 c strongcg : 0.19 5 0 0 2342 0
3.39/3.42 c cmir : 0.00 0 0 0 0 0
3.39/3.42 c flowcover : 0.00 0 0 0 0 0
3.39/3.42 c clique : 0.00 5 0 0 0 0
3.39/3.42 c zerohalf : 0.00 0 0 0 0 0
3.39/3.42 c mcf : 0.00 1 0 0 0 0
3.39/3.42 c oddcycle : 0.00 0 0 0 0 0
3.39/3.42 c rapidlearning : 0.04 1 0 0 0 47
3.39/3.42 c Pricers : Time Calls Vars
3.39/3.42 c problem variables: 0.00 0 0
3.39/3.42 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.39/3.42 c relpscost : 2.65 70 4 111 0 0 40
3.39/3.42 c pscost : 0.00 0 0 0 0 0 0
3.39/3.42 c inference : 0.00 0 0 0 0 0 0
3.39/3.42 c mostinf : 0.00 0 0 0 0 0 0
3.39/3.42 c leastinf : 0.00 0 0 0 0 0 0
3.39/3.42 c fullstrong : 0.00 0 0 0 0 0 0
3.39/3.42 c allfullstrong : 0.00 0 0 0 0 0 0
3.39/3.42 c random : 0.00 0 0 0 0 0 0
3.39/3.42 c Primal Heuristics : Time Calls Found
3.39/3.42 c LP solutions : 0.00 - 1
3.39/3.42 c pseudo solutions : 0.00 - 0
3.39/3.42 c trivial : 0.00 1 0
3.39/3.42 c shiftandpropagate: 0.00 0 0
3.39/3.42 c simplerounding : 0.00 0 0
3.39/3.42 c zirounding : 0.00 0 0
3.39/3.42 c rounding : 0.00 0 0
3.39/3.42 c shifting : 0.00 0 0
3.39/3.42 c intshifting : 0.00 0 0
3.39/3.42 c oneopt : 0.00 0 0
3.39/3.42 c twoopt : 0.00 0 0
3.39/3.42 c fixandinfer : 0.00 0 0
3.39/3.42 c feaspump : 0.00 0 0
3.39/3.42 c clique : 0.00 0 0
3.39/3.42 c coefdiving : 0.00 0 0
3.39/3.42 c pscostdiving : 0.00 0 0
3.39/3.42 c fracdiving : 0.00 0 0
3.39/3.42 c veclendiving : 0.00 0 0
3.39/3.42 c intdiving : 0.00 0 0
3.39/3.42 c actconsdiving : 0.00 0 0
3.39/3.42 c objpscostdiving : 0.00 0 0
3.39/3.42 c rootsoldiving : 0.00 0 0
3.39/3.42 c linesearchdiving : 0.00 0 0
3.39/3.42 c guideddiving : 0.00 0 0
3.39/3.42 c octane : 0.00 0 0
3.39/3.42 c rens : 0.00 0 0
3.39/3.42 c rins : 0.00 0 0
3.39/3.42 c localbranching : 0.00 0 0
3.39/3.42 c mutation : 0.00 0 0
3.39/3.42 c crossover : 0.00 0 0
3.39/3.42 c dins : 0.00 0 0
3.39/3.42 c vbounds : 0.00 0 0
3.39/3.42 c undercover : 0.00 0 0
3.39/3.42 c subnlp : 0.00 0 0
3.39/3.42 c trysol : 0.00 0 0
3.39/3.42 c LP : Time Calls Iterations Iter/call Iter/sec
3.39/3.42 c primal LP : 0.00 0 0 0.00 -
3.39/3.42 c dual LP : 0.20 77 1728 22.44 8555.73
3.39/3.42 c lex dual LP : 0.00 0 0 0.00 -
3.39/3.42 c barrier LP : 0.00 0 0 0.00 -
3.39/3.42 c diving/probing LP: 0.00 0 0 0.00 -
3.39/3.42 c strong branching : 2.64 435 23204 53.34 8789.41
3.39/3.42 c (at root node) : - 9 701 77.89 -
3.39/3.42 c conflict analysis: 0.00 0 0 0.00 -
3.39/3.42 c B&B Tree :
3.39/3.42 c number of runs : 1
3.39/3.42 c nodes : 27
3.39/3.42 c nodes (total) : 27
3.39/3.42 c nodes left : 0
3.39/3.42 c max depth : 11
3.39/3.42 c max depth (total): 11
3.39/3.42 c backtracks : 1 (3.7%)
3.39/3.42 c delayed cutoffs : 0
3.39/3.42 c repropagations : 0 (0 domain reductions, 0 cutoffs)
3.39/3.42 c avg switch length: 2.00
3.39/3.42 c switching time : 0.00
3.39/3.42 c Solution :
3.39/3.42 c Solutions found : 1 (1 improvements)
3.39/3.42 c First Solution : +0.00000000000000e+00 (in run 1, after 27 nodes, 3.42 seconds, depth 11, found by <relaxation>)
3.39/3.42 c Primal Bound : +0.00000000000000e+00 (in run 1, after 27 nodes, 3.42 seconds, depth 11, found by <relaxation>)
3.39/3.42 c Dual Bound : +0.00000000000000e+00
3.39/3.42 c Gap : 0.00 %
3.39/3.42 c Root Dual Bound : +0.00000000000000e+00
3.39/3.42 c Root Iterations : 151
3.39/3.43 c Time complete: 3.43.