0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.00 c Copyright (c) 2002-2011 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-3451175-1307067591.opb>
0.00/0.00 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.00 c problem read
0.00/0.00 c No objective function, only one solution is needed.
0.00/0.00 c presolving settings loaded
0.00/0.00 c presolving:
0.00/0.01 c (round 1) 0 del vars, 28 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.01 c (round 2) 0 del vars, 28 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.01 c presolving (3 rounds):
0.00/0.01 c 0 deleted vars, 28 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 8 implications, 68 cliques
0.00/0.01 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.01 c 1 constraints of type <knapsack>
0.00/0.01 c 72 constraints of type <setppc>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.01
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 2.0.1.5
0.00/0.01 c
0.00/0.01 c # frequency for displaying node information lines
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01 c display/freq = 10000
0.00/0.01 c
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = 1800
0.00/0.01 c
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = 13950
0.00/0.01 c
0.00/0.01 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c limits/solutions = 1
0.00/0.01 c
0.00/0.01 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.01 c separating/maxrounds = 1
0.00/0.01 c
0.00/0.01 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/maxroundsroot = 5
0.00/0.01 c
0.00/0.01 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01 c # [type: int, range: [1,2], default: 1]
0.00/0.01 c timing/clocktype = 2
0.00/0.01 c
0.00/0.01 c # belongs reading time to solving time?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c timing/reading = TRUE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify inequalities
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/linear/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/indicator/addCouplingCons = TRUE
0.00/0.01 c
0.00/0.01 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.01 c constraints/knapsack/disaggregation = FALSE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify knapsacks
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c presolving/probing/maxrounds = 0
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/coefdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.01 c heuristics/crossover/freq = -1
0.00/0.01 c
0.00/0.01 c # number of nodes added to the contingent of the total nodes
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01 c heuristics/crossover/nodesofs = 750
0.00/0.01 c
0.00/0.01 c # number of nodes without incumbent change that heuristic should wait
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.01 c heuristics/crossover/nwaitingnodes = 100
0.00/0.01 c
0.00/0.01 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.01 c # [type: real, range: [0,1], default: 0.1]
0.00/0.01 c heuristics/crossover/nodesquot = 0.15
0.00/0.01 c
0.00/0.01 c # minimum percentage of integer variables that have to be fixed
0.00/0.01 c # [type: real, range: [0,1], default: 0.666]
0.00/0.01 c heuristics/crossover/minfixingrate = 0.5
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/feaspump/freq = -1
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/fracdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/guideddiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/intshifting/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/linesearchdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/objpscostdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.01 c # [type: real, range: [0,1], default: 0.01]
0.00/0.01 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/oneopt/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/pscostdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/rens/freq = -1
0.00/0.01 c
0.00/0.01 c # minimum percentage of integer variables that have to be fixable
0.00/0.01 c # [type: real, range: [0,1], default: 0.5]
0.00/0.01 c heuristics/rens/minfixingrate = 0.3
0.00/0.01 c
0.00/0.01 c # number of nodes added to the contingent of the total nodes
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01 c heuristics/rens/nodesofs = 2000
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/rootsoldiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.01 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/rounding/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/shiftandpropagate/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/shifting/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/simplerounding/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/subnlp/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/trivial/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/trysol/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/undercover/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/veclendiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/zirounding/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c separating/cmir/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c separating/flowcover/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/rapidlearning/freq = 0
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.01 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.01 c 0.0s| 1 | 0 | 131 | - | 770k| 0 | 42 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.04 c 0.0s| 1 | 0 | 159 | - |1234k| 0 | 51 | 169 | 113 | 169 | 86 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.05 c 0.0s| 1 | 0 | 177 | - |1241k| 0 | 57 | 169 | 113 | 169 | 94 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
0.04/0.05 c 0.1s| 1 | 0 | 180 | - |1243k| 0 | 57 | 169 | 113 | 169 | 96 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
0.04/0.06 c 0.1s| 1 | 0 | 194 | - |1248k| 0 | 60 | 169 | 113 | 169 | 98 | 25 | 0 | 0 | 0.000000e+00 | -- | Inf
0.04/0.06 c 0.1s| 1 | 0 | 197 | - |1250k| 0 | 60 | 169 | 113 | 169 | 101 | 28 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.15 c 0.2s| 1 | 0 | 219 | - |1246k| 0 | 59 | 169 | 109 | 169 | 101 | 28 | 0 | 13 | 0.000000e+00 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 231 | - |1219k| 0 | 60 | 169 | 86 | 169 | 101 | 28 | 0 | 24 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 256 | - |1219k| 0 | 57 | 169 | 86 | 169 | 101 | 28 | 0 | 35 | 0.000000e+00 | -- | Inf
0.29/0.37 c 0.4s| 1 | 0 | 271 | - |1219k| 0 | 56 | 169 | 86 | 169 | 101 | 28 | 0 | 42 | 0.000000e+00 | -- | Inf
0.39/0.42 c 0.4s| 1 | 0 | 284 | - |1219k| 0 | 56 | 169 | 86 | 169 | 101 | 28 | 0 | 48 | 0.000000e+00 | -- | Inf
0.49/0.50 c 0.5s| 1 | 0 | 301 | - |1219k| 0 | 53 | 169 | 86 | 169 | 97 | 28 | 0 | 58 | 0.000000e+00 | -- | Inf
0.49/0.54 c 0.5s| 1 | 0 | 313 | - |1219k| 0 | 54 | 169 | 86 | 169 | 97 | 28 | 0 | 64 | 0.000000e+00 | -- | Inf
0.59/0.62 c 0.6s| 1 | 0 | 326 | - |1219k| 0 | 52 | 169 | 86 | 169 | 97 | 28 | 0 | 76 | 0.000000e+00 | -- | Inf
0.59/0.64 c 0.6s| 1 | 0 | 326 | - |1219k| 0 | - | 169 | 86 | 169 | 97 | 28 | 0 | 81 | 0.000000e+00 | -- | Inf
0.59/0.64 c (run 1, node 1) restarting after 37 global fixings of integer variables
0.59/0.64 c
0.59/0.64 c (restart) converted 24 cuts from the global cut pool into linear constraints
0.59/0.64 c
0.59/0.64 c presolving:
0.59/0.65 c (round 1) 37 del vars, 1 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 14 impls, 80 clqs
0.59/0.65 c (round 2) 37 del vars, 1 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 36 upgd conss, 14 impls, 80 clqs
0.59/0.65 c (round 3) 37 del vars, 1 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 4 chg coeffs, 36 upgd conss, 14 impls, 80 clqs
0.59/0.65 c (round 4) 37 del vars, 1 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 7 chg coeffs, 36 upgd conss, 14 impls, 80 clqs
0.59/0.65 c (round 5) 37 del vars, 1 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 9 chg coeffs, 36 upgd conss, 14 impls, 80 clqs
0.59/0.65 c presolving (6 rounds):
0.59/0.65 c 37 deleted vars, 1 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 9 changed coefficients
0.59/0.65 c 14 implications, 80 cliques
0.59/0.65 c presolved problem has 132 variables (132 bin, 0 int, 0 impl, 0 cont) and 109 constraints
0.59/0.65 c 10 constraints of type <knapsack>
0.59/0.65 c 86 constraints of type <setppc>
0.59/0.65 c 13 constraints of type <logicor>
0.59/0.65 c transformed objective value is always integral (scale: 1)
0.59/0.65 c Presolving Time: 0.01
0.59/0.65 c
0.59/0.66 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.59/0.66 c 0.7s| 1 | 0 | 426 | - | 898k| 0 | 43 | 132 | 109 | 132 | 96 | 0 | 0 | 81 | 0.000000e+00 | -- | Inf
0.59/0.67 c 0.7s| 1 | 0 | 455 | - |1176k| 0 | 53 | 132 | 109 | 132 | 111 | 15 | 0 | 81 | 0.000000e+00 | -- | Inf
0.69/0.77 c 0.8s| 1 | 0 | 469 | - |1176k| 0 | 55 | 132 | 108 | 132 | 111 | 15 | 0 | 101 | 0.000000e+00 | -- | Inf
0.79/0.85 c 0.9s| 1 | 0 | 483 | - |1175k| 0 | 56 | 132 | 106 | 132 | 111 | 15 | 0 | 118 | 0.000000e+00 | -- | Inf
0.89/0.95 c 0.9s| 1 | 0 | 495 | - |1175k| 0 | 53 | 132 | 106 | 132 | 111 | 15 | 0 | 139 | 0.000000e+00 | -- | Inf
0.89/0.97 c 1.0s| 1 | 0 | 510 | - |1174k| 0 | 51 | 132 | 104 | 132 | 111 | 15 | 0 | 144 | 0.000000e+00 | -- | Inf
1.01/1.03 c 1.0s| 1 | 0 | 524 | - |1174k| 0 | 51 | 132 | 103 | 132 | 111 | 15 | 0 | 156 | 0.000000e+00 | -- | Inf
1.01/1.06 c 1.1s| 1 | 0 | 524 | - |1173k| 0 | - | 132 | 103 | 132 | 111 | 15 | 0 | 162 | 0.000000e+00 | -- | Inf
1.01/1.06 c (run 2, node 1) restarting after 30 global fixings of integer variables
1.01/1.06 c
1.01/1.06 c (restart) converted 15 cuts from the global cut pool into linear constraints
1.01/1.06 c
1.01/1.06 c presolving:
1.01/1.06 c (round 1) 30 del vars, 10 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 15 upgd conss, 26 impls, 78 clqs
1.01/1.06 c (round 2) 30 del vars, 14 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 15 upgd conss, 26 impls, 78 clqs
1.01/1.06 c presolving (3 rounds):
1.01/1.06 c 30 deleted vars, 14 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.01/1.06 c 26 implications, 78 cliques
1.01/1.06 c presolved problem has 102 variables (102 bin, 0 int, 0 impl, 0 cont) and 104 constraints
1.01/1.06 c 19 constraints of type <knapsack>
1.01/1.06 c 85 constraints of type <setppc>
1.01/1.06 c transformed objective value is always integral (scale: 1)
1.01/1.06 c Presolving Time: 0.02
1.01/1.06 c
1.01/1.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.01/1.07 c 1.1s| 1 | 0 | 605 | - | 938k| 0 | 47 | 102 | 104 | 102 | 104 | 0 | 0 | 162 | 0.000000e+00 | -- | Inf
1.01/1.07 c 1.1s| 1 | 0 | 631 | - |1178k| 0 | 52 | 102 | 104 | 102 | 115 | 11 | 0 | 162 | 0.000000e+00 | -- | Inf
1.11/1.14 c 1.1s| 1 | 0 | 659 | - |1178k| 0 | 52 | 102 | 104 | 102 | 115 | 11 | 0 | 183 | 0.000000e+00 | -- | Inf
1.19/1.20 c 1.2s| 1 | 0 | 676 | - |1178k| 0 | 50 | 102 | 104 | 102 | 115 | 11 | 0 | 200 | 0.000000e+00 | -- | Inf
1.19/1.24 c 1.2s| 1 | 0 | 687 | - |1178k| 0 | 53 | 102 | 103 | 102 | 115 | 11 | 0 | 213 | 0.000000e+00 | -- | Inf
1.19/1.25 c 1.3s| 1 | 0 | 696 | - |1177k| 0 | 49 | 102 | 101 | 102 | 115 | 11 | 0 | 219 | 0.000000e+00 | -- | Inf
1.19/1.27 c 1.3s| 1 | 0 | 696 | - |1177k| 0 | - | 102 | 101 | 102 | 115 | 11 | 0 | 227 | 0.000000e+00 | -- | Inf
1.19/1.27 c (run 3, node 1) restarting after 24 global fixings of integer variables
1.19/1.27 c
1.19/1.27 c (restart) converted 11 cuts from the global cut pool into linear constraints
1.19/1.27 c
1.19/1.27 c presolving:
1.19/1.28 c (round 1) 24 del vars, 3 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 11 upgd conss, 40 impls, 76 clqs
1.19/1.28 c (round 2) 24 del vars, 6 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 3 chg coeffs, 11 upgd conss, 40 impls, 76 clqs
1.19/1.28 c presolving (3 rounds):
1.19/1.28 c 24 deleted vars, 6 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 3 changed coefficients
1.19/1.28 c 40 implications, 76 cliques
1.19/1.28 c presolved problem has 78 variables (78 bin, 0 int, 0 impl, 0 cont) and 106 constraints
1.19/1.28 c 24 constraints of type <knapsack>
1.19/1.28 c 82 constraints of type <setppc>
1.19/1.28 c transformed objective value is always integral (scale: 1)
1.19/1.28 c Presolving Time: 0.03
1.19/1.28 c
1.19/1.28 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.19/1.28 c 1.3s| 1 | 0 | 755 | - | 932k| 0 | 41 | 78 | 106 | 78 | 106 | 0 | 0 | 227 | 0.000000e+00 | -- | Inf
1.19/1.29 c 1.3s| 1 | 0 | 775 | - |1142k| 0 | 46 | 78 | 106 | 78 | 116 | 10 | 0 | 227 | 0.000000e+00 | -- | Inf
1.29/1.31 c 1.3s| 1 | 0 | 791 | - |1142k| 0 | 47 | 78 | 106 | 78 | 116 | 10 | 0 | 241 | 0.000000e+00 | -- | Inf
1.29/1.33 c 1.3s| 1 | 0 | 910 | - |1141k| 0 | 39 | 78 | 105 | 78 | 116 | 10 | 0 | 248 | 0.000000e+00 | -- | Inf
1.29/1.34 c 1.3s| 1 | 0 | 931 | - |1140k| 0 | 30 | 78 | 101 | 78 | 116 | 10 | 0 | 259 | 0.000000e+00 | -- | Inf
1.29/1.35 c 1.3s| 1 | 0 | 931 | - |1140k| 0 | - | 78 | 101 | 78 | 116 | 10 | 0 | 264 | 0.000000e+00 | -- | Inf
1.29/1.35 c (run 4, node 1) restarting after 20 global fixings of integer variables
1.29/1.35 c
1.29/1.35 c (restart) converted 10 cuts from the global cut pool into linear constraints
1.29/1.35 c
1.29/1.35 c presolving:
1.29/1.35 c (round 1) 44 del vars, 18 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 10 chg coeffs, 0 upgd conss, 72 impls, 32 clqs
1.29/1.35 c (round 2) 52 del vars, 36 del conss, 0 add conss, 0 chg bounds, 70 chg sides, 116 chg coeffs, 9 upgd conss, 90 impls, 25 clqs
1.29/1.36 c (round 3) 53 del vars, 44 del conss, 0 add conss, 0 chg bounds, 106 chg sides, 216 chg coeffs, 9 upgd conss, 98 impls, 37 clqs
1.29/1.36 c (round 4) 75 del vars, 71 del conss, 0 add conss, 0 chg bounds, 122 chg sides, 299 chg coeffs, 9 upgd conss, 154 impls, 1 clqs
1.29/1.36 c presolving (5 rounds):
1.29/1.36 c 78 deleted vars, 111 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 122 changed sides, 299 changed coefficients
1.29/1.36 c 154 implications, 0 cliques
1.29/1.36 c presolved problem has 0 variables (0 bin, 0 int, 0 impl, 0 cont) and 0 constraints
1.29/1.36 c transformed objective value is always integral (scale: 1)
1.29/1.36 c Presolving Time: 0.04
1.29/1.36 c
1.29/1.36 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.29/1.36 c * 1.4s| 1 | 0 | 931 | - | 659k| 0 | - | 0 | 0 | 0 | 0 | 0 | 0 | 264 | 0.000000e+00 | 0.000000e+00 | 0.00%
1.29/1.36 c 1.4s| 1 | 0 | 931 | - | 659k| 0 | - | 0 | 0 | 0 | 0 | 0 | 0 | 264 | 0.000000e+00 | 0.000000e+00 | 0.00%
1.29/1.36 c
1.29/1.36 c SCIP Status : problem is solved [optimal solution found]
1.29/1.36 c Solving Time (sec) : 1.36
1.29/1.36 c Solving Nodes : 1 (total of 5 nodes in 5 runs)
1.29/1.36 c Primal Bound : +0.00000000000000e+00 (1 solutions)
1.29/1.36 c Dual Bound : +0.00000000000000e+00
1.29/1.36 c Gap : 0.00 %
1.29/1.36 s SATISFIABLE
1.29/1.36 v x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
1.29/1.36 v x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 x132 -x131 -x130 -x129 x128 -x127
1.29/1.36 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 x110 -x109 -x108 -x107 -x106
1.29/1.36 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
1.29/1.36 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
1.29/1.36 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
1.29/1.36 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
1.29/1.36 v -x4 -x3 -x2 -x1
1.29/1.36 c SCIP Status : problem is solved [optimal solution found]
1.29/1.36 c Total Time : 1.36
1.29/1.36 c solving : 1.36
1.29/1.36 c presolving : 0.04 (included in solving)
1.29/1.36 c reading : 0.00 (included in solving)
1.29/1.36 c Original Problem :
1.29/1.36 c Problem name : HOME/instance-3451175-1307067591.opb
1.29/1.36 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.36 c Constraints : 101 initial, 101 maximal
1.29/1.36 c Presolved Problem :
1.29/1.36 c Problem name : t_HOME/instance-3451175-1307067591.opb
1.29/1.36 c Variables : 0 (0 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.36 c Constraints : 0 initial, 0 maximal
1.29/1.36 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
1.29/1.36 c trivial : 0.00 114 0 0 0 0 0 0 0 0
1.29/1.36 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
1.29/1.36 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
1.29/1.36 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
1.29/1.36 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
1.29/1.36 c implics : 0.00 0 0 0 0 0 0 0 0 0
1.29/1.36 c probing : 0.00 0 0 0 0 0 0 0 0 0
1.29/1.36 c knapsack : 0.02 5 0 0 0 0 29 0 122 311
1.29/1.36 c setppc : 0.00 39 11 0 0 0 92 0 0 0
1.29/1.36 c linear : 0.00 0 0 0 0 0 30 0 1 0
1.29/1.36 c logicor : 0.00 0 0 0 0 0 9 0 0 0
1.29/1.36 c root node : - 111 - - 111 - - - - -
1.29/1.36 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
1.29/1.36 c integral : 0 0 0 24 0 7 0 0 111 0 0 0
1.29/1.36 c countsols : 0 0 0 0 0 3 0 0 0 0 0 0
1.29/1.36 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
1.29/1.36 c integral : 1.21 0.00 0.00 1.21 0.00 0.00 0.00
1.29/1.36 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.29/1.36 c Propagators : #Propagate #Resprop Cutoffs DomReds
1.29/1.36 c vbounds : 0 0 0 0
1.29/1.36 c rootredcost : 0 0 0 0
1.29/1.36 c pseudoobj : 0 0 0 0
1.29/1.36 c Propagator Timings : TotalTime Propagate Resprop
1.29/1.36 c vbounds : 0.00 0.00 0.00
1.29/1.36 c rootredcost : 0.00 0.00 0.00
1.29/1.36 c pseudoobj : 0.00 0.00 0.00
1.29/1.36 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.29/1.36 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.29/1.36 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.36 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.36 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.36 c pseudo solution : 0.00 1 0 0 0.0 0 0.0 -
1.29/1.36 c applied globally : - - - 0 0.0 - - -
1.29/1.36 c applied locally : - - - 0 0.0 - - -
1.29/1.36 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.29/1.36 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.29/1.36 c redcost : 0.00 8 0 0 0 0
1.29/1.36 c impliedbounds : 0.00 8 0 0 0 0
1.29/1.36 c intobj : 0.00 0 0 0 0 0
1.29/1.36 c gomory : 0.02 8 0 0 55 0
1.29/1.36 c cgmip : 0.00 0 0 0 0 0
1.29/1.36 c closecuts : 0.00 0 0 0 0 0
1.29/1.36 c strongcg : 0.02 8 0 0 308 0
1.29/1.36 c cmir : 0.00 0 0 0 0 0
1.29/1.36 c flowcover : 0.00 0 0 0 0 0
1.29/1.36 c clique : 0.00 8 0 0 37 0
1.29/1.36 c zerohalf : 0.00 0 0 0 0 0
1.29/1.36 c mcf : 0.00 4 0 0 0 0
1.29/1.36 c oddcycle : 0.00 0 0 0 0 0
1.29/1.36 c rapidlearning : 0.02 1 0 0 0 40
1.29/1.36 c Pricers : Time Calls Vars
1.29/1.36 c problem variables: 0.00 0 0
1.29/1.36 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.29/1.36 c relpscost : 1.21 24 0 111 0 0 0
1.29/1.36 c pscost : 0.00 0 0 0 0 0 0
1.29/1.36 c inference : 0.00 0 0 0 0 0 0
1.29/1.36 c mostinf : 0.00 0 0 0 0 0 0
1.29/1.36 c leastinf : 0.00 0 0 0 0 0 0
1.29/1.36 c fullstrong : 0.00 0 0 0 0 0 0
1.29/1.36 c allfullstrong : 0.00 0 0 0 0 0 0
1.29/1.36 c random : 0.00 0 0 0 0 0 0
1.29/1.36 c Primal Heuristics : Time Calls Found
1.29/1.36 c LP solutions : 0.00 - 0
1.29/1.36 c pseudo solutions : 0.00 - 0
1.29/1.36 c trivial : 0.00 1 0
1.29/1.36 c shiftandpropagate: 0.00 0 0
1.29/1.36 c simplerounding : 0.00 0 0
1.29/1.36 c zirounding : 0.00 0 0
1.29/1.36 c rounding : 0.00 0 0
1.29/1.36 c shifting : 0.00 0 0
1.29/1.36 c intshifting : 0.00 0 0
1.29/1.36 c oneopt : 0.00 0 0
1.29/1.36 c twoopt : 0.00 0 0
1.29/1.36 c fixandinfer : 0.00 0 0
1.29/1.36 c feaspump : 0.00 0 0
1.29/1.36 c clique : 0.00 0 0
1.29/1.36 c coefdiving : 0.00 0 0
1.29/1.36 c pscostdiving : 0.00 0 0
1.29/1.36 c fracdiving : 0.00 0 0
1.29/1.36 c veclendiving : 0.00 0 0
1.29/1.36 c intdiving : 0.00 0 0
1.29/1.36 c actconsdiving : 0.00 0 0
1.29/1.36 c objpscostdiving : 0.00 0 0
1.29/1.36 c rootsoldiving : 0.00 0 0
1.29/1.36 c linesearchdiving : 0.00 0 0
1.29/1.36 c guideddiving : 0.00 0 0
1.29/1.36 c octane : 0.00 0 0
1.29/1.36 c rens : 0.00 0 0
1.29/1.36 c rins : 0.00 0 0
1.29/1.36 c localbranching : 0.00 0 0
1.29/1.36 c mutation : 0.00 0 0
1.29/1.36 c crossover : 0.00 0 0
1.29/1.36 c dins : 0.00 0 0
1.29/1.36 c vbounds : 0.00 0 0
1.29/1.36 c undercover : 0.00 0 0
1.29/1.36 c subnlp : 0.00 0 0
1.29/1.36 c trysol : 0.00 0 0
1.29/1.36 c LP : Time Calls Iterations Iter/call Iter/sec
1.29/1.36 c primal LP : 0.00 0 0 0.00 -
1.29/1.36 c dual LP : 0.03 32 931 29.09 34589.09
1.29/1.36 c lex dual LP : 0.00 0 0 0.00 -
1.29/1.36 c barrier LP : 0.00 0 0 0.00 -
1.29/1.36 c diving/probing LP: 0.00 0 0 0.00 -
1.29/1.36 c strong branching : 1.21 264 41926 158.81 34710.66
1.29/1.36 c (at root node) : - 264 41926 158.81 -
1.29/1.36 c conflict analysis: 0.00 0 0 0.00 -
1.29/1.36 c B&B Tree :
1.29/1.36 c number of runs : 5
1.29/1.36 c nodes : 1
1.29/1.36 c nodes (total) : 5
1.29/1.36 c nodes left : 0
1.29/1.36 c max depth : 0
1.29/1.36 c max depth (total): 0
1.29/1.36 c backtracks : 0 (0.0%)
1.29/1.36 c delayed cutoffs : 0
1.29/1.36 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.29/1.36 c avg switch length: 2.00
1.29/1.36 c switching time : 0.00
1.29/1.36 c Solution :
1.29/1.36 c Solutions found : 1 (1 improvements)
1.29/1.36 c First Solution : +0.00000000000000e+00 (in run 5, after 1 nodes, 1.36 seconds, depth 0, found by <relaxation>)
1.29/1.36 c Primal Bound : +0.00000000000000e+00 (in run 5, after 1 nodes, 1.36 seconds, depth 0, found by <relaxation>)
1.29/1.36 c Dual Bound : +0.00000000000000e+00
1.29/1.36 c Gap : 0.00 %
1.29/1.36 c Root Dual Bound : +0.00000000000000e+00
1.29/1.36 c Root Iterations : 931
1.29/1.36 c Time complete: 1.35.