0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2667240-1276281513.opb>
0.00/0.06 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.00/0.06 c problem read
0.00/0.06 c No objective function, only one solution is needed.
0.00/0.06 c presolving settings loaded
0.00/0.07 c presolving:
0.10/0.12 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.10/0.13 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.10/0.15 c presolving (3 rounds):
0.10/0.15 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.10/0.15 c 242 implications, 22 cliques
0.10/0.15 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.10/0.15 c 1 constraints of type <knapsack>
0.10/0.15 c 22 constraints of type <setppc>
0.10/0.15 c 2541 constraints of type <logicor>
0.10/0.15 c transformed objective value is always integral (scale: 1)
0.10/0.15 c Presolving Time: 0.06
0.10/0.15 c - non default parameters ----------------------------------------------------------------------
0.10/0.15 c # SCIP version 1.2.1.2
0.10/0.15 c
0.10/0.15 c # frequency for displaying node information lines
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 100]
0.10/0.15 c display/freq = 10000
0.10/0.15 c
0.10/0.15 c # maximal time in seconds to run
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.10/0.15 c limits/time = 1799.95
0.10/0.15 c
0.10/0.15 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.10/0.15 c limits/memory = 1620
0.10/0.15 c
0.10/0.15 c # solving stops, if the given number of solutions were found (-1: no limit)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.15 c limits/solutions = 1
0.10/0.15 c
0.10/0.15 c # maximal number of separation rounds per node (-1: unlimited)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 5]
0.10/0.15 c separating/maxrounds = 1
0.10/0.15 c
0.10/0.15 c # maximal number of separation rounds in the root node (-1: unlimited)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.15 c separating/maxroundsroot = 5
0.10/0.15 c
0.10/0.15 c # should presolving try to simplify inequalities
0.10/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.15 c constraints/linear/simplifyinequalities = TRUE
0.10/0.15 c
0.10/0.15 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.10/0.15 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.10/0.15 c constraints/knapsack/disaggregation = FALSE
0.10/0.15 c
0.10/0.15 c # should presolving try to simplify knapsacks
0.10/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.15 c constraints/knapsack/simplifyinequalities = TRUE
0.10/0.15 c
0.10/0.15 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.15 c presolving/probing/maxrounds = 0
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/coefdiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.15 c heuristics/coefdiving/maxlpiterquot = 0.075
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/coefdiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 30]
0.10/0.15 c heuristics/crossover/freq = -1
0.10/0.15 c
0.10/0.15 c # number of nodes added to the contingent of the total nodes
0.10/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.10/0.15 c heuristics/crossover/nodesofs = 750
0.10/0.15 c
0.10/0.15 c # number of nodes without incumbent change that heuristic should wait
0.10/0.15 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.10/0.15 c heuristics/crossover/nwaitingnodes = 100
0.10/0.15 c
0.10/0.15 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.10/0.15 c # [type: real, range: [0,1], default: 0.1]
0.10/0.15 c heuristics/crossover/nodesquot = 0.15
0.10/0.15 c
0.10/0.15 c # minimum percentage of integer variables that have to be fixed
0.10/0.15 c # [type: real, range: [0,1], default: 0.666]
0.10/0.15 c heuristics/crossover/minfixingrate = 0.5
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.15 c heuristics/feaspump/freq = -1
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/feaspump/maxlpiterofs = 2000
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/fracdiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.15 c heuristics/fracdiving/maxlpiterquot = 0.075
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/fracdiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/guideddiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.15 c heuristics/guideddiving/maxlpiterquot = 0.075
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/guideddiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.15 c heuristics/intdiving/maxlpiterquot = 0.075
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/intshifting/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/linesearchdiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.15 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.15 c heuristics/nlp/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.15 c heuristics/objpscostdiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to total iteration number
0.10/0.15 c # [type: real, range: [0,1], default: 0.01]
0.10/0.15 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.15 c heuristics/oneopt/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/pscostdiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.15 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/pscostdiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.15 c heuristics/rens/freq = -1
0.10/0.15 c
0.10/0.15 c # minimum percentage of integer variables that have to be fixable
0.10/0.15 c # [type: real, range: [0,1], default: 0.5]
0.10/0.15 c heuristics/rens/minfixingrate = 0.3
0.10/0.15 c
0.10/0.15 c # number of nodes added to the contingent of the total nodes
0.10/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.10/0.15 c heuristics/rens/nodesofs = 2000
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.15 c heuristics/rootsoldiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.10/0.15 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.15 c heuristics/rounding/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/shifting/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.15 c heuristics/simplerounding/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.15 c heuristics/trivial/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.15 c heuristics/trysol/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/veclendiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.15 c heuristics/veclendiving/maxlpiterquot = 0.075
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/veclendiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.15 c heuristics/zirounding/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.15 c separating/cmir/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.15 c separating/flowcover/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.15 c separating/rapidlearning/freq = 0
0.10/0.15 c
0.10/0.15 c -----------------------------------------------------------------------------------------------
0.10/0.15 c start solving
0.10/0.15 c
0.10/0.17 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.10/0.17 c 0.1s| 1 | 0 | 86 | - |3551k| 0 | 37 | 231 |2564 | 231 |2564 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.55 c 0.4s| 1 | 0 | 103 | - |3914k| 0 | 41 | 231 |2690 | 231 |2576 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.76 c 0.6s| 1 | 0 | 127 | - |4525k| 0 | 47 | 231 |2690 | 231 |2580 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
1.00/1.10 c 0.9s| 1 | 0 | 209 | - |4578k| 0 | 52 | 231 |2690 | 231 |2587 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
1.49/1.54 c 1.4s| 1 | 0 | 218 | - |4580k| 0 | 54 | 231 |2690 | 231 |2589 | 25 | 0 | 0 | 0.000000e+00 | -- | Inf
1.89/1.99 c 1.8s| 1 | 0 | 222 | - |4581k| 0 | 55 | 231 |2690 | 231 |2590 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
2.69/2.79 c 2.6s| 1 | 2 | 222 | - |4581k| 0 | 55 | 231 |2690 | 231 |2590 | 26 | 0 | 10 | 0.000000e+00 | -- | Inf
21.49/21.51 c *21.1s| 36 | 0 | 2494 | 64.9 |4736k| 14 | - | 231 |2693 | 231 |2578 | 26 | 3 | 586 | 0.000000e+00 | 0.000000e+00 | 0.00%
21.49/21.51 c
21.49/21.51 c SCIP Status : problem is solved [optimal solution found]
21.49/21.51 c Solving Time (sec) : 21.15
21.49/21.51 c Solving Nodes : 36
21.49/21.51 c Primal Bound : +0.00000000000000e+00 (1 solutions)
21.49/21.51 c Dual Bound : +0.00000000000000e+00
21.49/21.51 c Gap : 0.00 %
21.49/21.51 s SATISFIABLE
21.49/21.51 v -x221 -x211 -x201 -x191 -x181 -x171 -x161 -x151 x141 -x131 -x231 -x210 -x200 -x190 -x180 -x170 x160 -x150 -x140 -x130 -x230 -x220
21.49/21.51 v -x199 x189 -x179 -x169 -x159 -x149 -x139 -x129 -x229 -x219 -x209 -x188 x178 -x168 -x158 -x148 -x138 -x128 -x228 -x218 -x208
21.49/21.51 v -x198 -x177 -x167 -x157 -x147 -x137 x127 -x227 -x217 x207 -x197 -x187 -x166 -x156 -x146 -x136 -x126 x226 -x216 -x206 -x196
21.49/21.51 v -x186 -x176 -x155 -x145 -x135 -x125 -x225 -x215 -x205 x195 -x185 -x175 -x165 -x144 -x134 -x124 -x224 x214 -x204 -x194 -x184 -x174
21.49/21.51 v -x164 -x154 -x133 -x123 -x223 -x213 -x203 -x193 -x183 -x173 -x163 -x153 x143 -x122 -x222 -x212 -x202 -x192 -x182 -x172 x162
21.49/21.51 v -x152 -x142 -x132 -x121 -x120 x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 x106 -x105 -x104
21.49/21.51 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
21.49/21.51 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
21.49/21.51 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
21.49/21.51 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
21.49/21.51 v -x1
21.49/21.51 c SCIP Status : problem is solved [optimal solution found]
21.49/21.51 c Solving Time : 21.15
21.49/21.51 c Original Problem :
21.49/21.51 c Problem name : HOME/instance-2667240-1276281513.opb
21.49/21.51 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
21.49/21.51 c Constraints : 2707 initial, 2707 maximal
21.49/21.51 c Presolved Problem :
21.49/21.51 c Problem name : t_HOME/instance-2667240-1276281513.opb
21.49/21.51 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
21.49/21.51 c Constraints : 2564 initial, 2693 maximal
21.49/21.51 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
21.49/21.51 c trivial : 0.00 0 0 0 0 0 0 0 0
21.49/21.51 c dualfix : 0.00 0 0 0 0 0 0 0 0
21.49/21.51 c boundshift : 0.00 0 0 0 0 0 0 0 0
21.49/21.51 c inttobinary : 0.00 0 0 0 0 0 0 0 0
21.49/21.51 c implics : 0.00 0 0 0 0 0 0 0 0
21.49/21.51 c probing : 0.00 0 0 0 0 0 0 0 0
21.49/21.51 c knapsack : 0.00 0 0 0 0 0 0 0 0
21.49/21.51 c setppc : 0.00 0 0 0 0 0 0 0 0
21.49/21.51 c linear : 0.04 0 0 0 0 0 143 0 0
21.49/21.51 c logicor : 0.02 0 0 0 0 0 0 0 0
21.49/21.51 c root node : - 0 - - 0 - - - -
21.49/21.51 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
21.49/21.51 c integral : 0 0 0 82 0 4 155 0 0 52
21.49/21.51 c knapsack : 1 5 153 0 0 0 36 2 0 0
21.49/21.51 c setppc : 22 5 153 0 0 1 334 0 0 0
21.49/21.51 c linear : 0+ 5 151 0 0 0 3 3 0 0
21.49/21.51 c logicor : 2541+ 5 140 1 0 0 400 0 0 0
21.49/21.51 c countsols : 0 0 0 1 0 0 0 0 0 0
21.49/21.51 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
21.49/21.51 c integral : 18.32 0.00 0.00 18.32 0.00
21.49/21.51 c knapsack : 0.00 0.00 0.00 0.00 0.00
21.49/21.51 c setppc : 0.00 0.00 0.00 0.00 0.00
21.49/21.51 c linear : 0.00 0.00 0.00 0.00 0.00
21.49/21.51 c logicor : 0.00 0.00 0.00 0.00 0.00
21.49/21.51 c countsols : 0.00 0.00 0.00 0.00 0.00
21.49/21.51 c Propagators : Time Calls Cutoffs DomReds
21.49/21.51 c vbounds : 0.00 1 0 0
21.49/21.51 c rootredcost : 0.00 0 0 0
21.49/21.51 c pseudoobj : 0.00 0 0 0
21.49/21.51 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
21.49/21.51 c propagation : 0.00 1 1 4 30.0 0 0.0 -
21.49/21.51 c infeasible LP : 0.01 4 2 11 33.9 0 0.0 0
21.49/21.51 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
21.49/21.51 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
21.49/21.51 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
21.49/21.51 c applied globally : - - - 3 18.0 - - -
21.49/21.51 c applied locally : - - - 0 0.0 - - -
21.49/21.51 c Separators : Time Calls Cutoffs DomReds Cuts Conss
21.49/21.51 c cut pool : 0.00 4 - - 66 - (maximal pool size: 346)
21.49/21.51 c redcost : 0.00 40 0 0 0 0
21.49/21.51 c impliedbounds : 0.00 5 0 0 0 0
21.49/21.51 c intobj : 0.00 0 0 0 0 0
21.49/21.51 c cgmip : 0.00 0 0 0 0 0
21.49/21.51 c gomory : 0.82 5 0 0 1275 0
21.49/21.51 c strongcg : 0.64 5 0 0 1306 0
21.49/21.51 c cmir : 0.00 0 0 0 0 0
21.49/21.51 c flowcover : 0.00 0 0 0 0 0
21.49/21.51 c clique : 0.00 5 0 0 0 0
21.49/21.51 c zerohalf : 0.00 0 0 0 0 0
21.49/21.51 c mcf : 0.00 1 0 0 0 0
21.49/21.51 c rapidlearning : 0.21 1 0 0 0 126
21.49/21.51 c Pricers : Time Calls Vars
21.49/21.51 c problem variables: 0.00 0 0
21.49/21.51 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
21.49/21.51 c relpscost : 18.32 81 4 155 0 0 52
21.49/21.51 c pscost : 0.00 0 0 0 0 0 0
21.49/21.51 c inference : 0.00 0 0 0 0 0 0
21.49/21.51 c mostinf : 0.00 0 0 0 0 0 0
21.49/21.51 c leastinf : 0.00 0 0 0 0 0 0
21.49/21.51 c fullstrong : 0.00 0 0 0 0 0 0
21.49/21.51 c allfullstrong : 0.00 0 0 0 0 0 0
21.49/21.51 c random : 0.00 0 0 0 0 0 0
21.49/21.51 c Primal Heuristics : Time Calls Found
21.49/21.51 c LP solutions : 0.00 - 1
21.49/21.51 c pseudo solutions : 0.00 - 0
21.49/21.51 c trivial : 0.00 1 0
21.49/21.51 c simplerounding : 0.00 0 0
21.49/21.51 c zirounding : 0.00 0 0
21.49/21.51 c rounding : 0.00 0 0
21.49/21.51 c shifting : 0.00 0 0
21.49/21.51 c intshifting : 0.00 0 0
21.49/21.51 c oneopt : 0.00 0 0
21.49/21.51 c twoopt : 0.00 0 0
21.49/21.51 c fixandinfer : 0.00 0 0
21.49/21.51 c feaspump : 0.00 0 0
21.49/21.51 c coefdiving : 0.00 0 0
21.49/21.51 c pscostdiving : 0.00 0 0
21.49/21.51 c fracdiving : 0.00 0 0
21.49/21.51 c veclendiving : 0.00 0 0
21.49/21.51 c intdiving : 0.00 0 0
21.49/21.51 c actconsdiving : 0.00 0 0
21.49/21.51 c objpscostdiving : 0.00 0 0
21.49/21.51 c rootsoldiving : 0.00 0 0
21.49/21.51 c linesearchdiving : 0.00 0 0
21.49/21.51 c guideddiving : 0.00 0 0
21.49/21.51 c octane : 0.00 0 0
21.49/21.51 c rens : 0.00 0 0
21.49/21.51 c rins : 0.00 0 0
21.49/21.51 c localbranching : 0.00 0 0
21.49/21.51 c mutation : 0.00 0 0
21.49/21.51 c crossover : 0.00 0 0
21.49/21.51 c dins : 0.00 0 0
21.49/21.51 c undercover : 0.00 0 0
21.49/21.51 c nlp : 0.00 0 0
21.49/21.51 c trysol : 0.00 0 0
21.49/21.51 c LP : Time Calls Iterations Iter/call Iter/sec
21.49/21.51 c primal LP : 0.00 0 0 0.00 -
21.49/21.51 c dual LP : 1.00 90 2494 27.71 2494.00
21.49/21.51 c lex dual LP : 0.00 0 0 0.00 -
21.49/21.51 c barrier LP : 0.00 0 0 0.00 -
21.49/21.51 c diving/probing LP: 0.00 0 0 0.00 -
21.49/21.51 c strong branching : 18.32 586 46537 79.41 2540.23
21.49/21.51 c (at root node) : - 10 1916 191.60 -
21.49/21.51 c conflict analysis: 0.00 0 0 0.00 -
21.49/21.51 c B&B Tree :
21.49/21.51 c number of runs : 1
21.49/21.51 c nodes : 36
21.49/21.51 c nodes (total) : 36
21.49/21.51 c nodes left : 0
21.49/21.51 c max depth : 14
21.49/21.51 c max depth (total): 14
21.49/21.51 c backtracks : 2 (5.6%)
21.49/21.51 c delayed cutoffs : 0
21.49/21.51 c repropagations : 0 (0 domain reductions, 0 cutoffs)
21.49/21.51 c avg switch length: 2.11
21.49/21.51 c switching time : 0.00
21.49/21.51 c Solution :
21.49/21.51 c Solutions found : 1 (1 improvements)
21.49/21.51 c First Solution : +0.00000000000000e+00 (in run 1, after 36 nodes, 21.15 seconds, depth 10, found by <relaxation>)
21.49/21.51 c Primal Bound : +0.00000000000000e+00 (in run 1, after 36 nodes, 21.15 seconds, depth 10, found by <relaxation>)
21.49/21.51 c Dual Bound : +0.00000000000000e+00
21.49/21.51 c Gap : 0.00 %
21.49/21.51 c Root Dual Bound : +0.00000000000000e+00
21.49/21.51 c Root Iterations : 222
21.49/21.52 c Time complete: 21.51.