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-2666000-1276338582.opb>
0.00/0.02 c original problem has 719 variables (719 bin, 0 int, 0 impl, 0 cont) and 593 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.03 c presolving:
0.00/0.04 c (round 1) 12 del vars, 1 del conss, 1 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6188 impls, 0 clqs
0.00/0.05 c (round 2) 14 del vars, 26 del conss, 3 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6188 impls, 0 clqs
0.00/0.05 c (round 3) 18 del vars, 34 del conss, 7 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6188 impls, 0 clqs
0.00/0.05 c (round 4) 22 del vars, 42 del conss, 11 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6188 impls, 0 clqs
0.00/0.05 c (round 5) 26 del vars, 50 del conss, 15 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6188 impls, 0 clqs
0.00/0.05 c (round 6) 30 del vars, 58 del conss, 19 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6188 impls, 0 clqs
0.05/0.06 c (round 7) 34 del vars, 66 del conss, 23 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6188 impls, 0 clqs
0.05/0.06 c (round 8) 38 del vars, 75 del conss, 27 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6188 impls, 0 clqs
0.05/0.06 c (round 9) 40 del vars, 78 del conss, 29 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6188 impls, 0 clqs
0.05/0.06 c (round 10) 44 del vars, 85 del conss, 33 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6188 impls, 0 clqs
0.05/0.07 c (round 11) 48 del vars, 95 del conss, 37 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6190 impls, 0 clqs
0.05/0.07 c (round 12) 52 del vars, 103 del conss, 41 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6190 impls, 0 clqs
0.05/0.07 c (round 13) 56 del vars, 111 del conss, 45 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6190 impls, 0 clqs
0.05/0.07 c (round 14) 61 del vars, 120 del conss, 49 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6192 impls, 0 clqs
0.05/0.07 c (round 15) 63 del vars, 128 del conss, 51 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6198 impls, 0 clqs
0.05/0.08 c (round 16) 65 del vars, 131 del conss, 53 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6198 impls, 0 clqs
0.05/0.08 c (round 17) 69 del vars, 139 del conss, 57 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6198 impls, 0 clqs
0.05/0.08 c (round 18) 73 del vars, 147 del conss, 61 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6198 impls, 0 clqs
0.05/0.08 c (round 19) 77 del vars, 155 del conss, 65 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6198 impls, 0 clqs
0.05/0.09 c (round 20) 81 del vars, 163 del conss, 69 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6198 impls, 0 clqs
0.05/0.09 c (round 21) 85 del vars, 170 del conss, 73 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6198 impls, 0 clqs
0.05/0.09 c (round 22) 90 del vars, 180 del conss, 77 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6200 impls, 0 clqs
0.05/0.09 c (round 23) 94 del vars, 189 del conss, 81 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6200 impls, 0 clqs
0.05/0.09 c (round 24) 98 del vars, 198 del conss, 85 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6200 impls, 0 clqs
0.09/0.10 c (round 25) 102 del vars, 205 del conss, 89 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6200 impls, 0 clqs
0.09/0.10 c (round 26) 109 del vars, 215 del conss, 95 chg bounds, 123 chg sides, 249 chg coeffs, 0 upgd conss, 6202 impls, 0 clqs
0.09/0.10 c (round 27) 114 del vars, 226 del conss, 99 chg bounds, 130 chg sides, 259 chg coeffs, 0 upgd conss, 6204 impls, 0 clqs
0.09/0.10 c (round 28) 118 del vars, 236 del conss, 103 chg bounds, 130 chg sides, 259 chg coeffs, 0 upgd conss, 6204 impls, 0 clqs
0.09/0.11 c (round 29) 123 del vars, 245 del conss, 107 chg bounds, 130 chg sides, 259 chg coeffs, 0 upgd conss, 6206 impls, 0 clqs
0.09/0.11 c (round 30) 127 del vars, 254 del conss, 111 chg bounds, 130 chg sides, 259 chg coeffs, 0 upgd conss, 6206 impls, 0 clqs
0.09/0.11 c (round 31) 129 del vars, 260 del conss, 113 chg bounds, 130 chg sides, 259 chg coeffs, 0 upgd conss, 6208 impls, 0 clqs
0.09/0.11 c (round 32) 131 del vars, 265 del conss, 115 chg bounds, 130 chg sides, 259 chg coeffs, 0 upgd conss, 6210 impls, 0 clqs
0.09/0.11 c (round 33) 135 del vars, 271 del conss, 119 chg bounds, 130 chg sides, 259 chg coeffs, 0 upgd conss, 6210 impls, 0 clqs
0.09/0.11 c (round 34) 139 del vars, 280 del conss, 123 chg bounds, 130 chg sides, 259 chg coeffs, 0 upgd conss, 6210 impls, 0 clqs
0.09/0.12 c (round 35) 145 del vars, 291 del conss, 129 chg bounds, 133 chg sides, 263 chg coeffs, 0 upgd conss, 6212 impls, 0 clqs
0.09/0.12 c (round 36) 149 del vars, 296 del conss, 133 chg bounds, 136 chg sides, 267 chg coeffs, 0 upgd conss, 6212 impls, 0 clqs
0.09/0.12 c (round 37) 153 del vars, 303 del conss, 137 chg bounds, 137 chg sides, 269 chg coeffs, 0 upgd conss, 6212 impls, 0 clqs
0.09/0.12 c (round 38) 158 del vars, 311 del conss, 142 chg bounds, 137 chg sides, 270 chg coeffs, 0 upgd conss, 6212 impls, 0 clqs
0.09/0.13 c (round 39) 162 del vars, 318 del conss, 146 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6212 impls, 0 clqs
0.09/0.13 c (round 40) 163 del vars, 325 del conss, 147 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6214 impls, 0 clqs
0.09/0.13 c (round 41) 165 del vars, 328 del conss, 149 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6214 impls, 0 clqs
0.09/0.13 c (round 42) 169 del vars, 334 del conss, 153 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6214 impls, 0 clqs
0.09/0.13 c (round 43) 173 del vars, 342 del conss, 157 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6214 impls, 0 clqs
0.09/0.13 c (round 44) 177 del vars, 350 del conss, 161 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6214 impls, 0 clqs
0.09/0.14 c (round 45) 183 del vars, 361 del conss, 167 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6216 impls, 0 clqs
0.09/0.14 c (round 46) 187 del vars, 373 del conss, 171 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6220 impls, 0 clqs
0.09/0.14 c (round 47) 197 del vars, 392 del conss, 181 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6222 impls, 0 clqs
0.09/0.14 c (round 48) 214 del vars, 423 del conss, 198 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6226 impls, 0 clqs
0.09/0.14 c (round 49) 221 del vars, 443 del conss, 205 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6226 impls, 0 clqs
0.09/0.14 c (round 50) 221 del vars, 448 del conss, 205 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6226 impls, 0 clqs
0.09/0.15 c (round 51) 221 del vars, 489 del conss, 205 chg bounds, 138 chg sides, 271 chg coeffs, 63 upgd conss, 6226 impls, 0 clqs
0.09/0.16 c (round 52) 455 del vars, 519 del conss, 205 chg bounds, 138 chg sides, 271 chg coeffs, 63 upgd conss, 6336 impls, 0 clqs
0.09/0.16 c (round 53) 513 del vars, 522 del conss, 205 chg bounds, 145 chg sides, 361 chg coeffs, 63 upgd conss, 6336 impls, 0 clqs
0.09/0.16 c (round 54) 513 del vars, 522 del conss, 205 chg bounds, 148 chg sides, 367 chg coeffs, 63 upgd conss, 6336 impls, 0 clqs
0.09/0.17 c presolving (55 rounds):
0.09/0.17 c 513 deleted vars, 522 deleted constraints, 205 tightened bounds, 0 added holes, 148 changed sides, 367 changed coefficients
0.09/0.17 c 6336 implications, 0 cliques
0.09/0.17 c presolved problem has 206 variables (206 bin, 0 int, 0 impl, 0 cont) and 71 constraints
0.09/0.17 c 49 constraints of type <knapsack>
0.09/0.17 c 8 constraints of type <linear>
0.09/0.17 c 14 constraints of type <logicor>
0.09/0.17 c transformed objective value is always integral (scale: 1)
0.09/0.17 c Presolving Time: 0.07
0.09/0.17 c - non default parameters ----------------------------------------------------------------------
0.09/0.17 c # SCIP version 1.2.1.2
0.09/0.17 c
0.09/0.17 c # frequency for displaying node information lines
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.17 c display/freq = 10000
0.09/0.17 c
0.09/0.17 c # maximal time in seconds to run
0.09/0.17 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.17 c limits/time = 1799.99
0.09/0.17 c
0.09/0.17 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.17 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.17 c limits/memory = 1620
0.09/0.17 c
0.09/0.17 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.17 c limits/solutions = 1
0.09/0.17 c
0.09/0.17 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.17 c separating/maxrounds = 1
0.09/0.17 c
0.09/0.17 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.17 c separating/maxroundsroot = 5
0.09/0.17 c
0.09/0.17 c # should presolving try to simplify inequalities
0.09/0.17 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.17 c constraints/linear/simplifyinequalities = TRUE
0.09/0.17 c
0.09/0.17 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.17 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.17 c constraints/knapsack/disaggregation = FALSE
0.09/0.17 c
0.09/0.17 c # should presolving try to simplify knapsacks
0.09/0.17 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.17 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.17 c
0.09/0.17 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.17 c presolving/probing/maxrounds = 0
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.17 c heuristics/coefdiving/freq = -1
0.09/0.17 c
0.09/0.17 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.17 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.17 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.17 c
0.09/0.17 c # additional number of allowed LP iterations
0.09/0.17 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.17 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.17 c heuristics/crossover/freq = -1
0.09/0.17 c
0.09/0.17 c # number of nodes added to the contingent of the total nodes
0.09/0.17 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.17 c heuristics/crossover/nodesofs = 750
0.09/0.17 c
0.09/0.17 c # number of nodes without incumbent change that heuristic should wait
0.09/0.17 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.17 c heuristics/crossover/nwaitingnodes = 100
0.09/0.17 c
0.09/0.17 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.17 c # [type: real, range: [0,1], default: 0.1]
0.09/0.17 c heuristics/crossover/nodesquot = 0.15
0.09/0.17 c
0.09/0.17 c # minimum percentage of integer variables that have to be fixed
0.09/0.17 c # [type: real, range: [0,1], default: 0.666]
0.09/0.17 c heuristics/crossover/minfixingrate = 0.5
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.17 c heuristics/feaspump/freq = -1
0.09/0.17 c
0.09/0.17 c # additional number of allowed LP iterations
0.09/0.17 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.17 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.17 c heuristics/fracdiving/freq = -1
0.09/0.17 c
0.09/0.17 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.17 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.17 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.17 c
0.09/0.17 c # additional number of allowed LP iterations
0.09/0.17 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.17 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.17 c heuristics/guideddiving/freq = -1
0.09/0.17 c
0.09/0.17 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.17 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.17 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.17 c
0.09/0.17 c # additional number of allowed LP iterations
0.09/0.17 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.17 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.17 c
0.09/0.17 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.17 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.17 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.17 c heuristics/intshifting/freq = -1
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.17 c heuristics/linesearchdiving/freq = -1
0.09/0.17 c
0.09/0.17 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.17 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.17 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.17 c
0.09/0.17 c # additional number of allowed LP iterations
0.09/0.17 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.17 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.17 c heuristics/nlp/freq = -1
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.17 c heuristics/objpscostdiving/freq = -1
0.09/0.17 c
0.09/0.17 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.17 c # [type: real, range: [0,1], default: 0.01]
0.09/0.17 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.17 c
0.09/0.17 c # additional number of allowed LP iterations
0.09/0.17 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.17 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.17 c heuristics/oneopt/freq = -1
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.17 c heuristics/pscostdiving/freq = -1
0.09/0.17 c
0.09/0.17 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.17 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.17 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.17 c
0.09/0.17 c # additional number of allowed LP iterations
0.09/0.17 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.17 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.17 c heuristics/rens/freq = -1
0.09/0.17 c
0.09/0.17 c # minimum percentage of integer variables that have to be fixable
0.09/0.17 c # [type: real, range: [0,1], default: 0.5]
0.09/0.17 c heuristics/rens/minfixingrate = 0.3
0.09/0.17 c
0.09/0.17 c # number of nodes added to the contingent of the total nodes
0.09/0.17 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.17 c heuristics/rens/nodesofs = 2000
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.17 c heuristics/rootsoldiving/freq = -1
0.09/0.17 c
0.09/0.17 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.17 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.17 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.17 c
0.09/0.17 c # additional number of allowed LP iterations
0.09/0.17 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.17 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.17 c heuristics/rounding/freq = -1
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.17 c heuristics/shifting/freq = -1
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.17 c heuristics/simplerounding/freq = -1
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.17 c heuristics/trivial/freq = -1
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.17 c heuristics/trysol/freq = -1
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.17 c heuristics/veclendiving/freq = -1
0.09/0.17 c
0.09/0.17 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.17 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.17 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.17 c
0.09/0.17 c # additional number of allowed LP iterations
0.09/0.17 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.17 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.17 c heuristics/zirounding/freq = -1
0.09/0.17 c
0.09/0.17 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.17 c separating/cmir/freq = -1
0.09/0.17 c
0.09/0.17 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.17 c separating/flowcover/freq = -1
0.09/0.17 c
0.09/0.17 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.17 c separating/rapidlearning/freq = 0
0.09/0.17 c
0.09/0.17 c -----------------------------------------------------------------------------------------------
0.09/0.17 c start solving
0.09/0.17 c
0.09/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.09/0.17 c 0.1s| 1 | 0 | 30 | - |1910k| 0 | 23 | 206 | 71 | 206 | 71 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 0 | 53 | - |2101k| 0 | 36 | 206 | 226 | 206 | 83 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 0 | 67 | - |2108k| 0 | 44 | 206 | 226 | 206 | 94 | 34 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.30 c 0.2s| 1 | 0 | 80 | - |2114k| 0 | 54 | 206 | 226 | 206 | 103 | 43 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.30 c 0.2s| 1 | 0 | 106 | - |2131k| 0 | 50 | 206 | 226 | 206 | 115 | 55 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.31 c 0.2s| 1 | 0 | 125 | - |2141k| 0 | 64 | 206 | 226 | 206 | 128 | 68 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.34 c 0.2s| 1 | 0 | 130 | - |2140k| 0 | 64 | 206 | 224 | 206 | 128 | 68 | 0 | 16 | 0.000000e+00 | -- | Inf
0.29/0.36 c 0.2s| 1 | 2 | 130 | - |2141k| 0 | 64 | 206 | 224 | 206 | 128 | 68 | 0 | 31 | 0.000000e+00 | -- | Inf
0.49/0.51 c
0.49/0.51 c SCIP Status : problem is solved [infeasible]
0.49/0.51 c Solving Time (sec) : 0.38
0.49/0.51 c Solving Nodes : 17
0.49/0.51 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.49/0.51 c Dual Bound : +1.00000000000000e+20
0.49/0.51 c Gap : 0.00 %
0.49/0.51 s UNSATISFIABLE
0.49/0.51 c SCIP Status : problem is solved [infeasible]
0.49/0.51 c Solving Time : 0.38
0.49/0.51 c Original Problem :
0.49/0.51 c Problem name : HOME/instance-2666000-1276338582.opb
0.49/0.51 c Variables : 719 (719 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.51 c Constraints : 593 initial, 593 maximal
0.49/0.51 c Presolved Problem :
0.49/0.51 c Problem name : t_HOME/instance-2666000-1276338582.opb
0.49/0.51 c Variables : 206 (206 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.51 c Constraints : 71 initial, 230 maximal
0.49/0.51 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.49/0.51 c trivial : 0.01 0 0 0 0 0 0 0 0
0.49/0.51 c dualfix : 0.01 58 0 0 0 0 0 0 0
0.49/0.51 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.49/0.51 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.49/0.51 c implics : 0.00 0 16 0 0 0 0 0 0
0.49/0.51 c probing : 0.00 0 0 0 0 0 0 0 0
0.49/0.51 c knapsack : 0.01 0 0 0 0 0 0 10 96
0.49/0.51 c linear : 0.03 205 234 0 205 0 522 138 271
0.49/0.51 c logicor : 0.00 0 0 0 0 0 0 0 0
0.49/0.51 c root node : - 13 - - 13 - - - -
0.49/0.51 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.49/0.51 c integral : 0 0 0 16 0 7 1 0 0 16
0.49/0.51 c knapsack : 49 6 29 0 0 1 30 223 0 0
0.49/0.51 c linear : 8+ 6 28 0 0 0 69 4 0 0
0.49/0.51 c logicor : 14 6 5 0 0 1 3 0 0 0
0.49/0.51 c countsols : 0 0 0 0 0 0 0 0 0 0
0.49/0.51 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.49/0.51 c integral : 0.17 0.00 0.00 0.17 0.00
0.49/0.51 c knapsack : 0.02 0.01 0.01 0.00 0.00
0.49/0.51 c linear : 0.00 0.00 0.00 0.00 0.00
0.49/0.51 c logicor : 0.00 0.00 0.00 0.00 0.00
0.49/0.51 c countsols : 0.00 0.00 0.00 0.00 0.00
0.49/0.51 c Propagators : Time Calls Cutoffs DomReds
0.49/0.51 c vbounds : 0.00 1 0 0
0.49/0.51 c rootredcost : 0.00 0 0 0
0.49/0.51 c pseudoobj : 0.00 0 0 0
0.49/0.51 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.49/0.51 c propagation : 0.00 2 0 0 0.0 0 0.0 -
0.49/0.51 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.51 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.51 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.51 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.51 c applied globally : - - - 0 0.0 - - -
0.49/0.51 c applied locally : - - - 0 0.0 - - -
0.49/0.51 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.49/0.51 c cut pool : 0.00 4 - - 2 - (maximal pool size: 32)
0.49/0.51 c redcost : 0.00 19 0 0 0 0
0.49/0.51 c impliedbounds : 0.00 5 0 0 2 0
0.49/0.51 c intobj : 0.00 0 0 0 0 0
0.49/0.51 c cgmip : 0.00 0 0 0 0 0
0.49/0.51 c gomory : 0.00 5 0 0 29 0
0.49/0.51 c strongcg : 0.00 5 0 0 18 0
0.49/0.51 c cmir : 0.00 0 0 0 0 0
0.49/0.51 c flowcover : 0.00 0 0 0 0 0
0.49/0.51 c clique : 0.00 1 0 0 0 0
0.49/0.51 c zerohalf : 0.00 0 0 0 0 0
0.49/0.51 c mcf : 0.00 1 0 0 0 0
0.49/0.51 c rapidlearning : 0.08 1 0 3 0 159
0.49/0.51 c Pricers : Time Calls Vars
0.49/0.51 c problem variables: 0.00 0 0
0.49/0.51 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.49/0.51 c relpscost : 0.17 16 7 1 0 0 16
0.49/0.51 c pscost : 0.00 0 0 0 0 0 0
0.49/0.51 c inference : 0.00 0 0 0 0 0 0
0.49/0.51 c mostinf : 0.00 0 0 0 0 0 0
0.49/0.51 c leastinf : 0.00 0 0 0 0 0 0
0.49/0.51 c fullstrong : 0.00 0 0 0 0 0 0
0.49/0.51 c allfullstrong : 0.00 0 0 0 0 0 0
0.49/0.51 c random : 0.00 0 0 0 0 0 0
0.49/0.51 c Primal Heuristics : Time Calls Found
0.49/0.51 c LP solutions : 0.00 - 0
0.49/0.51 c pseudo solutions : 0.00 - 0
0.49/0.51 c trivial : 0.00 1 0
0.49/0.51 c simplerounding : 0.00 0 0
0.49/0.51 c zirounding : 0.00 0 0
0.49/0.51 c rounding : 0.00 0 0
0.49/0.51 c shifting : 0.00 0 0
0.49/0.51 c intshifting : 0.00 0 0
0.49/0.51 c oneopt : 0.00 0 0
0.49/0.51 c twoopt : 0.00 0 0
0.49/0.51 c fixandinfer : 0.00 0 0
0.49/0.51 c feaspump : 0.00 0 0
0.49/0.51 c coefdiving : 0.00 0 0
0.49/0.51 c pscostdiving : 0.00 0 0
0.49/0.51 c fracdiving : 0.00 0 0
0.49/0.51 c veclendiving : 0.00 0 0
0.49/0.51 c intdiving : 0.00 0 0
0.49/0.51 c actconsdiving : 0.00 0 0
0.49/0.51 c objpscostdiving : 0.00 0 0
0.49/0.51 c rootsoldiving : 0.00 0 0
0.49/0.51 c linesearchdiving : 0.00 0 0
0.49/0.51 c guideddiving : 0.00 0 0
0.49/0.51 c octane : 0.00 0 0
0.49/0.51 c rens : 0.00 0 0
0.49/0.51 c rins : 0.00 0 0
0.49/0.51 c localbranching : 0.00 0 0
0.49/0.51 c mutation : 0.00 0 0
0.49/0.51 c crossover : 0.00 0 0
0.49/0.51 c dins : 0.00 0 0
0.49/0.51 c undercover : 0.00 0 0
0.49/0.51 c nlp : 0.00 0 0
0.49/0.51 c trysol : 0.00 0 0
0.49/0.51 c LP : Time Calls Iterations Iter/call Iter/sec
0.49/0.51 c primal LP : 0.00 0 0 0.00 -
0.49/0.51 c dual LP : 0.03 22 277 12.59 9233.33
0.49/0.51 c lex dual LP : 0.00 0 0 0.00 -
0.49/0.51 c barrier LP : 0.00 0 0 0.00 -
0.49/0.51 c diving/probing LP: 0.00 0 0 0.00 -
0.49/0.51 c strong branching : 0.17 155 2953 19.05 17370.59
0.49/0.51 c (at root node) : - 31 834 26.90 -
0.49/0.51 c conflict analysis: 0.00 0 0 0.00 -
0.49/0.51 c B&B Tree :
0.49/0.51 c number of runs : 1
0.49/0.51 c nodes : 17
0.49/0.51 c nodes (total) : 17
0.49/0.51 c nodes left : 0
0.49/0.51 c max depth : 8
0.49/0.51 c max depth (total): 8
0.49/0.51 c backtracks : 7 (41.2%)
0.49/0.51 c delayed cutoffs : 0
0.49/0.51 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.49/0.51 c avg switch length: 3.06
0.49/0.51 c switching time : 0.00
0.49/0.51 c Solution :
0.49/0.51 c Solutions found : 0 (0 improvements)
0.49/0.51 c Primal Bound : infeasible
0.49/0.51 c Dual Bound : -
0.49/0.51 c Gap : 0.00 %
0.49/0.51 c Root Dual Bound : +0.00000000000000e+00
0.49/0.51 c Root Iterations : 130
0.49/0.52 c Time complete: 0.52.