0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2665921-1276321847.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.03 c heuristics/fracdiving/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/fracdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <guideddiving> (-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/guideddiving/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/guideddiving/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/guideddiving/maxlpiterofs = 1500
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/intdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <intshifting> (-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/intshifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-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/linesearchdiving/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/linesearchdiving/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/linesearchdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/nlp/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-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/objpscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03 c # [type: real, range: [0,1], default: 0.01]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
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/objpscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/oneopt/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <pscostdiving> (-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/pscostdiving/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/pscostdiving/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/pscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/rens/freq = -1
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixable
0.00/0.03 c # [type: real, range: [0,1], default: 0.5]
0.00/0.03 c heuristics/rens/minfixingrate = 0.3
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/rens/nodesofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-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/rootsoldiving/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.01]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
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/rootsoldiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/rounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <shifting> (-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/shifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/simplerounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/trivial/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/trysol/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <veclendiving> (-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/veclendiving/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/veclendiving/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/veclendiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/zirounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/cmir/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/flowcover/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 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 | 70 | - |1001k| 0 | 60 | 252 | 206 | 252 | 206 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.11 c 0.1s| 1 | 0 | 112 | - |1191k| 0 | 58 | 252 | 206 | 252 | 214 | 8 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.14 c 0.1s| 1 | 0 | 166 | - |1301k| 0 | 55 | 252 | 206 | 252 | 221 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.18 c 0.1s| 1 | 0 | 242 | - |1539k| 0 | 61 | 252 | 206 | 252 | 227 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 370 | - |1724k| 0 | 64 | 252 | 206 | 252 | 234 | 28 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 506 | - |1993k| 0 | 79 | 252 | 206 | 252 | 244 | 38 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.35 c 0.3s| 1 | 2 | 506 | - |1993k| 0 | 79 | 252 | 206 | 252 | 244 | 38 | 0 | 26 | 0.000000e+00 | -- | Inf
1.39/1.42 c * 1.2s| 61 | 0 | 1176 | 11.2 |2087k| 22 | - | 252 | 217 | 252 | 221 | 38 | 11 | 703 | 0.000000e+00 | 0.000000e+00 | 0.00%
1.39/1.42 c
1.39/1.42 c SCIP Status : problem is solved [optimal solution found]
1.39/1.42 c Solving Time (sec) : 1.25
1.39/1.42 c Solving Nodes : 61
1.39/1.42 c Primal Bound : +0.00000000000000e+00 (1 solutions)
1.39/1.42 c Dual Bound : +0.00000000000000e+00
1.39/1.42 c Gap : 0.00 %
1.39/1.42 s SATISFIABLE
1.39/1.42 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
1.39/1.42 v -x166 -x158 -x70 -x65 -x62 -x59 -x164 -x147 -x80 -x126 -x119 -x32 x146 -x116 -x34 -x114 -x117 x61 -x123 -x33 -x63 -x121 -x120
1.39/1.42 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.39/1.42 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.39/1.42 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.39/1.42 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.39/1.42 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.39/1.42 v -x248 -x247 -x168 -x72 -x156 -x48 -x124 -x100 -x104 -x140 -x139 -x138 -x137 -x136 -x134 -x133 -x132 -x131 -x130 -x129 -x128
1.39/1.42 v -x127 -x180 -x179 -x178 -x177 -x176 -x175 -x142 -x240 -x239 -x238 -x237 x236 -x235 -x54 -x228 -x227 x226 -x225 -x224 -x223
1.39/1.42 v -x150 -x204 -x203 x202 -x201 -x200 -x199 -x160 -x216 -x215 -x214 -x213 -x212 -x211 -x64 -x23 -x192 x191 -x190 -x189 -x188 -x187
1.39/1.42 v -x60 -x234 -x233 -x232 -x231 -x230 x229 -x81 x222 -x221 -x220 -x219 -x218 -x217 x135 x198 -x197 -x196 -x195 -x194 -x193 -x19
1.39/1.42 c SCIP Status : problem is solved [optimal solution found]
1.39/1.42 c Solving Time : 1.25
1.39/1.42 c Original Problem :
1.39/1.42 c Problem name : HOME/instance-2665921-1276321847.opb
1.39/1.42 c Variables : 252 (252 binary, 0 integer, 0 implicit integer, 0 continuous)
1.39/1.42 c Constraints : 206 initial, 206 maximal
1.39/1.42 c Presolved Problem :
1.39/1.42 c Problem name : t_HOME/instance-2665921-1276321847.opb
1.39/1.42 c Variables : 252 (252 binary, 0 integer, 0 implicit integer, 0 continuous)
1.39/1.42 c Constraints : 206 initial, 217 maximal
1.39/1.42 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.39/1.42 c trivial : 0.00 0 0 0 0 0 0 0 0
1.39/1.42 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.39/1.42 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.39/1.42 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.39/1.42 c implics : 0.00 0 0 0 0 0 0 0 0
1.39/1.42 c probing : 0.00 0 0 0 0 0 0 0 0
1.39/1.42 c setppc : 0.00 0 0 0 0 0 0 0 0
1.39/1.42 c logicor : 0.01 0 0 0 0 0 0 0 0
1.39/1.42 c root node : - 0 - - 0 - - - -
1.39/1.42 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.39/1.42 c integral : 0 0 0 81 0 6 60 0 0 92
1.39/1.42 c setppc : 26 5 149 1 0 0 423 0 0 0
1.39/1.42 c logicor : 180+ 5 64 1 0 0 9 0 0 0
1.39/1.42 c countsols : 0 0 0 1 0 0 0 0 0 0
1.39/1.42 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.39/1.42 c integral : 0.96 0.00 0.00 0.96 0.00
1.39/1.42 c setppc : 0.00 0.00 0.00 0.00 0.00
1.39/1.42 c logicor : 0.00 0.00 0.00 0.00 0.00
1.39/1.42 c countsols : 0.00 0.00 0.00 0.00 0.00
1.39/1.42 c Propagators : Time Calls Cutoffs DomReds
1.39/1.42 c vbounds : 0.00 1 0 0
1.39/1.42 c rootredcost : 0.00 0 0 0
1.39/1.42 c pseudoobj : 0.00 0 0 0
1.39/1.42 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.39/1.42 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.39/1.42 c infeasible LP : 0.00 8 5 42 28.2 0 0.0 0
1.39/1.42 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.39/1.42 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.39/1.42 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.39/1.42 c applied globally : - - - 11 17.5 - - -
1.39/1.42 c applied locally : - - - 0 0.0 - - -
1.39/1.42 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.39/1.42 c cut pool : 0.00 4 - - 1 - (maximal pool size: 326)
1.39/1.42 c redcost : 0.00 60 0 0 0 0
1.39/1.42 c impliedbounds : 0.00 5 0 0 0 0
1.39/1.42 c intobj : 0.00 0 0 0 0 0
1.39/1.42 c cgmip : 0.00 0 0 0 0 0
1.39/1.42 c gomory : 0.05 5 0 0 711 0
1.39/1.42 c strongcg : 0.09 5 0 0 805 0
1.39/1.42 c cmir : 0.00 0 0 0 0 0
1.39/1.43 c flowcover : 0.00 0 0 0 0 0
1.39/1.43 c clique : 0.00 5 0 0 0 0
1.39/1.43 c zerohalf : 0.00 0 0 0 0 0
1.39/1.43 c mcf : 0.00 1 0 0 0 0
1.39/1.43 c rapidlearning : 0.02 1 0 0 0 0
1.39/1.43 c Pricers : Time Calls Vars
1.39/1.43 c problem variables: 0.00 0 0
1.39/1.43 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.39/1.43 c relpscost : 0.96 80 6 60 0 0 92
1.39/1.43 c pscost : 0.00 0 0 0 0 0 0
1.39/1.43 c inference : 0.00 0 0 0 0 0 0
1.39/1.43 c mostinf : 0.00 0 0 0 0 0 0
1.39/1.43 c leastinf : 0.00 0 0 0 0 0 0
1.39/1.43 c fullstrong : 0.00 0 0 0 0 0 0
1.39/1.43 c allfullstrong : 0.00 0 0 0 0 0 0
1.39/1.43 c random : 0.00 0 0 0 0 0 0
1.39/1.43 c Primal Heuristics : Time Calls Found
1.39/1.43 c LP solutions : 0.00 - 1
1.39/1.43 c pseudo solutions : 0.00 - 0
1.39/1.43 c trivial : 0.00 1 0
1.39/1.43 c simplerounding : 0.00 0 0
1.39/1.43 c zirounding : 0.00 0 0
1.39/1.43 c rounding : 0.00 0 0
1.39/1.43 c shifting : 0.00 0 0
1.39/1.43 c intshifting : 0.00 0 0
1.39/1.43 c oneopt : 0.00 0 0
1.39/1.43 c twoopt : 0.00 0 0
1.39/1.43 c fixandinfer : 0.00 0 0
1.39/1.43 c feaspump : 0.00 0 0
1.39/1.43 c coefdiving : 0.00 0 0
1.39/1.43 c pscostdiving : 0.00 0 0
1.39/1.43 c fracdiving : 0.00 0 0
1.39/1.43 c veclendiving : 0.00 0 0
1.39/1.43 c intdiving : 0.00 0 0
1.39/1.43 c actconsdiving : 0.00 0 0
1.39/1.43 c objpscostdiving : 0.00 0 0
1.39/1.43 c rootsoldiving : 0.00 0 0
1.39/1.43 c linesearchdiving : 0.00 0 0
1.39/1.43 c guideddiving : 0.00 0 0
1.39/1.43 c octane : 0.00 0 0
1.39/1.43 c rens : 0.00 0 0
1.39/1.43 c rins : 0.00 0 0
1.39/1.43 c localbranching : 0.00 0 0
1.39/1.43 c mutation : 0.00 0 0
1.39/1.43 c crossover : 0.00 0 0
1.39/1.43 c dins : 0.00 0 0
1.39/1.43 c undercover : 0.00 0 0
1.39/1.43 c nlp : 0.00 0 0
1.39/1.43 c trysol : 0.00 0 0
1.39/1.43 c LP : Time Calls Iterations Iter/call Iter/sec
1.39/1.43 c primal LP : 0.00 0 0 0.00 -
1.39/1.43 c dual LP : 0.10 94 1176 12.51 11760.00
1.39/1.43 c lex dual LP : 0.00 0 0 0.00 -
1.39/1.43 c barrier LP : 0.00 0 0 0.00 -
1.39/1.43 c diving/probing LP: 0.00 0 0 0.00 -
1.39/1.43 c strong branching : 0.95 703 12851 18.28 13527.37
1.39/1.43 c (at root node) : - 26 1154 44.38 -
1.39/1.43 c conflict analysis: 0.00 0 0 0.00 -
1.39/1.43 c B&B Tree :
1.39/1.43 c number of runs : 1
1.39/1.43 c nodes : 61
1.39/1.43 c nodes (total) : 61
1.39/1.43 c nodes left : 0
1.39/1.43 c max depth : 22
1.39/1.43 c max depth (total): 22
1.39/1.43 c backtracks : 4 (6.6%)
1.39/1.43 c delayed cutoffs : 0
1.39/1.43 c repropagations : 8 (5 domain reductions, 0 cutoffs)
1.39/1.43 c avg switch length: 2.43
1.39/1.43 c switching time : 0.00
1.39/1.43 c Solution :
1.39/1.43 c Solutions found : 1 (1 improvements)
1.39/1.43 c First Solution : +0.00000000000000e+00 (in run 1, after 61 nodes, 1.25 seconds, depth 22, found by <relaxation>)
1.39/1.43 c Primal Bound : +0.00000000000000e+00 (in run 1, after 61 nodes, 1.25 seconds, depth 22, found by <relaxation>)
1.39/1.43 c Dual Bound : +0.00000000000000e+00
1.39/1.43 c Gap : 0.00 %
1.39/1.43 c Root Dual Bound : +0.00000000000000e+00
1.39/1.43 c Root Iterations : 506
1.39/1.44 c Time complete: 1.43.