0.00/0.01 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.01 c Copyright (c) 2002-2011 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01 c
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c reading problem <HOME/instance-3452847-1307067410.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.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.4
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.02 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/zirounding/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/cmir/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/flowcover/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/rapidlearning/freq = 0
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 c
0.00/0.02 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.02 c 0.0s| 1 | 0 | 97 | - | 762k| 0 | 43 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.04 c 0.0s| 1 | 0 | 119 | - |1008k| 0 | 50 | 169 | 115 | 169 | 84 | 11 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.05 c 0.0s| 1 | 0 | 146 | - |1304k| 0 | 54 | 169 | 115 | 169 | 91 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.06 c 0.1s| 1 | 0 | 176 | - |1535k| 0 | 53 | 169 | 115 | 169 | 97 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.07 c 0.1s| 1 | 0 | 209 | - |1705k| 0 | 56 | 169 | 115 | 169 | 102 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.08 c 0.1s| 1 | 0 | 254 | - |1742k| 0 | 59 | 169 | 115 | 169 | 105 | 32 | 0 | 0 | 0.000000e+00 | -- | Inf
0.18/0.20 c 0.2s| 1 | 0 | 344 | - |1734k| 0 | 51 | 169 | 107 | 169 | 105 | 32 | 0 | 15 | 0.000000e+00 | -- | Inf
0.18/0.22 c 0.2s| 1 | 0 | 391 | - |1702k| 0 | 51 | 169 | 74 | 169 | 105 | 32 | 0 | 22 | 0.000000e+00 | -- | Inf
0.18/0.24 c 0.2s| 1 | 0 | 416 | - |1702k| 0 | 47 | 169 | 74 | 169 | 105 | 32 | 0 | 28 | 0.000000e+00 | -- | Inf
0.18/0.26 c 0.3s| 1 | 0 | 424 | - |1702k| 0 | 47 | 169 | 74 | 169 | 105 | 32 | 0 | 37 | 0.000000e+00 | -- | Inf
0.18/0.27 c 0.3s| 1 | 0 | 430 | - |1701k| 0 | 46 | 169 | 73 | 169 | 105 | 32 | 0 | 45 | 0.000000e+00 | -- | Inf
0.18/0.28 c 0.3s| 1 | 0 | 441 | - |1701k| 0 | 45 | 169 | 73 | 169 | 97 | 32 | 0 | 51 | 0.000000e+00 | -- | Inf
0.18/0.29 c 0.3s| 1 | 0 | 441 | - |1701k| 0 | - | 169 | 73 | 169 | 97 | 32 | 0 | 58 | 0.000000e+00 | -- | Inf
0.18/0.29 c (run 1, node 1) restarting after 35 global fixings of integer variables
0.18/0.29 c
0.18/0.29 c (restart) converted 23 cuts from the global cut pool into linear constraints
0.18/0.29 c
0.18/0.29 c presolving:
0.18/0.29 c (round 1) 35 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 24 upgd conss, 14 impls, 81 clqs
0.29/0.30 c (round 2) 35 del vars, 2 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 24 upgd conss, 14 impls, 81 clqs
0.29/0.30 c presolving (3 rounds):
0.29/0.30 c 35 deleted vars, 2 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.30 c 14 implications, 81 cliques
0.29/0.30 c presolved problem has 134 variables (134 bin, 0 int, 0 impl, 0 cont) and 94 constraints
0.29/0.30 c 7 constraints of type <knapsack>
0.29/0.30 c 86 constraints of type <setppc>
0.29/0.30 c 1 constraints of type <logicor>
0.29/0.30 c transformed objective value is always integral (scale: 1)
0.29/0.30 c Presolving Time: 0.01
0.29/0.30 c
0.29/0.30 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.30 c 0.3s| 1 | 0 | 519 | - | 843k| 0 | 41 | 134 | 94 | 134 | 93 | 0 | 0 | 58 | 0.000000e+00 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 534 | - |1086k| 0 | 46 | 134 | 94 | 134 | 102 | 9 | 0 | 58 | 0.000000e+00 | -- | Inf
0.29/0.35 c 0.3s| 1 | 0 | 561 | - |1085k| 0 | 47 | 134 | 94 | 134 | 102 | 9 | 0 | 79 | 0.000000e+00 | -- | Inf
0.29/0.36 c 0.4s| 1 | 0 | 570 | - |1085k| 0 | 45 | 134 | 94 | 134 | 102 | 9 | 0 | 85 | 0.000000e+00 | -- | Inf
0.29/0.38 c 0.4s| 1 | 0 | 576 | - |1085k| 0 | 47 | 134 | 93 | 134 | 102 | 9 | 0 | 94 | 0.000000e+00 | -- | Inf
0.29/0.39 c 0.4s| 1 | 0 | 585 | - |1085k| 0 | 46 | 134 | 93 | 134 | 102 | 9 | 0 | 100 | 0.000000e+00 | -- | Inf
0.38/0.40 c 0.4s| 1 | 0 | 591 | - |1085k| 0 | 46 | 134 | 93 | 134 | 102 | 9 | 0 | 105 | 0.000000e+00 | -- | Inf
0.38/0.41 c 0.4s| 1 | 0 | 591 | - |1085k| 0 | - | 134 | 93 | 134 | 102 | 9 | 0 | 110 | 0.000000e+00 | -- | Inf
0.38/0.41 c (run 2, node 1) restarting after 29 global fixings of integer variables
0.38/0.41 c
0.38/0.41 c (restart) converted 9 cuts from the global cut pool into linear constraints
0.38/0.41 c
0.38/0.41 c presolving:
0.38/0.42 c (round 1) 30 del vars, 2 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 30 impls, 75 clqs
0.38/0.42 c (round 2) 30 del vars, 10 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 30 impls, 75 clqs
0.38/0.42 c presolving (3 rounds):
0.38/0.42 c 30 deleted vars, 10 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.38/0.42 c 30 implications, 75 cliques
0.38/0.42 c presolved problem has 104 variables (104 bin, 0 int, 0 impl, 0 cont) and 92 constraints
0.38/0.42 c 11 constraints of type <knapsack>
0.38/0.42 c 81 constraints of type <setppc>
0.38/0.42 c transformed objective value is always integral (scale: 1)
0.38/0.42 c Presolving Time: 0.02
0.38/0.42 c
0.38/0.42 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.38/0.42 c 0.4s| 1 | 0 | 654 | - | 841k| 0 | 36 | 104 | 92 | 104 | 92 | 0 | 0 | 110 | 0.000000e+00 | -- | Inf
0.38/0.43 c 0.4s| 1 | 0 | 683 | - |1206k| 0 | 43 | 104 | 92 | 104 | 108 | 16 | 0 | 110 | 0.000000e+00 | -- | Inf
0.38/0.46 c 0.5s| 1 | 0 | 732 | - |1205k| 0 | 43 | 104 | 92 | 104 | 108 | 16 | 0 | 117 | 0.000000e+00 | -- | Inf
0.38/0.49 c 0.5s| 1 | 0 | 758 | - |1203k| 0 | 39 | 104 | 88 | 104 | 108 | 16 | 0 | 127 | 0.000000e+00 | -- | Inf
0.49/0.50 c 0.5s| 1 | 0 | 758 | - |1203k| 0 | - | 104 | 88 | 104 | 108 | 16 | 0 | 136 | 0.000000e+00 | -- | Inf
0.49/0.50 c (run 3, node 1) restarting after 25 global fixings of integer variables
0.49/0.50 c
0.49/0.50 c (restart) converted 16 cuts from the global cut pool into linear constraints
0.49/0.50 c
0.49/0.50 c presolving:
0.49/0.50 c (round 1) 41 del vars, 12 del conss, 0 add conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 54 impls, 46 clqs
0.49/0.51 c (round 2) 41 del vars, 17 del conss, 0 add conss, 1 chg bounds, 2 chg sides, 9 chg coeffs, 14 upgd conss, 54 impls, 46 clqs
0.49/0.51 c (round 3) 41 del vars, 23 del conss, 0 add conss, 1 chg bounds, 2 chg sides, 16 chg coeffs, 14 upgd conss, 54 impls, 46 clqs
0.49/0.51 c (round 4) 41 del vars, 23 del conss, 0 add conss, 1 chg bounds, 2 chg sides, 21 chg coeffs, 14 upgd conss, 54 impls, 46 clqs
0.49/0.51 c (round 5) 41 del vars, 23 del conss, 0 add conss, 1 chg bounds, 2 chg sides, 23 chg coeffs, 14 upgd conss, 54 impls, 46 clqs
0.49/0.51 c presolving (6 rounds):
0.49/0.51 c 41 deleted vars, 23 deleted constraints, 0 added constraints, 1 tightened bounds, 0 added holes, 2 changed sides, 23 changed coefficients
0.49/0.51 c 54 implications, 46 cliques
0.49/0.51 c presolved problem has 63 variables (63 bin, 0 int, 0 impl, 0 cont) and 81 constraints
0.49/0.51 c 23 constraints of type <knapsack>
0.49/0.51 c 58 constraints of type <setppc>
0.49/0.51 c transformed objective value is always integral (scale: 1)
0.49/0.51 c Presolving Time: 0.03
0.49/0.51 c
0.49/0.51 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.51 c 0.5s| 1 | 0 | 806 | - | 856k| 0 | 33 | 63 | 81 | 63 | 81 | 0 | 0 | 136 | 0.000000e+00 | -- | Inf
0.49/0.52 c 0.5s| 1 | 0 | 807 | - | 954k| 0 | 0 | 63 | 81 | 63 | 85 | 4 | 0 | 136 | 0.000000e+00 | -- | Inf
0.49/0.52 c * 0.5s| 1 | 0 | 807 | - | 956k| 0 | - | 63 | 81 | 63 | 85 | 4 | 0 | 136 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.49/0.52 c
0.49/0.52 c SCIP Status : problem is solved [optimal solution found]
0.49/0.52 c Solving Time (sec) : 0.51
0.49/0.52 c Solving Nodes : 1 (total of 4 nodes in 4 runs)
0.49/0.52 c Primal Bound : +0.00000000000000e+00 (1 solutions)
0.49/0.52 c Dual Bound : +0.00000000000000e+00
0.49/0.52 c Gap : 0.00 %
0.49/0.52 s SATISFIABLE
0.49/0.52 v -x169 -x168 -x167 -x166 x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 x154 -x153 -x152 -x151 -x150 -x149 -x148
0.49/0.52 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 x131 -x130 -x129 -x128 -x127
0.49/0.52 v -x126 -x125 x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 x108 -x107 -x106
0.49/0.52 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
0.49/0.52 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
0.49/0.52 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
0.49/0.52 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
0.49/0.52 v -x4 -x3 -x2 -x1
0.49/0.52 c SCIP Status : problem is solved [optimal solution found]
0.49/0.52 c Total Time : 0.51
0.49/0.52 c solving : 0.51
0.49/0.52 c presolving : 0.03 (included in solving)
0.49/0.52 c reading : 0.00 (included in solving)
0.49/0.52 c Original Problem :
0.49/0.52 c Problem name : HOME/instance-3452847-1307067410.opb
0.49/0.52 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.52 c Constraints : 101 initial, 101 maximal
0.49/0.52 c Presolved Problem :
0.49/0.52 c Problem name : t_HOME/instance-3452847-1307067410.opb
0.49/0.52 c Variables : 63 (63 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.52 c Constraints : 81 initial, 81 maximal
0.49/0.52 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.49/0.52 c trivial : 0.00 89 0 0 0 0 0 0 0 0
0.49/0.52 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.52 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.52 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.52 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.52 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.52 c knapsack : 0.02 0 0 0 0 0 0 0 2 23
0.49/0.52 c setppc : 0.00 13 3 0 0 0 32 0 0 0
0.49/0.52 c linear : 0.00 1 0 0 1 0 30 0 0 0
0.49/0.52 c logicor : 0.00 0 0 0 0 0 1 0 0 0
0.49/0.52 c root node : - 89 - - 89 - - - - -
0.49/0.52 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.49/0.52 c integral : 0 0 0 17 0 6 0 0 79 0 0 0
0.49/0.52 c knapsack : 23 8 18 1 0 0 0 0 0 0 0 0
0.49/0.52 c setppc : 58 8 18 1 0 0 0 0 10 0 0 0
0.49/0.52 c countsols : 0 0 0 1 0 2 0 0 0 0 0 0
0.49/0.52 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.49/0.52 c integral : 0.37 0.00 0.00 0.37 0.00 0.00 0.00
0.49/0.52 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.52 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.52 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.52 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.49/0.52 c vbounds : 0 0 0 0
0.49/0.52 c rootredcost : 0 0 0 0
0.49/0.52 c pseudoobj : 0 0 0 0
0.49/0.52 c Propagator Timings : TotalTime Propagate Resprop
0.49/0.52 c vbounds : 0.00 0.00 0.00
0.49/0.52 c rootredcost : 0.00 0.00 0.00
0.49/0.52 c pseudoobj : 0.00 0.00 0.00
0.49/0.52 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.49/0.52 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.52 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.52 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.52 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.52 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.52 c applied globally : - - - 0 0.0 - - -
0.49/0.52 c applied locally : - - - 0 0.0 - - -
0.49/0.52 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.49/0.52 c cut pool : 0.00 0 - - 0 - (maximal pool size: 47)
0.49/0.52 c redcost : 0.00 8 0 0 0 0
0.49/0.52 c impliedbounds : 0.00 8 0 0 0 0
0.49/0.52 c intobj : 0.00 0 0 0 0 0
0.49/0.52 c gomory : 0.02 8 0 0 89 0
0.49/0.52 c cgmip : 0.00 0 0 0 0 0
0.49/0.52 c closecuts : 0.00 0 0 0 0 0
0.49/0.52 c strongcg : 0.03 8 0 0 411 0
0.49/0.52 c cmir : 0.00 0 0 0 0 0
0.49/0.52 c flowcover : 0.00 0 0 0 0 0
0.49/0.52 c clique : 0.00 8 0 0 35 0
0.49/0.52 c zerohalf : 0.00 0 0 0 0 0
0.49/0.52 c mcf : 0.00 4 0 0 0 0
0.49/0.52 c oddcycle : 0.00 0 0 0 0 0
0.49/0.52 c rapidlearning : 0.02 1 0 0 0 42
0.49/0.52 c Pricers : Time Calls Vars
0.49/0.52 c problem variables: 0.00 0 0
0.49/0.52 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.49/0.52 c relpscost : 0.37 16 0 79 0 0 0
0.49/0.52 c pscost : 0.00 0 0 0 0 0 0
0.49/0.52 c inference : 0.00 0 0 0 0 0 0
0.49/0.52 c mostinf : 0.00 0 0 0 0 0 0
0.49/0.52 c leastinf : 0.00 0 0 0 0 0 0
0.49/0.52 c fullstrong : 0.00 0 0 0 0 0 0
0.49/0.52 c allfullstrong : 0.00 0 0 0 0 0 0
0.49/0.52 c random : 0.00 0 0 0 0 0 0
0.49/0.52 c Primal Heuristics : Time Calls Found
0.49/0.52 c LP solutions : 0.00 - 1
0.49/0.52 c pseudo solutions : 0.00 - 0
0.49/0.52 c trivial : 0.00 1 0
0.49/0.52 c shiftandpropagate: 0.00 0 0
0.49/0.52 c simplerounding : 0.00 0 0
0.49/0.52 c zirounding : 0.00 0 0
0.49/0.52 c rounding : 0.00 0 0
0.49/0.52 c shifting : 0.00 0 0
0.49/0.52 c intshifting : 0.00 0 0
0.49/0.52 c oneopt : 0.00 0 0
0.49/0.52 c twoopt : 0.00 0 0
0.49/0.52 c fixandinfer : 0.00 0 0
0.49/0.52 c feaspump : 0.00 0 0
0.49/0.52 c clique : 0.00 0 0
0.49/0.52 c coefdiving : 0.00 0 0
0.49/0.52 c pscostdiving : 0.00 0 0
0.49/0.52 c fracdiving : 0.00 0 0
0.49/0.52 c veclendiving : 0.00 0 0
0.49/0.52 c intdiving : 0.00 0 0
0.49/0.52 c actconsdiving : 0.00 0 0
0.49/0.52 c objpscostdiving : 0.00 0 0
0.49/0.52 c rootsoldiving : 0.00 0 0
0.49/0.52 c linesearchdiving : 0.00 0 0
0.49/0.52 c guideddiving : 0.00 0 0
0.49/0.52 c octane : 0.00 0 0
0.49/0.52 c rens : 0.00 0 0
0.49/0.52 c rins : 0.00 0 0
0.49/0.52 c localbranching : 0.00 0 0
0.49/0.52 c mutation : 0.00 0 0
0.49/0.52 c crossover : 0.00 0 0
0.49/0.52 c dins : 0.00 0 0
0.49/0.52 c vbounds : 0.00 0 0
0.49/0.52 c undercover : 0.00 0 0
0.49/0.52 c subnlp : 0.00 0 0
0.49/0.52 c trysol : 0.00 0 0
0.49/0.52 c LP : Time Calls Iterations Iter/call Iter/sec
0.49/0.52 c primal LP : 0.00 0 0 0.00 -
0.49/0.52 c dual LP : 0.02 25 807 32.28 34105.32
0.49/0.52 c lex dual LP : 0.00 0 0 0.00 -
0.49/0.52 c barrier LP : 0.00 0 0 0.00 -
0.49/0.52 c diving/probing LP: 0.00 0 0 0.00 -
0.49/0.52 c strong branching : 0.37 136 12034 88.49 32648.21
0.49/0.52 c (at root node) : - 136 12034 88.49 -
0.49/0.52 c conflict analysis: 0.00 0 0 0.00 -
0.49/0.52 c B&B Tree :
0.49/0.52 c number of runs : 4
0.49/0.52 c nodes : 1
0.49/0.52 c nodes (total) : 4
0.49/0.52 c nodes left : 0
0.49/0.52 c max depth : 0
0.49/0.52 c max depth (total): 0
0.49/0.52 c backtracks : 0 (0.0%)
0.49/0.52 c delayed cutoffs : 0
0.49/0.52 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.49/0.52 c avg switch length: 2.00
0.49/0.52 c switching time : 0.00
0.49/0.52 c Solution :
0.49/0.52 c Solutions found : 1 (1 improvements)
0.49/0.52 c First Solution : +0.00000000000000e+00 (in run 4, after 1 nodes, 0.51 seconds, depth 0, found by <relaxation>)
0.49/0.52 c Primal Bound : +0.00000000000000e+00 (in run 4, after 1 nodes, 0.51 seconds, depth 0, found by <relaxation>)
0.49/0.52 c Dual Bound : +0.00000000000000e+00
0.49/0.52 c Gap : 0.00 %
0.49/0.52 c Root Dual Bound : +0.00000000000000e+00
0.49/0.52 c Root Iterations : 807
0.49/0.52 c Time complete: 0.51.