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-2667166-1276273940.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.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.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/zirounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c separating/cmir/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c separating/flowcover/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 c
0.00/0.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.04 c 0.0s| 1 | 0 | 120 | - | 743k| 0 | 44 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 144 | - |1182k| 0 | 53 | 169 | 211 | 169 | 83 | 10 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 167 | - |1430k| 0 | 57 | 169 | 211 | 169 | 92 | 19 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 0 | 187 | - |1554k| 0 | 61 | 169 | 211 | 169 | 98 | 25 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 212 | - |1592k| 0 | 65 | 169 | 211 | 169 | 105 | 32 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 251 | - |1620k| 0 | 62 | 169 | 211 | 169 | 108 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.55 c 0.5s| 1 | 0 | 257 | - |1590k| 0 | 63 | 169 | 182 | 169 | 108 | 35 | 0 | 12 | 0.000000e+00 | -- | Inf
0.69/0.78 c 0.7s| 1 | 0 | 268 | - |1581k| 0 | 62 | 169 | 174 | 169 | 108 | 35 | 0 | 24 | 0.000000e+00 | -- | Inf
0.89/0.96 c 0.9s| 1 | 0 | 270 | - |1577k| 0 | 62 | 169 | 170 | 169 | 108 | 35 | 0 | 34 | 0.000000e+00 | -- | Inf
1.10/1.14 c 1.1s| 1 | 0 | 282 | - |1566k| 0 | 64 | 169 | 160 | 169 | 108 | 35 | 0 | 45 | 0.000000e+00 | -- | Inf
1.39/1.40 c 1.3s| 1 | 0 | 290 | - |1560k| 0 | 63 | 169 | 154 | 169 | 108 | 35 | 0 | 58 | 0.000000e+00 | -- | Inf
1.39/1.49 c 1.4s| 1 | 0 | 300 | - |1557k| 0 | 61 | 169 | 150 | 169 | 105 | 35 | 0 | 63 | 0.000000e+00 | -- | Inf
1.49/1.59 c 1.5s| 1 | 0 | 310 | - |1550k| 0 | 61 | 169 | 143 | 169 | 105 | 35 | 0 | 69 | 0.000000e+00 | -- | Inf
1.69/1.74 c 1.6s| 1 | 0 | 320 | - |1548k| 0 | 61 | 169 | 141 | 169 | 105 | 35 | 0 | 79 | 0.000000e+00 | -- | Inf
1.89/1.94 c 1.8s| 1 | 0 | 330 | - |1547k| 0 | 62 | 169 | 140 | 169 | 105 | 35 | 0 | 92 | 0.000000e+00 | -- | Inf
1.99/2.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.99/2.04 c 1.9s| 1 | 0 | 330 | - |1547k| 0 | - | 169 | 140 | 169 | 105 | 35 | 0 | 99 | 0.000000e+00 | -- | Inf
1.99/2.04 c (run 1, node 1) restarting after 37 global fixings of integer variables
1.99/2.04 c
1.99/2.04 c (restart) converted 32 cuts from the global cut pool into linear constraints
1.99/2.04 c
1.99/2.04 c presolving:
1.99/2.05 c (round 1) 37 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 12 impls, 86 clqs
1.99/2.05 c (round 2) 37 del vars, 15 del conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 0 upgd conss, 12 impls, 86 clqs
1.99/2.05 c (round 3) 37 del vars, 15 del conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 86 upgd conss, 12 impls, 86 clqs
1.99/2.06 c (round 4) 37 del vars, 18 del conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 86 upgd conss, 12 impls, 86 clqs
1.99/2.06 c presolving (5 rounds):
1.99/2.06 c 37 deleted vars, 18 deleted constraints, 0 tightened bounds, 0 added holes, 4 changed sides, 0 changed coefficients
1.99/2.06 c 12 implications, 86 cliques
1.99/2.06 c presolved problem has 132 variables (132 bin, 0 int, 0 impl, 0 cont) and 154 constraints
1.99/2.06 c 12 constraints of type <knapsack>
1.99/2.06 c 82 constraints of type <setppc>
1.99/2.06 c 60 constraints of type <logicor>
1.99/2.06 c transformed objective value is always integral (scale: 1)
1.99/2.06 c Presolving Time: 0.03
1.99/2.06 c
1.99/2.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.99/2.07 c 2.0s| 1 | 0 | 422 | - | 936k| 0 | 46 | 132 | 154 | 132 | 97 | 0 | 0 | 99 | 0.000000e+00 | -- | Inf
1.99/2.09 c 2.0s| 1 | 0 | 449 | - |1185k| 0 | 51 | 132 | 154 | 132 | 108 | 11 | 0 | 99 | 0.000000e+00 | -- | Inf
2.29/2.31 c 2.2s| 1 | 0 | 457 | - |1185k| 0 | 52 | 132 | 154 | 132 | 108 | 11 | 0 | 119 | 0.000000e+00 | -- | Inf
2.29/2.38 c 2.3s| 1 | 0 | 462 | - |1185k| 0 | 51 | 132 | 154 | 132 | 108 | 11 | 0 | 125 | 0.000000e+00 | -- | Inf
2.49/2.52 c 2.4s| 1 | 0 | 473 | - |1185k| 0 | 50 | 132 | 154 | 132 | 108 | 11 | 0 | 142 | 0.000000e+00 | -- | Inf
2.59/2.67 c 2.5s| 1 | 0 | 495 | - |1185k| 0 | 51 | 132 | 153 | 132 | 108 | 11 | 0 | 159 | 0.000000e+00 | -- | Inf
2.79/2.81 c 2.7s| 1 | 0 | 501 | - |1185k| 0 | 50 | 132 | 153 | 132 | 108 | 11 | 0 | 172 | 0.000000e+00 | -- | Inf
2.79/2.87 c 2.7s| 1 | 0 | 509 | - |1185k| 0 | 51 | 132 | 153 | 132 | 108 | 11 | 0 | 177 | 0.000000e+00 | -- | Inf
2.89/2.93 c 2.8s| 1 | 0 | 509 | - |1185k| 0 | - | 132 | 153 | 132 | 108 | 11 | 0 | 182 | 0.000000e+00 | -- | Inf
2.89/2.93 c (run 2, node 1) restarting after 27 global fixings of integer variables
2.89/2.93 c
2.89/2.93 c (restart) converted 11 cuts from the global cut pool into linear constraints
2.89/2.93 c
2.89/2.93 c presolving:
2.89/2.94 c (round 1) 27 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 11 upgd conss, 18 impls, 88 clqs
2.89/2.94 c presolving (2 rounds):
2.89/2.94 c 27 deleted vars, 17 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
2.89/2.94 c 18 implications, 88 cliques
2.89/2.94 c presolved problem has 105 variables (105 bin, 0 int, 0 impl, 0 cont) and 147 constraints
2.89/2.94 c 17 constraints of type <knapsack>
2.89/2.94 c 86 constraints of type <setppc>
2.89/2.94 c 44 constraints of type <logicor>
2.89/2.94 c transformed objective value is always integral (scale: 1)
2.89/2.94 c Presolving Time: 0.05
2.89/2.94 c
2.89/2.95 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.89/2.95 c 2.8s| 1 | 0 | 585 | - | 937k| 0 | 45 | 105 | 147 | 105 | 106 | 0 | 0 | 182 | 0.000000e+00 | -- | Inf
2.89/2.97 c 2.8s| 1 | 0 | 602 | - |1178k| 0 | 49 | 105 | 147 | 105 | 116 | 10 | 0 | 182 | 0.000000e+00 | -- | Inf
3.09/3.11 c 3.0s| 1 | 0 | 609 | - |1178k| 0 | 49 | 105 | 147 | 105 | 116 | 10 | 0 | 202 | 0.000000e+00 | -- | Inf
3.20/3.20 c 3.1s| 1 | 2 | 609 | - |1178k| 0 | 49 | 105 | 147 | 105 | 116 | 10 | 0 | 217 | 0.000000e+00 | -- | Inf
3.20/3.24 c * 3.1s| 2 | 0 | 709 | 100.0 |1215k| 1 | - | 105 | 147 | 105 | 84 | 10 | 0 | 234 | 0.000000e+00 | 0.000000e+00 | 0.00%
3.20/3.24 c
3.20/3.24 c SCIP Status : problem is solved [optimal solution found]
3.20/3.24 c Solving Time (sec) : 3.11
3.20/3.24 c Solving Nodes : 2 (total of 4 nodes in 3 runs)
3.20/3.24 c Primal Bound : +0.00000000000000e+00 (1 solutions)
3.20/3.24 c Dual Bound : +0.00000000000000e+00
3.20/3.24 c Gap : 0.00 %
3.20/3.24 s SATISFIABLE
3.20/3.24 v -x169 -x168 -x167 x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 x151 -x150 -x149 -x148
3.20/3.24 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
3.20/3.24 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 x111 -x110 -x109 -x108 -x107 -x106
3.20/3.24 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
3.20/3.24 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
3.20/3.24 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
3.20/3.24 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
3.20/3.24 v -x4 x3 -x2 -x1
3.20/3.24 c SCIP Status : problem is solved [optimal solution found]
3.20/3.24 c Solving Time : 3.11
3.20/3.24 c Original Problem :
3.20/3.24 c Problem name : HOME/instance-2667166-1276273940.opb
3.20/3.24 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
3.20/3.24 c Constraints : 101 initial, 101 maximal
3.20/3.24 c Presolved Problem :
3.20/3.24 c Problem name : t_HOME/instance-2667166-1276273940.opb
3.20/3.24 c Variables : 105 (105 binary, 0 integer, 0 implicit integer, 0 continuous)
3.20/3.24 c Constraints : 147 initial, 147 maximal
3.20/3.24 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.20/3.24 c trivial : 0.00 64 0 0 0 0 0 0 0
3.20/3.24 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.20/3.24 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.20/3.24 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.20/3.24 c implics : 0.00 0 0 0 0 0 0 0 0
3.20/3.24 c probing : 0.00 0 0 0 0 0 0 0 0
3.20/3.24 c knapsack : 0.03 0 0 0 0 0 0 0 1
3.20/3.24 c setppc : 0.01 0 0 0 0 0 5 0 0
3.20/3.24 c linear : 0.01 0 0 0 0 0 42 4 0
3.20/3.24 c logicor : 0.00 0 0 0 0 0 16 0 0
3.20/3.24 c root node : - 67 - - 67 - - - -
3.20/3.24 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.20/3.24 c integral : 0 0 0 23 0 0 82 0 0 2
3.20/3.24 c knapsack : 17 7 30 1 0 0 0 0 0 0
3.20/3.24 c setppc : 86 7 30 0 0 0 86 0 0 0
3.20/3.24 c logicor : 44 7 14 1 0 0 0 0 0 0
3.20/3.24 c countsols : 0 0 0 1 0 0 0 0 0 0
3.20/3.24 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.20/3.24 c integral : 2.73 0.00 0.00 2.73 0.00
3.20/3.24 c knapsack : 0.01 0.01 0.00 0.00 0.00
3.20/3.24 c setppc : 0.00 0.00 0.00 0.00 0.00
3.20/3.24 c logicor : 0.00 0.00 0.00 0.00 0.00
3.20/3.24 c countsols : 0.00 0.00 0.00 0.00 0.00
3.20/3.24 c Propagators : Time Calls Cutoffs DomReds
3.20/3.24 c vbounds : 0.00 3 0 0
3.20/3.24 c rootredcost : 0.00 0 0 0
3.20/3.24 c pseudoobj : 0.00 0 0 0
3.20/3.24 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.20/3.24 c propagation : 0.00 0 0 0 0.0 0 0.0 -
3.20/3.24 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.20/3.24 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.20/3.24 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.20/3.24 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.20/3.24 c applied globally : - - - 0 0.0 - - -
3.20/3.24 c applied locally : - - - 0 0.0 - - -
3.20/3.24 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.20/3.24 c cut pool : 0.00 0 - - 0 - (maximal pool size: 94)
3.20/3.24 c redcost : 0.00 8 0 0 0 0
3.20/3.24 c impliedbounds : 0.00 7 0 0 0 0
3.20/3.24 c intobj : 0.00 0 0 0 0 0
3.20/3.24 c cgmip : 0.00 0 0 0 0 0
3.20/3.24 c gomory : 0.04 7 0 0 11 0
3.20/3.24 c strongcg : 0.06 7 0 0 322 0
3.20/3.24 c cmir : 0.00 0 0 0 0 0
3.20/3.24 c flowcover : 0.00 0 0 0 0 0
3.20/3.24 c clique : 0.00 7 0 0 36 0
3.20/3.24 c zerohalf : 0.00 0 0 0 0 0
3.20/3.24 c mcf : 0.00 3 0 0 0 0
3.20/3.24 c rapidlearning : 0.18 1 0 0 0 138
3.20/3.24 c Pricers : Time Calls Vars
3.20/3.24 c problem variables: 0.00 0 0
3.20/3.24 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.20/3.24 c relpscost : 2.73 22 0 82 0 0 2
3.20/3.24 c pscost : 0.00 0 0 0 0 0 0
3.20/3.24 c inference : 0.00 0 0 0 0 0 0
3.20/3.24 c mostinf : 0.00 0 0 0 0 0 0
3.20/3.24 c leastinf : 0.00 0 0 0 0 0 0
3.20/3.24 c fullstrong : 0.00 0 0 0 0 0 0
3.20/3.24 c allfullstrong : 0.00 0 0 0 0 0 0
3.20/3.24 c random : 0.00 0 0 0 0 0 0
3.20/3.24 c Primal Heuristics : Time Calls Found
3.20/3.24 c LP solutions : 0.00 - 1
3.20/3.24 c pseudo solutions : 0.00 - 0
3.20/3.24 c trivial : 0.00 1 0
3.20/3.24 c simplerounding : 0.00 0 0
3.20/3.24 c zirounding : 0.00 0 0
3.20/3.24 c rounding : 0.00 0 0
3.20/3.24 c shifting : 0.00 0 0
3.20/3.24 c intshifting : 0.00 0 0
3.20/3.24 c oneopt : 0.00 0 0
3.20/3.24 c twoopt : 0.00 0 0
3.20/3.24 c fixandinfer : 0.00 0 0
3.20/3.24 c feaspump : 0.00 0 0
3.20/3.24 c coefdiving : 0.00 0 0
3.20/3.24 c pscostdiving : 0.00 0 0
3.20/3.24 c fracdiving : 0.00 0 0
3.20/3.24 c veclendiving : 0.00 0 0
3.20/3.24 c intdiving : 0.00 0 0
3.20/3.24 c actconsdiving : 0.00 0 0
3.20/3.24 c objpscostdiving : 0.00 0 0
3.20/3.24 c rootsoldiving : 0.00 0 0
3.20/3.24 c linesearchdiving : 0.00 0 0
3.20/3.24 c guideddiving : 0.00 0 0
3.20/3.24 c octane : 0.00 0 0
3.20/3.24 c rens : 0.00 0 0
3.20/3.24 c rins : 0.00 0 0
3.20/3.24 c localbranching : 0.00 0 0
3.20/3.24 c mutation : 0.00 0 0
3.20/3.24 c crossover : 0.00 0 0
3.20/3.24 c dins : 0.00 0 0
3.20/3.24 c undercover : 0.00 0 0
3.20/3.24 c nlp : 0.00 0 0
3.20/3.24 c trysol : 0.00 0 0
3.20/3.24 c LP : Time Calls Iterations Iter/call Iter/sec
3.20/3.24 c primal LP : 0.00 0 0 0.00 -
3.20/3.24 c dual LP : 0.03 30 709 23.63 23633.33
3.20/3.24 c lex dual LP : 0.00 0 0 0.00 -
3.20/3.24 c barrier LP : 0.00 0 0 0.00 -
3.20/3.24 c diving/probing LP: 0.00 0 0 0.00 -
3.20/3.24 c strong branching : 2.73 234 27539 117.69 10087.55
3.20/3.24 c (at root node) : - 217 27063 124.71 -
3.20/3.24 c conflict analysis: 0.00 0 0 0.00 -
3.20/3.24 c B&B Tree :
3.20/3.24 c number of runs : 3
3.20/3.24 c nodes : 2
3.20/3.24 c nodes (total) : 4
3.20/3.24 c nodes left : 0
3.20/3.24 c max depth : 1
3.20/3.24 c max depth (total): 1
3.20/3.24 c backtracks : 0 (0.0%)
3.20/3.24 c delayed cutoffs : 0
3.20/3.24 c repropagations : 0 (0 domain reductions, 0 cutoffs)
3.20/3.24 c avg switch length: 2.00
3.20/3.24 c switching time : 0.00
3.20/3.24 c Solution :
3.20/3.24 c Solutions found : 1 (1 improvements)
3.20/3.24 c First Solution : +0.00000000000000e+00 (in run 3, after 2 nodes, 3.11 seconds, depth 1, found by <relaxation>)
3.20/3.24 c Primal Bound : +0.00000000000000e+00 (in run 3, after 2 nodes, 3.11 seconds, depth 1, found by <relaxation>)
3.20/3.24 c Dual Bound : +0.00000000000000e+00
3.20/3.24 c Gap : 0.00 %
3.20/3.24 c Root Dual Bound : +0.00000000000000e+00
3.20/3.24 c Root Iterations : 609
3.20/3.25 c Time complete: 3.24.