0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2667219-1276278504.opb>
0.00/0.01 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 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.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.03 c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.03 c presolving (3 rounds):
0.00/0.03 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 8 implications, 68 cliques
0.00/0.03 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.03 c 1 constraints of type <knapsack>
0.00/0.03 c 68 constraints of type <setppc>
0.00/0.03 c 4 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.00
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 = 1800
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.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 | 104 | - | 743k| 0 | 42 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 131 | - |1161k| 0 | 53 | 169 | 210 | 169 | 87 | 14 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 183 | - |1265k| 0 | 56 | 169 | 210 | 169 | 94 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 0 | 207 | - |1299k| 0 | 57 | 169 | 210 | 169 | 102 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 259 | - |1316k| 0 | 60 | 169 | 210 | 169 | 107 | 34 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 266 | - |1317k| 0 | 60 | 169 | 210 | 169 | 110 | 37 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.53 c 0.5s| 1 | 0 | 286 | - |1316k| 0 | 57 | 169 | 209 | 169 | 110 | 37 | 0 | 11 | 0.000000e+00 | -- | Inf
0.69/0.73 c 0.7s| 1 | 0 | 290 | - |1293k| 0 | 59 | 169 | 186 | 169 | 110 | 37 | 0 | 23 | 0.000000e+00 | -- | Inf
0.89/0.93 c 0.9s| 1 | 0 | 309 | - |1284k| 0 | 60 | 169 | 178 | 169 | 110 | 37 | 0 | 35 | 0.000000e+00 | -- | Inf
0.99/1.07 c 1.0s| 1 | 0 | 355 | - |1281k| 0 | 56 | 169 | 175 | 169 | 110 | 37 | 0 | 43 | 0.000000e+00 | -- | Inf
1.19/1.22 c 1.1s| 1 | 0 | 380 | - |1272k| 0 | 54 | 169 | 168 | 169 | 110 | 37 | 0 | 52 | 0.000000e+00 | -- | Inf
1.29/1.34 c 1.2s| 1 | 0 | 394 | - |1256k| 0 | 55 | 169 | 154 | 169 | 102 | 37 | 0 | 60 | 0.000000e+00 | -- | Inf
1.49/1.52 c 1.4s| 1 | 0 | 404 | - |1254k| 0 | 55 | 169 | 152 | 169 | 102 | 37 | 0 | 73 | 0.000000e+00 | -- | Inf
1.49/1.59 c 1.5s| 1 | 0 | 404 | - |1254k| 0 | - | 169 | 152 | 169 | 102 | 37 | 0 | 78 | 0.000000e+00 | -- | Inf
1.49/1.59 c (run 1, node 1) restarting after 34 global fixings of integer variables
1.49/1.59 c
1.49/1.59 c (restart) converted 29 cuts from the global cut pool into linear constraints
1.49/1.59 c
1.49/1.59 c presolving:
1.49/1.59 c (round 1) 34 del vars, 18 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 16 impls, 86 clqs
1.59/1.60 c (round 2) 34 del vars, 20 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 92 upgd conss, 16 impls, 86 clqs
1.59/1.61 c presolving (3 rounds):
1.59/1.61 c 34 deleted vars, 20 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.59/1.61 c 16 implications, 86 cliques
1.59/1.61 c presolved problem has 135 variables (135 bin, 0 int, 0 impl, 0 cont) and 161 constraints
1.59/1.61 c 8 constraints of type <knapsack>
1.59/1.61 c 88 constraints of type <setppc>
1.59/1.61 c 65 constraints of type <logicor>
1.59/1.61 c transformed objective value is always integral (scale: 1)
1.59/1.61 c Presolving Time: 0.02
1.59/1.61 c
1.59/1.61 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.59/1.61 c 1.5s| 1 | 0 | 496 | - | 908k| 0 | 45 | 135 | 161 | 135 | 100 | 0 | 0 | 78 | 0.000000e+00 | -- | Inf
1.59/1.64 c 1.5s| 1 | 0 | 517 | - |1138k| 0 | 49 | 135 | 161 | 135 | 110 | 10 | 0 | 78 | 0.000000e+00 | -- | Inf
1.69/1.79 c 1.7s| 1 | 0 | 526 | - |1137k| 0 | 51 | 135 | 161 | 135 | 110 | 10 | 0 | 98 | 0.000000e+00 | -- | Inf
1.89/1.95 c 1.9s| 1 | 0 | 543 | - |1137k| 0 | 49 | 135 | 160 | 135 | 110 | 10 | 0 | 113 | 0.000000e+00 | -- | Inf
1.99/2.04 c 1.9s| 1 | 0 | 552 | - |1136k| 0 | 47 | 135 | 158 | 135 | 110 | 10 | 0 | 120 | 0.000000e+00 | -- | Inf
2.10/2.16 c 2.0s| 1 | 0 | 566 | - |1136k| 0 | 49 | 135 | 158 | 135 | 110 | 10 | 0 | 133 | 0.000000e+00 | -- | Inf
2.29/2.32 c 2.2s| 1 | 0 | 575 | - |1136k| 0 | 51 | 135 | 156 | 135 | 110 | 10 | 0 | 148 | 0.000000e+00 | -- | Inf
2.39/2.40 c 2.3s| 1 | 0 | 584 | - |1134k| 0 | 51 | 135 | 151 | 135 | 110 | 10 | 0 | 154 | 0.000000e+00 | -- | Inf
2.39/2.47 c 2.4s| 1 | 0 | 584 | - |1134k| 0 | - | 135 | 151 | 135 | 110 | 10 | 0 | 159 | 0.000000e+00 | -- | Inf
2.39/2.47 c (run 2, node 1) restarting after 28 global fixings of integer variables
2.39/2.47 c
2.39/2.47 c (restart) converted 10 cuts from the global cut pool into linear constraints
2.39/2.47 c
2.39/2.47 c presolving:
2.39/2.48 c (round 1) 28 del vars, 26 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 10 upgd conss, 26 impls, 83 clqs
2.39/2.48 c (round 2) 28 del vars, 27 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 10 upgd conss, 26 impls, 83 clqs
2.39/2.48 c presolving (3 rounds):
2.39/2.48 c 28 deleted vars, 27 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.39/2.48 c 26 implications, 83 cliques
2.39/2.48 c presolved problem has 107 variables (107 bin, 0 int, 0 impl, 0 cont) and 134 constraints
2.39/2.48 c 15 constraints of type <knapsack>
2.39/2.48 c 84 constraints of type <setppc>
2.39/2.48 c 35 constraints of type <logicor>
2.39/2.48 c transformed objective value is always integral (scale: 1)
2.39/2.48 c Presolving Time: 0.03
2.39/2.48 c
2.39/2.49 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.39/2.49 c 2.4s| 1 | 0 | 676 | - | 920k| 0 | 49 | 107 | 134 | 107 | 102 | 0 | 0 | 159 | 0.000000e+00 | -- | Inf
2.49/2.51 c 2.4s| 1 | 0 | 695 | - |1129k| 0 | 53 | 107 | 134 | 107 | 110 | 8 | 0 | 159 | 0.000000e+00 | -- | Inf
2.59/2.66 c 2.5s| 1 | 2 | 695 | - |1129k| 0 | 53 | 107 | 134 | 107 | 110 | 8 | 0 | 177 | 0.000000e+00 | -- | Inf
2.79/2.82 c * 2.7s| 2 | 0 | 848 | 153.0 |1155k| 1 | - | 107 | 134 | 107 | 79 | 8 | 0 | 244 | 0.000000e+00 | 0.000000e+00 | 0.00%
2.79/2.82 c
2.79/2.82 c SCIP Status : problem is solved [optimal solution found]
2.79/2.82 c Solving Time (sec) : 2.69
2.79/2.82 c Solving Nodes : 2 (total of 4 nodes in 3 runs)
2.79/2.82 c Primal Bound : +0.00000000000000e+00 (1 solutions)
2.79/2.82 c Dual Bound : +0.00000000000000e+00
2.79/2.82 c Gap : 0.00 %
2.79/2.83 s SATISFIABLE
2.79/2.83 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 x152 -x151 -x150 -x149 -x148
2.79/2.83 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
2.79/2.83 v -x126 x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
2.79/2.83 v -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 x84 -x83 -x82
2.79/2.83 v -x81 -x80 -x79 x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 x62 -x61 -x60 -x59 -x58 -x57 -x56
2.79/2.83 v -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31
2.79/2.83 v -x30 x29 -x28 -x27 -x26 x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5
2.79/2.83 v -x4 -x3 x2 -x1
2.79/2.83 c SCIP Status : problem is solved [optimal solution found]
2.79/2.83 c Solving Time : 2.69
2.79/2.83 c Original Problem :
2.79/2.83 c Problem name : HOME/instance-2667219-1276278504.opb
2.79/2.83 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
2.79/2.83 c Constraints : 101 initial, 101 maximal
2.79/2.83 c Presolved Problem :
2.79/2.83 c Problem name : t_HOME/instance-2667219-1276278504.opb
2.79/2.83 c Variables : 107 (107 binary, 0 integer, 0 implicit integer, 0 continuous)
2.79/2.83 c Constraints : 134 initial, 134 maximal
2.79/2.83 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.79/2.83 c trivial : 0.00 62 0 0 0 0 0 0 0
2.79/2.83 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.79/2.83 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.79/2.83 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.79/2.83 c implics : 0.00 0 0 0 0 0 0 0 0
2.79/2.83 c probing : 0.00 0 0 0 0 0 0 0 0
2.79/2.83 c knapsack : 0.01 0 0 0 0 0 0 0 0
2.79/2.83 c setppc : 0.02 0 0 0 0 0 5 0 0
2.79/2.83 c linear : 0.00 0 0 0 0 0 44 0 0
2.79/2.83 c logicor : 0.00 0 0 0 0 0 26 0 0
2.79/2.83 c root node : - 62 - - 62 - - - -
2.79/2.83 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.79/2.83 c integral : 0 0 0 25 0 0 99 0 0 2
2.79/2.83 c knapsack : 15 7 27 1 0 0 2 0 0 0
2.79/2.83 c setppc : 84 7 27 1 0 0 31 0 0 0
2.79/2.83 c logicor : 35 7 16 1 0 0 0 0 0 0
2.79/2.83 c countsols : 0 0 0 1 0 0 0 0 0 0
2.79/2.83 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.79/2.83 c integral : 2.27 0.00 0.00 2.27 0.00
2.79/2.83 c knapsack : 0.00 0.00 0.00 0.00 0.00
2.79/2.83 c setppc : 0.00 0.00 0.00 0.00 0.00
2.79/2.83 c logicor : 0.00 0.00 0.00 0.00 0.00
2.79/2.83 c countsols : 0.00 0.00 0.00 0.00 0.00
2.79/2.83 c Propagators : Time Calls Cutoffs DomReds
2.79/2.83 c vbounds : 0.00 3 0 0
2.79/2.83 c rootredcost : 0.00 0 0 0
2.79/2.83 c pseudoobj : 0.00 0 0 0
2.79/2.83 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.79/2.83 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.79/2.83 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.79/2.83 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.79/2.83 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.79/2.83 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.79/2.83 c applied globally : - - - 0 0.0 - - -
2.79/2.83 c applied locally : - - - 0 0.0 - - -
2.79/2.83 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.79/2.83 c cut pool : 0.00 0 - - 0 - (maximal pool size: 84)
2.79/2.83 c redcost : 0.00 8 0 0 0 0
2.79/2.83 c impliedbounds : 0.00 7 0 0 0 0
2.79/2.83 c intobj : 0.00 0 0 0 0 0
2.79/2.83 c cgmip : 0.00 0 0 0 0 0
2.79/2.83 c gomory : 0.05 7 0 0 4 0
2.79/2.83 c strongcg : 0.03 7 0 0 250 0
2.79/2.83 c cmir : 0.00 0 0 0 0 0
2.79/2.83 c flowcover : 0.00 0 0 0 0 0
2.79/2.83 c clique : 0.02 7 0 0 34 0
2.79/2.83 c zerohalf : 0.00 0 0 0 0 0
2.79/2.83 c mcf : 0.00 3 0 0 0 0
2.79/2.83 c rapidlearning : 0.16 1 0 0 0 137
2.79/2.83 c Pricers : Time Calls Vars
2.79/2.83 c problem variables: 0.00 0 0
2.79/2.83 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.79/2.83 c relpscost : 2.27 24 0 99 0 0 2
2.79/2.83 c pscost : 0.00 0 0 0 0 0 0
2.79/2.83 c inference : 0.00 0 0 0 0 0 0
2.79/2.83 c mostinf : 0.00 0 0 0 0 0 0
2.79/2.83 c leastinf : 0.00 0 0 0 0 0 0
2.79/2.83 c fullstrong : 0.00 0 0 0 0 0 0
2.79/2.83 c allfullstrong : 0.00 0 0 0 0 0 0
2.79/2.83 c random : 0.00 0 0 0 0 0 0
2.79/2.83 c Primal Heuristics : Time Calls Found
2.79/2.83 c LP solutions : 0.00 - 1
2.79/2.83 c pseudo solutions : 0.00 - 0
2.79/2.83 c trivial : 0.00 1 0
2.79/2.83 c simplerounding : 0.00 0 0
2.79/2.83 c zirounding : 0.00 0 0
2.79/2.83 c rounding : 0.00 0 0
2.79/2.83 c shifting : 0.00 0 0
2.79/2.83 c intshifting : 0.00 0 0
2.79/2.83 c oneopt : 0.00 0 0
2.79/2.83 c twoopt : 0.00 0 0
2.79/2.83 c fixandinfer : 0.00 0 0
2.79/2.83 c feaspump : 0.00 0 0
2.79/2.83 c coefdiving : 0.00 0 0
2.79/2.83 c pscostdiving : 0.00 0 0
2.79/2.83 c fracdiving : 0.00 0 0
2.79/2.83 c veclendiving : 0.00 0 0
2.79/2.83 c intdiving : 0.00 0 0
2.79/2.83 c actconsdiving : 0.00 0 0
2.79/2.83 c objpscostdiving : 0.00 0 0
2.79/2.83 c rootsoldiving : 0.00 0 0
2.79/2.83 c linesearchdiving : 0.00 0 0
2.79/2.83 c guideddiving : 0.00 0 0
2.79/2.83 c octane : 0.00 0 0
2.79/2.83 c rens : 0.00 0 0
2.79/2.83 c rins : 0.00 0 0
2.79/2.83 c localbranching : 0.00 0 0
2.79/2.83 c mutation : 0.00 0 0
2.79/2.83 c crossover : 0.00 0 0
2.79/2.83 c dins : 0.00 0 0
2.79/2.83 c undercover : 0.00 0 0
2.79/2.83 c nlp : 0.00 0 0
2.79/2.83 c trysol : 0.00 0 0
2.79/2.83 c LP : Time Calls Iterations Iter/call Iter/sec
2.79/2.83 c primal LP : 0.00 0 0 0.00 -
2.79/2.83 c dual LP : 0.07 32 848 26.50 12114.29
2.79/2.83 c lex dual LP : 0.00 0 0 0.00 -
2.79/2.83 c barrier LP : 0.00 0 0 0.00 -
2.79/2.83 c diving/probing LP: 0.00 0 0 0.00 -
2.79/2.83 c strong branching : 2.27 244 25575 104.82 11266.52
2.79/2.83 c (at root node) : - 177 23014 130.02 -
2.79/2.83 c conflict analysis: 0.00 0 0 0.00 -
2.79/2.83 c B&B Tree :
2.79/2.83 c number of runs : 3
2.79/2.83 c nodes : 2
2.79/2.83 c nodes (total) : 4
2.79/2.83 c nodes left : 0
2.79/2.83 c max depth : 1
2.79/2.83 c max depth (total): 1
2.79/2.83 c backtracks : 0 (0.0%)
2.79/2.83 c delayed cutoffs : 0
2.79/2.83 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.79/2.83 c avg switch length: 2.00
2.79/2.83 c switching time : 0.00
2.79/2.83 c Solution :
2.79/2.83 c Solutions found : 1 (1 improvements)
2.79/2.83 c First Solution : +0.00000000000000e+00 (in run 3, after 2 nodes, 2.69 seconds, depth 1, found by <relaxation>)
2.79/2.83 c Primal Bound : +0.00000000000000e+00 (in run 3, after 2 nodes, 2.69 seconds, depth 1, found by <relaxation>)
2.79/2.83 c Dual Bound : +0.00000000000000e+00
2.79/2.83 c Gap : 0.00 %
2.79/2.83 c Root Dual Bound : +0.00000000000000e+00
2.79/2.83 c Root Iterations : 695
2.79/2.83 c Time complete: 2.83.