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-2665704-1276270662.opb>
0.00/0.02 c original problem has 266 variables (266 bin, 0 int, 0 impl, 0 cont) and 401 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, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 401 upgd conss, 298 impls, 0 clqs
0.00/0.05 c (round 2) 8 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 401 upgd conss, 7146 impls, 0 clqs
0.00/0.05 c presolving (3 rounds):
0.00/0.05 c 8 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.05 c 7146 implications, 0 cliques
0.00/0.05 c presolved problem has 258 variables (258 bin, 0 int, 0 impl, 0 cont) and 401 constraints
0.00/0.05 c 164 constraints of type <knapsack>
0.00/0.05 c 237 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.02
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c # SCIP version 1.2.1.2
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 = 1799.99
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 = 1620
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 # 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 # 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 <nlp> (-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/nlp/freq = -1
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 <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 <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 <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.06/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.06/0.06 c 0.0s| 1 | 0 | 108 | - |1580k| 0 | 68 | 258 | 401 | 258 | 393 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 256 | - |2173k| 0 | 143 | 258 | 403 | 258 | 587 | 194 | 0 | 0 | 0.000000e+00 | -- | Inf
0.40/0.46 c 0.4s| 1 | 0 | 410 | - |4156k| 0 | 158 | 258 | 403 | 258 | 697 | 304 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.69 c 0.6s| 1 | 0 | 526 | - |6037k| 0 | 141 | 258 | 403 | 258 | 776 | 383 | 0 | 0 | 0.000000e+00 | -- | Inf
0.79/0.86 c 0.8s| 1 | 0 | 561 | - |6850k| 0 | 152 | 258 | 403 | 258 | 785 | 392 | 0 | 0 | 0.000000e+00 | -- | Inf
0.99/1.02 c 0.9s| 1 | 0 | 648 | - |7384k| 0 | 148 | 258 | 403 | 258 | 792 | 399 | 0 | 0 | 0.000000e+00 | -- | Inf
1.19/1.27 c 1.2s| 1 | 2 | 648 | - |7385k| 0 | 148 | 258 | 403 | 258 | 792 | 399 | 0 | 10 | 0.000000e+00 | -- | Inf
27.58/27.69 c 25.8s| 10000 | 63 |113872 | 11.3 |7796k| 35 | 21 | 258 | 734 | 258 | 541 | 399 | 483 |2086 | 0.000000e+00 | -- | Inf
44.86/44.97 c 41.9s| 20000 | 82 |222749 | 11.1 |7954k| 35 | 34 | 258 | 985 | 258 | 541 | 399 |1010 |2091 | 0.000000e+00 | -- | Inf
63.76/63.86 c 59.6s| 30000 | 82 |332284 | 11.1 |8033k| 37 | 30 | 258 |1156 | 258 | 541 | 399 |1585 |2442 | 0.000000e+00 | -- | Inf
84.45/84.58 c 79.0s| 40000 | 94 |450055 | 11.2 |8115k| 38 | - | 258 |1185 | 0 | 0 | 399 |2066 |2910 | 0.000000e+00 | -- | Inf
105.14/105.25 c 98.4s| 50000 | 104 |568694 | 11.4 |8149k| 42 | - | 258 |1125 | 0 | 0 | 399 |2498 |3346 | 0.000000e+00 | -- | Inf
121.34/121.47 c 114s| 60000 | 101 |661412 | 11.0 |8257k| 45 | 21 | 258 |1437 | 258 | 541 | 399 |3108 |3531 | 0.000000e+00 | -- | Inf
127.44/127.56 c * 119s| 63062 | 0 |694463 | 11.0 |7996k| 45 | - | 258 |1330 | 258 | 541 | 399 |3298 |3674 | 0.000000e+00 | 0.000000e+00 | 0.00%
127.44/127.57 c
127.44/127.57 c SCIP Status : problem is solved [optimal solution found]
127.44/127.57 c Solving Time (sec) : 119.31
127.44/127.57 c Solving Nodes : 63062
127.44/127.57 c Primal Bound : +0.00000000000000e+00 (1 solutions)
127.44/127.57 c Dual Bound : +0.00000000000000e+00
127.44/127.57 c Gap : 0.00 %
127.44/127.57 s SATISFIABLE
127.44/127.57 v x265 -x266 -x263 x264 x261 -x262 -x259 x260 x257 -x258 -x255 -x256 -x253 -x254 -x251 x252 -x249 x250 -x247 -x248 -x245 x246 x243
127.44/127.57 v -x244 -x241 x242 x239 -x240 -x237 x238 x235 -x236 -x233 x234 x231 -x232 -x229 x230 x227 -x228 -x225 x226 x223 -x224 -x221 x222
127.44/127.57 v x219 -x220 -x217 -x218 -x215 -x216 x213 -x214 -x211 x212 x209 -x210 -x207 x208 x205 -x206 -x203 x204 x201 -x202 -x199 x200
127.44/127.57 v -x197 x198 x195 -x196 x193 -x194 x191 -x192 -x189 x190 x187 -x188 -x185 x186 x183 -x184 x181 -x182 -x179 x180 x177 -x178 -x175
127.44/127.57 v x176 x173 -x174 -x171 x172 x169 -x170 x167 -x168 x165 -x166 -x163 x164 -x162 -x160 -x158 -x156 -x154 -x152 -x150 -x148 -x146
127.44/127.57 v -x144 -x142 x140 -x138 -x136 -x134 -x132 -x130 x128 -x126 -x124 -x122 -x120 -x118 -x116 -x114 -x112 -x110 -x108 -x106 x104
127.44/127.57 v -x102 -x100 -x98 -x96 -x94 x92 -x90 -x88 -x86 -x84 -x82 -x80 -x78 -x76 -x74 -x72 -x70 x68 -x66 -x64 -x62 -x60 -x58 x56 -x54
127.44/127.57 v x52 -x50 x48 -x46 x44 -x42 x40 -x38 -x36 -x34 x32 -x30 -x28 -x26 -x24 -x22 x20 -x18 -x16 -x14 -x12 -x10 -x8 -x6 -x4 -x2 x161
127.44/127.57 v -x159 -x157 -x155 x153 -x151 x149 -x147 -x145 -x143 -x141 -x139 -x137 -x135 -x133 -x131 -x129 -x127 x125 -x123 -x121 -x119 x117
127.44/127.57 v -x115 x113 -x111 -x109 -x107 -x105 -x103 -x101 -x99 -x97 -x95 -x93 -x91 x89 -x87 -x85 -x83 x81 -x79 x77 -x75 -x73 -x71 -x69
127.44/127.57 v -x67 -x65 -x63 -x61 -x59 -x57 -x55 -x53 -x51 -x49 -x47 -x45 -x43 -x41 -x39 -x37 -x35 -x33 -x31 -x29 -x27 -x25 -x23 -x21 -x19
127.44/127.57 v x17 -x15 -x13 -x11 x9 -x7 x5 -x3 -x1
127.44/127.57 c SCIP Status : problem is solved [optimal solution found]
127.44/127.57 c Solving Time : 119.31
127.44/127.57 c Original Problem :
127.44/127.57 c Problem name : HOME/instance-2665704-1276270662.opb
127.44/127.57 c Variables : 266 (266 binary, 0 integer, 0 implicit integer, 0 continuous)
127.44/127.57 c Constraints : 401 initial, 401 maximal
127.44/127.57 c Presolved Problem :
127.44/127.57 c Problem name : t_HOME/instance-2665704-1276270662.opb
127.44/127.57 c Variables : 258 (258 binary, 0 integer, 0 implicit integer, 0 continuous)
127.44/127.57 c Constraints : 401 initial, 1453 maximal
127.44/127.57 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
127.44/127.57 c trivial : 0.00 0 0 0 0 0 0 0 0
127.44/127.57 c dualfix : 0.00 0 0 0 0 0 0 0 0
127.44/127.57 c boundshift : 0.00 0 0 0 0 0 0 0 0
127.44/127.57 c inttobinary : 0.00 0 0 0 0 0 0 0 0
127.44/127.57 c implics : 0.00 0 8 0 0 0 0 0 0
127.44/127.57 c probing : 0.00 0 0 0 0 0 0 0 0
127.44/127.57 c knapsack : 0.01 0 0 0 0 0 0 0 0
127.44/127.57 c linear : 0.01 0 0 0 0 0 0 0 0
127.44/127.57 c logicor : 0.00 0 0 0 0 0 0 0 0
127.44/127.57 c root node : - 0 - - 0 - - - -
127.44/127.57 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
127.44/127.57 c integral : 0 0 0 32087 0 54 543 0 0 63504
127.44/127.57 c knapsack : 164 5 159645 0 0 23767 540125 473 0 0
127.44/127.57 c linear : 0+ 5 19343 0 0 0 276 0 0 0
127.44/127.57 c logicor : 237+ 5 104838 1 0 484 272651 0 0 0
127.44/127.57 c countsols : 0 0 0 1 0 0 0 0 0 0
127.44/127.57 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
127.44/127.57 c integral : 13.30 0.00 0.00 13.30 0.00
127.44/127.57 c knapsack : 4.60 0.00 4.60 0.00 0.00
127.44/127.57 c linear : 0.03 0.00 0.03 0.00 0.00
127.44/127.57 c logicor : 2.10 0.00 2.10 0.00 0.00
127.44/127.57 c countsols : 0.00 0.00 0.00 0.00 0.00
127.44/127.57 c Propagators : Time Calls Cutoffs DomReds
127.44/127.57 c vbounds : 0.07 1 0 0
127.44/127.57 c rootredcost : 0.07 0 0 0
127.44/127.57 c pseudoobj : 0.07 0 0 0
127.44/127.57 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
127.44/127.57 c propagation : 0.97 3833 3193 17539 55.7 68 61.1 -
127.44/127.57 c infeasible LP : 1.03 7342 0 0 0.0 0 0.0 0
127.44/127.57 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
127.44/127.57 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
127.44/127.57 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
127.44/127.57 c applied globally : - - - 3259 14.3 - - -
127.44/127.57 c applied locally : - - - 39 34.1 - - -
127.44/127.57 c Separators : Time Calls Cutoffs DomReds Cuts Conss
127.44/127.57 c cut pool : 0.00 4 - - 64 - (maximal pool size: 1611)
127.44/127.57 c redcost : 0.34 31932 0 0 0 0
127.44/127.57 c impliedbounds : 0.00 5 0 0 672 0
127.44/127.57 c intobj : 0.00 0 0 0 0 0
127.44/127.57 c cgmip : 0.00 0 0 0 0 0
127.44/127.57 c gomory : 0.31 5 0 0 435 0
127.44/127.57 c strongcg : 0.33 5 0 0 2086 0
127.44/127.57 c cmir : 0.00 0 0 0 0 0
127.44/127.57 c flowcover : 0.00 0 0 0 0 0
127.44/127.57 c clique : 0.01 1 0 0 0 0
127.44/127.57 c zerohalf : 0.00 0 0 0 0 0
127.44/127.57 c mcf : 0.00 1 0 0 0 0
127.44/127.57 c rapidlearning : 0.09 1 0 0 0 2
127.44/127.57 c Pricers : Time Calls Vars
127.44/127.57 c problem variables: 0.00 0 0
127.44/127.57 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
127.44/127.57 c relpscost : 13.25 32086 54 543 0 0 63504
127.44/127.57 c pscost : 0.00 0 0 0 0 0 0
127.44/127.57 c inference : 0.00 0 0 0 0 0 0
127.44/127.57 c mostinf : 0.00 0 0 0 0 0 0
127.44/127.57 c leastinf : 0.00 0 0 0 0 0 0
127.44/127.57 c fullstrong : 0.00 0 0 0 0 0 0
127.44/127.57 c allfullstrong : 0.00 0 0 0 0 0 0
127.44/127.57 c random : 0.00 0 0 0 0 0 0
127.44/127.57 c Primal Heuristics : Time Calls Found
127.44/127.57 c LP solutions : 0.00 - 1
127.44/127.57 c pseudo solutions : 0.00 - 0
127.44/127.57 c trivial : 0.00 1 0
127.44/127.57 c simplerounding : 0.00 0 0
127.44/127.57 c zirounding : 0.00 0 0
127.44/127.57 c rounding : 0.00 0 0
127.44/127.57 c shifting : 0.00 0 0
127.44/127.57 c intshifting : 0.00 0 0
127.44/127.57 c oneopt : 0.00 0 0
127.44/127.57 c twoopt : 0.00 0 0
127.44/127.57 c fixandinfer : 0.00 0 0
127.44/127.57 c feaspump : 0.00 0 0
127.44/127.57 c coefdiving : 0.00 0 0
127.44/127.57 c pscostdiving : 0.00 0 0
127.44/127.57 c fracdiving : 0.00 0 0
127.44/127.57 c veclendiving : 0.00 0 0
127.44/127.57 c intdiving : 0.00 0 0
127.44/127.57 c actconsdiving : 0.00 0 0
127.44/127.57 c objpscostdiving : 0.00 0 0
127.44/127.57 c rootsoldiving : 0.00 0 0
127.44/127.57 c linesearchdiving : 0.00 0 0
127.44/127.57 c guideddiving : 0.00 0 0
127.44/127.57 c octane : 0.00 0 0
127.44/127.57 c rens : 0.00 0 0
127.44/127.57 c rins : 0.00 0 0
127.44/127.57 c localbranching : 0.00 0 0
127.44/127.57 c mutation : 0.00 0 0
127.44/127.57 c crossover : 0.00 0 0
127.44/127.57 c dins : 0.00 0 0
127.44/127.57 c undercover : 0.00 0 0
127.44/127.57 c nlp : 0.00 0 0
127.44/127.57 c trysol : 0.00 0 0
127.44/127.57 c LP : Time Calls Iterations Iter/call Iter/sec
127.44/127.57 c primal LP : 0.00 0 0 0.00 -
127.44/127.57 c dual LP : 87.46 39407 694463 17.62 7940.35
127.44/127.57 c lex dual LP : 0.00 0 0 0.00 -
127.44/127.57 c barrier LP : 0.00 0 0 0.00 -
127.44/127.57 c diving/probing LP: 0.00 0 0 0.00 -
127.44/127.57 c strong branching : 12.41 3674 97292 26.48 7839.81
127.44/127.57 c (at root node) : - 10 1145 114.50 -
127.44/127.57 c conflict analysis: 0.00 0 0 0.00 -
127.44/127.57 c B&B Tree :
127.44/127.57 c number of runs : 1
127.44/127.57 c nodes : 63062
127.44/127.57 c nodes (total) : 63062
127.44/127.57 c nodes left : 0
127.44/127.57 c max depth : 45
127.44/127.57 c max depth (total): 45
127.44/127.57 c backtracks : 8649 (13.7%)
127.44/127.57 c delayed cutoffs : 347
127.44/127.57 c repropagations : 6750 (17844 domain reductions, 338 cutoffs)
127.44/127.57 c avg switch length: 2.83
127.44/127.57 c switching time : 3.23
127.44/127.57 c Solution :
127.44/127.57 c Solutions found : 1 (1 improvements)
127.44/127.57 c First Solution : +0.00000000000000e+00 (in run 1, after 63062 nodes, 119.31 seconds, depth 25, found by <relaxation>)
127.44/127.57 c Primal Bound : +0.00000000000000e+00 (in run 1, after 63062 nodes, 119.31 seconds, depth 25, found by <relaxation>)
127.44/127.57 c Dual Bound : +0.00000000000000e+00
127.44/127.57 c Gap : 0.00 %
127.44/127.57 c Root Dual Bound : +0.00000000000000e+00
127.44/127.57 c Root Iterations : 648
127.44/127.58 c Time complete: 127.52.