0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
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-3485857-1307753681.opb>
0.00/0.00 c original problem has 294 variables (294 bin, 0 int, 0 impl, 0 cont) and 238 constraints
0.00/0.00 c problem read
0.00/0.00 c No objective function, only one solution is needed.
0.00/0.00 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 238 upgd conss, 0 impls, 28 clqs
0.00/0.01 c presolving (2 rounds):
0.00/0.01 c 0 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 0 implications, 28 cliques
0.00/0.01 c presolved problem has 294 variables (294 bin, 0 int, 0 impl, 0 cont) and 238 constraints
0.00/0.01 c 28 constraints of type <setppc>
0.00/0.01 c 210 constraints of type <logicor>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.01
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 2.0.1.4
0.00/0.01 c
0.00/0.01 c # frequency for displaying node information lines
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01 c display/freq = 10000
0.00/0.01 c
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = 1797
0.00/0.01 c
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = 13950
0.00/0.01 c
0.00/0.01 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c limits/solutions = 1
0.00/0.01 c
0.00/0.01 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.01 c separating/maxrounds = 1
0.00/0.01 c
0.00/0.01 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/maxroundsroot = 5
0.00/0.01 c
0.00/0.01 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01 c # [type: int, range: [1,2], default: 1]
0.00/0.01 c timing/clocktype = 2
0.00/0.01 c
0.00/0.01 c # belongs reading time to solving time?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c timing/reading = TRUE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify inequalities
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/linear/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/indicator/addCouplingCons = TRUE
0.00/0.01 c
0.00/0.01 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.01 c constraints/knapsack/disaggregation = FALSE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify knapsacks
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c presolving/probing/maxrounds = 0
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/coefdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.01 c heuristics/crossover/freq = -1
0.00/0.01 c
0.00/0.01 c # number of nodes added to the contingent of the total nodes
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01 c heuristics/crossover/nodesofs = 750
0.00/0.01 c
0.00/0.01 c # number of nodes without incumbent change that heuristic should wait
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.01 c heuristics/crossover/nwaitingnodes = 100
0.00/0.01 c
0.00/0.01 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.01 c # [type: real, range: [0,1], default: 0.1]
0.00/0.01 c heuristics/crossover/nodesquot = 0.15
0.00/0.01 c
0.00/0.01 c # minimum percentage of integer variables that have to be fixed
0.00/0.01 c # [type: real, range: [0,1], default: 0.666]
0.00/0.01 c heuristics/crossover/minfixingrate = 0.5
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/feaspump/freq = -1
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/fracdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/guideddiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/intshifting/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/linesearchdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/objpscostdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.01 c # [type: real, range: [0,1], default: 0.01]
0.00/0.01 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/oneopt/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/pscostdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/rens/freq = -1
0.00/0.01 c
0.00/0.01 c # minimum percentage of integer variables that have to be fixable
0.00/0.01 c # [type: real, range: [0,1], default: 0.5]
0.00/0.01 c heuristics/rens/minfixingrate = 0.3
0.00/0.01 c
0.00/0.01 c # number of nodes added to the contingent of the total nodes
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01 c heuristics/rens/nodesofs = 2000
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/rootsoldiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.01 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/rounding/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/shiftandpropagate/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/shifting/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/simplerounding/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/subnlp/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/trivial/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/trysol/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/undercover/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/veclendiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/zirounding/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c separating/cmir/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c separating/flowcover/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/rapidlearning/freq = 0
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.02 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.02 c 0.0s| 1 | 0 | 150 | - |1200k| 0 | 77 | 294 | 238 | 294 | 238 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.02/0.05 c 0.1s| 1 | 0 | 225 | - |1508k| 0 | 73 | 294 | 253 | 294 | 245 | 7 | 0 | 0 | 0.000000e+00 | -- | Inf
0.02/0.08 c 0.1s| 1 | 0 | 358 | - |1848k| 0 | 84 | 294 | 253 | 294 | 255 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
0.10/0.10 c 0.1s| 1 | 0 | 472 | - |2240k| 0 | 75 | 294 | 253 | 294 | 264 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
0.10/0.13 c 0.1s| 1 | 0 | 601 | - |2554k| 0 | 78 | 294 | 253 | 294 | 272 | 34 | 0 | 0 | 0.000000e+00 | -- | Inf
0.10/0.15 c 0.2s| 1 | 0 | 924 | - |2813k| 0 | 75 | 294 | 253 | 294 | 282 | 44 | 0 | 0 | 0.000000e+00 | -- | Inf
0.10/0.18 c 0.2s| 1 | 2 | 924 | - |2814k| 0 | 75 | 294 | 253 | 294 | 282 | 44 | 0 | 16 | 0.000000e+00 | -- | Inf
0.19/0.27 c * 0.3s| 11 | 0 | 1044 | 12.0 |2866k| 10 | - | 294 | 253 | 294 | 250 | 44 | 0 | 152 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.19/0.27 c
0.19/0.27 c SCIP Status : problem is solved [optimal solution found]
0.19/0.27 c Solving Time (sec) : 0.27
0.19/0.27 c Solving Nodes : 11
0.19/0.27 c Primal Bound : +0.00000000000000e+00 (1 solutions)
0.19/0.27 c Dual Bound : +0.00000000000000e+00
0.19/0.27 c Gap : 0.00 %
0.19/0.27 s SATISFIABLE
0.19/0.27 v -x87 -x85 -x50 -x53 -x88 -x97 -x48 -x43 -x11 -x10 -x8 -x7 -x6 -x5 -x2 -x55 -x3 -x54 x84 -x78 -x76 -x72 -x70 -x69 -x60 -x59 x57
0.19/0.27 v -x80 x51 -x64 -x92 -x1 -x71 -x181 -x177 -x175 -x170 -x62 -x58 -x173 -x182 -x172 -x45 -x77 -x94 -x28 -x24 -x22 -x19 -x74 -x9 -x178
0.19/0.27 v -x49 -x61 -x79 -x4 x27 -x46 -x96 -x196 -x195 -x194 -x193 -x192 -x191 -x189 -x188 x186 -x185 -x184 -x183 -x44 -x174 -x26
0.19/0.27 v -x14 -x140 -x139 -x138 -x136 -x135 -x134 -x131 -x130 -x129 -x52 -x25 -x169 -x65 -x111 -x107 -x106 -x105 -x103 -x102 -x100 -x99
0.19/0.27 v -x127 -x17 -x16 -x90 -x73 -x68 -x190 -x86 -x47 -x137 -x23 x12 -x187 -x13 x171 -x83 -x18 x133 -x132 -x112 -x224 -x223 -x222
0.19/0.27 v x221 -x220 -x219 -x218 x95 -x67 -x63 -x56 -x91 -x101 x108 -x109 -x259 -x258 -x257 -x256 -x255 x254 -x253 -x93 -x21 -x20 -x294
0.19/0.27 v -x293 -x292 -x291 -x290 -x289 x288 -x98 -x252 -x251 -x250 x249 -x248 -x247 -x246 -x176 -x179 -x66 -x154 -x153 -x152 -x151 -x150
0.19/0.27 v -x149 -x148 -x147 x146 -x145 -x144 -x142 -x141 -x89 -x42 -x41 -x40 -x39 -x38 -x37 x36 -x35 -x34 -x33 -x32 -x31 -x30 -x231
0.19/0.27 v -x230 -x229 -x228 -x227 x226 -x225 -x75 -x217 -x216 x215 -x214 -x213 -x212 -x211 -x143 -x15 -x126 -x125 -x124 -x123 -x121 -x120
0.19/0.27 v -x118 -x117 -x116 -x115 x114 -x113 -x245 -x244 -x243 -x242 x241 -x240 -x239 -x119 -x203 -x202 -x201 -x200 -x199 -x198 x197
0.19/0.27 v -x29 -x180 -x287 x286 -x285 -x284 -x283 -x282 -x281 -x110 -x238 x237 -x236 -x235 -x234 -x233 -x232 -x104 -x168 -x167 -x166
0.19/0.27 v -x165 -x164 -x163 -x162 -x161 -x160 x159 -x158 -x157 -x156 -x155 -x280 -x279 x278 -x277 -x276 -x275 -x274 -x82 x210 -x209 -x208
0.19/0.27 v -x207 -x206 -x205 -x204 -x128 -x273 -x272 -x271 -x270 x269 -x268 -x267 -x81 x266 -x265 -x264 -x263 -x262 -x261 -x260 -x122
0.19/0.27 c SCIP Status : problem is solved [optimal solution found]
0.19/0.27 c Total Time : 0.27
0.19/0.27 c solving : 0.27
0.19/0.27 c presolving : 0.01 (included in solving)
0.19/0.27 c reading : 0.00 (included in solving)
0.19/0.27 c Original Problem :
0.19/0.27 c Problem name : HOME/instance-3485857-1307753681.opb
0.19/0.27 c Variables : 294 (294 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.27 c Constraints : 238 initial, 238 maximal
0.19/0.27 c Presolved Problem :
0.19/0.27 c Problem name : t_HOME/instance-3485857-1307753681.opb
0.19/0.27 c Variables : 294 (294 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.27 c Constraints : 238 initial, 253 maximal
0.19/0.27 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.19/0.27 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.27 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.27 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.27 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.27 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.27 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.27 c setppc : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.27 c linear : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.27 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.27 c root node : - 0 - - 0 - - - - -
0.19/0.27 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.19/0.27 c integral : 0 0 0 11 0 3 0 0 0 0 0 20
0.19/0.27 c setppc : 28 5 21 1 0 0 0 0 130 0 0 0
0.19/0.27 c linear : 0+ 5 7 0 0 0 0 0 0 0 0 0
0.19/0.27 c logicor : 210 5 11 1 0 0 0 0 0 0 0 0
0.19/0.27 c countsols : 0 0 0 1 0 2 0 0 0 0 0 0
0.19/0.27 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.19/0.27 c integral : 0.11 0.00 0.00 0.11 0.00 0.00 0.00
0.19/0.27 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.27 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.27 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.27 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.27 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.19/0.27 c vbounds : 0 0 0 0
0.19/0.27 c rootredcost : 0 0 0 0
0.19/0.27 c pseudoobj : 0 0 0 0
0.19/0.27 c Propagator Timings : TotalTime Propagate Resprop
0.19/0.27 c vbounds : 0.00 0.00 0.00
0.19/0.27 c rootredcost : 0.00 0.00 0.00
0.19/0.27 c pseudoobj : 0.00 0.00 0.00
0.19/0.27 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.19/0.27 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.19/0.27 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.27 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.27 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.27 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.19/0.27 c applied globally : - - - 0 0.0 - - -
0.19/0.27 c applied locally : - - - 0 0.0 - - -
0.19/0.27 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.19/0.27 c cut pool : 0.00 4 - - 0 - (maximal pool size: 421)
0.19/0.27 c redcost : 0.00 15 0 0 0 0
0.19/0.27 c impliedbounds : 0.00 5 0 0 0 0
0.19/0.27 c intobj : 0.00 0 0 0 0 0
0.19/0.27 c gomory : 0.04 5 0 0 966 0
0.19/0.27 c cgmip : 0.00 0 0 0 0 0
0.19/0.27 c closecuts : 0.00 0 0 0 0 0
0.19/0.27 c strongcg : 0.04 5 0 0 1109 0
0.19/0.27 c cmir : 0.00 0 0 0 0 0
0.19/0.27 c flowcover : 0.00 0 0 0 0 0
0.19/0.27 c clique : 0.00 5 0 0 0 0
0.19/0.27 c zerohalf : 0.00 0 0 0 0 0
0.19/0.27 c mcf : 0.00 1 0 0 0 0
0.19/0.27 c oddcycle : 0.00 0 0 0 0 0
0.19/0.27 c rapidlearning : 0.02 1 0 0 0 15
0.19/0.27 c Pricers : Time Calls Vars
0.19/0.27 c problem variables: 0.00 0 0
0.19/0.27 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.19/0.27 c relpscost : 0.11 10 0 0 0 0 20
0.19/0.27 c pscost : 0.00 0 0 0 0 0 0
0.19/0.27 c inference : 0.00 0 0 0 0 0 0
0.19/0.27 c mostinf : 0.00 0 0 0 0 0 0
0.19/0.27 c leastinf : 0.00 0 0 0 0 0 0
0.19/0.27 c fullstrong : 0.00 0 0 0 0 0 0
0.19/0.27 c allfullstrong : 0.00 0 0 0 0 0 0
0.19/0.27 c random : 0.00 0 0 0 0 0 0
0.19/0.27 c Primal Heuristics : Time Calls Found
0.19/0.27 c LP solutions : 0.00 - 1
0.19/0.27 c pseudo solutions : 0.00 - 0
0.19/0.27 c trivial : 0.00 1 0
0.19/0.27 c shiftandpropagate: 0.00 0 0
0.19/0.27 c simplerounding : 0.00 0 0
0.19/0.27 c zirounding : 0.00 0 0
0.19/0.27 c rounding : 0.00 0 0
0.19/0.27 c shifting : 0.00 0 0
0.19/0.27 c intshifting : 0.00 0 0
0.19/0.27 c oneopt : 0.00 0 0
0.19/0.27 c twoopt : 0.00 0 0
0.19/0.27 c fixandinfer : 0.00 0 0
0.19/0.27 c feaspump : 0.00 0 0
0.19/0.27 c clique : 0.00 0 0
0.19/0.27 c coefdiving : 0.00 0 0
0.19/0.27 c pscostdiving : 0.00 0 0
0.19/0.27 c fracdiving : 0.00 0 0
0.19/0.27 c veclendiving : 0.00 0 0
0.19/0.27 c intdiving : 0.00 0 0
0.19/0.27 c actconsdiving : 0.00 0 0
0.19/0.27 c objpscostdiving : 0.00 0 0
0.19/0.27 c rootsoldiving : 0.00 0 0
0.19/0.27 c linesearchdiving : 0.00 0 0
0.19/0.27 c guideddiving : 0.00 0 0
0.19/0.27 c octane : 0.00 0 0
0.19/0.27 c rens : 0.00 0 0
0.19/0.27 c rins : 0.00 0 0
0.19/0.27 c localbranching : 0.00 0 0
0.19/0.27 c mutation : 0.00 0 0
0.19/0.27 c crossover : 0.00 0 0
0.19/0.27 c dins : 0.00 0 0
0.19/0.27 c vbounds : 0.00 0 0
0.19/0.27 c undercover : 0.00 0 0
0.19/0.27 c subnlp : 0.00 0 0
0.19/0.27 c trysol : 0.00 0 0
0.19/0.27 c LP : Time Calls Iterations Iter/call Iter/sec
0.19/0.27 c primal LP : 0.00 0 0 0.00 -
0.19/0.27 c dual LP : 0.04 16 1044 65.25 28280.42
0.19/0.27 c lex dual LP : 0.00 0 0 0.00 -
0.19/0.27 c barrier LP : 0.00 0 0 0.00 -
0.19/0.27 c diving/probing LP: 0.00 0 0 0.00 -
0.19/0.27 c strong branching : 0.11 152 2856 18.79 26081.95
0.19/0.27 c (at root node) : - 16 602 37.62 -
0.19/0.27 c conflict analysis: 0.00 0 0 0.00 -
0.19/0.27 c B&B Tree :
0.19/0.27 c number of runs : 1
0.19/0.27 c nodes : 11
0.19/0.27 c nodes (total) : 11
0.19/0.27 c nodes left : 0
0.19/0.27 c max depth : 10
0.19/0.27 c max depth (total): 10
0.19/0.27 c backtracks : 0 (0.0%)
0.19/0.27 c delayed cutoffs : 0
0.19/0.27 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.19/0.27 c avg switch length: 2.00
0.19/0.27 c switching time : 0.00
0.19/0.27 c Solution :
0.19/0.27 c Solutions found : 1 (1 improvements)
0.19/0.27 c First Solution : +0.00000000000000e+00 (in run 1, after 11 nodes, 0.27 seconds, depth 10, found by <relaxation>)
0.19/0.27 c Primal Bound : +0.00000000000000e+00 (in run 1, after 11 nodes, 0.27 seconds, depth 10, found by <relaxation>)
0.19/0.27 c Dual Bound : +0.00000000000000e+00
0.19/0.27 c Gap : 0.00 %
0.19/0.27 c Root Dual Bound : +0.00000000000000e+00
0.19/0.27 c Root Iterations : 924
0.19/0.27 c Time complete: 0.27.