0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2704119-1278549319.opb>
0.00/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.00/0.05 c problem read
0.00/0.05 c No objective function, only one solution is needed.
0.00/0.05 c presolving settings loaded
0.00/0.06 c presolving:
0.09/0.10 c (round 1) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.09/0.12 c (round 2) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.09/0.13 c (round 3) 0 del vars, 264 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.09/0.13 c presolving (4 rounds):
0.09/0.13 c 0 deleted vars, 264 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.13 c 242 implications, 22 cliques
0.09/0.13 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2443 constraints
0.09/0.13 c 1 constraints of type <knapsack>
0.09/0.13 c 22 constraints of type <setppc>
0.09/0.13 c 2420 constraints of type <logicor>
0.09/0.13 c transformed objective value is always integral (scale: 1)
0.09/0.13 c Presolving Time: 0.07
0.09/0.13 c - non default parameters ----------------------------------------------------------------------
0.09/0.13 c # SCIP version 1.2.1.3
0.09/0.13 c
0.09/0.13 c # frequency for displaying node information lines
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.13 c display/freq = 10000
0.09/0.13 c
0.09/0.13 c # maximal time in seconds to run
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.13 c limits/time = 1789.96
0.09/0.13 c
0.09/0.13 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.13 c limits/memory = 1620
0.09/0.13 c
0.09/0.13 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c limits/solutions = 1
0.09/0.13 c
0.09/0.13 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.13 c separating/maxrounds = 1
0.09/0.13 c
0.09/0.13 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c separating/maxroundsroot = 5
0.09/0.13 c
0.09/0.13 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.13 c # [type: int, range: [1,2], default: 1]
0.09/0.13 c timing/clocktype = 2
0.09/0.13 c
0.09/0.13 c # should presolving try to simplify inequalities
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/linear/simplifyinequalities = TRUE
0.09/0.13 c
0.09/0.13 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/indicator/addCouplingCons = TRUE
0.09/0.13 c
0.09/0.13 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.13 c constraints/knapsack/disaggregation = FALSE
0.09/0.13 c
0.09/0.13 c # should presolving try to simplify knapsacks
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.13 c
0.09/0.13 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c presolving/probing/maxrounds = 0
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/coefdiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.13 c heuristics/crossover/freq = -1
0.09/0.13 c
0.09/0.13 c # number of nodes added to the contingent of the total nodes
0.09/0.13 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.13 c heuristics/crossover/nodesofs = 750
0.09/0.13 c
0.09/0.13 c # number of nodes without incumbent change that heuristic should wait
0.09/0.13 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.13 c heuristics/crossover/nwaitingnodes = 100
0.09/0.13 c
0.09/0.13 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.13 c # [type: real, range: [0,1], default: 0.1]
0.09/0.13 c heuristics/crossover/nodesquot = 0.15
0.09/0.13 c
0.09/0.13 c # minimum percentage of integer variables that have to be fixed
0.09/0.13 c # [type: real, range: [0,1], default: 0.666]
0.09/0.13 c heuristics/crossover/minfixingrate = 0.5
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.14 c heuristics/feaspump/freq = -1
0.09/0.14 c
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/fracdiving/freq = -1
0.09/0.14 c
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.14 c
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/guideddiving/freq = -1
0.09/0.14 c
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.14 c
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.14 c
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/intshifting/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/linesearchdiving/freq = -1
0.09/0.14 c
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.14 c
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/nlp/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.14 c heuristics/objpscostdiving/freq = -1
0.09/0.14 c
0.09/0.14 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.14 c # [type: real, range: [0,1], default: 0.01]
0.09/0.14 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.14 c
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/oneopt/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/pscostdiving/freq = -1
0.09/0.14 c
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.14 c
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c heuristics/rens/freq = -1
0.09/0.14 c
0.09/0.14 c # minimum percentage of integer variables that have to be fixable
0.09/0.14 c # [type: real, range: [0,1], default: 0.5]
0.09/0.14 c heuristics/rens/minfixingrate = 0.3
0.09/0.14 c
0.09/0.14 c # number of nodes added to the contingent of the total nodes
0.09/0.14 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.14 c heuristics/rens/nodesofs = 2000
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.14 c heuristics/rootsoldiving/freq = -1
0.09/0.14 c
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.14 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.14 c
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/rounding/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/shifting/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/simplerounding/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c heuristics/trivial/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/trysol/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/veclendiving/freq = -1
0.09/0.14 c
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.14 c
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/zirounding/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c separating/cmir/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c separating/flowcover/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14 c separating/rapidlearning/freq = 0
0.09/0.14 c
0.09/0.14 c -----------------------------------------------------------------------------------------------
0.09/0.14 c start solving
0.09/0.14 c
0.09/0.16 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.16 c 0.1s| 1 | 0 | 76 | - |3488k| 0 | 36 | 231 |2443 | 231 |2443 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.54 c 0.5s| 1 | 0 | 100 | - |3908k| 0 | 47 | 231 |2615 | 231 |2455 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.79/0.82 c 0.8s| 1 | 0 | 136 | - |4331k| 0 | 46 | 231 |2615 | 231 |2459 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
1.10/1.11 c 1.1s| 1 | 0 | 197 | - |4781k| 0 | 56 | 231 |2615 | 231 |2460 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
1.49/1.51 c 1.5s| 1 | 0 | 246 | - |5310k| 0 | 55 | 231 |2615 | 231 |2462 | 19 | 0 | 0 | 0.000000e+00 | -- | Inf
1.89/1.92 c 1.9s| 1 | 0 | 295 | - |5312k| 0 | 49 | 231 |2615 | 231 |2463 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
2.69/2.77 c 2.7s| 1 | 2 | 295 | - |5313k| 0 | 49 | 231 |2615 | 231 |2463 | 20 | 0 | 9 | 0.000000e+00 | -- | Inf
138.25/138.30 c 138s| 10000 | 74 |242605 | 24.2 |7123k| 36 | 32 | 231 |6046 | 231 |2455 | 20 |5918 |2269 | 0.000000e+00 | -- | Inf
140.66/140.75 c * 141s| 10243 | 0 |248920 | 24.3 |6937k| 36 | - | 231 |6037 | 231 |2455 | 20 |6032 |2270 | 0.000000e+00 | 0.000000e+00 | 0.00%
140.66/140.75 c
140.66/140.75 c SCIP Status : problem is solved [optimal solution found]
140.66/140.75 c Solving Time (sec) : 140.70
140.66/140.75 c Solving Nodes : 10243
140.66/140.75 c Primal Bound : +0.00000000000000e+00 (1 solutions)
140.66/140.75 c Dual Bound : +0.00000000000000e+00
140.66/140.75 c Gap : 0.00 %
140.66/140.76 s SATISFIABLE
140.66/140.76 v -x221 -x211 -x201 -x191 -x181 -x171 -x161 -x151 -x141 x131 -x231 -x210 -x200 -x190 -x180 -x170 -x160 -x150 x140 -x130 -x230 -x220
140.66/140.76 v -x199 x189 -x179 -x169 -x159 -x149 -x139 -x129 -x229 -x219 -x209 -x188 -x178 -x168 -x158 x148 -x138 -x128 -x228 -x218 -x208
140.66/140.76 v -x198 -x177 -x167 x157 -x147 -x137 -x127 -x227 x217 -x207 -x197 -x187 -x166 -x156 -x146 -x136 -x126 -x226 -x216 -x206 x196
140.66/140.76 v -x186 -x176 -x155 -x145 -x135 -x125 x225 -x215 -x205 -x195 -x185 -x175 -x165 -x144 -x134 -x124 -x224 -x214 x204 -x194 -x184 -x174
140.66/140.76 v -x164 -x154 -x133 -x123 -x223 -x213 -x203 -x193 -x183 -x173 x163 -x153 -x143 -x122 -x222 -x212 -x202 -x192 -x182 x172 -x162
140.66/140.76 v -x152 -x142 -x132 -x121 x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104
140.66/140.76 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
140.66/140.76 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
140.66/140.76 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
140.66/140.76 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
140.66/140.76 v -x1
140.66/140.76 c SCIP Status : problem is solved [optimal solution found]
140.66/140.76 c Solving Time : 140.70
140.66/140.76 c Original Problem :
140.66/140.76 c Problem name : HOME/instance-2704119-1278549319.opb
140.66/140.76 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
140.66/140.76 c Constraints : 2707 initial, 2707 maximal
140.66/140.76 c Presolved Problem :
140.66/140.76 c Problem name : t_HOME/instance-2704119-1278549319.opb
140.66/140.76 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
140.66/140.76 c Constraints : 2443 initial, 6144 maximal
140.66/140.76 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
140.66/140.76 c trivial : 0.00 0 0 0 0 0 0 0 0
140.66/140.76 c dualfix : 0.00 0 0 0 0 0 0 0 0
140.66/140.76 c boundshift : 0.00 0 0 0 0 0 0 0 0
140.66/140.76 c inttobinary : 0.00 0 0 0 0 0 0 0 0
140.66/140.76 c implics : 0.00 0 0 0 0 0 0 0 0
140.66/140.76 c probing : 0.00 0 0 0 0 0 0 0 0
140.66/140.76 c knapsack : 0.00 0 0 0 0 0 0 0 0
140.66/140.76 c setppc : 0.00 0 0 0 0 0 121 0 0
140.66/140.76 c linear : 0.03 0 0 0 0 0 143 0 0
140.66/140.76 c logicor : 0.03 0 0 0 0 0 0 0 0
140.66/140.76 c root node : - 0 - - 0 - - - -
140.66/140.76 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
140.66/140.76 c integral : 0 0 0 5717 0 56 901 0 0 10430
140.66/140.76 c knapsack : 1 5 37603 1 0 105 17902 0 0 0
140.66/140.76 c setppc : 22 5 37520 0 0 252 53451 0 0 0
140.66/140.76 c linear : 0+ 5 36963 0 0 14 541 1 0 0
140.66/140.76 c logicor : 2420+ 5 20195 1 0 98 72296 0 0 0
140.66/140.76 c countsols : 0 0 0 1 0 0 0 0 0 0
140.66/140.76 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
140.66/140.76 c integral : 43.14 0.00 0.00 43.14 0.00
140.66/140.76 c knapsack : 0.33 0.00 0.33 0.00 0.00
140.66/140.76 c setppc : 0.57 0.00 0.57 0.00 0.00
140.66/140.76 c linear : 0.40 0.00 0.39 0.00 0.00
140.66/140.76 c logicor : 2.16 0.00 2.16 0.00 0.00
140.66/140.76 c countsols : 0.00 0.00 0.00 0.00 0.00
140.66/140.76 c Propagators : Time Calls Cutoffs DomReds
140.66/140.76 c vbounds : 0.02 1 0 0
140.66/140.76 c rootredcost : 0.02 0 0 0
140.66/140.76 c pseudoobj : 0.02 0 0 0
140.66/140.76 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
140.66/140.76 c propagation : 0.04 469 466 3016 21.5 8 16.9 -
140.66/140.76 c infeasible LP : 1.83 4603 4389 31300 32.4 51 16.6 0
140.66/140.76 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
140.66/140.76 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
140.66/140.76 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
140.66/140.76 c applied globally : - - - 6026 15.2 - - -
140.66/140.76 c applied locally : - - - 6 37.0 - - -
140.66/140.76 c Separators : Time Calls Cutoffs DomReds Cuts Conss
140.66/140.76 c cut pool : 0.00 4 - - 31 - (maximal pool size: 483)
140.66/140.76 c redcost : 0.06 5306 0 0 0 0
140.66/140.76 c impliedbounds : 0.00 5 0 0 0 0
140.66/140.76 c intobj : 0.00 0 0 0 0 0
140.66/140.76 c cgmip : 0.00 0 0 0 0 0
140.66/140.76 c gomory : 0.84 5 0 0 618 0
140.66/140.76 c strongcg : 0.58 5 0 0 2000 0
140.66/140.76 c cmir : 0.00 0 0 0 0 0
140.66/140.76 c flowcover : 0.00 0 0 0 0 0
140.66/140.76 c clique : 0.00 5 0 0 0 0
140.66/140.76 c zerohalf : 0.00 0 0 0 0 0
140.66/140.76 c mcf : 0.00 1 0 0 0 0
140.66/140.76 c rapidlearning : 0.25 1 0 0 0 172
140.66/140.76 c Pricers : Time Calls Vars
140.66/140.76 c problem variables: 0.00 0 0
140.66/140.76 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
140.66/140.76 c relpscost : 43.12 5716 56 901 0 0 10430
140.66/140.76 c pscost : 0.00 0 0 0 0 0 0
140.66/140.76 c inference : 0.00 0 0 0 0 0 0
140.66/140.76 c mostinf : 0.00 0 0 0 0 0 0
140.66/140.76 c leastinf : 0.00 0 0 0 0 0 0
140.66/140.76 c fullstrong : 0.00 0 0 0 0 0 0
140.66/140.76 c allfullstrong : 0.00 0 0 0 0 0 0
140.66/140.76 c random : 0.00 0 0 0 0 0 0
140.66/140.76 c Primal Heuristics : Time Calls Found
140.66/140.76 c LP solutions : 0.00 - 1
140.66/140.76 c pseudo solutions : 0.00 - 0
140.66/140.76 c trivial : 0.00 1 0
140.66/140.76 c simplerounding : 0.00 0 0
140.66/140.76 c zirounding : 0.00 0 0
140.66/140.76 c rounding : 0.00 0 0
140.66/140.76 c shifting : 0.00 0 0
140.66/140.76 c intshifting : 0.00 0 0
140.66/140.76 c oneopt : 0.00 0 0
140.66/140.76 c twoopt : 0.00 0 0
140.66/140.76 c fixandinfer : 0.00 0 0
140.66/140.76 c feaspump : 0.00 0 0
140.66/140.76 c coefdiving : 0.00 0 0
140.66/140.76 c pscostdiving : 0.00 0 0
140.66/140.76 c fracdiving : 0.00 0 0
140.66/140.76 c veclendiving : 0.00 0 0
140.66/140.76 c intdiving : 0.00 0 0
140.66/140.76 c actconsdiving : 0.00 0 0
140.66/140.76 c objpscostdiving : 0.00 0 0
140.66/140.76 c rootsoldiving : 0.00 0 0
140.66/140.76 c linesearchdiving : 0.00 0 0
140.66/140.76 c guideddiving : 0.00 0 0
140.66/140.76 c octane : 0.00 0 0
140.66/140.76 c rens : 0.00 0 0
140.66/140.76 c rins : 0.00 0 0
140.66/140.76 c localbranching : 0.00 0 0
140.66/140.76 c mutation : 0.00 0 0
140.66/140.76 c crossover : 0.00 0 0
140.66/140.76 c dins : 0.00 0 0
140.66/140.76 c undercover : 0.00 0 0
140.66/140.76 c nlp : 0.00 0 0
140.66/140.76 c trysol : 0.00 0 0
140.66/140.76 c LP : Time Calls Iterations Iter/call Iter/sec
140.66/140.76 c primal LP : 0.00 0 0 0.00 -
140.66/140.76 c dual LP : 82.83 10299 248920 24.17 3005.07
140.66/140.76 c lex dual LP : 0.00 0 0 0.00 -
140.66/140.76 c barrier LP : 0.00 0 0 0.00 -
140.66/140.76 c diving/probing LP: 0.00 0 0 0.00 -
140.66/140.76 c strong branching : 42.86 2270 124367 54.79 2901.76
140.66/140.76 c (at root node) : - 9 2098 233.11 -
140.66/140.76 c conflict analysis: 0.00 0 0 0.00 -
140.66/140.76 c B&B Tree :
140.66/140.76 c number of runs : 1
140.66/140.76 c nodes : 10243
140.66/140.76 c nodes (total) : 10243
140.66/140.76 c nodes left : 0
140.66/140.76 c max depth : 36
140.66/140.76 c max depth (total): 36
140.66/140.76 c backtracks : 1353 (13.2%)
140.66/140.76 c delayed cutoffs : 107
140.66/140.76 c repropagations : 13536 (19980 domain reductions, 101 cutoffs)
140.66/140.76 c avg switch length: 4.53
140.66/140.76 c switching time : 2.56
140.66/140.76 c Solution :
140.66/140.76 c Solutions found : 1 (1 improvements)
140.66/140.76 c First Solution : +0.00000000000000e+00 (in run 1, after 10243 nodes, 140.70 seconds, depth 20, found by <relaxation>)
140.66/140.76 c Primal Bound : +0.00000000000000e+00 (in run 1, after 10243 nodes, 140.70 seconds, depth 20, found by <relaxation>)
140.66/140.76 c Dual Bound : +0.00000000000000e+00
140.66/140.76 c Gap : 0.00 %
140.66/140.76 c Root Dual Bound : +0.00000000000000e+00
140.66/140.76 c Root Iterations : 295
140.66/140.78 c Time complete: 140.73.