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-2665956-1276328227.opb>
0.00/0.01 c original problem has 273 variables (273 bin, 0 int, 0 impl, 0 cont) and 222 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.00/0.02 c presolving:
0.00/0.03 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 222 upgd conss, 0 impls, 27 clqs
0.00/0.03 c presolving (2 rounds):
0.00/0.03 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 0 implications, 27 cliques
0.00/0.03 c presolved problem has 273 variables (273 bin, 0 int, 0 impl, 0 cont) and 222 constraints
0.00/0.03 c 27 constraints of type <setppc>
0.00/0.03 c 195 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1799.99
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c limits/solutions = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03 c separating/maxrounds = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/maxroundsroot = 5
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03 c constraints/knapsack/disaggregation = FALSE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c presolving/probing/maxrounds = 0
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/coefdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03 c heuristics/crossover/freq = -1
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/crossover/nodesofs = 750
0.00/0.03 c
0.00/0.03 c # number of nodes without incumbent change that heuristic should wait
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03 c heuristics/crossover/nwaitingnodes = 100
0.00/0.03 c
0.00/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03 c # [type: real, range: [0,1], default: 0.1]
0.00/0.03 c heuristics/crossover/nodesquot = 0.15
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixed
0.00/0.03 c # [type: real, range: [0,1], default: 0.666]
0.00/0.03 c heuristics/crossover/minfixingrate = 0.5
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/feaspump/freq = -1
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/fracdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/guideddiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/intshifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/linesearchdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/nlp/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/objpscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03 c # [type: real, range: [0,1], default: 0.01]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/oneopt/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/pscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c heuristics/rens/freq = -1
0.00/0.04 c
0.00/0.04 c # minimum percentage of integer variables that have to be fixable
0.00/0.04 c # [type: real, range: [0,1], default: 0.5]
0.00/0.04 c heuristics/rens/minfixingrate = 0.3
0.00/0.04 c
0.00/0.04 c # number of nodes added to the contingent of the total nodes
0.00/0.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.04 c heuristics/rens/nodesofs = 2000
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.04 c heuristics/rootsoldiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.04 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/rounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/shifting/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/simplerounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c heuristics/trivial/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/trysol/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/veclendiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/zirounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c separating/cmir/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c separating/flowcover/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 c
0.00/0.04 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.04 c 0.0s| 1 | 0 | 71 | - |1088k| 0 | 65 | 273 | 222 | 273 | 222 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 107 | - |1350k| 0 | 69 | 273 | 222 | 273 | 228 | 6 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.18 c 0.1s| 1 | 0 | 206 | - |1636k| 0 | 83 | 273 | 222 | 273 | 235 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 291 | - |1740k| 0 | 70 | 273 | 222 | 273 | 241 | 19 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 426 | - |2021k| 0 | 92 | 273 | 222 | 273 | 250 | 28 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 636 | - |2404k| 0 | 67 | 273 | 222 | 273 | 262 | 40 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.43 c 0.4s| 1 | 2 | 636 | - |2405k| 0 | 67 | 273 | 222 | 273 | 262 | 40 | 0 | 33 | 0.000000e+00 | -- | Inf
0.99/1.05 c * 0.9s| 17 | 0 | 787 | 9.4 |2472k| 16 | - | 273 | 222 | 273 | 238 | 40 | 0 | 408 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.99/1.05 c
0.99/1.05 c SCIP Status : problem is solved [optimal solution found]
0.99/1.05 c Solving Time (sec) : 0.94
0.99/1.05 c Solving Nodes : 17
0.99/1.05 c Primal Bound : +0.00000000000000e+00 (1 solutions)
0.99/1.05 c Dual Bound : +0.00000000000000e+00
0.99/1.05 c Gap : 0.00 %
0.99/1.06 s SATISFIABLE
0.99/1.06 v -x75 -x78 x81 -x139 -x138 -x135 -x131 -x68 -x64 -x60 -x134 -x152 -x150 -x149 -x148 -x83 -x61 -x71 -x146 -x128 -x41 -x40 -x34 -x33
0.99/1.06 v -x31 -x32 -x39 -x151 -x80 -x37 -x137 -x69 -x13 -x12 -x9 -x8 -x6 -x1 -x57 -x36 x30 -x179 -x178 -x177 -x176 -x175 -x172 -x171
0.99/1.06 v -x170 -x147 -x5 -x2 -x130 x154 -x72 -x35 -x62 -x168 -x167 -x166 -x165 -x163 -x160 -x158 -x157 -x156 x181 -x79 -x73 -x14 -x143
0.99/1.06 v -x38 -x59 -x77 -x155 -x159 -x112 -x110 x108 -x107 -x106 -x105 -x104 -x103 -x102 -x100 -x99 -x66 -x82 -x11 x4 -x180 -x58 -x56
0.99/1.06 v -x53 -x52 -x50 -x49 -x48 x47 -x46 -x45 -x43 -x10 -x67 -x140 -x162 -x29 -x70 -x98 -x97 -x95 -x94 -x93 x92 -x90 -x89 -x88 -x87
0.99/1.06 v -x86 -x85 -x74 -x125 x124 -x123 -x119 -x117 -x116 -x115 -x114 -x113 -x133 -x174 -x55 x129 -x144 -x169 -x63 -x118 -x76 -x206
0.99/1.06 v -x205 -x204 x203 -x202 -x201 x65 x252 -x251 -x250 -x249 -x248 -x247 -x246 -x109 -x3 -x51 -x122 -x153 x161 -x141 -x28 -x26 -x25
0.99/1.06 v -x24 -x23 -x21 -x20 -x19 -x18 x15 -x96 -x111 -x120 -x126 -x136 -x231 -x230 -x229 -x228 x227 -x226 -x225 -x22 -x142 -x91 -x173
0.99/1.06 v -x259 -x258 x257 -x256 -x255 -x254 -x253 -x54 -x44 -x182 -x238 -x237 -x236 x235 -x234 -x233 -x232 -x121 -x188 -x187 -x186
0.99/1.06 v -x185 x184 -x183 -x127 -x218 -x217 -x216 -x215 -x214 -x213 -x132 -x17 -x266 -x265 -x264 -x263 -x262 x261 -x260 -x27 -x224 -x223
0.99/1.06 v x222 -x221 -x220 -x219 -x7 -x42 -x200 -x199 -x198 -x197 -x196 x195 -x101 -x273 -x272 -x271 -x270 -x269 -x268 x267 -x84 x212
0.99/1.06 v -x211 -x210 -x209 -x208 -x207 -x145 -x194 x193 -x192 -x191 -x190 -x189 -x16 -x245 x244 -x243 -x242 -x241 -x240 -x239 -x164
0.99/1.06 c SCIP Status : problem is solved [optimal solution found]
0.99/1.06 c Solving Time : 0.94
0.99/1.06 c Original Problem :
0.99/1.06 c Problem name : HOME/instance-2665956-1276328227.opb
0.99/1.06 c Variables : 273 (273 binary, 0 integer, 0 implicit integer, 0 continuous)
0.99/1.06 c Constraints : 222 initial, 222 maximal
0.99/1.06 c Presolved Problem :
0.99/1.06 c Problem name : t_HOME/instance-2665956-1276328227.opb
0.99/1.06 c Variables : 273 (273 binary, 0 integer, 0 implicit integer, 0 continuous)
0.99/1.06 c Constraints : 222 initial, 222 maximal
0.99/1.06 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.99/1.06 c trivial : 0.00 0 0 0 0 0 0 0 0
0.99/1.06 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.99/1.06 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.99/1.06 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.99/1.06 c implics : 0.00 0 0 0 0 0 0 0 0
0.99/1.06 c probing : 0.00 0 0 0 0 0 0 0 0
0.99/1.06 c setppc : 0.00 0 0 0 0 0 0 0 0
0.99/1.06 c logicor : 0.00 0 0 0 0 0 0 0 0
0.99/1.06 c root node : - 0 - - 0 - - - -
0.99/1.06 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.99/1.06 c integral : 0 0 0 21 0 0 4 0 0 32
0.99/1.06 c setppc : 27 5 37 1 0 0 167 0 0 0
0.99/1.06 c logicor : 195 5 13 1 0 0 0 0 0 0
0.99/1.06 c countsols : 0 0 0 1 0 0 0 0 0 0
0.99/1.06 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.99/1.06 c integral : 0.64 0.00 0.00 0.64 0.00
0.99/1.06 c setppc : 0.00 0.00 0.00 0.00 0.00
0.99/1.06 c logicor : 0.02 0.01 0.01 0.00 0.00
0.99/1.06 c countsols : 0.00 0.00 0.00 0.00 0.00
0.99/1.06 c Propagators : Time Calls Cutoffs DomReds
0.99/1.06 c vbounds : 0.00 1 0 0
0.99/1.06 c rootredcost : 0.00 0 0 0
0.99/1.06 c pseudoobj : 0.00 0 0 0
0.99/1.06 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.99/1.06 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.99/1.06 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.06 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.06 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.06 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.99/1.06 c applied globally : - - - 0 0.0 - - -
0.99/1.06 c applied locally : - - - 0 0.0 - - -
0.99/1.06 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.99/1.06 c cut pool : 0.00 4 - - 0 - (maximal pool size: 351)
0.99/1.06 c redcost : 0.00 21 0 0 0 0
0.99/1.06 c impliedbounds : 0.00 5 0 0 0 0
0.99/1.06 c intobj : 0.00 0 0 0 0 0
0.99/1.06 c cgmip : 0.00 0 0 0 0 0
0.99/1.06 c gomory : 0.10 5 0 0 692 0
0.99/1.06 c strongcg : 0.09 5 0 0 913 0
0.99/1.06 c cmir : 0.00 0 0 0 0 0
0.99/1.06 c flowcover : 0.00 0 0 0 0 0
0.99/1.06 c clique : 0.00 5 0 0 0 0
0.99/1.06 c zerohalf : 0.00 0 0 0 0 0
0.99/1.06 c mcf : 0.00 1 0 0 0 0
0.99/1.06 c rapidlearning : 0.02 1 0 0 0 0
0.99/1.06 c Pricers : Time Calls Vars
0.99/1.06 c problem variables: 0.00 0 0
0.99/1.06 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.99/1.06 c relpscost : 0.64 20 0 4 0 0 32
0.99/1.06 c pscost : 0.00 0 0 0 0 0 0
0.99/1.06 c inference : 0.00 0 0 0 0 0 0
0.99/1.06 c mostinf : 0.00 0 0 0 0 0 0
0.99/1.06 c leastinf : 0.00 0 0 0 0 0 0
0.99/1.06 c fullstrong : 0.00 0 0 0 0 0 0
0.99/1.06 c allfullstrong : 0.00 0 0 0 0 0 0
0.99/1.06 c random : 0.00 0 0 0 0 0 0
0.99/1.06 c Primal Heuristics : Time Calls Found
0.99/1.06 c LP solutions : 0.00 - 1
0.99/1.06 c pseudo solutions : 0.00 - 0
0.99/1.06 c trivial : 0.00 1 0
0.99/1.06 c simplerounding : 0.00 0 0
0.99/1.06 c zirounding : 0.00 0 0
0.99/1.06 c rounding : 0.00 0 0
0.99/1.06 c shifting : 0.00 0 0
0.99/1.06 c intshifting : 0.00 0 0
0.99/1.06 c oneopt : 0.00 0 0
0.99/1.06 c twoopt : 0.00 0 0
0.99/1.06 c fixandinfer : 0.00 0 0
0.99/1.06 c feaspump : 0.00 0 0
0.99/1.06 c coefdiving : 0.00 0 0
0.99/1.06 c pscostdiving : 0.00 0 0
0.99/1.06 c fracdiving : 0.00 0 0
0.99/1.06 c veclendiving : 0.00 0 0
0.99/1.06 c intdiving : 0.00 0 0
0.99/1.06 c actconsdiving : 0.00 0 0
0.99/1.06 c objpscostdiving : 0.00 0 0
0.99/1.06 c rootsoldiving : 0.00 0 0
0.99/1.06 c linesearchdiving : 0.00 0 0
0.99/1.06 c guideddiving : 0.00 0 0
0.99/1.06 c octane : 0.00 0 0
0.99/1.06 c rens : 0.00 0 0
0.99/1.06 c rins : 0.00 0 0
0.99/1.06 c localbranching : 0.00 0 0
0.99/1.06 c mutation : 0.00 0 0
0.99/1.06 c crossover : 0.00 0 0
0.99/1.06 c dins : 0.00 0 0
0.99/1.06 c undercover : 0.00 0 0
0.99/1.06 c nlp : 0.00 0 0
0.99/1.06 c trysol : 0.00 0 0
0.99/1.06 c LP : Time Calls Iterations Iter/call Iter/sec
0.99/1.06 c primal LP : 0.00 0 0 0.00 -
0.99/1.06 c dual LP : 0.05 26 787 30.27 15740.00
0.99/1.06 c lex dual LP : 0.00 0 0 0.00 -
0.99/1.06 c barrier LP : 0.00 0 0 0.00 -
0.99/1.06 c diving/probing LP: 0.00 0 0 0.00 -
0.99/1.06 c strong branching : 0.64 408 8757 21.46 13682.81
0.99/1.06 c (at root node) : - 33 1335 40.45 -
0.99/1.06 c conflict analysis: 0.00 0 0 0.00 -
0.99/1.06 c B&B Tree :
0.99/1.06 c number of runs : 1
0.99/1.06 c nodes : 17
0.99/1.06 c nodes (total) : 17
0.99/1.06 c nodes left : 0
0.99/1.06 c max depth : 16
0.99/1.06 c max depth (total): 16
0.99/1.06 c backtracks : 0 (0.0%)
0.99/1.06 c delayed cutoffs : 0
0.99/1.06 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.99/1.06 c avg switch length: 2.00
0.99/1.06 c switching time : 0.00
0.99/1.06 c Solution :
0.99/1.06 c Solutions found : 1 (1 improvements)
0.99/1.06 c First Solution : +0.00000000000000e+00 (in run 1, after 17 nodes, 0.94 seconds, depth 16, found by <relaxation>)
0.99/1.06 c Primal Bound : +0.00000000000000e+00 (in run 1, after 17 nodes, 0.94 seconds, depth 16, found by <relaxation>)
0.99/1.06 c Dual Bound : +0.00000000000000e+00
0.99/1.06 c Gap : 0.00 %
0.99/1.06 c Root Dual Bound : +0.00000000000000e+00
0.99/1.06 c Root Iterations : 636
0.99/1.06 c Time complete: 1.06.