0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2667130-1276269670.opb>
0.00/0.01 c original problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 332 constraints
0.00/0.01 c problem read
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c presolving settings loaded
0.01/0.02 c presolving:
0.01/0.03 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 252 impls, 0 clqs
0.01/0.04 c (round 2) 8 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 5244 impls, 0 clqs
0.01/0.04 c presolving (3 rounds):
0.01/0.04 c 8 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.04 c 5244 implications, 0 cliques
0.01/0.04 c presolved problem has 212 variables (212 bin, 0 int, 0 impl, 0 cont) and 332 constraints
0.01/0.04 c 130 constraints of type <knapsack>
0.01/0.04 c 202 constraints of type <logicor>
0.01/0.04 c transformed objective value is always integral (scale: 1)
0.01/0.04 c Presolving Time: 0.02
0.01/0.04 c - non default parameters ----------------------------------------------------------------------
0.01/0.04 c # SCIP version 1.2.1.2
0.01/0.04 c
0.01/0.04 c # frequency for displaying node information lines
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.04 c display/freq = 10000
0.01/0.04 c
0.01/0.04 c # maximal time in seconds to run
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/time = 1799.99
0.01/0.04 c
0.01/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/memory = 1620
0.01/0.04 c
0.01/0.04 c # solving stops, if the given number of solutions were found (-1: no limit)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c limits/solutions = 1
0.01/0.04 c
0.01/0.04 c # maximal number of separation rounds per node (-1: unlimited)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 5]
0.01/0.04 c separating/maxrounds = 1
0.01/0.04 c
0.01/0.04 c # maximal number of separation rounds in the root node (-1: unlimited)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c separating/maxroundsroot = 5
0.01/0.04 c
0.01/0.04 c # should presolving try to simplify inequalities
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/linear/simplifyinequalities = TRUE
0.01/0.04 c
0.01/0.04 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.01/0.04 c constraints/knapsack/disaggregation = FALSE
0.01/0.04 c
0.01/0.04 c # should presolving try to simplify knapsacks
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.04 c
0.01/0.04 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c presolving/probing/maxrounds = 0
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/coefdiving/freq = -1
0.01/0.04 c
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/coefdiving/maxlpiterquot = 0.075
0.01/0.04 c
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/coefdiving/maxlpiterofs = 1500
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 30]
0.01/0.04 c heuristics/crossover/freq = -1
0.01/0.04 c
0.01/0.04 c # number of nodes added to the contingent of the total nodes
0.01/0.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.04 c heuristics/crossover/nodesofs = 750
0.01/0.04 c
0.01/0.04 c # number of nodes without incumbent change that heuristic should wait
0.01/0.04 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.01/0.04 c heuristics/crossover/nwaitingnodes = 100
0.01/0.04 c
0.01/0.04 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.01/0.04 c # [type: real, range: [0,1], default: 0.1]
0.01/0.04 c heuristics/crossover/nodesquot = 0.15
0.01/0.04 c
0.01/0.04 c # minimum percentage of integer variables that have to be fixed
0.01/0.04 c # [type: real, range: [0,1], default: 0.666]
0.01/0.04 c heuristics/crossover/minfixingrate = 0.5
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.04 c heuristics/feaspump/freq = -1
0.01/0.04 c
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/feaspump/maxlpiterofs = 2000
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/fracdiving/freq = -1
0.01/0.04 c
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/fracdiving/maxlpiterquot = 0.075
0.01/0.04 c
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/fracdiving/maxlpiterofs = 1500
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/guideddiving/freq = -1
0.01/0.04 c
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/guideddiving/maxlpiterquot = 0.075
0.01/0.04 c
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/guideddiving/maxlpiterofs = 1500
0.01/0.04 c
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/intdiving/maxlpiterquot = 0.075
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/intshifting/freq = -1
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/linesearchdiving/freq = -1
0.01/0.04 c
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.01/0.04 c
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.04 c heuristics/nlp/freq = -1
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.04 c heuristics/objpscostdiving/freq = -1
0.01/0.04 c
0.01/0.04 c # maximal fraction of diving LP iterations compared to total iteration number
0.01/0.05 c # [type: real, range: [0,1], default: 0.01]
0.01/0.05 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.01/0.05 c
0.01/0.05 c # additional number of allowed LP iterations
0.01/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.05 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.01/0.05 c
0.01/0.05 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.05 c heuristics/oneopt/freq = -1
0.01/0.05 c
0.01/0.05 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.05 c heuristics/pscostdiving/freq = -1
0.01/0.05 c
0.01/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.05 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.01/0.05 c
0.01/0.05 c # additional number of allowed LP iterations
0.01/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.05 c heuristics/pscostdiving/maxlpiterofs = 1500
0.01/0.05 c
0.01/0.05 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.05 c heuristics/rens/freq = -1
0.01/0.05 c
0.01/0.05 c # minimum percentage of integer variables that have to be fixable
0.01/0.05 c # [type: real, range: [0,1], default: 0.5]
0.01/0.05 c heuristics/rens/minfixingrate = 0.3
0.01/0.05 c
0.01/0.05 c # number of nodes added to the contingent of the total nodes
0.01/0.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.05 c heuristics/rens/nodesofs = 2000
0.01/0.05 c
0.01/0.05 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.05 c heuristics/rootsoldiving/freq = -1
0.01/0.05 c
0.01/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.01/0.05 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.01/0.05 c
0.01/0.05 c # additional number of allowed LP iterations
0.01/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.05 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.01/0.05 c
0.01/0.05 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.05 c heuristics/rounding/freq = -1
0.01/0.05 c
0.01/0.05 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.05 c heuristics/shifting/freq = -1
0.01/0.05 c
0.01/0.05 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.05 c heuristics/simplerounding/freq = -1
0.01/0.05 c
0.01/0.05 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.05 c heuristics/trivial/freq = -1
0.01/0.05 c
0.01/0.05 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.05 c heuristics/trysol/freq = -1
0.01/0.05 c
0.01/0.05 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.05 c heuristics/veclendiving/freq = -1
0.01/0.05 c
0.01/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.05 c heuristics/veclendiving/maxlpiterquot = 0.075
0.01/0.05 c
0.01/0.05 c # additional number of allowed LP iterations
0.01/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.05 c heuristics/veclendiving/maxlpiterofs = 1500
0.01/0.05 c
0.01/0.05 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.05 c heuristics/zirounding/freq = -1
0.01/0.05 c
0.01/0.05 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.05 c separating/cmir/freq = -1
0.01/0.05 c
0.01/0.05 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.05 c separating/flowcover/freq = -1
0.01/0.05 c
0.01/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.05 c separating/rapidlearning/freq = 0
0.01/0.05 c
0.01/0.05 c -----------------------------------------------------------------------------------------------
0.01/0.05 c start solving
0.01/0.05 c
0.01/0.05 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.01/0.05 c 0.0s| 1 | 0 | 96 | - |1302k| 0 | 57 | 212 | 332 | 212 | 324 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 264 | - |1801k| 0 | 106 | 212 | 333 | 212 | 490 | 166 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.41 c 0.3s| 1 | 0 | 408 | - |2620k| 0 | 115 | 212 | 333 | 212 | 585 | 261 | 0 | 0 | 0.000000e+00 | -- | Inf
0.50/0.56 c 0.5s| 1 | 0 | 513 | - |3569k| 0 | 117 | 212 | 333 | 212 | 608 | 284 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.70 c 0.6s| 1 | 0 | 599 | - |4404k| 0 | 117 | 212 | 333 | 212 | 609 | 285 | 0 | 0 | 0.000000e+00 | -- | Inf
0.79/0.84 c 0.8s| 1 | 0 | 667 | - |5314k| 0 | 117 | 212 | 333 | 212 | 612 | 288 | 0 | 0 | 0.000000e+00 | -- | Inf
1.29/1.31 c 1.2s| 1 | 2 | 667 | - |5315k| 0 | 117 | 212 | 333 | 212 | 612 | 288 | 0 | 10 | 0.000000e+00 | -- | Inf
3.79/3.84 c * 3.7s| 305 | 0 | 3297 | 8.7 |5486k| 22 | - | 212 | 501 | 212 | 432 | 288 | 170 | 905 | 0.000000e+00 | 0.000000e+00 | 0.00%
3.79/3.84 c
3.79/3.84 c SCIP Status : problem is solved [optimal solution found]
3.79/3.84 c Solving Time (sec) : 3.67
3.79/3.84 c Solving Nodes : 305
3.79/3.84 c Primal Bound : +0.00000000000000e+00 (1 solutions)
3.79/3.84 c Dual Bound : +0.00000000000000e+00
3.79/3.84 c Gap : 0.00 %
3.79/3.84 s SATISFIABLE
3.79/3.84 v x219 -x220 x217 -x218 x215 -x216 x213 -x214 x211 -x212 x209 -x210 -x207 -x208 -x205 -x206 -x203 -x204 x201 -x202 x199 -x200 -x197
3.79/3.84 v x198 -x195 x196 x193 -x194 -x191 x192 x189 -x190 x187 -x188 -x185 x186 -x183 x184 -x181 x182 -x179 -x180 -x177 -x178 -x175
3.79/3.84 v x176 -x173 -x174 -x171 x172 -x169 x170 -x167 x168 -x165 x166 -x163 x164 x161 -x162 x159 -x160 x157 -x158 x155 -x156 x153 -x154
3.79/3.84 v -x151 x152 -x149 x150 -x147 x148 -x145 x146 -x143 x144 -x141 x142 x139 -x140 x137 -x138 -x135 x136 -x133 x134 x131 -x132 x129
3.79/3.84 v -x130 -x128 -x126 -x124 -x122 -x120 -x118 -x116 -x114 -x112 -x110 -x108 -x106 -x104 -x102 -x100 -x98 x96 x94 -x92 -x90 -x88
3.79/3.84 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
3.79/3.84 v -x36 -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
3.79/3.84 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
3.79/3.84 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 -x13
3.79/3.84 v -x11 -x9 -x7 -x5 -x3 -x1
3.79/3.84 c SCIP Status : problem is solved [optimal solution found]
3.79/3.84 c Solving Time : 3.67
3.79/3.84 c Original Problem :
3.79/3.84 c Problem name : HOME/instance-2667130-1276269670.opb
3.79/3.84 c Variables : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
3.79/3.84 c Constraints : 332 initial, 332 maximal
3.79/3.84 c Presolved Problem :
3.79/3.84 c Problem name : t_HOME/instance-2667130-1276269670.opb
3.79/3.84 c Variables : 212 (212 binary, 0 integer, 0 implicit integer, 0 continuous)
3.79/3.84 c Constraints : 332 initial, 501 maximal
3.79/3.84 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.79/3.84 c trivial : 0.00 0 0 0 0 0 0 0 0
3.79/3.84 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.79/3.84 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.79/3.84 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.79/3.84 c implics : 0.00 0 8 0 0 0 0 0 0
3.79/3.84 c probing : 0.00 0 0 0 0 0 0 0 0
3.79/3.84 c knapsack : 0.01 0 0 0 0 0 0 0 0
3.79/3.84 c linear : 0.01 0 0 0 0 0 0 0 0
3.79/3.84 c logicor : 0.00 0 0 0 0 0 0 0 0
3.79/3.84 c root node : - 0 - - 0 - - - -
3.79/3.84 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.79/3.84 c integral : 0 0 0 235 0 4 97 0 0 356
3.79/3.84 c knapsack : 130 5 1154 0 0 126 2795 314 0 0
3.79/3.84 c linear : 0+ 5 112 0 0 0 0 0 0 0
3.79/3.84 c logicor : 202+ 5 719 1 0 10 1550 0 0 0
3.79/3.84 c countsols : 0 0 0 1 0 0 0 0 0 0
3.79/3.84 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.79/3.84 c integral : 2.52 0.00 0.00 2.52 0.00
3.79/3.84 c knapsack : 0.06 0.00 0.06 0.00 0.00
3.79/3.84 c linear : 0.00 0.00 0.00 0.00 0.00
3.79/3.84 c logicor : 0.01 0.00 0.01 0.00 0.00
3.79/3.84 c countsols : 0.00 0.00 0.00 0.00 0.00
3.79/3.84 c Propagators : Time Calls Cutoffs DomReds
3.79/3.84 c vbounds : 0.00 1 0 0
3.79/3.84 c rootredcost : 0.00 0 0 0
3.79/3.84 c pseudoobj : 0.00 0 0 0
3.79/3.84 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.79/3.84 c propagation : 0.03 136 105 708 46.8 1 55.0 -
3.79/3.84 c infeasible LP : 0.00 6 0 0 0.0 0 0.0 0
3.79/3.84 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.79/3.84 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.79/3.84 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.79/3.84 c applied globally : - - - 168 15.0 - - -
3.79/3.84 c applied locally : - - - 2 54.5 - - -
3.79/3.84 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.79/3.84 c cut pool : 0.00 4 - - 113 - (maximal pool size: 1260)
3.79/3.84 c redcost : 0.00 207 0 0 0 0
3.79/3.84 c impliedbounds : 0.01 5 0 0 433 0
3.79/3.84 c intobj : 0.00 0 0 0 0 0
3.79/3.84 c cgmip : 0.00 0 0 0 0 0
3.79/3.84 c gomory : 0.21 5 0 0 144 0
3.79/3.84 c strongcg : 0.24 5 0 0 1684 0
3.79/3.84 c cmir : 0.00 0 0 0 0 0
3.79/3.84 c flowcover : 0.00 0 0 0 0 0
3.79/3.84 c clique : 0.01 1 0 0 0 0
3.79/3.84 c zerohalf : 0.00 0 0 0 0 0
3.79/3.84 c mcf : 0.00 1 0 0 0 0
3.79/3.84 c rapidlearning : 0.12 1 0 0 0 1
3.79/3.84 c Pricers : Time Calls Vars
3.79/3.84 c problem variables: 0.00 0 0
3.79/3.84 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.79/3.84 c relpscost : 2.52 234 4 97 0 0 356
3.79/3.84 c pscost : 0.00 0 0 0 0 0 0
3.79/3.84 c inference : 0.00 0 0 0 0 0 0
3.79/3.84 c mostinf : 0.00 0 0 0 0 0 0
3.79/3.84 c leastinf : 0.00 0 0 0 0 0 0
3.79/3.84 c fullstrong : 0.00 0 0 0 0 0 0
3.79/3.84 c allfullstrong : 0.00 0 0 0 0 0 0
3.79/3.84 c random : 0.00 0 0 0 0 0 0
3.79/3.84 c Primal Heuristics : Time Calls Found
3.79/3.84 c LP solutions : 0.00 - 1
3.79/3.84 c pseudo solutions : 0.00 - 0
3.79/3.84 c trivial : 0.00 1 0
3.79/3.84 c simplerounding : 0.00 0 0
3.79/3.84 c zirounding : 0.00 0 0
3.79/3.84 c rounding : 0.00 0 0
3.79/3.84 c shifting : 0.00 0 0
3.79/3.84 c intshifting : 0.00 0 0
3.79/3.84 c oneopt : 0.00 0 0
3.79/3.84 c twoopt : 0.00 0 0
3.79/3.84 c fixandinfer : 0.00 0 0
3.79/3.84 c feaspump : 0.00 0 0
3.79/3.84 c coefdiving : 0.00 0 0
3.79/3.84 c pscostdiving : 0.00 0 0
3.79/3.84 c fracdiving : 0.00 0 0
3.79/3.84 c veclendiving : 0.00 0 0
3.79/3.84 c intdiving : 0.00 0 0
3.79/3.84 c actconsdiving : 0.00 0 0
3.79/3.84 c objpscostdiving : 0.00 0 0
3.79/3.84 c rootsoldiving : 0.00 0 0
3.79/3.84 c linesearchdiving : 0.00 0 0
3.79/3.84 c guideddiving : 0.00 0 0
3.79/3.84 c octane : 0.00 0 0
3.79/3.84 c rens : 0.00 0 0
3.79/3.84 c rins : 0.00 0 0
3.79/3.84 c localbranching : 0.00 0 0
3.79/3.84 c mutation : 0.00 0 0
3.79/3.84 c crossover : 0.00 0 0
3.79/3.84 c dins : 0.00 0 0
3.79/3.84 c undercover : 0.00 0 0
3.79/3.84 c nlp : 0.00 0 0
3.79/3.84 c trysol : 0.00 0 0
3.79/3.84 c LP : Time Calls Iterations Iter/call Iter/sec
3.79/3.84 c primal LP : 0.00 0 0 0.00 -
3.79/3.84 c dual LP : 0.40 246 3297 13.40 8242.50
3.79/3.84 c lex dual LP : 0.00 0 0 0.00 -
3.79/3.84 c barrier LP : 0.00 0 0 0.00 -
3.79/3.84 c diving/probing LP: 0.00 0 0 0.00 -
3.79/3.84 c strong branching : 2.52 905 17212 19.02 6830.16
3.79/3.84 c (at root node) : - 10 2122 212.20 -
3.79/3.84 c conflict analysis: 0.00 0 0 0.00 -
3.79/3.84 c B&B Tree :
3.79/3.84 c number of runs : 1
3.79/3.84 c nodes : 305
3.79/3.84 c nodes (total) : 305
3.79/3.84 c nodes left : 0
3.79/3.84 c max depth : 22
3.79/3.84 c max depth (total): 22
3.79/3.84 c backtracks : 47 (15.4%)
3.79/3.84 c delayed cutoffs : 20
3.79/3.84 c repropagations : 144 (593 domain reductions, 20 cutoffs)
3.79/3.84 c avg switch length: 2.84
3.79/3.84 c switching time : 0.00
3.79/3.84 c Solution :
3.79/3.84 c Solutions found : 1 (1 improvements)
3.79/3.84 c First Solution : +0.00000000000000e+00 (in run 1, after 305 nodes, 3.67 seconds, depth 21, found by <relaxation>)
3.79/3.84 c Primal Bound : +0.00000000000000e+00 (in run 1, after 305 nodes, 3.67 seconds, depth 21, found by <relaxation>)
3.79/3.84 c Dual Bound : +0.00000000000000e+00
3.79/3.84 c Gap : 0.00 %
3.79/3.84 c Root Dual Bound : +0.00000000000000e+00
3.79/3.84 c Root Iterations : 667
3.79/3.85 c Time complete: 3.84.