0.00/0.02 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.02 c Copyright (c) 2002-2011 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.02 c
0.00/0.02 c user parameter file <scip.set> not found - using default parameters
0.00/0.02 c reading problem <HOME/instance-3450270-1307112061.opb>
0.00/0.02 c original problem has 1580 variables (1580 bin, 0 int, 0 impl, 0 cont) and 1732 constraints
0.00/0.02 c problem read
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.05 c (round 1) 0 del vars, 1580 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 51 upgd conss, 11940 impls, 99 clqs
0.00/0.06 c (round 2) 1480 del vars, 1580 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 11940 impls, 0 clqs
0.00/0.06 c presolving (3 rounds):
0.00/0.06 c 1480 deleted vars, 1580 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.06 c 11940 implications, 0 cliques
0.00/0.06 c presolved problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 152 constraints
0.00/0.06 c 101 constraints of type <knapsack>
0.00/0.06 c 50 constraints of type <setppc>
0.00/0.06 c 1 constraints of type <linear>
0.00/0.06 c transformed objective value is always integral (scale: 1)
0.00/0.06 c Presolving Time: 0.04
0.00/0.06 c - non default parameters ----------------------------------------------------------------------
0.00/0.06 c # SCIP version 2.0.1.5
0.00/0.06 c
0.00/0.06 c # frequency for displaying node information lines
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.06 c display/freq = 10000
0.00/0.06 c
0.00/0.06 c # maximal time in seconds to run
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/time = 1800
0.00/0.06 c
0.00/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/memory = 13950
0.00/0.06 c
0.00/0.06 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c limits/solutions = 1
0.00/0.06 c
0.00/0.06 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.06 c separating/maxrounds = 1
0.00/0.06 c
0.00/0.06 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c separating/maxroundsroot = 5
0.00/0.06 c
0.00/0.06 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.06 c # [type: int, range: [1,2], default: 1]
0.00/0.06 c timing/clocktype = 2
0.00/0.06 c
0.00/0.06 c # belongs reading time to solving time?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c timing/reading = TRUE
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify inequalities
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/linear/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/indicator/addCouplingCons = TRUE
0.00/0.06 c
0.00/0.06 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.06 c constraints/knapsack/disaggregation = FALSE
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify knapsacks
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c presolving/probing/maxrounds = 0
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/coefdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.06 c heuristics/crossover/freq = -1
0.00/0.06 c
0.00/0.06 c # number of nodes added to the contingent of the total nodes
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.06 c heuristics/crossover/nodesofs = 750
0.00/0.06 c
0.00/0.06 c # number of nodes without incumbent change that heuristic should wait
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.06 c heuristics/crossover/nwaitingnodes = 100
0.00/0.06 c
0.00/0.06 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.06 c # [type: real, range: [0,1], default: 0.1]
0.00/0.06 c heuristics/crossover/nodesquot = 0.15
0.00/0.06 c
0.00/0.06 c # minimum percentage of integer variables that have to be fixed
0.00/0.06 c # [type: real, range: [0,1], default: 0.666]
0.00/0.06 c heuristics/crossover/minfixingrate = 0.5
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/feaspump/freq = -1
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/fracdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/guideddiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/intshifting/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/linesearchdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/objpscostdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.06 c # [type: real, range: [0,1], default: 0.01]
0.00/0.06 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/oneopt/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/pscostdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/rens/freq = -1
0.00/0.06 c
0.00/0.06 c # minimum percentage of integer variables that have to be fixable
0.00/0.06 c # [type: real, range: [0,1], default: 0.5]
0.00/0.06 c heuristics/rens/minfixingrate = 0.3
0.00/0.06 c
0.00/0.06 c # number of nodes added to the contingent of the total nodes
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.06 c heuristics/rens/nodesofs = 2000
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/rootsoldiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.06 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/rounding/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/shiftandpropagate/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/shifting/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/simplerounding/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/subnlp/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/trivial/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/trysol/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/undercover/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/veclendiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/zirounding/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c separating/cmir/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c separating/flowcover/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c separating/rapidlearning/freq = 0
0.00/0.06 c
0.00/0.06 c -----------------------------------------------------------------------------------------------
0.00/0.06 c start solving
0.00/0.06 c
0.00/0.06 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.06 c 0.1s| 1 | 0 | 73 | - |4216k| 0 | 45 | 100 | 152 | 100 | 152 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.08/0.11 c 0.1s| 1 | 0 | 109 | - |4344k| 0 | 71 | 100 | 193 | 100 | 174 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
0.08/0.12 c 0.1s| 1 | 0 | 114 | - |4356k| 0 | 73 | 100 | 193 | 100 | 183 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.08/0.14 c 0.1s| 1 | 0 | 118 | - |4362k| 0 | 76 | 100 | 193 | 100 | 184 | 32 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.34 c 0.3s| 1 | 0 | 146 | - |4320k| 0 | 76 | 100 | 175 | 100 | 184 | 32 | 0 | 17 | 0.000000e+00 | -- | Inf
0.29/0.36 c 0.4s| 1 | 0 | 152 | - |4330k| 0 | 79 | 100 | 175 | 100 | 189 | 37 | 0 | 17 | 0.000000e+00 | -- | Inf
0.39/0.45 c 0.4s| 1 | 0 | 184 | - |4312k| 0 | 79 | 100 | 164 | 100 | 189 | 37 | 0 | 26 | 0.000000e+00 | -- | Inf
0.49/0.56 c 0.6s| 1 | 0 | 191 | - |4306k| 0 | 81 | 100 | 162 | 100 | 189 | 37 | 0 | 39 | 0.000000e+00 | -- | Inf
0.59/0.64 c 0.6s| 1 | 0 | 222 | - |4262k| 0 | 77 | 100 | 139 | 100 | 189 | 37 | 0 | 48 | 0.000000e+00 | -- | Inf
0.69/0.73 c 0.7s| 1 | 0 | 222 | - |4251k| 0 | - | 100 | 139 | 100 | 189 | 37 | 0 | 58 | 0.000000e+00 | -- | Inf
0.69/0.73 c (run 1, node 1) restarting after 21 global fixings of integer variables
0.69/0.73 c
0.69/0.73 c (restart) converted 6 cuts from the global cut pool into linear constraints
0.69/0.73 c
0.69/0.74 c presolving:
0.69/0.74 c (round 1) 21 del vars, 25 del conss, 0 add conss, 0 chg bounds, 78 chg sides, 78 chg coeffs, 0 upgd conss, 11940 impls, 0 clqs
0.69/0.74 c (round 2) 21 del vars, 25 del conss, 0 add conss, 0 chg bounds, 78 chg sides, 78 chg coeffs, 5 upgd conss, 11940 impls, 0 clqs
0.69/0.74 c (round 3) 21 del vars, 25 del conss, 0 add conss, 0 chg bounds, 79 chg sides, 79 chg coeffs, 5 upgd conss, 11940 impls, 0 clqs
0.69/0.74 c presolving (4 rounds):
0.69/0.74 c 21 deleted vars, 25 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 79 changed sides, 79 changed coefficients
0.69/0.74 c 11940 implications, 0 cliques
0.69/0.74 c presolved problem has 79 variables (79 bin, 0 int, 0 impl, 0 cont) and 120 constraints
0.69/0.74 c 85 constraints of type <knapsack>
0.69/0.74 c 34 constraints of type <setppc>
0.69/0.74 c 1 constraints of type <linear>
0.69/0.74 c transformed objective value is always integral (scale: 1)
0.69/0.74 c Presolving Time: 0.05
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 | 302 | - |4035k| 0 | 51 | 79 | 120 | 79 | 120 | 0 | 0 | 58 | 0.000000e+00 | -- | Inf
0.69/0.76 c 0.8s| 1 | 0 | 321 | - |4150k| 0 | 63 | 79 | 120 | 79 | 142 | 22 | 0 | 58 | 0.000000e+00 | -- | Inf
0.69/0.79 c 0.8s| 1 | 0 | 357 | - |4132k| 0 | 69 | 79 | 115 | 79 | 142 | 22 | 0 | 63 | 0.000000e+00 | -- | Inf
0.79/0.81 c 0.8s| 1 | 0 | 367 | - |4117k| 0 | 63 | 79 | 111 | 79 | 142 | 22 | 0 | 68 | 0.000000e+00 | -- | Inf
0.79/0.84 c 0.8s| 1 | 0 | 385 | - |4099k| 0 | 53 | 79 | 106 | 79 | 142 | 22 | 0 | 73 | 0.000000e+00 | -- | Inf
0.79/0.85 c 0.9s| 1 | 0 | 385 | - |4085k| 0 | - | 79 | 106 | 79 | 142 | 22 | 0 | 78 | 0.000000e+00 | -- | Inf
0.79/0.85 c (run 2, node 1) restarting after 20 global fixings of integer variables
0.79/0.85 c
0.79/0.85 c (restart) converted 1 cuts from the global cut pool into linear constraints
0.79/0.85 c
0.79/0.86 c presolving:
0.79/0.86 c (round 1) 20 del vars, 24 del conss, 0 add conss, 0 chg bounds, 213 chg sides, 223 chg coeffs, 1 upgd conss, 11940 impls, 0 clqs
0.79/0.86 c (round 2) 20 del vars, 24 del conss, 0 add conss, 0 chg bounds, 213 chg sides, 233 chg coeffs, 1 upgd conss, 11940 impls, 0 clqs
0.79/0.86 c (round 3) 20 del vars, 24 del conss, 0 add conss, 0 chg bounds, 213 chg sides, 241 chg coeffs, 1 upgd conss, 11940 impls, 0 clqs
0.79/0.86 c (round 4) 20 del vars, 24 del conss, 0 add conss, 0 chg bounds, 213 chg sides, 249 chg coeffs, 1 upgd conss, 11940 impls, 0 clqs
0.79/0.86 c (round 5) 20 del vars, 24 del conss, 0 add conss, 0 chg bounds, 213 chg sides, 255 chg coeffs, 1 upgd conss, 11940 impls, 0 clqs
0.79/0.86 c (round 6) 20 del vars, 24 del conss, 0 add conss, 0 chg bounds, 213 chg sides, 260 chg coeffs, 1 upgd conss, 11940 impls, 0 clqs
0.79/0.86 c (round 7) 20 del vars, 24 del conss, 0 add conss, 0 chg bounds, 213 chg sides, 265 chg coeffs, 1 upgd conss, 11940 impls, 0 clqs
0.79/0.86 c (round 8) 20 del vars, 24 del conss, 0 add conss, 0 chg bounds, 213 chg sides, 268 chg coeffs, 1 upgd conss, 11940 impls, 0 clqs
0.79/0.87 c (round 9) 20 del vars, 24 del conss, 0 add conss, 0 chg bounds, 213 chg sides, 272 chg coeffs, 1 upgd conss, 11940 impls, 0 clqs
0.79/0.87 c (round 10) 20 del vars, 24 del conss, 0 add conss, 0 chg bounds, 213 chg sides, 276 chg coeffs, 1 upgd conss, 11940 impls, 0 clqs
0.79/0.87 c (round 11) 20 del vars, 24 del conss, 0 add conss, 0 chg bounds, 213 chg sides, 280 chg coeffs, 1 upgd conss, 11940 impls, 0 clqs
0.79/0.87 c (round 12) 20 del vars, 24 del conss, 0 add conss, 0 chg bounds, 213 chg sides, 282 chg coeffs, 1 upgd conss, 11940 impls, 0 clqs
0.79/0.87 c (round 13) 20 del vars, 24 del conss, 0 add conss, 0 chg bounds, 213 chg sides, 285 chg coeffs, 1 upgd conss, 11940 impls, 0 clqs
0.79/0.87 c (round 14) 20 del vars, 24 del conss, 0 add conss, 0 chg bounds, 213 chg sides, 287 chg coeffs, 1 upgd conss, 11940 impls, 0 clqs
0.79/0.87 c presolving (15 rounds):
0.79/0.87 c 20 deleted vars, 24 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 213 changed sides, 287 changed coefficients
0.79/0.87 c 11940 implications, 0 cliques
0.79/0.87 c presolved problem has 59 variables (59 bin, 0 int, 0 impl, 0 cont) and 83 constraints
0.79/0.87 c 66 constraints of type <knapsack>
0.79/0.87 c 16 constraints of type <setppc>
0.79/0.87 c 1 constraints of type <linear>
0.79/0.87 c transformed objective value is always integral (scale: 1)
0.79/0.87 c Presolving Time: 0.06
0.79/0.87 c
0.79/0.87 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.79/0.87 c 0.9s| 1 | 0 | 474 | - |3862k| 0 | - | 59 | 83 | 59 | 83 | 0 | 0 | 78 | cutoff | -- | 0.00%
0.79/0.87 c 0.9s| 1 | 0 | 474 | - |3862k| 0 | - | 59 | 83 | 59 | 83 | 0 | 0 | 78 | cutoff | -- | 0.00%
0.79/0.87 c
0.79/0.87 c SCIP Status : problem is solved [infeasible]
0.79/0.87 c Solving Time (sec) : 0.87
0.79/0.87 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
0.79/0.87 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.79/0.87 c Dual Bound : +1.00000000000000e+20
0.79/0.87 c Gap : 0.00 %
0.79/0.87 s UNSATISFIABLE
0.79/0.87 c SCIP Status : problem is solved [infeasible]
0.79/0.87 c Total Time : 0.87
0.79/0.87 c solving : 0.87
0.79/0.87 c presolving : 0.06 (included in solving)
0.79/0.87 c reading : 0.01 (included in solving)
0.79/0.87 c Original Problem :
0.79/0.87 c Problem name : HOME/instance-3450270-1307112061.opb
0.79/0.87 c Variables : 1580 (1580 binary, 0 integer, 0 implicit integer, 0 continuous)
0.79/0.87 c Constraints : 1732 initial, 1732 maximal
0.79/0.87 c Presolved Problem :
0.79/0.87 c Problem name : t_HOME/instance-3450270-1307112061.opb
0.79/0.87 c Variables : 59 (59 binary, 0 integer, 0 implicit integer, 0 continuous)
0.79/0.87 c Constraints : 83 initial, 83 maximal
0.79/0.87 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.79/0.87 c trivial : 0.00 41 0 0 0 0 0 0 0 0
0.79/0.87 c dualfix : 0.00 1480 0 0 0 0 0 0 0 0
0.79/0.87 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.79/0.87 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.79/0.87 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.79/0.87 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.79/0.87 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.79/0.87 c knapsack : 0.02 0 0 0 0 0 41 0 292 366
0.79/0.87 c setppc : 0.00 0 0 0 0 0 7 0 0 0
0.79/0.87 c linear : 0.00 0 0 0 0 0 1 0 0 0
0.79/0.87 c pseudoboolean : 0.00 0 0 0 0 0 1580 0 0 0
0.79/0.87 c root node : - 41 - - 41 - - - - -
0.79/0.87 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.79/0.87 c integral : 0 0 0 9 0 2 0 0 41 0 0 0
0.79/0.87 c knapsack : 66 6 10 0 0 0 0 0 0 196 0 0
0.79/0.87 c setppc : 16 6 10 0 0 0 0 0 0 0 0 0
0.79/0.87 c linear : 1 7 10 0 0 0 0 0 0 0 0 0
0.79/0.87 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
0.79/0.87 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.79/0.87 c integral : 0.65 0.00 0.00 0.65 0.00 0.00 0.00
0.79/0.87 c knapsack : 0.01 0.01 0.00 0.00 0.00 0.00 0.00
0.79/0.87 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.79/0.87 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.79/0.87 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.79/0.87 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.79/0.87 c vbounds : 0 0 0 0
0.79/0.87 c rootredcost : 0 0 0 0
0.79/0.87 c pseudoobj : 0 0 0 0
0.79/0.87 c Propagator Timings : TotalTime Propagate Resprop
0.79/0.87 c vbounds : 0.00 0.00 0.00
0.79/0.87 c rootredcost : 0.00 0.00 0.00
0.79/0.87 c pseudoobj : 0.00 0.00 0.00
0.79/0.87 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.79/0.87 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.79/0.87 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.87 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.87 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.87 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.79/0.87 c applied globally : - - - 0 0.0 - - -
0.79/0.87 c applied locally : - - - 0 0.0 - - -
0.79/0.87 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.79/0.87 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.79/0.87 c redcost : 0.00 6 0 0 0 0
0.79/0.87 c impliedbounds : 0.00 6 0 0 0 0
0.79/0.87 c intobj : 0.00 0 0 0 0 0
0.79/0.87 c gomory : 0.04 6 0 0 0 0
0.79/0.87 c cgmip : 0.00 0 0 0 0 0
0.79/0.87 c closecuts : 0.00 0 0 0 0 0
0.79/0.87 c strongcg : 0.03 6 0 0 69 0
0.79/0.87 c cmir : 0.00 0 0 0 0 0
0.79/0.87 c flowcover : 0.00 0 0 0 0 0
0.79/0.87 c clique : 0.00 2 0 0 0 0
0.79/0.87 c zerohalf : 0.00 0 0 0 0 0
0.79/0.87 c mcf : 0.00 2 0 0 0 0
0.79/0.87 c oddcycle : 0.00 0 0 0 0 0
0.79/0.87 c rapidlearning : 0.03 1 0 0 0 41
0.79/0.87 c Pricers : Time Calls Vars
0.79/0.87 c problem variables: 0.00 0 0
0.79/0.87 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.79/0.87 c relpscost : 0.65 9 0 41 0 0 0
0.79/0.87 c pscost : 0.00 0 0 0 0 0 0
0.79/0.87 c inference : 0.00 0 0 0 0 0 0
0.79/0.87 c mostinf : 0.00 0 0 0 0 0 0
0.79/0.87 c leastinf : 0.00 0 0 0 0 0 0
0.79/0.87 c fullstrong : 0.00 0 0 0 0 0 0
0.79/0.87 c allfullstrong : 0.00 0 0 0 0 0 0
0.79/0.87 c random : 0.00 0 0 0 0 0 0
0.79/0.87 c Primal Heuristics : Time Calls Found
0.79/0.87 c LP solutions : 0.00 - 0
0.79/0.87 c pseudo solutions : 0.00 - 0
0.79/0.87 c trivial : 0.00 1 0
0.79/0.87 c shiftandpropagate: 0.00 0 0
0.79/0.87 c simplerounding : 0.00 0 0
0.79/0.87 c zirounding : 0.00 0 0
0.79/0.87 c rounding : 0.00 0 0
0.79/0.87 c shifting : 0.00 0 0
0.79/0.87 c intshifting : 0.00 0 0
0.79/0.87 c oneopt : 0.00 0 0
0.79/0.87 c twoopt : 0.00 0 0
0.79/0.87 c fixandinfer : 0.00 0 0
0.79/0.87 c feaspump : 0.00 0 0
0.79/0.87 c clique : 0.00 0 0
0.79/0.87 c coefdiving : 0.00 0 0
0.79/0.87 c pscostdiving : 0.00 0 0
0.79/0.87 c fracdiving : 0.00 0 0
0.79/0.87 c veclendiving : 0.00 0 0
0.79/0.87 c intdiving : 0.00 0 0
0.79/0.87 c actconsdiving : 0.00 0 0
0.79/0.87 c objpscostdiving : 0.00 0 0
0.79/0.87 c rootsoldiving : 0.00 0 0
0.79/0.87 c linesearchdiving : 0.00 0 0
0.79/0.87 c guideddiving : 0.00 0 0
0.79/0.87 c octane : 0.00 0 0
0.79/0.87 c rens : 0.00 0 0
0.79/0.87 c rins : 0.00 0 0
0.79/0.87 c localbranching : 0.00 0 0
0.79/0.87 c mutation : 0.00 0 0
0.79/0.87 c crossover : 0.00 0 0
0.79/0.87 c dins : 0.00 0 0
0.79/0.87 c vbounds : 0.00 0 0
0.79/0.87 c undercover : 0.00 0 0
0.79/0.87 c subnlp : 0.00 0 0
0.79/0.87 c trysol : 0.00 0 0
0.79/0.87 c LP : Time Calls Iterations Iter/call Iter/sec
0.79/0.87 c primal LP : 0.00 0 0 0.00 -
0.79/0.87 c dual LP : 0.04 15 474 31.60 13332.96
0.79/0.87 c lex dual LP : 0.00 0 0 0.00 -
0.79/0.87 c barrier LP : 0.00 0 0 0.00 -
0.79/0.87 c diving/probing LP: 0.00 0 0 0.00 -
0.79/0.87 c strong branching : 0.65 78 8156 104.56 12628.24
0.79/0.87 c (at root node) : - 78 8156 104.56 -
0.79/0.87 c conflict analysis: 0.00 0 0 0.00 -
0.79/0.87 c B&B Tree :
0.79/0.87 c number of runs : 3
0.79/0.87 c nodes : 1
0.79/0.87 c nodes (total) : 3
0.79/0.87 c nodes left : 0
0.79/0.87 c max depth : 0
0.79/0.87 c max depth (total): 0
0.79/0.87 c backtracks : 0 (0.0%)
0.79/0.87 c delayed cutoffs : 0
0.79/0.87 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.79/0.87 c avg switch length: 2.00
0.79/0.87 c switching time : 0.00
0.79/0.87 c Solution :
0.79/0.87 c Solutions found : 0 (0 improvements)
0.79/0.87 c Primal Bound : infeasible
0.79/0.87 c Dual Bound : -
0.79/0.87 c Gap : 0.00 %
0.79/0.87 c Root Dual Bound : -
0.79/0.87 c Root Iterations : 474
0.79/0.88 c Time complete: 0.87.