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-2703966-1278548194.opb>
0.00/0.02 c original problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 470 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.03 c (round 1) 3 del vars, 1 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 256 impls, 0 clqs
0.00/0.03 c (round 2) 13 del vars, 17 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 256 impls, 0 clqs
0.00/0.03 c (round 3) 13 del vars, 27 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 256 impls, 0 clqs
0.00/0.04 c (round 4) 13 del vars, 27 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 443 upgd conss, 256 impls, 0 clqs
0.00/0.05 c (round 5) 19 del vars, 27 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 443 upgd conss, 4704 impls, 6 clqs
0.00/0.05 c (round 6) 19 del vars, 33 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 443 upgd conss, 4704 impls, 6 clqs
0.00/0.05 c (round 7) 19 del vars, 35 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 443 upgd conss, 4704 impls, 6 clqs
0.00/0.05 c presolving (8 rounds):
0.00/0.05 c 19 deleted vars, 35 deleted constraints, 11 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.05 c 4704 implications, 6 cliques
0.00/0.05 c presolved problem has 201 variables (201 bin, 0 int, 0 impl, 0 cont) and 435 constraints
0.00/0.05 c 129 constraints of type <knapsack>
0.00/0.05 c 95 constraints of type <setppc>
0.00/0.05 c 211 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.03
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c # SCIP version 1.2.1.3
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 = 1789.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 # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.05 c # [type: int, range: [1,2], default: 1]
0.00/0.05 c timing/clocktype = 2
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 # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/indicator/addCouplingCons = TRUE
0.00/0.06 c
0.00/0.06 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.06 c constraints/knapsack/disaggregation = FALSE
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify knapsacks
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c presolving/probing/maxrounds = 0
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/coefdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.06 c heuristics/crossover/freq = -1
0.00/0.06 c
0.00/0.06 c # number of nodes added to the contingent of the total nodes
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.06 c heuristics/crossover/nodesofs = 750
0.00/0.06 c
0.00/0.06 c # number of nodes without incumbent change that heuristic should wait
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.06 c heuristics/crossover/nwaitingnodes = 100
0.00/0.06 c
0.00/0.06 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.06 c # [type: real, range: [0,1], default: 0.1]
0.00/0.06 c heuristics/crossover/nodesquot = 0.15
0.00/0.06 c
0.00/0.06 c # minimum percentage of integer variables that have to be fixed
0.00/0.06 c # [type: real, range: [0,1], default: 0.666]
0.00/0.06 c heuristics/crossover/minfixingrate = 0.5
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/feaspump/freq = -1
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/fracdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/guideddiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/intshifting/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/linesearchdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/nlp/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/objpscostdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.06 c # [type: real, range: [0,1], default: 0.01]
0.00/0.06 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/oneopt/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/pscostdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/rens/freq = -1
0.00/0.06 c
0.00/0.06 c # minimum percentage of integer variables that have to be fixable
0.00/0.06 c # [type: real, range: [0,1], default: 0.5]
0.00/0.06 c heuristics/rens/minfixingrate = 0.3
0.00/0.06 c
0.00/0.06 c # number of nodes added to the contingent of the total nodes
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.06 c heuristics/rens/nodesofs = 2000
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/rootsoldiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.06 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/rounding/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/shifting/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/simplerounding/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/trivial/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/trysol/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/veclendiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/zirounding/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c separating/cmir/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c separating/flowcover/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c separating/rapidlearning/freq = 0
0.00/0.06 c
0.00/0.06 c -----------------------------------------------------------------------------------------------
0.00/0.06 c start solving
0.00/0.06 c
0.07/0.08 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.07/0.08 c 0.1s| 1 | 0 | 269 | - |1437k| 0 | 116 | 201 | 435 | 201 | 435 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.46 c 0.4s| 1 | 0 | 605 | - |2682k| 0 | 159 | 201 | 498 | 201 | 673 | 238 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.67 c 0.7s| 1 | 0 | 877 | - |4012k| 0 | 172 | 201 | 498 | 201 | 749 | 314 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/0.96 c 0.9s| 1 | 0 | 1180 | - |5707k| 0 | 176 | 201 | 498 | 201 | 787 | 352 | 0 | 0 | 0.000000e+00 | -- | Inf
1.09/1.19 c 1.2s| 1 | 0 | 1431 | - |7171k| 0 | 177 | 201 | 498 | 201 | 809 | 374 | 0 | 0 | 0.000000e+00 | -- | Inf
1.49/1.52 c 1.5s| 1 | 0 | 1846 | - |8941k| 0 | 189 | 201 | 498 | 201 | 828 | 393 | 0 | 0 | 0.000000e+00 | -- | Inf
3.79/3.84 c 3.8s| 1 | 2 | 1846 | - |8941k| 0 | 189 | 201 | 498 | 201 | 828 | 393 | 0 | 10 | 0.000000e+00 | -- | Inf
21.78/21.86 c *21.8s| 1960 | 0 | 46588 | 22.8 |9459k| 23 | - | 201 |1551 | 201 | 585 | 393 |1120 |1258 | 0.000000e+00 | 0.000000e+00 | 0.00%
21.78/21.86 c
21.78/21.86 c SCIP Status : problem is solved [optimal solution found]
21.78/21.86 c Solving Time (sec) : 21.84
21.78/21.86 c Solving Nodes : 1960
21.78/21.86 c Primal Bound : +0.00000000000000e+00 (1 solutions)
21.78/21.86 c Dual Bound : +0.00000000000000e+00
21.78/21.86 c Gap : 0.00 %
21.78/21.86 s SATISFIABLE
21.78/21.86 v x219 -x220 x217 -x218 x215 -x216 x213 -x214 x211 -x212 x209 -x210 x207 -x208 -x205 -x206 -x203 -x204 x201 -x202 x199 -x200 -x197
21.78/21.86 v x198 x195 -x196 -x193 x194 x191 -x192 x189 -x190 x187 -x188 -x185 x186 -x183 x184 -x181 x182 -x179 -x180 -x177 -x178 -x175
21.78/21.86 v -x176 -x173 x174 -x171 -x172 -x169 x170 -x167 x168 -x165 x166 -x163 x164 -x161 x162 x159 -x160 x157 -x158 x155 -x156 -x153 x154
21.78/21.86 v -x151 x152 -x149 x150 -x147 x148 -x145 x146 -x143 x144 -x141 x142 x139 -x140 x137 -x138 -x135 x136 -x133 x134 x131 -x132 x129
21.78/21.86 v -x130 -x128 -x126 -x124 -x122 -x120 -x118 -x116 -x114 -x112 -x110 -x108 -x106 -x104 -x102 -x100 -x98 x96 x94 -x92 -x90 -x88
21.78/21.86 v -x86 -x84 -x82 x80 -x78 x76 -x74 -x72 -x70 -x68 -x66 -x64 -x62 -x60 -x58 -x56 -x54 -x52 -x50 -x48 -x46 -x44 -x42 -x40 -x38
21.78/21.86 v -x36 -x34 -x32 x30 x28 -x26 -x24 -x22 -x20 -x18 x16 x14 x12 -x10 -x8 -x6 -x4 -x2 -x127 -x125 -x123 -x121 x119 -x117 x115 -x113
21.78/21.86 v -x111 -x109 -x107 x105 -x103 x101 -x99 -x97 -x95 -x93 -x91 -x89 -x87 -x85 -x83 -x81 -x79 -x77 -x75 -x73 -x71 -x69 -x67 -x65
21.78/21.86 v -x63 -x61 -x59 -x57 -x55 -x53 x51 x49 -x47 -x45 -x43 -x41 -x39 x37 x35 x33 -x31 -x29 -x27 -x25 -x23 -x21 -x19 -x17 -x15 -x13
21.78/21.86 v -x11 -x9 -x7 -x5 -x3 -x1
21.78/21.86 c SCIP Status : problem is solved [optimal solution found]
21.78/21.86 c Solving Time : 21.84
21.78/21.86 c Original Problem :
21.78/21.86 c Problem name : HOME/instance-2703966-1278548194.opb
21.78/21.86 c Variables : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
21.78/21.86 c Constraints : 470 initial, 470 maximal
21.78/21.86 c Presolved Problem :
21.78/21.86 c Problem name : t_HOME/instance-2703966-1278548194.opb
21.78/21.86 c Variables : 201 (201 binary, 0 integer, 0 implicit integer, 0 continuous)
21.78/21.86 c Constraints : 435 initial, 1551 maximal
21.78/21.86 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
21.78/21.86 c trivial : 0.00 0 0 0 0 0 0 0 0
21.78/21.86 c dualfix : 0.00 0 0 0 0 0 0 0 0
21.78/21.86 c boundshift : 0.00 0 0 0 0 0 0 0 0
21.78/21.86 c inttobinary : 0.00 0 0 0 0 0 0 0 0
21.78/21.86 c implics : 0.00 0 8 0 0 0 0 0 0
21.78/21.86 c probing : 0.00 0 0 0 0 0 0 0 0
21.78/21.86 c knapsack : 0.01 0 0 0 0 0 0 0 0
21.78/21.86 c setppc : 0.00 0 0 0 0 0 8 0 0
21.78/21.86 c linear : 0.01 11 0 0 11 0 27 0 0
21.78/21.86 c logicor : 0.00 0 0 0 0 0 0 0 0
21.78/21.86 c root node : - 0 - - 0 - - - -
21.78/21.86 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
21.78/21.86 c integral : 0 0 0 1176 0 13 165 0 0 2174
21.78/21.86 c knapsack : 129 5 8453 1 0 599 19788 445 0 0
21.78/21.86 c setppc : 95 5 7789 0 0 42 6383 0 0 0
21.78/21.86 c linear : 0+ 5 4595 0 0 0 23 1 0 0
21.78/21.86 c logicor : 211+ 5 6226 1 0 197 8125 0 0 0
21.78/21.86 c countsols : 0 0 0 1 0 0 0 0 0 0
21.78/21.86 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
21.78/21.86 c integral : 12.89 0.00 0.00 12.89 0.00
21.78/21.86 c knapsack : 0.26 0.01 0.25 0.00 0.00
21.78/21.86 c setppc : 0.03 0.00 0.03 0.00 0.00
21.78/21.86 c linear : 0.01 0.00 0.01 0.00 0.00
21.78/21.86 c logicor : 0.13 0.00 0.13 0.00 0.00
21.78/21.86 c countsols : 0.00 0.00 0.00 0.00 0.00
21.78/21.86 c Propagators : Time Calls Cutoffs DomReds
21.78/21.86 c vbounds : 0.00 1 0 0
21.78/21.86 c rootredcost : 0.00 0 0 0
21.78/21.86 c pseudoobj : 0.01 0 0 0
21.78/21.86 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
21.78/21.86 c propagation : 0.11 838 745 4951 44.1 16 27.7 -
21.78/21.86 c infeasible LP : 0.02 201 3 22 43.1 0 0.0 0
21.78/21.86 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
21.78/21.86 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
21.78/21.86 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
21.78/21.86 c applied globally : - - - 1108 14.1 - - -
21.78/21.86 c applied locally : - - - 12 50.3 - - -
21.78/21.86 c Separators : Time Calls Cutoffs DomReds Cuts Conss
21.78/21.86 c cut pool : 0.01 4 - - 35 - (maximal pool size: 2312)
21.78/21.86 c redcost : 0.01 1127 0 0 0 0
21.78/21.86 c impliedbounds : 0.00 5 0 0 600 0
21.78/21.86 c intobj : 0.00 0 0 0 0 0
21.78/21.86 c cgmip : 0.00 0 0 0 0 0
21.78/21.86 c gomory : 0.35 5 0 0 62 0
21.78/21.86 c strongcg : 0.36 5 0 0 2353 0
21.78/21.86 c cmir : 0.00 0 0 0 0 0
21.78/21.86 c flowcover : 0.00 0 0 0 0 0
21.78/21.86 c clique : 0.00 5 0 0 14 0
21.78/21.86 c zerohalf : 0.00 0 0 0 0 0
21.78/21.86 c mcf : 0.00 1 0 0 0 0
21.78/21.86 c rapidlearning : 0.19 1 0 0 0 63
21.78/21.86 c Pricers : Time Calls Vars
21.78/21.86 c problem variables: 0.00 0 0
21.78/21.86 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
21.78/21.86 c relpscost : 12.88 1175 13 165 0 0 2174
21.78/21.86 c pscost : 0.00 0 0 0 0 0 0
21.78/21.86 c inference : 0.00 0 0 0 0 0 0
21.78/21.86 c mostinf : 0.00 0 0 0 0 0 0
21.78/21.86 c leastinf : 0.00 0 0 0 0 0 0
21.78/21.86 c fullstrong : 0.00 0 0 0 0 0 0
21.78/21.86 c allfullstrong : 0.00 0 0 0 0 0 0
21.78/21.86 c random : 0.00 0 0 0 0 0 0
21.78/21.86 c Primal Heuristics : Time Calls Found
21.78/21.86 c LP solutions : 0.00 - 1
21.78/21.86 c pseudo solutions : 0.00 - 0
21.78/21.86 c trivial : 0.00 1 0
21.78/21.86 c simplerounding : 0.00 0 0
21.78/21.86 c zirounding : 0.00 0 0
21.78/21.86 c rounding : 0.00 0 0
21.78/21.86 c shifting : 0.00 0 0
21.78/21.86 c intshifting : 0.00 0 0
21.78/21.86 c oneopt : 0.00 0 0
21.78/21.86 c twoopt : 0.00 0 0
21.78/21.86 c fixandinfer : 0.00 0 0
21.78/21.86 c feaspump : 0.00 0 0
21.78/21.86 c coefdiving : 0.00 0 0
21.78/21.86 c pscostdiving : 0.00 0 0
21.78/21.86 c fracdiving : 0.00 0 0
21.78/21.86 c veclendiving : 0.00 0 0
21.78/21.86 c intdiving : 0.00 0 0
21.78/21.86 c actconsdiving : 0.00 0 0
21.78/21.86 c objpscostdiving : 0.00 0 0
21.78/21.86 c rootsoldiving : 0.00 0 0
21.78/21.86 c linesearchdiving : 0.00 0 0
21.78/21.86 c guideddiving : 0.00 0 0
21.78/21.86 c octane : 0.00 0 0
21.78/21.86 c rens : 0.00 0 0
21.78/21.86 c rins : 0.00 0 0
21.78/21.86 c localbranching : 0.00 0 0
21.78/21.86 c mutation : 0.00 0 0
21.78/21.86 c crossover : 0.00 0 0
21.78/21.86 c dins : 0.00 0 0
21.78/21.86 c undercover : 0.00 0 0
21.78/21.86 c nlp : 0.00 0 0
21.78/21.86 c trysol : 0.00 0 0
21.78/21.86 c LP : Time Calls Iterations Iter/call Iter/sec
21.78/21.86 c primal LP : 0.00 0 0 0.00 -
21.78/21.86 c dual LP : 7.02 1382 46588 33.71 6641.20
21.78/21.86 c lex dual LP : 0.00 0 0 0.00 -
21.78/21.86 c barrier LP : 0.00 0 0 0.00 -
21.78/21.86 c diving/probing LP: 0.00 0 0 0.00 -
21.78/21.86 c strong branching : 12.84 1258 71396 56.75 5561.30
21.78/21.86 c (at root node) : - 10 6964 696.40 -
21.78/21.86 c conflict analysis: 0.00 0 0 0.00 -
21.78/21.86 c B&B Tree :
21.78/21.86 c number of runs : 1
21.78/21.86 c nodes : 1960
21.78/21.86 c nodes (total) : 1960
21.78/21.86 c nodes left : 0
21.78/21.86 c max depth : 23
21.78/21.86 c max depth (total): 23
21.78/21.86 c backtracks : 429 (21.9%)
21.78/21.86 c delayed cutoffs : 191
21.78/21.86 c repropagations : 1135 (7382 domain reductions, 180 cutoffs)
21.78/21.86 c avg switch length: 3.25
21.78/21.86 c switching time : 0.17
21.78/21.86 c Solution :
21.78/21.86 c Solutions found : 1 (1 improvements)
21.78/21.86 c First Solution : +0.00000000000000e+00 (in run 1, after 1960 nodes, 21.84 seconds, depth 21, found by <relaxation>)
21.78/21.86 c Primal Bound : +0.00000000000000e+00 (in run 1, after 1960 nodes, 21.84 seconds, depth 21, found by <relaxation>)
21.78/21.86 c Dual Bound : +0.00000000000000e+00
21.78/21.86 c Gap : 0.00 %
21.78/21.86 c Root Dual Bound : +0.00000000000000e+00
21.78/21.86 c Root Iterations : 1846
21.78/21.88 c Time complete: 21.86.