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-3451132-1307067566.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 | 89 | - | 770k| 0 | 42 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.03/0.04 c 0.0s| 1 | 0 | 113 | - |1174k| 0 | 47 | 169 | 118 | 169 | 85 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.03/0.04 c 0.0s| 1 | 0 | 152 | - |1186k| 0 | 56 | 169 | 118 | 169 | 96 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
0.03/0.05 c 0.1s| 1 | 0 | 176 | - |1197k| 0 | 58 | 169 | 118 | 169 | 101 | 28 | 0 | 0 | 0.000000e+00 | -- | Inf
0.03/0.06 c 0.1s| 1 | 0 | 185 | - |1199k| 0 | 60 | 169 | 118 | 169 | 104 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.03/0.06 c 0.1s| 1 | 0 | 195 | - |1202k| 0 | 60 | 169 | 118 | 169 | 106 | 33 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.17 c 0.2s| 1 | 0 | 216 | - |1192k| 0 | 57 | 169 | 108 | 169 | 106 | 33 | 0 | 14 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.3s| 1 | 0 | 237 | - |1192k| 0 | 55 | 169 | 108 | 169 | 106 | 33 | 0 | 28 | 0.000000e+00 | -- | Inf
0.29/0.38 c 0.4s| 1 | 0 | 244 | - |1191k| 0 | 55 | 169 | 107 | 169 | 106 | 33 | 0 | 42 | 0.000000e+00 | -- | Inf
0.39/0.46 c 0.5s| 1 | 0 | 246 | - |1191k| 0 | 55 | 169 | 107 | 169 | 106 | 33 | 0 | 55 | 0.000000e+00 | -- | Inf
0.49/0.57 c 0.6s| 1 | 0 | 271 | - |1191k| 0 | 56 | 169 | 107 | 169 | 106 | 33 | 0 | 70 | 0.000000e+00 | -- | Inf
0.59/0.64 c 0.6s| 1 | 0 | 289 | - |1191k| 0 | 57 | 169 | 107 | 169 | 101 | 33 | 0 | 78 | 0.000000e+00 | -- | Inf
0.59/0.68 c 0.7s| 1 | 0 | 302 | - |1191k| 0 | 54 | 169 | 107 | 169 | 101 | 33 | 0 | 83 | 0.000000e+00 | -- | Inf
0.69/0.73 c 0.7s| 1 | 0 | 302 | - |1191k| 0 | - | 169 | 107 | 169 | 101 | 33 | 0 | 89 | 0.000000e+00 | -- | Inf
0.69/0.73 c (run 1, node 1) restarting after 35 global fixings of integer variables
0.69/0.73 c
0.69/0.73 c (restart) converted 28 cuts from the global cut pool into linear constraints
0.69/0.73 c
0.69/0.73 c presolving:
0.69/0.73 c (round 1) 35 del vars, 1 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 12 impls, 85 clqs
0.69/0.73 c (round 2) 35 del vars, 1 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 61 upgd conss, 12 impls, 85 clqs
0.69/0.74 c (round 3) 35 del vars, 3 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 61 upgd conss, 12 impls, 85 clqs
0.69/0.74 c presolving (4 rounds):
0.69/0.74 c 35 deleted vars, 3 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
0.69/0.74 c 12 implications, 85 cliques
0.69/0.74 c presolved problem has 134 variables (134 bin, 0 int, 0 impl, 0 cont) and 132 constraints
0.69/0.74 c 10 constraints of type <knapsack>
0.69/0.74 c 89 constraints of type <setppc>
0.69/0.74 c 33 constraints of type <logicor>
0.69/0.74 c transformed objective value is always integral (scale: 1)
0.69/0.74 c Presolving Time: 0.01
0.69/0.74 c
0.69/0.74 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.69/0.74 c 0.7s| 1 | 0 | 398 | - | 910k| 0 | 42 | 134 | 132 | 134 | 99 | 0 | 0 | 89 | 0.000000e+00 | -- | Inf
0.69/0.75 c 0.7s| 1 | 0 | 420 | - |1181k| 0 | 56 | 134 | 132 | 134 | 114 | 15 | 0 | 89 | 0.000000e+00 | -- | Inf
0.79/0.82 c 0.8s| 1 | 0 | 445 | - |1181k| 0 | 54 | 134 | 132 | 134 | 114 | 15 | 0 | 111 | 0.000000e+00 | -- | Inf
0.79/0.89 c 0.9s| 1 | 0 | 463 | - |1181k| 0 | 54 | 134 | 131 | 134 | 114 | 15 | 0 | 130 | 0.000000e+00 | -- | Inf
0.89/0.93 c 0.9s| 1 | 0 | 481 | - |1181k| 0 | 49 | 134 | 131 | 134 | 114 | 15 | 0 | 144 | 0.000000e+00 | -- | Inf
0.89/0.96 c 1.0s| 1 | 0 | 494 | - |1180k| 0 | 51 | 134 | 129 | 134 | 114 | 15 | 0 | 157 | 0.000000e+00 | -- | Inf
0.89/0.98 c 1.0s| 1 | 0 | 500 | - |1180k| 0 | 50 | 134 | 129 | 134 | 114 | 15 | 0 | 164 | 0.000000e+00 | -- | Inf
0.89/0.99 c 1.0s| 1 | 0 | 500 | - |1180k| 0 | - | 134 | 129 | 134 | 114 | 15 | 0 | 169 | 0.000000e+00 | -- | Inf
0.89/0.99 c (run 2, node 1) restarting after 27 global fixings of integer variables
0.89/0.99 c
0.89/0.99 c (restart) converted 15 cuts from the global cut pool into linear constraints
0.89/0.99 c
0.89/0.99 c presolving:
0.89/0.99 c (round 1) 27 del vars, 35 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 15 upgd conss, 20 impls, 87 clqs
0.89/1.00 c (round 2) 27 del vars, 36 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 15 upgd conss, 20 impls, 87 clqs
0.89/1.00 c presolving (3 rounds):
0.89/1.00 c 27 deleted vars, 36 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.89/1.00 c 20 implications, 87 cliques
0.89/1.00 c presolved problem has 107 variables (107 bin, 0 int, 0 impl, 0 cont) and 108 constraints
0.89/1.00 c 19 constraints of type <knapsack>
0.89/1.00 c 88 constraints of type <setppc>
0.89/1.00 c 1 constraints of type <logicor>
0.89/1.00 c transformed objective value is always integral (scale: 1)
0.89/1.00 c Presolving Time: 0.02
0.89/1.00 c
0.89/1.00 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.89/1.00 c 1.0s| 1 | 0 | 586 | - | 941k| 0 | 45 | 107 | 108 | 107 | 107 | 0 | 0 | 169 | 0.000000e+00 | -- | Inf
0.89/1.01 c 1.0s| 1 | 0 | 605 | - |1183k| 0 | 51 | 107 | 108 | 107 | 122 | 15 | 0 | 169 | 0.000000e+00 | -- | Inf
1.00/1.09 c 1.1s| 1 | 0 | 616 | - |1183k| 0 | 49 | 107 | 108 | 107 | 122 | 15 | 0 | 190 | 0.000000e+00 | -- | Inf
1.11/1.15 c 1.1s| 1 | 0 | 630 | - |1183k| 0 | 51 | 107 | 108 | 107 | 122 | 15 | 0 | 205 | 0.000000e+00 | -- | Inf
1.11/1.17 c 1.2s| 1 | 0 | 644 | - |1183k| 0 | 51 | 107 | 108 | 107 | 122 | 15 | 0 | 211 | 0.000000e+00 | -- | Inf
1.19/1.22 c 1.2s| 1 | 0 | 657 | - |1183k| 0 | 53 | 107 | 108 | 107 | 122 | 15 | 0 | 221 | 0.000000e+00 | -- | Inf
1.19/1.26 c 1.3s| 1 | 0 | 657 | - |1183k| 0 | - | 107 | 108 | 107 | 122 | 15 | 0 | 231 | 0.000000e+00 | -- | Inf
1.19/1.26 c (run 3, node 1) restarting after 24 global fixings of integer variables
1.19/1.26 c
1.19/1.26 c (restart) converted 15 cuts from the global cut pool into linear constraints
1.19/1.26 c
1.19/1.26 c presolving:
1.19/1.27 c (round 1) 25 del vars, 3 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 15 upgd conss, 36 impls, 81 clqs
1.19/1.27 c (round 2) 25 del vars, 8 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 15 upgd conss, 36 impls, 81 clqs
1.19/1.27 c presolving (3 rounds):
1.19/1.27 c 25 deleted vars, 8 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
1.19/1.27 c 36 implications, 81 cliques
1.19/1.27 c presolved problem has 82 variables (82 bin, 0 int, 0 impl, 0 cont) and 115 constraints
1.19/1.27 c 29 constraints of type <knapsack>
1.19/1.27 c 85 constraints of type <setppc>
1.19/1.27 c 1 constraints of type <logicor>
1.19/1.27 c transformed objective value is always integral (scale: 1)
1.19/1.27 c Presolving Time: 0.03
1.19/1.27 c
1.19/1.27 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.27 c 1.3s| 1 | 0 | 720 | - | 979k| 0 | 43 | 82 | 115 | 82 | 114 | 0 | 0 | 231 | 0.000000e+00 | -- | Inf
1.19/1.28 c 1.3s| 1 | 0 | 737 | - |1236k| 0 | 44 | 82 | 115 | 82 | 122 | 8 | 0 | 231 | 0.000000e+00 | -- | Inf
1.29/1.32 c 1.3s| 1 | 0 | 742 | - |1236k| 0 | 43 | 82 | 115 | 82 | 122 | 8 | 0 | 249 | 0.000000e+00 | -- | Inf
1.29/1.37 c 1.4s| 1 | 0 | 757 | - |1236k| 0 | 43 | 82 | 115 | 82 | 122 | 8 | 0 | 271 | 0.000000e+00 | -- | Inf
1.39/1.40 c 1.4s| 1 | 0 | 768 | - |1235k| 0 | 43 | 82 | 114 | 82 | 122 | 8 | 0 | 283 | 0.000000e+00 | -- | Inf
1.39/1.41 c 1.4s| 1 | 0 | 778 | - |1235k| 0 | 43 | 82 | 113 | 82 | 122 | 8 | 0 | 289 | 0.000000e+00 | -- | Inf
1.39/1.42 c 1.4s| 1 | 0 | 778 | - |1234k| 0 | - | 82 | 113 | 82 | 122 | 8 | 0 | 294 | 0.000000e+00 | -- | Inf
1.39/1.42 c (run 4, node 1) restarting after 20 global fixings of integer variables
1.39/1.42 c
1.39/1.42 c (restart) converted 8 cuts from the global cut pool into linear constraints
1.39/1.42 c
1.39/1.42 c presolving:
1.39/1.42 c (round 1) 23 del vars, 5 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 5 chg coeffs, 8 upgd conss, 76 impls, 59 clqs
1.39/1.43 c (round 2) 23 del vars, 16 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 8 chg coeffs, 8 upgd conss, 76 impls, 59 clqs
1.39/1.43 c (round 3) 23 del vars, 16 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 10 chg coeffs, 8 upgd conss, 76 impls, 59 clqs
1.39/1.43 c presolving (4 rounds):
1.39/1.43 c 23 deleted vars, 16 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 10 changed coefficients
1.39/1.43 c 76 implications, 59 cliques
1.39/1.43 c presolved problem has 59 variables (59 bin, 0 int, 0 impl, 0 cont) and 105 constraints
1.39/1.43 c 34 constraints of type <knapsack>
1.39/1.43 c 70 constraints of type <setppc>
1.39/1.43 c 1 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.04
1.39/1.43 c
1.39/1.43 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.43 c 1.4s| 1 | 0 | 827 | - | 952k| 0 | 36 | 59 | 105 | 59 | 104 | 0 | 0 | 294 | 0.000000e+00 | -- | Inf
1.39/1.44 c 1.4s| 1 | 0 | 841 | - |1193k| 0 | 39 | 59 | 105 | 59 | 116 | 12 | 0 | 294 | 0.000000e+00 | -- | Inf
1.39/1.46 c 1.5s| 1 | 0 | 865 | - |1192k| 0 | 33 | 59 | 103 | 59 | 116 | 12 | 0 | 304 | 0.000000e+00 | -- | Inf
1.39/1.49 c 1.5s| 1 | 0 | 934 | - |1191k| 0 | 0 | 59 | 102 | 59 | 116 | 12 | 0 | 320 | 0.000000e+00 | -- | Inf
1.39/1.50 c * 1.5s| 1 | 0 | 934 | - |1193k| 0 | - | 59 | 102 | 59 | 116 | 12 | 0 | 320 | 0.000000e+00 | 0.000000e+00 | 0.00%
1.39/1.50 c
1.39/1.50 c SCIP Status : problem is solved [optimal solution found]
1.39/1.50 c Solving Time (sec) : 1.49
1.39/1.50 c Solving Nodes : 1 (total of 5 nodes in 5 runs)
1.39/1.50 c Primal Bound : +0.00000000000000e+00 (1 solutions)
1.39/1.50 c Dual Bound : +0.00000000000000e+00
1.39/1.50 c Gap : 0.00 %
1.39/1.50 s SATISFIABLE
1.39/1.50 v -x169 -x168 -x167 -x166 -x165 -x164 x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 x154 -x153 -x152 -x151 -x150 -x149 -x148
1.39/1.50 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 x132 -x131 -x130 -x129 -x128 -x127
1.39/1.50 v -x126 x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
1.39/1.50 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.39/1.50 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
1.39/1.50 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
1.39/1.50 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.39/1.50 v -x4 -x3 -x2 -x1
1.39/1.50 c SCIP Status : problem is solved [optimal solution found]
1.39/1.50 c Total Time : 1.49
1.39/1.50 c solving : 1.49
1.39/1.50 c presolving : 0.04 (included in solving)
1.39/1.50 c reading : 0.00 (included in solving)
1.39/1.50 c Original Problem :
1.39/1.50 c Problem name : HOME/instance-3451132-1307067566.opb
1.39/1.50 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.39/1.50 c Constraints : 101 initial, 101 maximal
1.39/1.50 c Presolved Problem :
1.39/1.50 c Problem name : t_HOME/instance-3451132-1307067566.opb
1.39/1.50 c Variables : 59 (59 binary, 0 integer, 0 implicit integer, 0 continuous)
1.39/1.50 c Constraints : 105 initial, 105 maximal
1.39/1.50 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
1.39/1.50 c trivial : 0.00 106 0 0 0 0 0 0 0 0
1.39/1.50 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
1.39/1.50 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
1.39/1.50 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
1.39/1.50 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
1.39/1.50 c implics : 0.00 0 0 0 0 0 0 0 0 0
1.39/1.50 c probing : 0.00 0 0 0 0 0 0 0 0 0
1.39/1.50 c knapsack : 0.02 0 0 0 0 0 0 0 0 11
1.39/1.50 c setppc : 0.00 0 4 0 0 0 31 0 0 0
1.39/1.50 c linear : 0.00 0 0 0 0 0 29 0 1 0
1.39/1.50 c logicor : 0.00 0 0 0 0 0 31 0 0 0
1.39/1.50 c root node : - 116 - - 116 - - - - -
1.39/1.50 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
1.39/1.50 c integral : 0 0 0 27 0 8 0 0 116 0 0 0
1.39/1.50 c knapsack : 34 9 27 1 0 1 0 0 0 0 0 0
1.39/1.50 c setppc : 70 9 27 1 0 1 0 0 0 0 0 0
1.39/1.50 c logicor : 1 4 6 0 0 0 0 0 0 0 0 0
1.39/1.50 c countsols : 0 0 0 1 0 3 0 0 0 0 0 0
1.39/1.50 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
1.39/1.50 c integral : 1.33 0.00 0.00 1.33 0.00 0.00 0.00
1.39/1.50 c knapsack : 0.01 0.01 0.00 0.00 0.00 0.00 0.00
1.39/1.50 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.39/1.50 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.39/1.50 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.39/1.50 c Propagators : #Propagate #Resprop Cutoffs DomReds
1.39/1.50 c vbounds : 0 0 0 0
1.39/1.50 c rootredcost : 0 0 0 0
1.39/1.50 c pseudoobj : 0 0 0 0
1.39/1.50 c Propagator Timings : TotalTime Propagate Resprop
1.39/1.50 c vbounds : 0.00 0.00 0.00
1.39/1.50 c rootredcost : 0.00 0.00 0.00
1.39/1.50 c pseudoobj : 0.00 0.00 0.00
1.39/1.50 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.39/1.50 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.39/1.50 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.39/1.50 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.39/1.50 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.39/1.50 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.39/1.50 c applied globally : - - - 0 0.0 - - -
1.49/1.50 c applied locally : - - - 0 0.0 - - -
1.49/1.50 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.49/1.50 c cut pool : 0.00 0 - - 0 - (maximal pool size: 141)
1.49/1.50 c redcost : 0.00 9 0 0 0 0
1.49/1.50 c impliedbounds : 0.00 9 0 0 0 0
1.49/1.50 c intobj : 0.00 0 0 0 0 0
1.49/1.50 c gomory : 0.03 9 0 0 113 0
1.49/1.50 c cgmip : 0.00 0 0 0 0 0
1.49/1.50 c closecuts : 0.00 0 0 0 0 0
1.49/1.50 c strongcg : 0.02 9 0 0 420 0
1.49/1.50 c cmir : 0.00 0 0 0 0 0
1.49/1.50 c flowcover : 0.00 0 0 0 0 0
1.49/1.50 c clique : 0.00 9 0 0 42 0
1.49/1.50 c zerohalf : 0.00 0 0 0 0 0
1.49/1.50 c mcf : 0.00 5 0 0 0 0
1.49/1.50 c oddcycle : 0.00 0 0 0 0 0
1.49/1.50 c rapidlearning : 0.02 1 0 0 0 45
1.49/1.50 c Pricers : Time Calls Vars
1.49/1.50 c problem variables: 0.00 0 0
1.49/1.50 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.49/1.50 c relpscost : 1.33 26 0 116 0 0 0
1.49/1.50 c pscost : 0.00 0 0 0 0 0 0
1.49/1.50 c inference : 0.00 0 0 0 0 0 0
1.49/1.50 c mostinf : 0.00 0 0 0 0 0 0
1.49/1.50 c leastinf : 0.00 0 0 0 0 0 0
1.49/1.50 c fullstrong : 0.00 0 0 0 0 0 0
1.49/1.50 c allfullstrong : 0.00 0 0 0 0 0 0
1.49/1.50 c random : 0.00 0 0 0 0 0 0
1.49/1.50 c Primal Heuristics : Time Calls Found
1.49/1.50 c LP solutions : 0.00 - 0
1.49/1.50 c pseudo solutions : 0.00 - 0
1.49/1.50 c trivial : 0.00 1 0
1.49/1.50 c shiftandpropagate: 0.00 0 0
1.49/1.50 c simplerounding : 0.00 0 0
1.49/1.50 c zirounding : 0.00 0 0
1.49/1.50 c rounding : 0.00 0 0
1.49/1.50 c shifting : 0.00 0 0
1.49/1.50 c intshifting : 0.00 0 0
1.49/1.50 c oneopt : 0.00 0 0
1.49/1.50 c twoopt : 0.00 0 0
1.49/1.50 c fixandinfer : 0.00 0 0
1.49/1.50 c feaspump : 0.00 0 0
1.49/1.50 c clique : 0.00 0 0
1.49/1.50 c coefdiving : 0.00 0 0
1.49/1.50 c pscostdiving : 0.00 0 0
1.49/1.50 c fracdiving : 0.00 0 0
1.49/1.50 c veclendiving : 0.00 0 0
1.49/1.50 c intdiving : 0.00 0 0
1.49/1.50 c actconsdiving : 0.00 0 0
1.49/1.50 c objpscostdiving : 0.00 0 0
1.49/1.50 c rootsoldiving : 0.00 0 0
1.49/1.50 c linesearchdiving : 0.00 0 0
1.49/1.50 c guideddiving : 0.00 0 0
1.49/1.50 c octane : 0.00 0 0
1.49/1.50 c rens : 0.00 0 0
1.49/1.50 c rins : 0.00 0 0
1.49/1.50 c localbranching : 0.00 0 0
1.49/1.50 c mutation : 0.00 0 0
1.49/1.50 c crossover : 0.00 0 0
1.49/1.50 c dins : 0.00 0 0
1.49/1.50 c vbounds : 0.00 0 0
1.49/1.50 c undercover : 0.00 0 0
1.49/1.50 c subnlp : 0.00 0 0
1.49/1.50 c trysol : 0.00 0 0
1.49/1.50 c LP : Time Calls Iterations Iter/call Iter/sec
1.49/1.50 c primal LP : 0.00 0 0 0.00 -
1.49/1.50 c dual LP : 0.03 36 934 25.94 34549.09
1.49/1.50 c lex dual LP : 0.00 0 0 0.00 -
1.49/1.50 c barrier LP : 0.00 0 0 0.00 -
1.49/1.50 c diving/probing LP: 0.00 0 0 0.00 -
1.49/1.50 c strong branching : 1.33 320 46373 144.92 34777.41
1.49/1.50 c (at root node) : - 320 46373 144.92 -
1.49/1.50 c conflict analysis: 0.00 0 0 0.00 -
1.49/1.50 c B&B Tree :
1.49/1.50 c number of runs : 5
1.49/1.50 c nodes : 1
1.49/1.50 c nodes (total) : 5
1.49/1.50 c nodes left : 0
1.49/1.50 c max depth : 0
1.49/1.50 c max depth (total): 0
1.49/1.50 c backtracks : 0 (0.0%)
1.49/1.50 c delayed cutoffs : 0
1.49/1.50 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.49/1.50 c avg switch length: 2.00
1.49/1.50 c switching time : 0.00
1.49/1.50 c Solution :
1.49/1.50 c Solutions found : 1 (1 improvements)
1.49/1.50 c First Solution : +0.00000000000000e+00 (in run 5, after 1 nodes, 1.49 seconds, depth 0, found by <relaxation>)
1.49/1.50 c Primal Bound : +0.00000000000000e+00 (in run 5, after 1 nodes, 1.49 seconds, depth 0, found by <relaxation>)
1.49/1.50 c Dual Bound : +0.00000000000000e+00
1.49/1.50 c Gap : 0.00 %
1.49/1.50 c Root Dual Bound : +0.00000000000000e+00
1.49/1.50 c Root Iterations : 934
1.49/1.50 c Time complete: 1.5.