0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
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-3488271-1307789020.opb>
0.00/0.01 c original problem has 1598 variables (1598 bin, 0 int, 0 impl, 0 cont) and 1750 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.04 c (round 1) 0 del vars, 1698 del conss, 100 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 51 upgd conss, 12084 impls, 99 clqs
0.00/0.05 c (round 2) 1498 del vars, 1698 del conss, 100 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 12084 impls, 0 clqs
0.00/0.05 c presolving (3 rounds):
0.00/0.05 c 1498 deleted vars, 1698 deleted constraints, 100 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.05 c 12084 implications, 0 cliques
0.00/0.05 c presolved problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 152 constraints
0.00/0.05 c 101 constraints of type <knapsack>
0.00/0.05 c 50 constraints of type <setppc>
0.00/0.05 c 1 constraints of type <linear>
0.00/0.05 c transformed objective value is always integral (scale: 1)
0.00/0.05 c Presolving Time: 0.04
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c # SCIP version 2.0.1.5
0.00/0.05 c
0.00/0.05 c # frequency for displaying node information lines
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.05 c display/freq = 10000
0.00/0.05 c
0.00/0.05 c # maximal time in seconds to run
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/time = 1797
0.00/0.05 c
0.00/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/memory = 13950
0.00/0.05 c
0.00/0.05 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c limits/solutions = 1
0.00/0.05 c
0.00/0.05 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.05 c separating/maxrounds = 1
0.00/0.05 c
0.00/0.05 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/maxroundsroot = 5
0.00/0.05 c
0.00/0.05 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.05 c # [type: int, range: [1,2], default: 1]
0.00/0.05 c timing/clocktype = 2
0.00/0.05 c
0.00/0.05 c # belongs reading time to solving time?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c timing/reading = TRUE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify inequalities
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/linear/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/indicator/addCouplingCons = TRUE
0.00/0.05 c
0.00/0.05 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.05 c constraints/knapsack/disaggregation = FALSE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify knapsacks
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c presolving/probing/maxrounds = 0
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/coefdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.05 c heuristics/crossover/freq = -1
0.00/0.05 c
0.00/0.05 c # number of nodes added to the contingent of the total nodes
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.05 c heuristics/crossover/nodesofs = 750
0.00/0.05 c
0.00/0.05 c # number of nodes without incumbent change that heuristic should wait
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.05 c heuristics/crossover/nwaitingnodes = 100
0.00/0.05 c
0.00/0.05 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.05 c # [type: real, range: [0,1], default: 0.1]
0.00/0.05 c heuristics/crossover/nodesquot = 0.15
0.00/0.05 c
0.00/0.05 c # minimum percentage of integer variables that have to be fixed
0.00/0.05 c # [type: real, range: [0,1], default: 0.666]
0.00/0.05 c heuristics/crossover/minfixingrate = 0.5
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/feaspump/freq = -1
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/fracdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/guideddiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/intshifting/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/linesearchdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/objpscostdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.05 c # [type: real, range: [0,1], default: 0.01]
0.00/0.05 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/oneopt/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/pscostdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/rens/freq = -1
0.00/0.05 c
0.00/0.05 c # minimum percentage of integer variables that have to be fixable
0.00/0.05 c # [type: real, range: [0,1], default: 0.5]
0.00/0.05 c heuristics/rens/minfixingrate = 0.3
0.00/0.05 c
0.00/0.05 c # number of nodes added to the contingent of the total nodes
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.05 c heuristics/rens/nodesofs = 2000
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/rootsoldiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.05 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/rounding/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/shiftandpropagate/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/shifting/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/simplerounding/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/subnlp/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/trivial/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/trysol/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/undercover/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/veclendiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/zirounding/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c separating/cmir/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c separating/flowcover/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/rapidlearning/freq = 0
0.00/0.05 c
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c start solving
0.00/0.05 c
0.00/0.05 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.05 c 0.1s| 1 | 0 | 78 | - |4253k| 0 | 48 | 100 | 152 | 100 | 152 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.09 c 0.1s| 1 | 0 | 164 | - |4348k| 0 | 100 | 100 | 173 | 100 | 171 | 19 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.19 c 0.2s| 1 | 0 | 173 | - |4306k| 0 | 92 | 100 | 153 | 100 | 171 | 19 | 0 | 8 | 0.000000e+00 | -- | Inf
0.19/0.30 c 0.3s| 1 | 0 | 180 | - |4286k| 0 | 86 | 100 | 147 | 100 | 171 | 19 | 0 | 19 | 0.000000e+00 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 185 | - |4290k| 0 | 82 | 100 | 147 | 100 | 172 | 20 | 0 | 19 | 0.000000e+00 | -- | Inf
0.29/0.37 c 0.4s| 1 | 0 | 212 | - |4269k| 0 | 84 | 100 | 141 | 100 | 172 | 20 | 0 | 25 | 0.000000e+00 | -- | Inf
0.29/0.38 c 0.4s| 1 | 0 | 213 | - |4277k| 0 | 84 | 100 | 141 | 100 | 173 | 21 | 0 | 25 | 0.000000e+00 | -- | Inf
0.39/0.42 c 0.4s| 1 | 0 | 224 | - |4262k| 0 | 80 | 100 | 137 | 100 | 173 | 21 | 0 | 30 | 0.000000e+00 | -- | Inf
0.39/0.46 c 0.5s| 1 | 0 | 224 | - |4255k| 0 | - | 100 | 137 | 100 | 173 | 21 | 0 | 37 | 0.000000e+00 | -- | Inf
0.39/0.46 c (run 1, node 1) restarting after 25 global fixings of integer variables
0.39/0.46 c
0.39/0.46 c (restart) converted 5 cuts from the global cut pool into linear constraints
0.39/0.46 c
0.39/0.46 c presolving:
0.39/0.46 c (round 1) 25 del vars, 27 del conss, 0 add conss, 0 chg bounds, 76 chg sides, 76 chg coeffs, 0 upgd conss, 12084 impls, 0 clqs
0.39/0.47 c (round 2) 25 del vars, 27 del conss, 0 add conss, 0 chg bounds, 76 chg sides, 76 chg coeffs, 9 upgd conss, 12084 impls, 0 clqs
0.39/0.47 c (round 3) 25 del vars, 27 del conss, 0 add conss, 0 chg bounds, 80 chg sides, 81 chg coeffs, 9 upgd conss, 12084 impls, 0 clqs
0.39/0.47 c presolving (4 rounds):
0.39/0.47 c 25 deleted vars, 27 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 80 changed sides, 81 changed coefficients
0.39/0.47 c 12084 implications, 0 cliques
0.39/0.47 c presolved problem has 75 variables (75 bin, 0 int, 0 impl, 0 cont) and 115 constraints
0.39/0.47 c 81 constraints of type <knapsack>
0.39/0.47 c 29 constraints of type <setppc>
0.39/0.47 c 1 constraints of type <linear>
0.39/0.47 c 4 constraints of type <logicor>
0.39/0.47 c transformed objective value is always integral (scale: 1)
0.39/0.47 c Presolving Time: 0.04
0.39/0.47 c
0.39/0.47 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.47 c 0.5s| 1 | 0 | 309 | - |4046k| 0 | 52 | 75 | 115 | 75 | 111 | 0 | 0 | 37 | 0.000000e+00 | -- | Inf
0.39/0.48 c 0.5s| 1 | 0 | 325 | - |4141k| 0 | 61 | 75 | 115 | 75 | 130 | 19 | 0 | 37 | 0.000000e+00 | -- | Inf
0.49/0.50 c 0.5s| 1 | 0 | 334 | - |4126k| 0 | 58 | 75 | 111 | 75 | 130 | 19 | 0 | 42 | 0.000000e+00 | -- | Inf
0.49/0.52 c 0.5s| 1 | 0 | 348 | - |4112k| 0 | 57 | 75 | 107 | 75 | 130 | 19 | 0 | 47 | 0.000000e+00 | -- | Inf
0.49/0.53 c 0.5s| 1 | 0 | 379 | - |4098k| 0 | 52 | 75 | 103 | 75 | 130 | 19 | 0 | 52 | 0.000000e+00 | -- | Inf
0.49/0.55 c 0.5s| 1 | 0 | 379 | - |4092k| 0 | - | 75 | 103 | 75 | 130 | 19 | 0 | 57 | 0.000000e+00 | -- | Inf
0.49/0.55 c (run 2, node 1) restarting after 20 global fixings of integer variables
0.49/0.55 c
0.49/0.55 c (restart) converted 2 cuts from the global cut pool into linear constraints
0.49/0.55 c
0.49/0.55 c presolving:
0.49/0.55 c (round 1) 20 del vars, 27 del conss, 0 add conss, 0 chg bounds, 81 chg sides, 84 chg coeffs, 2 upgd conss, 12084 impls, 0 clqs
0.49/0.55 c (round 2) 20 del vars, 27 del conss, 0 add conss, 0 chg bounds, 81 chg sides, 86 chg coeffs, 2 upgd conss, 12084 impls, 0 clqs
0.49/0.55 c (round 3) 20 del vars, 27 del conss, 0 add conss, 0 chg bounds, 81 chg sides, 90 chg coeffs, 2 upgd conss, 12084 impls, 0 clqs
0.49/0.55 c (round 4) 20 del vars, 27 del conss, 0 add conss, 0 chg bounds, 81 chg sides, 93 chg coeffs, 2 upgd conss, 12084 impls, 0 clqs
0.49/0.55 c (round 5) 20 del vars, 27 del conss, 0 add conss, 0 chg bounds, 81 chg sides, 95 chg coeffs, 2 upgd conss, 12084 impls, 0 clqs
0.49/0.55 c (round 6) 20 del vars, 27 del conss, 0 add conss, 0 chg bounds, 81 chg sides, 96 chg coeffs, 2 upgd conss, 12084 impls, 0 clqs
0.49/0.55 c (round 7) 20 del vars, 27 del conss, 0 add conss, 0 chg bounds, 81 chg sides, 97 chg coeffs, 2 upgd conss, 12084 impls, 0 clqs
0.49/0.55 c presolving (8 rounds):
0.49/0.55 c 20 deleted vars, 27 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 81 changed sides, 97 changed coefficients
0.49/0.55 c 12084 implications, 0 cliques
0.49/0.55 c presolved problem has 55 variables (55 bin, 0 int, 0 impl, 0 cont) and 78 constraints
0.49/0.55 c 62 constraints of type <knapsack>
0.49/0.55 c 15 constraints of type <setppc>
0.49/0.55 c 1 constraints of type <linear>
0.49/0.55 c transformed objective value is always integral (scale: 1)
0.49/0.55 c Presolving Time: 0.05
0.49/0.55 c
0.49/0.56 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.56 c 0.6s| 1 | 0 | 453 | - |3893k| 0 | - | 55 | 78 | 55 | 78 | 0 | 0 | 57 | cutoff | -- | 0.00%
0.49/0.56 c 0.6s| 1 | 0 | 453 | - |3893k| 0 | - | 55 | 78 | 55 | 78 | 0 | 0 | 57 | cutoff | -- | 0.00%
0.49/0.56 c
0.49/0.56 c SCIP Status : problem is solved [infeasible]
0.49/0.56 c Solving Time (sec) : 0.56
0.49/0.56 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
0.49/0.56 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.49/0.56 c Dual Bound : +1.00000000000000e+20
0.49/0.56 c Gap : 0.00 %
0.49/0.56 s UNSATISFIABLE
0.49/0.56 c SCIP Status : problem is solved [infeasible]
0.49/0.56 c Total Time : 0.56
0.49/0.56 c solving : 0.56
0.49/0.56 c presolving : 0.05 (included in solving)
0.49/0.56 c reading : 0.01 (included in solving)
0.49/0.56 c Original Problem :
0.49/0.56 c Problem name : HOME/instance-3488271-1307789020.opb
0.49/0.56 c Variables : 1598 (1598 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.56 c Constraints : 1750 initial, 1750 maximal
0.49/0.56 c Presolved Problem :
0.49/0.56 c Problem name : t_HOME/instance-3488271-1307789020.opb
0.49/0.56 c Variables : 55 (55 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.56 c Constraints : 78 initial, 78 maximal
0.49/0.56 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.49/0.56 c trivial : 0.00 45 0 0 0 0 0 0 0 0
0.49/0.56 c dualfix : 0.00 1498 0 0 0 0 0 0 0 0
0.49/0.56 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.56 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.56 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.56 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.56 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.56 c knapsack : 0.01 0 0 0 0 0 46 0 160 177
0.49/0.56 c setppc : 0.00 0 0 0 0 0 4 0 0 0
0.49/0.56 c linear : 0.00 0 0 0 0 0 0 0 1 1
0.49/0.56 c logicor : 0.00 0 0 0 0 0 4 0 0 0
0.49/0.56 c pseudoboolean : 0.00 0 0 0 0 0 1698 100 0 0
0.49/0.56 c root node : - 45 - - 45 - - - - -
0.49/0.56 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.49/0.56 c integral : 0 0 0 9 0 2 0 0 45 0 0 0
0.49/0.56 c knapsack : 62 6 10 0 0 0 0 0 0 146 0 0
0.49/0.56 c setppc : 15 6 10 0 0 0 0 0 0 0 0 0
0.49/0.56 c linear : 1 7 10 0 0 0 0 0 0 0 0 0
0.49/0.56 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
0.49/0.56 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.49/0.56 c integral : 0.37 0.00 0.00 0.37 0.00 0.00 0.00
0.49/0.56 c knapsack : 0.01 0.01 0.00 0.00 0.00 0.00 0.00
0.49/0.56 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.56 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.56 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.56 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.49/0.56 c vbounds : 0 0 0 0
0.49/0.56 c rootredcost : 0 0 0 0
0.49/0.56 c pseudoobj : 0 0 0 0
0.49/0.56 c Propagator Timings : TotalTime Propagate Resprop
0.49/0.56 c vbounds : 0.00 0.00 0.00
0.49/0.56 c rootredcost : 0.00 0.00 0.00
0.49/0.56 c pseudoobj : 0.00 0.00 0.00
0.49/0.56 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.49/0.56 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.56 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.56 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.56 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.56 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.56 c applied globally : - - - 0 0.0 - - -
0.49/0.56 c applied locally : - - - 0 0.0 - - -
0.49/0.56 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.49/0.56 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.49/0.56 c redcost : 0.00 6 0 0 0 0
0.49/0.56 c impliedbounds : 0.00 6 0 0 0 0
0.49/0.56 c intobj : 0.00 0 0 0 0 0
0.49/0.56 c gomory : 0.03 6 0 0 0 0
0.49/0.56 c cgmip : 0.00 0 0 0 0 0
0.49/0.56 c closecuts : 0.00 0 0 0 0 0
0.49/0.56 c strongcg : 0.03 6 0 0 59 0
0.49/0.56 c cmir : 0.00 0 0 0 0 0
0.49/0.56 c flowcover : 0.00 0 0 0 0 0
0.49/0.56 c clique : 0.00 2 0 0 0 0
0.49/0.56 c zerohalf : 0.00 0 0 0 0 0
0.49/0.56 c mcf : 0.00 2 0 0 0 0
0.49/0.56 c oddcycle : 0.00 0 0 0 0 0
0.49/0.56 c rapidlearning : 0.02 1 0 0 0 21
0.49/0.56 c Pricers : Time Calls Vars
0.49/0.56 c problem variables: 0.00 0 0
0.49/0.56 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.49/0.56 c relpscost : 0.37 9 0 45 0 0 0
0.49/0.56 c pscost : 0.00 0 0 0 0 0 0
0.49/0.56 c inference : 0.00 0 0 0 0 0 0
0.49/0.56 c mostinf : 0.00 0 0 0 0 0 0
0.49/0.56 c leastinf : 0.00 0 0 0 0 0 0
0.49/0.56 c fullstrong : 0.00 0 0 0 0 0 0
0.49/0.56 c allfullstrong : 0.00 0 0 0 0 0 0
0.49/0.56 c random : 0.00 0 0 0 0 0 0
0.49/0.56 c Primal Heuristics : Time Calls Found
0.49/0.56 c LP solutions : 0.00 - 0
0.49/0.56 c pseudo solutions : 0.00 - 0
0.49/0.56 c trivial : 0.00 1 0
0.49/0.56 c shiftandpropagate: 0.00 0 0
0.49/0.56 c simplerounding : 0.00 0 0
0.49/0.56 c zirounding : 0.00 0 0
0.49/0.56 c rounding : 0.00 0 0
0.49/0.56 c shifting : 0.00 0 0
0.49/0.56 c intshifting : 0.00 0 0
0.49/0.56 c oneopt : 0.00 0 0
0.49/0.56 c twoopt : 0.00 0 0
0.49/0.56 c fixandinfer : 0.00 0 0
0.49/0.56 c feaspump : 0.00 0 0
0.49/0.56 c clique : 0.00 0 0
0.49/0.56 c coefdiving : 0.00 0 0
0.49/0.56 c pscostdiving : 0.00 0 0
0.49/0.56 c fracdiving : 0.00 0 0
0.49/0.56 c veclendiving : 0.00 0 0
0.49/0.56 c intdiving : 0.00 0 0
0.49/0.56 c actconsdiving : 0.00 0 0
0.49/0.56 c objpscostdiving : 0.00 0 0
0.49/0.56 c rootsoldiving : 0.00 0 0
0.49/0.56 c linesearchdiving : 0.00 0 0
0.49/0.56 c guideddiving : 0.00 0 0
0.49/0.56 c octane : 0.00 0 0
0.49/0.56 c rens : 0.00 0 0
0.49/0.56 c rins : 0.00 0 0
0.49/0.56 c localbranching : 0.00 0 0
0.49/0.56 c mutation : 0.00 0 0
0.49/0.56 c crossover : 0.00 0 0
0.49/0.56 c dins : 0.00 0 0
0.49/0.56 c vbounds : 0.00 0 0
0.49/0.56 c undercover : 0.00 0 0
0.49/0.56 c subnlp : 0.00 0 0
0.49/0.56 c trysol : 0.00 0 0
0.49/0.56 c LP : Time Calls Iterations Iter/call Iter/sec
0.49/0.56 c primal LP : 0.00 0 0 0.00 -
0.49/0.56 c dual LP : 0.03 14 453 32.36 13740.60
0.49/0.56 c lex dual LP : 0.00 0 0 0.00 -
0.49/0.56 c barrier LP : 0.00 0 0 0.00 -
0.49/0.56 c diving/probing LP: 0.00 0 0 0.00 -
0.49/0.56 c strong branching : 0.37 57 5151 90.37 14033.74
0.49/0.56 c (at root node) : - 57 5151 90.37 -
0.49/0.56 c conflict analysis: 0.00 0 0 0.00 -
0.49/0.56 c B&B Tree :
0.49/0.56 c number of runs : 3
0.49/0.56 c nodes : 1
0.49/0.56 c nodes (total) : 3
0.49/0.56 c nodes left : 0
0.49/0.56 c max depth : 0
0.49/0.56 c max depth (total): 0
0.49/0.56 c backtracks : 0 (0.0%)
0.49/0.56 c delayed cutoffs : 0
0.49/0.56 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.49/0.56 c avg switch length: 2.00
0.49/0.56 c switching time : 0.00
0.49/0.56 c Solution :
0.49/0.56 c Solutions found : 0 (0 improvements)
0.49/0.56 c Primal Bound : infeasible
0.49/0.56 c Dual Bound : -
0.49/0.56 c Gap : 0.00 %
0.49/0.56 c Root Dual Bound : -
0.49/0.56 c Root Iterations : 453
0.49/0.56 c Time complete: 0.56.