0.00/0.01 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.01 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01 c
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c reading problem <HOME/instance-2667351-1276321850.opb>
0.00/0.01 c original problem has 252 variables (252 bin, 0 int, 0 impl, 0 cont) and 206 constraints
0.00/0.01 c problem read
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.03 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 206 upgd conss, 0 impls, 26 clqs
0.00/0.03 c presolving (2 rounds):
0.00/0.03 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 0 implications, 26 cliques
0.00/0.03 c presolved problem has 252 variables (252 bin, 0 int, 0 impl, 0 cont) and 206 constraints
0.00/0.03 c 26 constraints of type <setppc>
0.00/0.03 c 180 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1799.99
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c limits/solutions = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03 c separating/maxrounds = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/maxroundsroot = 5
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03 c constraints/knapsack/disaggregation = FALSE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c presolving/probing/maxrounds = 0
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/coefdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03 c heuristics/crossover/freq = -1
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/crossover/nodesofs = 750
0.00/0.03 c
0.00/0.03 c # number of nodes without incumbent change that heuristic should wait
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03 c heuristics/crossover/nwaitingnodes = 100
0.00/0.03 c
0.00/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03 c # [type: real, range: [0,1], default: 0.1]
0.00/0.03 c heuristics/crossover/nodesquot = 0.15
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixed
0.00/0.03 c # [type: real, range: [0,1], default: 0.666]
0.00/0.03 c heuristics/crossover/minfixingrate = 0.5
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/feaspump/freq = -1
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/fracdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/guideddiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/intshifting/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/linesearchdiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/nlp/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.04 c heuristics/objpscostdiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.04 c # [type: real, range: [0,1], default: 0.01]
0.00/0.04 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/oneopt/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/pscostdiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c heuristics/rens/freq = -1
0.00/0.04 c
0.00/0.04 c # minimum percentage of integer variables that have to be fixable
0.00/0.04 c # [type: real, range: [0,1], default: 0.5]
0.00/0.04 c heuristics/rens/minfixingrate = 0.3
0.00/0.04 c
0.00/0.04 c # number of nodes added to the contingent of the total nodes
0.00/0.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.04 c heuristics/rens/nodesofs = 2000
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.04 c heuristics/rootsoldiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.04 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/rounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/shifting/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/simplerounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c heuristics/trivial/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/trysol/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/veclendiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/zirounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c separating/cmir/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c separating/flowcover/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 c
0.00/0.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.04 c 0.0s| 1 | 0 | 74 | - |1001k| 0 | 50 | 252 | 206 | 252 | 206 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.12 c 0.1s| 1 | 0 | 98 | - |1255k| 0 | 54 | 252 | 206 | 252 | 212 | 6 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 127 | - |1293k| 0 | 51 | 252 | 206 | 252 | 216 | 10 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.20 c 0.1s| 1 | 0 | 149 | - |1318k| 0 | 55 | 252 | 206 | 252 | 218 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 172 | - |1374k| 0 | 57 | 252 | 206 | 252 | 220 | 14 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.30 c 0.2s| 1 | 0 | 249 | - |1445k| 0 | 52 | 252 | 206 | 252 | 223 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.38 c 0.3s| 1 | 2 | 249 | - |1446k| 0 | 52 | 252 | 206 | 252 | 223 | 17 | 0 | 12 | 0.000000e+00 | -- | Inf
1.59/1.68 c * 1.6s| 81 | 0 | 1090 | 10.5 |1547k| 29 | - | 252 | 210 | 252 | 217 | 17 | 4 | 741 | 0.000000e+00 | 0.000000e+00 | 0.00%
1.59/1.68 c
1.59/1.68 c SCIP Status : problem is solved [optimal solution found]
1.59/1.68 c Solving Time (sec) : 1.57
1.59/1.68 c Solving Nodes : 81
1.59/1.68 c Primal Bound : +0.00000000000000e+00 (1 solutions)
1.59/1.68 c Dual Bound : +0.00000000000000e+00
1.59/1.68 c Gap : 0.00 %
1.59/1.68 s SATISFIABLE
1.59/1.68 v -x157 -x155 x1 -x8 -x7 -x78 -x77 -x82 x152 x73 -x161 -x149 x162 -x6 -x5 -x79 -x163 -x14 -x153 -x167 -x10 -x141 -x41 -x31 -x30 -x166
1.59/1.68 v -x158 -x70 x65 -x62 -x59 -x164 -x147 -x80 -x126 -x119 -x32 -x146 -x116 x34 -x114 -x117 -x61 -x123 -x33 -x63 -x121 -x120
1.59/1.68 v -x165 -x37 -x36 -x66 -x38 -x2 -x27 -x26 -x25 -x24 -x22 -x20 -x17 -x16 -x40 -x35 -x28 -x125 -x12 -x68 -x29 -x69 -x74 -x145 -x71
1.59/1.68 v -x11 -x154 -x98 -x97 -x96 x95 -x94 -x93 -x92 -x91 -x89 -x88 -x87 -x86 -x75 -x85 x122 -x42 -x151 -x90 -x57 -x113 -x115 -x83
1.59/1.68 v -x143 -x186 -x185 -x184 -x183 x182 -x181 -x3 -x58 -x67 -x84 -x144 -x4 -x174 -x173 -x172 x171 -x170 -x169 -x15 -x159 -x112 -x111
1.59/1.68 v -x110 -x109 -x108 -x107 -x106 x105 -x103 -x102 -x101 -x99 -x118 -x18 -x148 -x9 -x39 -x76 -x56 x55 -x53 -x52 -x51 -x49 -x47
1.59/1.68 v -x46 -x45 -x44 -x43 -x210 -x209 -x208 -x207 -x206 x205 -x21 -x50 -x246 -x245 -x244 -x243 x242 -x241 -x13 -x252 -x251 -x250 -x249
1.59/1.68 v -x248 -x247 -x168 -x72 -x156 -x48 -x124 -x100 -x104 -x140 -x139 -x138 -x137 -x136 -x134 -x133 -x132 -x131 -x130 -x129 x128
1.59/1.68 v -x127 -x180 x179 -x178 -x177 -x176 -x175 -x142 -x240 -x239 -x238 x237 -x236 -x235 -x54 -x228 -x227 -x226 -x225 -x224 x223
1.59/1.68 v -x150 -x204 -x203 x202 -x201 -x200 -x199 -x160 -x216 -x215 x214 -x213 -x212 -x211 -x64 -x23 -x192 -x191 -x190 -x189 -x188 -x187
1.59/1.68 v -x60 -x234 x233 -x232 -x231 -x230 -x229 -x81 x222 -x221 -x220 -x219 -x218 -x217 -x135 x198 -x197 -x196 -x195 -x194 -x193 x19
1.59/1.68 c SCIP Status : problem is solved [optimal solution found]
1.59/1.68 c Solving Time : 1.57
1.59/1.68 c Original Problem :
1.59/1.68 c Problem name : HOME/instance-2667351-1276321850.opb
1.59/1.68 c Variables : 252 (252 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.68 c Constraints : 206 initial, 206 maximal
1.59/1.68 c Presolved Problem :
1.59/1.68 c Problem name : t_HOME/instance-2667351-1276321850.opb
1.59/1.68 c Variables : 252 (252 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.68 c Constraints : 206 initial, 210 maximal
1.59/1.68 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.59/1.68 c trivial : 0.00 0 0 0 0 0 0 0 0
1.59/1.68 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.59/1.68 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.59/1.68 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.59/1.68 c implics : 0.00 0 0 0 0 0 0 0 0
1.59/1.68 c probing : 0.00 0 0 0 0 0 0 0 0
1.59/1.68 c setppc : 0.00 0 0 0 0 0 0 0 0
1.59/1.68 c logicor : 0.01 0 0 0 0 0 0 0 0
1.59/1.68 c root node : - 0 - - 0 - - - -
1.59/1.68 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.59/1.68 c integral : 0 0 0 142 0 22 85 0 0 110
1.59/1.68 c setppc : 26 5 206 1 0 0 508 0 0 0
1.59/1.68 c logicor : 180+ 5 82 1 0 0 4 0 0 0
1.59/1.68 c countsols : 0 0 0 1 0 0 0 0 0 0
1.59/1.68 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.59/1.68 c integral : 1.24 0.00 0.00 1.24 0.00
1.59/1.68 c setppc : 0.00 0.00 0.00 0.00 0.00
1.59/1.68 c logicor : 0.00 0.00 0.00 0.00 0.00
1.59/1.68 c countsols : 0.00 0.00 0.00 0.00 0.00
1.59/1.68 c Propagators : Time Calls Cutoffs DomReds
1.59/1.68 c vbounds : 0.00 1 0 0
1.59/1.68 c rootredcost : 0.00 0 0 0
1.59/1.68 c pseudoobj : 0.00 0 0 0
1.59/1.68 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.59/1.68 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.59/1.68 c infeasible LP : 0.00 3 3 31 22.0 0 0.0 0
1.59/1.68 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.68 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.68 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.59/1.68 c applied globally : - - - 4 17.8 - - -
1.59/1.68 c applied locally : - - - 0 0.0 - - -
1.59/1.68 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.59/1.68 c cut pool : 0.00 4 - - 3 - (maximal pool size: 106)
1.59/1.68 c redcost : 0.00 83 0 0 0 0
1.59/1.68 c impliedbounds : 0.00 5 0 0 0 0
1.59/1.68 c intobj : 0.00 0 0 0 0 0
1.59/1.68 c cgmip : 0.00 0 0 0 0 0
1.59/1.68 c gomory : 0.10 5 0 0 285 0
1.59/1.68 c strongcg : 0.09 5 0 0 377 0
1.59/1.68 c cmir : 0.00 0 0 0 0 0
1.59/1.68 c flowcover : 0.00 0 0 0 0 0
1.59/1.68 c clique : 0.00 5 0 0 0 0
1.59/1.68 c zerohalf : 0.00 0 0 0 0 0
1.59/1.68 c mcf : 0.00 1 0 0 0 0
1.59/1.68 c rapidlearning : 0.02 1 0 0 0 0
1.59/1.68 c Pricers : Time Calls Vars
1.59/1.68 c problem variables: 0.00 0 0
1.59/1.68 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.59/1.68 c relpscost : 1.24 141 22 85 0 0 110
1.59/1.68 c pscost : 0.00 0 0 0 0 0 0
1.59/1.68 c inference : 0.00 0 0 0 0 0 0
1.59/1.68 c mostinf : 0.00 0 0 0 0 0 0
1.59/1.68 c leastinf : 0.00 0 0 0 0 0 0
1.59/1.68 c fullstrong : 0.00 0 0 0 0 0 0
1.59/1.68 c allfullstrong : 0.00 0 0 0 0 0 0
1.59/1.68 c random : 0.00 0 0 0 0 0 0
1.59/1.68 c Primal Heuristics : Time Calls Found
1.59/1.68 c LP solutions : 0.00 - 1
1.59/1.68 c pseudo solutions : 0.00 - 0
1.59/1.68 c trivial : 0.00 1 0
1.59/1.68 c simplerounding : 0.00 0 0
1.59/1.68 c zirounding : 0.00 0 0
1.59/1.68 c rounding : 0.00 0 0
1.59/1.68 c shifting : 0.00 0 0
1.59/1.68 c intshifting : 0.00 0 0
1.59/1.68 c oneopt : 0.00 0 0
1.59/1.68 c twoopt : 0.00 0 0
1.59/1.68 c fixandinfer : 0.00 0 0
1.59/1.68 c feaspump : 0.00 0 0
1.59/1.68 c coefdiving : 0.00 0 0
1.59/1.68 c pscostdiving : 0.00 0 0
1.59/1.68 c fracdiving : 0.00 0 0
1.59/1.68 c veclendiving : 0.00 0 0
1.59/1.68 c intdiving : 0.00 0 0
1.59/1.68 c actconsdiving : 0.00 0 0
1.59/1.68 c objpscostdiving : 0.00 0 0
1.59/1.68 c rootsoldiving : 0.00 0 0
1.59/1.68 c linesearchdiving : 0.00 0 0
1.59/1.68 c guideddiving : 0.00 0 0
1.59/1.68 c octane : 0.00 0 0
1.59/1.68 c rens : 0.00 0 0
1.59/1.68 c rins : 0.00 0 0
1.59/1.68 c localbranching : 0.00 0 0
1.59/1.68 c mutation : 0.00 0 0
1.59/1.68 c crossover : 0.00 0 0
1.59/1.68 c dins : 0.00 0 0
1.59/1.68 c undercover : 0.00 0 0
1.59/1.68 c nlp : 0.00 0 0
1.59/1.68 c trysol : 0.00 0 0
1.59/1.68 c LP : Time Calls Iterations Iter/call Iter/sec
1.59/1.68 c primal LP : 0.00 0 0 0.00 -
1.59/1.68 c dual LP : 0.10 150 1090 7.27 10900.00
1.59/1.68 c lex dual LP : 0.00 0 0 0.00 -
1.59/1.68 c barrier LP : 0.00 0 0 0.00 -
1.59/1.68 c diving/probing LP: 0.00 0 0 0.00 -
1.59/1.68 c strong branching : 1.23 741 13168 17.77 10705.69
1.59/1.68 c (at root node) : - 12 822 68.50 -
1.59/1.68 c conflict analysis: 0.00 0 0 0.00 -
1.59/1.68 c B&B Tree :
1.59/1.68 c number of runs : 1
1.59/1.68 c nodes : 81
1.59/1.68 c nodes (total) : 81
1.59/1.68 c nodes left : 0
1.59/1.68 c max depth : 29
1.59/1.68 c max depth (total): 29
1.59/1.68 c backtracks : 4 (4.9%)
1.59/1.68 c delayed cutoffs : 0
1.59/1.68 c repropagations : 2 (2 domain reductions, 0 cutoffs)
1.59/1.68 c avg switch length: 2.27
1.59/1.68 c switching time : 0.01
1.59/1.68 c Solution :
1.59/1.68 c Solutions found : 1 (1 improvements)
1.59/1.68 c First Solution : +0.00000000000000e+00 (in run 1, after 81 nodes, 1.57 seconds, depth 20, found by <relaxation>)
1.59/1.68 c Primal Bound : +0.00000000000000e+00 (in run 1, after 81 nodes, 1.57 seconds, depth 20, found by <relaxation>)
1.59/1.68 c Dual Bound : +0.00000000000000e+00
1.59/1.68 c Gap : 0.00 %
1.59/1.68 c Root Dual Bound : +0.00000000000000e+00
1.59/1.68 c Root Iterations : 249
1.59/1.68 c Time complete: 1.67.