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-2667198-1276276858.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.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/shifting/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <simplerounding> (-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/simplerounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c heuristics/trivial/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <trysol> (-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/trysol/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/veclendiving/freq = -1
0.00/0.04 c
0.00/0.04 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 | 96 | - | 743k| 0 | 42 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 123 | - |1205k| 0 | 51 | 169 | 216 | 169 | 85 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 161 | - |1376k| 0 | 59 | 169 | 216 | 169 | 95 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 0 | 183 | - |1448k| 0 | 60 | 169 | 216 | 169 | 98 | 25 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.31 c 0.2s| 1 | 0 | 195 | - |1468k| 0 | 61 | 169 | 216 | 169 | 103 | 30 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 213 | - |1489k| 0 | 61 | 169 | 216 | 169 | 104 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.55 c 0.5s| 1 | 0 | 238 | - |1404k| 0 | 59 | 169 | 143 | 169 | 104 | 31 | 0 | 11 | 0.000000e+00 | -- | Inf
0.69/0.78 c 0.7s| 1 | 0 | 253 | - |1395k| 0 | 60 | 169 | 134 | 169 | 104 | 31 | 0 | 22 | 0.000000e+00 | -- | Inf
1.00/1.01 c 0.9s| 1 | 0 | 269 | - |1378k| 0 | 63 | 169 | 120 | 169 | 104 | 31 | 0 | 33 | 0.000000e+00 | -- | Inf
1.09/1.11 c 1.0s| 1 | 0 | 276 | - |1369k| 0 | 63 | 169 | 112 | 169 | 104 | 31 | 0 | 38 | 0.000000e+00 | -- | Inf
1.19/1.23 c 1.1s| 1 | 0 | 288 | - |1365k| 0 | 61 | 169 | 108 | 169 | 104 | 31 | 0 | 44 | 0.000000e+00 | -- | Inf
1.29/1.33 c 1.2s| 1 | 0 | 295 | - |1357k| 0 | 59 | 169 | 102 | 169 | 100 | 31 | 0 | 49 | 0.000000e+00 | -- | Inf
1.39/1.41 c 1.3s| 1 | 0 | 295 | - |1357k| 0 | - | 169 | 102 | 169 | 100 | 31 | 0 | 54 | 0.000000e+00 | -- | Inf
1.39/1.41 c (run 1, node 1) restarting after 35 global fixings of integer variables
1.39/1.41 c
1.39/1.41 c (restart) converted 27 cuts from the global cut pool into linear constraints
1.39/1.41 c
1.39/1.41 c presolving:
1.39/1.42 c (round 1) 35 del vars, 16 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 14 impls, 78 clqs
1.39/1.42 c (round 2) 35 del vars, 16 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 42 upgd conss, 14 impls, 78 clqs
1.39/1.43 c (round 3) 35 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 42 upgd conss, 14 impls, 78 clqs
1.39/1.43 c presolving (4 rounds):
1.39/1.43 c 35 deleted vars, 17 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.39/1.43 c 14 implications, 78 cliques
1.39/1.43 c presolved problem has 134 variables (134 bin, 0 int, 0 impl, 0 cont) and 112 constraints
1.39/1.43 c 14 constraints of type <knapsack>
1.39/1.43 c 80 constraints of type <setppc>
1.39/1.43 c 18 constraints of type <logicor>
1.39/1.43 c transformed objective value is always integral (scale: 1)
1.39/1.43 c Presolving Time: 0.03
1.39/1.43 c
1.39/1.44 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.39/1.44 c 1.3s| 1 | 0 | 386 | - | 950k| 0 | 43 | 134 | 112 | 134 | 96 | 0 | 0 | 54 | 0.000000e+00 | -- | Inf
1.39/1.46 c 1.4s| 1 | 0 | 431 | - |1300k| 0 | 51 | 134 | 112 | 134 | 108 | 12 | 0 | 54 | 0.000000e+00 | -- | Inf
1.59/1.68 c 1.6s| 1 | 0 | 456 | - |1299k| 0 | 47 | 134 | 112 | 134 | 108 | 12 | 0 | 72 | 0.000000e+00 | -- | Inf
1.69/1.80 c 1.7s| 1 | 0 | 477 | - |1299k| 0 | 51 | 134 | 111 | 134 | 108 | 12 | 0 | 80 | 0.000000e+00 | -- | Inf
1.79/1.86 c 1.8s| 1 | 0 | 490 | - |1299k| 0 | 47 | 134 | 111 | 134 | 108 | 12 | 0 | 85 | 0.000000e+00 | -- | Inf
1.99/2.00 c 1.9s| 1 | 0 | 503 | - |1299k| 0 | 46 | 134 | 111 | 134 | 108 | 12 | 0 | 92 | 0.000000e+00 | -- | Inf
1.99/2.08 c 2.0s| 1 | 0 | 578 | - |1298k| 0 | 36 | 134 | 110 | 134 | 108 | 12 | 0 | 97 | 0.000000e+00 | -- | Inf
2.10/2.13 c 2.0s| 1 | 0 | 578 | - |1298k| 0 | - | 134 | 110 | 134 | 108 | 12 | 0 | 103 | 0.000000e+00 | -- | Inf
2.10/2.13 c (run 2, node 1) restarting after 30 global fixings of integer variables
2.10/2.13 c
2.10/2.13 c (restart) converted 12 cuts from the global cut pool into linear constraints
2.10/2.13 c
2.10/2.13 c presolving:
2.10/2.14 c (round 1) 30 del vars, 14 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 20 impls, 80 clqs
2.10/2.15 c (round 2) 30 del vars, 14 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 11 upgd conss, 20 impls, 80 clqs
2.10/2.15 c (round 3) 30 del vars, 15 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 11 upgd conss, 20 impls, 80 clqs
2.10/2.15 c (round 4) 30 del vars, 15 del conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 11 upgd conss, 20 impls, 80 clqs
2.10/2.15 c presolving (5 rounds):
2.10/2.15 c 30 deleted vars, 15 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 2 changed coefficients
2.10/2.15 c 20 implications, 80 cliques
2.10/2.15 c presolved problem has 104 variables (104 bin, 0 int, 0 impl, 0 cont) and 107 constraints
2.10/2.15 c 20 constraints of type <knapsack>
2.10/2.15 c 81 constraints of type <setppc>
2.10/2.15 c 6 constraints of type <logicor>
2.10/2.15 c transformed objective value is always integral (scale: 1)
2.10/2.15 c Presolving Time: 0.05
2.10/2.15 c
2.10/2.16 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.10/2.16 c 2.0s| 1 | 0 | 650 | - | 958k| 0 | 43 | 104 | 107 | 104 | 102 | 0 | 0 | 103 | 0.000000e+00 | -- | Inf
2.10/2.19 c 2.1s| 1 | 0 | 742 | - |1270k| 0 | 42 | 104 | 107 | 104 | 111 | 9 | 0 | 103 | 0.000000e+00 | -- | Inf
2.29/2.34 c 2.2s| 1 | 0 | 846 | - |1268k| 0 | 32 | 104 | 99 | 104 | 111 | 9 | 0 | 112 | 0.000000e+00 | -- | Inf
2.49/2.53 c 2.4s| 1 | 0 | 846 | - |1268k| 0 | - | 104 | 99 | 104 | 111 | 9 | 0 | 131 | 0.000000e+00 | -- | Inf
2.49/2.53 c (run 3, node 1) restarting after 31 global fixings of integer variables
2.49/2.53 c
2.49/2.53 c (restart) converted 9 cuts from the global cut pool into linear constraints
2.49/2.53 c
2.49/2.53 c presolving:
2.49/2.54 c (round 1) 31 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 4 chg coeffs, 9 upgd conss, 40 impls, 63 clqs
2.49/2.54 c (round 2) 31 del vars, 6 del conss, 0 chg bounds, 0 chg sides, 6 chg coeffs, 9 upgd conss, 40 impls, 63 clqs
2.49/2.54 c (round 3) 31 del vars, 6 del conss, 0 chg bounds, 0 chg sides, 8 chg coeffs, 9 upgd conss, 40 impls, 63 clqs
2.49/2.54 c (round 4) 31 del vars, 6 del conss, 0 chg bounds, 0 chg sides, 10 chg coeffs, 9 upgd conss, 40 impls, 63 clqs
2.49/2.55 c (round 5) 31 del vars, 6 del conss, 0 chg bounds, 0 chg sides, 11 chg coeffs, 9 upgd conss, 40 impls, 63 clqs
2.49/2.55 c (round 6) 31 del vars, 6 del conss, 0 chg bounds, 0 chg sides, 12 chg coeffs, 9 upgd conss, 40 impls, 63 clqs
2.49/2.55 c presolving (7 rounds):
2.49/2.55 c 31 deleted vars, 6 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 12 changed coefficients
2.49/2.55 c 40 implications, 63 cliques
2.49/2.55 c presolved problem has 73 variables (73 bin, 0 int, 0 impl, 0 cont) and 102 constraints
2.49/2.55 c 27 constraints of type <knapsack>
2.49/2.55 c 68 constraints of type <setppc>
2.49/2.55 c 7 constraints of type <logicor>
2.49/2.55 c transformed objective value is always integral (scale: 1)
2.49/2.55 c Presolving Time: 0.07
2.49/2.55 c
2.49/2.55 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.49/2.55 c 2.4s| 1 | 0 | 884 | - | 950k| 0 | 0 | 73 | 102 | 73 | 97 | 0 | 0 | 131 | 0.000000e+00 | -- | Inf
2.49/2.55 c * 2.4s| 1 | 0 | 884 | - | 952k| 0 | - | 73 | 102 | 73 | 97 | 0 | 0 | 131 | 0.000000e+00 | 0.000000e+00 | 0.00%
2.49/2.55 c
2.49/2.55 c SCIP Status : problem is solved [optimal solution found]
2.49/2.55 c Solving Time (sec) : 2.42
2.49/2.55 c Solving Nodes : 1 (total of 4 nodes in 4 runs)
2.49/2.55 c Primal Bound : +0.00000000000000e+00 (1 solutions)
2.49/2.55 c Dual Bound : +0.00000000000000e+00
2.49/2.55 c Gap : 0.00 %
2.49/2.55 s SATISFIABLE
2.49/2.55 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 x161 -x160 -x159 -x158 -x157 -x156 -x155 x154 -x153 -x152 -x151 -x150 -x149 -x148
2.49/2.55 v -x147 -x146 -x145 -x144 x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
2.49/2.55 v -x126 -x125 x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 x106
2.49/2.55 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.49/2.55 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
2.49/2.55 v -x56 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.49/2.55 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.49/2.55 v -x4 -x3 -x2 x1
2.49/2.55 c SCIP Status : problem is solved [optimal solution found]
2.49/2.55 c Solving Time : 2.42
2.49/2.55 c Original Problem :
2.49/2.55 c Problem name : HOME/instance-2667198-1276276858.opb
2.49/2.55 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
2.49/2.55 c Constraints : 101 initial, 101 maximal
2.49/2.55 c Presolved Problem :
2.49/2.55 c Problem name : t_HOME/instance-2667198-1276276858.opb
2.49/2.55 c Variables : 73 (73 binary, 0 integer, 0 implicit integer, 0 continuous)
2.49/2.55 c Constraints : 102 initial, 102 maximal
2.49/2.55 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.49/2.55 c trivial : 0.00 96 0 0 0 0 0 0 0
2.49/2.55 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.49/2.55 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.49/2.55 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.49/2.55 c implics : 0.00 0 0 0 0 0 0 0 0
2.49/2.55 c probing : 0.00 0 0 0 0 0 0 0 0
2.49/2.55 c knapsack : 0.04 0 0 0 0 0 0 0 14
2.49/2.55 c setppc : 0.01 0 0 0 0 0 10 0 0
2.49/2.55 c linear : 0.00 0 0 0 0 0 43 0 0
2.49/2.55 c logicor : 0.00 0 0 0 0 0 13 0 0
2.49/2.55 c root node : - 96 - - 96 - - - -
2.49/2.55 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.49/2.55 c integral : 0 0 0 16 0 0 75 0 0 0
2.49/2.55 c knapsack : 27 8 17 1 0 0 2 0 0 0
2.49/2.55 c setppc : 68 8 17 1 0 0 19 0 0 0
2.49/2.55 c logicor : 7 8 6 1 0 0 0 0 0 0
2.49/2.55 c countsols : 0 0 0 1 0 0 0 0 0 0
2.49/2.55 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.49/2.55 c integral : 1.98 0.00 0.00 1.98 0.00
2.49/2.55 c knapsack : 0.01 0.01 0.00 0.00 0.00
2.49/2.55 c setppc : 0.00 0.00 0.00 0.00 0.00
2.49/2.55 c logicor : 0.00 0.00 0.00 0.00 0.00
2.49/2.55 c countsols : 0.00 0.00 0.00 0.00 0.00
2.49/2.55 c Propagators : Time Calls Cutoffs DomReds
2.49/2.55 c vbounds : 0.00 4 0 0
2.49/2.55 c rootredcost : 0.00 0 0 0
2.49/2.55 c pseudoobj : 0.00 0 0 0
2.49/2.55 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.49/2.55 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.49/2.55 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.49/2.55 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.49/2.55 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.49/2.55 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.49/2.55 c applied globally : - - - 0 0.0 - - -
2.49/2.55 c applied locally : - - - 0 0.0 - - -
2.49/2.55 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.49/2.55 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
2.49/2.55 c redcost : 0.00 8 0 0 0 0
2.49/2.55 c impliedbounds : 0.00 7 0 0 0 0
2.49/2.55 c intobj : 0.00 0 0 0 0 0
2.49/2.55 c cgmip : 0.00 0 0 0 0 0
2.49/2.55 c gomory : 0.05 7 0 0 80 0
2.49/2.55 c strongcg : 0.06 7 0 0 279 0
2.49/2.55 c cmir : 0.00 0 0 0 0 0
2.49/2.55 c flowcover : 0.00 0 0 0 0 0
2.49/2.55 c clique : 0.00 7 0 0 27 0
2.49/2.55 c zerohalf : 0.00 0 0 0 0 0
2.49/2.55 c mcf : 0.00 3 0 0 0 0
2.49/2.55 c rapidlearning : 0.16 1 0 0 0 143
2.49/2.55 c Pricers : Time Calls Vars
2.49/2.55 c problem variables: 0.00 0 0
2.49/2.55 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.49/2.55 c relpscost : 1.98 15 0 75 0 0 0
2.49/2.55 c pscost : 0.00 0 0 0 0 0 0
2.49/2.55 c inference : 0.00 0 0 0 0 0 0
2.49/2.55 c mostinf : 0.00 0 0 0 0 0 0
2.49/2.55 c leastinf : 0.00 0 0 0 0 0 0
2.49/2.55 c fullstrong : 0.00 0 0 0 0 0 0
2.49/2.55 c allfullstrong : 0.00 0 0 0 0 0 0
2.49/2.55 c random : 0.00 0 0 0 0 0 0
2.49/2.55 c Primal Heuristics : Time Calls Found
2.49/2.55 c LP solutions : 0.00 - 1
2.49/2.55 c pseudo solutions : 0.00 - 0
2.49/2.55 c trivial : 0.00 1 0
2.49/2.55 c simplerounding : 0.00 0 0
2.49/2.55 c zirounding : 0.00 0 0
2.49/2.55 c rounding : 0.00 0 0
2.49/2.55 c shifting : 0.00 0 0
2.49/2.55 c intshifting : 0.00 0 0
2.49/2.55 c oneopt : 0.00 0 0
2.49/2.55 c twoopt : 0.00 0 0
2.49/2.55 c fixandinfer : 0.00 0 0
2.49/2.55 c feaspump : 0.00 0 0
2.49/2.55 c coefdiving : 0.00 0 0
2.49/2.55 c pscostdiving : 0.00 0 0
2.49/2.55 c fracdiving : 0.00 0 0
2.49/2.55 c veclendiving : 0.00 0 0
2.49/2.55 c intdiving : 0.00 0 0
2.49/2.55 c actconsdiving : 0.00 0 0
2.49/2.55 c objpscostdiving : 0.00 0 0
2.49/2.55 c rootsoldiving : 0.00 0 0
2.49/2.55 c linesearchdiving : 0.00 0 0
2.49/2.55 c guideddiving : 0.00 0 0
2.49/2.55 c octane : 0.00 0 0
2.49/2.55 c rens : 0.00 0 0
2.49/2.55 c rins : 0.00 0 0
2.49/2.55 c localbranching : 0.00 0 0
2.49/2.55 c mutation : 0.00 0 0
2.49/2.55 c crossover : 0.00 0 0
2.49/2.55 c dins : 0.00 0 0
2.49/2.55 c undercover : 0.00 0 0
2.49/2.55 c nlp : 0.00 0 0
2.49/2.55 c trysol : 0.00 0 0
2.49/2.55 c LP : Time Calls Iterations Iter/call Iter/sec
2.49/2.55 c primal LP : 0.00 0 0 0.00 -
2.49/2.55 c dual LP : 0.07 23 884 38.43 12628.57
2.49/2.55 c lex dual LP : 0.00 0 0 0.00 -
2.49/2.55 c barrier LP : 0.00 0 0 0.00 -
2.49/2.55 c diving/probing LP: 0.00 0 0 0.00 -
2.49/2.55 c strong branching : 1.98 131 20015 152.79 10108.59
2.49/2.55 c (at root node) : - 131 20015 152.79 -
2.49/2.55 c conflict analysis: 0.00 0 0 0.00 -
2.49/2.55 c B&B Tree :
2.49/2.55 c number of runs : 4
2.49/2.55 c nodes : 1
2.49/2.55 c nodes (total) : 4
2.49/2.55 c nodes left : 0
2.49/2.55 c max depth : 0
2.49/2.55 c max depth (total): 0
2.49/2.55 c backtracks : 0 (0.0%)
2.49/2.55 c delayed cutoffs : 0
2.49/2.55 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.49/2.55 c avg switch length: 2.00
2.49/2.55 c switching time : 0.00
2.49/2.55 c Solution :
2.49/2.55 c Solutions found : 1 (1 improvements)
2.49/2.55 c First Solution : +0.00000000000000e+00 (in run 4, after 1 nodes, 2.42 seconds, depth 0, found by <relaxation>)
2.49/2.55 c Primal Bound : +0.00000000000000e+00 (in run 4, after 1 nodes, 2.42 seconds, depth 0, found by <relaxation>)
2.49/2.55 c Dual Bound : +0.00000000000000e+00
2.49/2.55 c Gap : 0.00 %
2.49/2.55 c Root Dual Bound : +0.00000000000000e+00
2.49/2.55 c Root Iterations : 884
2.49/2.56 c Time complete: 2.55.