0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.00 c Copyright (c) 2002-2011 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-3451233-1307639280.opb>
0.00/0.02 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.00/0.02 c problem read
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c presolving settings loaded
0.00/0.02 c presolving:
0.03/0.04 c (round 1) 0 del vars, 143 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.03/0.05 c (round 2) 0 del vars, 143 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.03/0.05 c (round 3) 0 del vars, 264 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.03/0.05 c presolving (4 rounds):
0.03/0.05 c 0 deleted vars, 264 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.03/0.05 c 242 implications, 22 cliques
0.03/0.05 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2443 constraints
0.03/0.05 c 1 constraints of type <knapsack>
0.03/0.05 c 22 constraints of type <setppc>
0.03/0.05 c 2420 constraints of type <logicor>
0.03/0.05 c transformed objective value is always integral (scale: 1)
0.03/0.05 c Presolving Time: 0.03
0.03/0.05 c - non default parameters ----------------------------------------------------------------------
0.03/0.05 c # SCIP version 2.0.1.5
0.03/0.05 c
0.03/0.05 c # frequency for displaying node information lines
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.03/0.05 c display/freq = 10000
0.03/0.05 c
0.03/0.05 c # maximal time in seconds to run
0.03/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.05 c limits/time = 1800
0.03/0.05 c
0.03/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.03/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.05 c limits/memory = 13950
0.03/0.05 c
0.03/0.05 c # solving stops, if the given number of solutions were found (-1: no limit)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.05 c limits/solutions = 1
0.03/0.05 c
0.03/0.05 c # maximal number of separation rounds per node (-1: unlimited)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 5]
0.03/0.05 c separating/maxrounds = 1
0.03/0.05 c
0.03/0.05 c # maximal number of separation rounds in the root node (-1: unlimited)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.05 c separating/maxroundsroot = 5
0.03/0.05 c
0.03/0.05 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.03/0.05 c # [type: int, range: [1,2], default: 1]
0.03/0.05 c timing/clocktype = 2
0.03/0.05 c
0.03/0.05 c # belongs reading time to solving time?
0.03/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.05 c timing/reading = TRUE
0.03/0.05 c
0.03/0.05 c # should presolving try to simplify inequalities
0.03/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.05 c constraints/linear/simplifyinequalities = TRUE
0.03/0.05 c
0.03/0.05 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.03/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.05 c constraints/indicator/addCouplingCons = TRUE
0.03/0.05 c
0.03/0.05 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.03/0.05 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.03/0.05 c constraints/knapsack/disaggregation = FALSE
0.03/0.05 c
0.03/0.05 c # should presolving try to simplify knapsacks
0.03/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.03/0.05 c
0.03/0.05 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.05 c presolving/probing/maxrounds = 0
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.05 c heuristics/coefdiving/freq = -1
0.03/0.05 c
0.03/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.05 c heuristics/coefdiving/maxlpiterquot = 0.075
0.03/0.05 c
0.03/0.05 c # additional number of allowed LP iterations
0.03/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.05 c heuristics/coefdiving/maxlpiterofs = 1500
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 30]
0.03/0.05 c heuristics/crossover/freq = -1
0.03/0.05 c
0.03/0.05 c # number of nodes added to the contingent of the total nodes
0.03/0.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.03/0.05 c heuristics/crossover/nodesofs = 750
0.03/0.05 c
0.03/0.05 c # number of nodes without incumbent change that heuristic should wait
0.03/0.05 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.03/0.05 c heuristics/crossover/nwaitingnodes = 100
0.03/0.05 c
0.03/0.05 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.03/0.05 c # [type: real, range: [0,1], default: 0.1]
0.03/0.05 c heuristics/crossover/nodesquot = 0.15
0.03/0.05 c
0.03/0.05 c # minimum percentage of integer variables that have to be fixed
0.03/0.05 c # [type: real, range: [0,1], default: 0.666]
0.03/0.05 c heuristics/crossover/minfixingrate = 0.5
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.03/0.05 c heuristics/feaspump/freq = -1
0.03/0.05 c
0.03/0.05 c # additional number of allowed LP iterations
0.03/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.05 c heuristics/feaspump/maxlpiterofs = 2000
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.05 c heuristics/fracdiving/freq = -1
0.03/0.05 c
0.03/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.05 c heuristics/fracdiving/maxlpiterquot = 0.075
0.03/0.05 c
0.03/0.05 c # additional number of allowed LP iterations
0.03/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.05 c heuristics/fracdiving/maxlpiterofs = 1500
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.05 c heuristics/guideddiving/freq = -1
0.03/0.05 c
0.03/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.05 c heuristics/guideddiving/maxlpiterquot = 0.075
0.03/0.05 c
0.03/0.05 c # additional number of allowed LP iterations
0.03/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.05 c heuristics/guideddiving/maxlpiterofs = 1500
0.03/0.05 c
0.03/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.05 c heuristics/intdiving/maxlpiterquot = 0.075
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.05 c heuristics/intshifting/freq = -1
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.05 c heuristics/linesearchdiving/freq = -1
0.03/0.05 c
0.03/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.05 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.03/0.05 c
0.03/0.05 c # additional number of allowed LP iterations
0.03/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.05 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.03/0.05 c heuristics/objpscostdiving/freq = -1
0.03/0.05 c
0.03/0.05 c # maximal fraction of diving LP iterations compared to total iteration number
0.03/0.05 c # [type: real, range: [0,1], default: 0.01]
0.03/0.05 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.03/0.05 c
0.03/0.05 c # additional number of allowed LP iterations
0.03/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.05 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.05 c heuristics/oneopt/freq = -1
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.05 c heuristics/pscostdiving/freq = -1
0.03/0.05 c
0.03/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.05 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.03/0.05 c
0.03/0.05 c # additional number of allowed LP iterations
0.03/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.05 c heuristics/pscostdiving/maxlpiterofs = 1500
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.03/0.05 c heuristics/rens/freq = -1
0.03/0.05 c
0.03/0.05 c # minimum percentage of integer variables that have to be fixable
0.03/0.05 c # [type: real, range: [0,1], default: 0.5]
0.03/0.05 c heuristics/rens/minfixingrate = 0.3
0.03/0.05 c
0.03/0.05 c # number of nodes added to the contingent of the total nodes
0.03/0.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.03/0.05 c heuristics/rens/nodesofs = 2000
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.03/0.05 c heuristics/rootsoldiving/freq = -1
0.03/0.05 c
0.03/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.03/0.05 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.03/0.05 c
0.03/0.05 c # additional number of allowed LP iterations
0.03/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.05 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.05 c heuristics/rounding/freq = -1
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.03/0.05 c heuristics/shiftandpropagate/freq = -1
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.05 c heuristics/shifting/freq = -1
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.05 c heuristics/simplerounding/freq = -1
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.05 c heuristics/subnlp/freq = -1
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.03/0.05 c heuristics/trivial/freq = -1
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.05 c heuristics/trysol/freq = -1
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.03/0.05 c heuristics/undercover/freq = -1
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.05 c heuristics/veclendiving/freq = -1
0.03/0.05 c
0.03/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.05 c heuristics/veclendiving/maxlpiterquot = 0.075
0.03/0.05 c
0.03/0.05 c # additional number of allowed LP iterations
0.03/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.05 c heuristics/veclendiving/maxlpiterofs = 1500
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.05 c heuristics/zirounding/freq = -1
0.03/0.05 c
0.03/0.05 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.03/0.05 c separating/cmir/freq = -1
0.03/0.05 c
0.03/0.05 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.03/0.05 c separating/flowcover/freq = -1
0.03/0.05 c
0.03/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.05 c separating/rapidlearning/freq = 0
0.03/0.05 c
0.03/0.05 c -----------------------------------------------------------------------------------------------
0.03/0.05 c start solving
0.03/0.05 c
0.03/0.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.03/0.07 c 0.1s| 1 | 0 | 76 | - |3825k| 0 | 36 | 231 |2443 | 231 |2443 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.15 c 0.2s| 1 | 0 | 95 | - |4129k| 0 | 45 | 231 |2487 | 231 |2455 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.3s| 1 | 0 | 106 | - |4460k| 0 | 45 | 231 |2487 | 231 |2456 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.37 c 0.4s| 1 | 0 | 115 | - |4812k| 0 | 48 | 231 |2487 | 231 |2459 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.50 c 0.5s| 1 | 0 | 127 | - |5218k| 0 | 48 | 231 |2487 | 231 |2460 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.64 c 0.6s| 1 | 0 | 144 | - |5564k| 0 | 48 | 231 |2487 | 231 |2461 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.76 c 0.8s| 1 | 2 | 144 | - |5565k| 0 | 48 | 231 |2487 | 231 |2461 | 18 | 0 | 9 | 0.000000e+00 | -- | Inf
6.09/6.10 c * 6.1s| 94 | 0 | 3865 | 40.0 |5723k| 18 | - | 231 |2504 | 231 |2452 | 18 | 17 |1216 | 0.000000e+00 | 0.000000e+00 | 0.00%
6.09/6.10 c
6.09/6.10 c SCIP Status : problem is solved [optimal solution found]
6.09/6.10 c Solving Time (sec) : 6.10
6.09/6.10 c Solving Nodes : 94
6.09/6.10 c Primal Bound : +0.00000000000000e+00 (1 solutions)
6.09/6.10 c Dual Bound : +0.00000000000000e+00
6.09/6.10 c Gap : 0.00 %
6.09/6.10 s SATISFIABLE
6.09/6.10 v -x221 -x211 -x201 x191 -x181 -x171 -x161 -x151 -x141 -x131 -x231 -x210 -x200 -x190 -x180 -x170 -x160 x150 -x140 -x130 x230 -x220
6.09/6.10 v -x199 -x189 -x179 -x169 -x159 -x149 -x139 -x129 -x229 -x219 -x209 -x188 -x178 -x168 -x158 -x148 x138 -x128 -x228 -x218 -x208
6.09/6.10 v -x198 -x177 -x167 x157 -x147 -x137 -x127 -x227 -x217 x207 -x197 -x187 -x166 -x156 -x146 -x136 -x126 -x226 -x216 -x206 -x196
6.09/6.10 v -x186 -x176 -x155 -x145 -x135 x125 -x225 -x215 -x205 x195 -x185 -x175 -x165 -x144 -x134 -x124 -x224 -x214 -x204 -x194 -x184
6.09/6.10 v -x174 x164 -x154 -x133 -x123 -x223 x213 -x203 -x193 -x183 -x173 -x163 -x153 -x143 -x122 -x222 -x212 -x202 -x192 -x182 x172 -x162
6.09/6.10 v -x152 -x142 -x132 -x121 -x120 -x119 -x118 -x117 x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 x108 -x107 -x106 -x105 -x104
6.09/6.10 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
6.09/6.10 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
6.09/6.10 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
6.09/6.10 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
6.09/6.10 v x1
6.09/6.10 c SCIP Status : problem is solved [optimal solution found]
6.09/6.10 c Total Time : 6.10
6.09/6.10 c solving : 6.10
6.09/6.10 c presolving : 0.03 (included in solving)
6.09/6.10 c reading : 0.02 (included in solving)
6.09/6.10 c Original Problem :
6.09/6.10 c Problem name : HOME/instance-3451233-1307639280.opb
6.09/6.10 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
6.09/6.10 c Constraints : 2707 initial, 2707 maximal
6.09/6.10 c Presolved Problem :
6.09/6.10 c Problem name : t_HOME/instance-3451233-1307639280.opb
6.09/6.10 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
6.09/6.10 c Constraints : 2443 initial, 2504 maximal
6.09/6.10 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
6.09/6.10 c trivial : 0.00 0 0 0 0 0 0 0 0 0
6.09/6.10 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
6.09/6.10 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
6.09/6.10 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
6.09/6.10 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
6.09/6.10 c implics : 0.00 0 0 0 0 0 0 0 0 0
6.09/6.10 c probing : 0.00 0 0 0 0 0 0 0 0 0
6.09/6.10 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
6.09/6.10 c setppc : 0.00 0 0 0 0 0 121 0 0 0
6.09/6.10 c linear : 0.01 0 0 0 0 0 143 0 0 0
6.09/6.10 c logicor : 0.01 0 0 0 0 0 0 0 0 0
6.09/6.10 c root node : - 0 - - 0 - - - - -
6.09/6.10 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
6.09/6.10 c integral : 0 0 0 181 0 3 0 20 397 0 0 110
6.09/6.10 c knapsack : 1 5 397 1 0 0 10 2 166 0 0 0
6.09/6.10 c setppc : 22 5 395 1 0 0 307 4 692 0 0 0
6.09/6.10 c linear : 0+ 5 167 0 0 0 0 0 4 1 0 0
6.09/6.10 c logicor : 2420+ 5 354 1 0 0 153 2 1026 0 0 0
6.09/6.10 c countsols : 0 0 0 1 0 2 0 0 0 0 0 0
6.09/6.10 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
6.09/6.10 c integral : 4.98 0.00 0.00 4.98 0.00 0.00 0.00
6.09/6.10 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
6.09/6.10 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
6.09/6.10 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
6.09/6.10 c logicor : 0.01 0.00 0.00 0.00 0.00 0.00 0.00
6.09/6.10 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
6.09/6.10 c Propagators : #Propagate #Resprop Cutoffs DomReds
6.09/6.10 c vbounds : 0 0 0 0
6.09/6.10 c rootredcost : 0 0 0 0
6.09/6.10 c pseudoobj : 0 0 0 0
6.09/6.10 c Propagator Timings : TotalTime Propagate Resprop
6.09/6.10 c vbounds : 0.00 0.00 0.00
6.09/6.10 c rootredcost : 0.00 0.00 0.00
6.09/6.10 c pseudoobj : 0.00 0.00 0.00
6.09/6.10 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
6.09/6.10 c propagation : 0.00 8 7 30 27.1 1 12.0 -
6.09/6.10 c infeasible LP : 0.00 10 1 6 46.7 0 0.0 0
6.09/6.10 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
6.09/6.10 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
6.09/6.10 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
6.09/6.10 c applied globally : - - - 17 20.7 - - -
6.09/6.10 c applied locally : - - - 0 0.0 - - -
6.09/6.10 c Separators : Time Calls Cutoffs DomReds Cuts Conss
6.09/6.10 c cut pool : 0.00 4 - - 32 - (maximal pool size: 501)
6.09/6.10 c redcost : 0.00 92 0 0 0 0
6.09/6.10 c impliedbounds : 0.00 5 0 0 0 0
6.09/6.10 c intobj : 0.00 0 0 0 0 0
6.09/6.10 c gomory : 0.32 5 0 0 529 0
6.09/6.10 c cgmip : 0.00 0 0 0 0 0
6.09/6.10 c closecuts : 0.00 0 0 0 0 0
6.09/6.10 c strongcg : 0.20 5 0 0 2500 0
6.09/6.10 c cmir : 0.00 0 0 0 0 0
6.09/6.10 c flowcover : 0.00 0 0 0 0 0
6.09/6.10 c clique : 0.00 5 0 0 0 0
6.09/6.10 c zerohalf : 0.00 0 0 0 0 0
6.09/6.10 c mcf : 0.00 1 0 0 0 0
6.09/6.10 c oddcycle : 0.00 0 0 0 0 0
6.09/6.10 c rapidlearning : 0.04 1 0 0 0 44
6.09/6.10 c Pricers : Time Calls Vars
6.09/6.10 c problem variables: 0.00 0 0
6.09/6.10 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
6.09/6.10 c relpscost : 4.98 180 20 397 0 0 110
6.09/6.10 c pscost : 0.00 0 0 0 0 0 0
6.09/6.10 c inference : 0.00 0 0 0 0 0 0
6.09/6.10 c mostinf : 0.00 0 0 0 0 0 0
6.09/6.10 c leastinf : 0.00 0 0 0 0 0 0
6.09/6.10 c fullstrong : 0.00 0 0 0 0 0 0
6.09/6.10 c allfullstrong : 0.00 0 0 0 0 0 0
6.09/6.10 c random : 0.00 0 0 0 0 0 0
6.09/6.10 c Primal Heuristics : Time Calls Found
6.09/6.10 c LP solutions : 0.00 - 1
6.09/6.10 c pseudo solutions : 0.00 - 0
6.09/6.10 c trivial : 0.00 1 0
6.09/6.10 c shiftandpropagate: 0.00 0 0
6.09/6.10 c simplerounding : 0.00 0 0
6.09/6.10 c zirounding : 0.00 0 0
6.09/6.10 c rounding : 0.00 0 0
6.09/6.10 c shifting : 0.00 0 0
6.09/6.10 c intshifting : 0.00 0 0
6.09/6.10 c oneopt : 0.00 0 0
6.09/6.10 c twoopt : 0.00 0 0
6.09/6.10 c fixandinfer : 0.00 0 0
6.09/6.10 c feaspump : 0.00 0 0
6.09/6.10 c clique : 0.00 0 0
6.09/6.10 c coefdiving : 0.00 0 0
6.09/6.10 c pscostdiving : 0.00 0 0
6.09/6.10 c fracdiving : 0.00 0 0
6.09/6.10 c veclendiving : 0.00 0 0
6.09/6.10 c intdiving : 0.00 0 0
6.09/6.10 c actconsdiving : 0.00 0 0
6.09/6.10 c objpscostdiving : 0.00 0 0
6.09/6.10 c rootsoldiving : 0.00 0 0
6.09/6.10 c linesearchdiving : 0.00 0 0
6.09/6.10 c guideddiving : 0.00 0 0
6.09/6.10 c octane : 0.00 0 0
6.09/6.10 c rens : 0.00 0 0
6.09/6.10 c rins : 0.00 0 0
6.09/6.10 c localbranching : 0.00 0 0
6.09/6.10 c mutation : 0.00 0 0
6.09/6.10 c crossover : 0.00 0 0
6.09/6.10 c dins : 0.00 0 0
6.09/6.10 c vbounds : 0.00 0 0
6.09/6.10 c undercover : 0.00 0 0
6.09/6.10 c subnlp : 0.00 0 0
6.09/6.10 c trysol : 0.00 0 0
6.09/6.10 c LP : Time Calls Iterations Iter/call Iter/sec
6.09/6.10 c primal LP : 0.00 0 0 0.00 -
6.09/6.10 c dual LP : 0.45 196 3865 19.72 8613.10
6.09/6.10 c lex dual LP : 0.00 0 0 0.00 -
6.09/6.10 c barrier LP : 0.00 0 0 0.00 -
6.09/6.10 c diving/probing LP: 0.00 0 0 0.00 -
6.09/6.10 c strong branching : 4.96 1216 41187 33.87 8300.64
6.09/6.10 c (at root node) : - 9 1079 119.89 -
6.09/6.10 c conflict analysis: 0.00 0 0 0.00 -
6.09/6.10 c B&B Tree :
6.09/6.10 c number of runs : 1
6.09/6.10 c nodes : 94
6.09/6.10 c nodes (total) : 94
6.09/6.10 c nodes left : 0
6.09/6.10 c max depth : 18
6.09/6.10 c max depth (total): 18
6.09/6.10 c backtracks : 8 (8.5%)
6.09/6.10 c delayed cutoffs : 0
6.09/6.10 c repropagations : 4 (5 domain reductions, 0 cutoffs)
6.09/6.10 c avg switch length: 2.68
6.09/6.10 c switching time : 0.01
6.09/6.10 c Solution :
6.09/6.10 c Solutions found : 1 (1 improvements)
6.09/6.10 c First Solution : +0.00000000000000e+00 (in run 1, after 94 nodes, 6.10 seconds, depth 9, found by <relaxation>)
6.09/6.10 c Primal Bound : +0.00000000000000e+00 (in run 1, after 94 nodes, 6.10 seconds, depth 9, found by <relaxation>)
6.09/6.10 c Dual Bound : +0.00000000000000e+00
6.09/6.10 c Gap : 0.00 %
6.09/6.10 c Root Dual Bound : +0.00000000000000e+00
6.09/6.10 c Root Iterations : 144
6.09/6.11 c Time complete: 6.11.