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-3451171-1307067589.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.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.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 | 127 | - | 770k| 0 | 45 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.04 c 0.0s| 1 | 0 | 192 | - |1024k| 0 | 50 | 169 | 115 | 169 | 86 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.05 c 0.0s| 1 | 0 | 221 | - |1050k| 0 | 52 | 169 | 115 | 169 | 93 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.06 c 0.1s| 1 | 0 | 276 | - |1081k| 0 | 53 | 169 | 115 | 169 | 100 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.06 c 0.1s| 1 | 0 | 315 | - |1102k| 0 | 55 | 169 | 115 | 169 | 105 | 32 | 0 | 0 | 0.000000e+00 | -- | Inf
0.05/0.07 c 0.1s| 1 | 0 | 363 | - |1117k| 0 | 52 | 169 | 115 | 169 | 109 | 36 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.12 c 0.1s| 1 | 0 | 481 | - |1105k| 0 | 44 | 169 | 103 | 169 | 109 | 36 | 0 | 7 | 0.000000e+00 | -- | Inf
0.09/0.16 c 0.2s| 1 | 0 | 499 | - |1071k| 0 | 39 | 169 | 66 | 169 | 109 | 36 | 0 | 19 | 0.000000e+00 | -- | Inf
0.09/0.18 c 0.2s| 1 | 0 | 499 | - |1071k| 0 | - | 169 | 66 | 169 | 109 | 36 | 0 | 27 | 0.000000e+00 | -- | Inf
0.09/0.18 c (run 1, node 1) restarting after 48 global fixings of integer variables
0.09/0.18 c
0.09/0.18 c (restart) converted 36 cuts from the global cut pool into linear constraints
0.09/0.18 c
0.09/0.18 c presolving:
0.09/0.18 c (round 1) 48 del vars, 4 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 20 impls, 75 clqs
0.09/0.18 c (round 2) 48 del vars, 4 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 33 upgd conss, 20 impls, 75 clqs
0.09/0.18 c (round 3) 48 del vars, 8 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 33 upgd conss, 20 impls, 75 clqs
0.09/0.18 c (round 4) 48 del vars, 8 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 33 upgd conss, 20 impls, 75 clqs
0.09/0.18 c presolving (5 rounds):
0.09/0.18 c 48 deleted vars, 8 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 2 changed coefficients
0.09/0.18 c 20 implications, 75 cliques
0.09/0.18 c presolved problem has 121 variables (121 bin, 0 int, 0 impl, 0 cont) and 94 constraints
0.09/0.18 c 15 constraints of type <knapsack>
0.09/0.18 c 79 constraints of type <setppc>
0.09/0.18 c transformed objective value is always integral (scale: 1)
0.09/0.18 c Presolving Time: 0.01
0.09/0.19 c
0.09/0.19 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.19 c 0.2s| 1 | 0 | 609 | - | 931k| 0 | 44 | 121 | 94 | 121 | 94 | 0 | 0 | 27 | 0.000000e+00 | -- | Inf
0.19/0.20 c 0.2s| 1 | 0 | 642 | - |1160k| 0 | 46 | 121 | 94 | 121 | 102 | 8 | 0 | 27 | 0.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 701 | - |1158k| 0 | 31 | 121 | 89 | 121 | 102 | 8 | 0 | 38 | 0.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 701 | - |1158k| 0 | - | 121 | 89 | 121 | 102 | 8 | 0 | 43 | 0.000000e+00 | -- | Inf
0.19/0.23 c (run 2, node 1) restarting after 36 global fixings of integer variables
0.19/0.23 c
0.19/0.23 c (restart) converted 8 cuts from the global cut pool into linear constraints
0.19/0.23 c
0.19/0.23 c presolving:
0.19/0.23 c (round 1) 60 del vars, 12 del conss, 0 add conss, 0 chg bounds, 26 chg sides, 34 chg coeffs, 8 upgd conss, 42 impls, 52 clqs
0.19/0.23 c (round 2) 60 del vars, 13 del conss, 0 add conss, 0 chg bounds, 46 chg sides, 72 chg coeffs, 8 upgd conss, 44 impls, 52 clqs
0.19/0.24 c (round 3) 60 del vars, 20 del conss, 0 add conss, 0 chg bounds, 48 chg sides, 88 chg coeffs, 8 upgd conss, 44 impls, 52 clqs
0.19/0.24 c (round 4) 60 del vars, 20 del conss, 0 add conss, 0 chg bounds, 50 chg sides, 101 chg coeffs, 8 upgd conss, 44 impls, 52 clqs
0.19/0.24 c (round 5) 60 del vars, 20 del conss, 0 add conss, 0 chg bounds, 51 chg sides, 110 chg coeffs, 8 upgd conss, 44 impls, 52 clqs
0.19/0.24 c (round 6) 60 del vars, 20 del conss, 0 add conss, 0 chg bounds, 51 chg sides, 116 chg coeffs, 8 upgd conss, 44 impls, 52 clqs
0.19/0.24 c (round 7) 60 del vars, 20 del conss, 0 add conss, 0 chg bounds, 51 chg sides, 120 chg coeffs, 8 upgd conss, 44 impls, 52 clqs
0.19/0.24 c (round 8) 60 del vars, 20 del conss, 0 add conss, 0 chg bounds, 51 chg sides, 121 chg coeffs, 8 upgd conss, 44 impls, 52 clqs
0.19/0.24 c presolving (9 rounds):
0.19/0.24 c 60 deleted vars, 20 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 51 changed sides, 121 changed coefficients
0.19/0.24 c 44 implications, 52 cliques
0.19/0.24 c presolved problem has 61 variables (61 bin, 0 int, 0 impl, 0 cont) and 77 constraints
0.19/0.24 c 19 constraints of type <knapsack>
0.19/0.24 c 58 constraints of type <setppc>
0.19/0.24 c transformed objective value is always integral (scale: 1)
0.19/0.24 c Presolving Time: 0.03
0.19/0.24 c
0.19/0.24 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.24 c 0.2s| 1 | 0 | 746 | - | 851k| 0 | - | 61 | 77 | 61 | 77 | 0 | 0 | 43 | cutoff | -- | 0.00%
0.19/0.24 c 0.2s| 1 | 0 | 746 | - | 851k| 0 | - | 61 | 77 | 61 | 77 | 0 | 0 | 43 | cutoff | -- | 0.00%
0.19/0.24 c
0.19/0.24 c SCIP Status : problem is solved [infeasible]
0.19/0.24 c Solving Time (sec) : 0.24
0.19/0.24 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
0.19/0.24 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.19/0.24 c Dual Bound : +1.00000000000000e+20
0.19/0.24 c Gap : 0.00 %
0.19/0.24 s UNSATISFIABLE
0.19/0.24 c SCIP Status : problem is solved [infeasible]
0.19/0.24 c Total Time : 0.24
0.19/0.24 c solving : 0.24
0.19/0.24 c presolving : 0.03 (included in solving)
0.19/0.24 c reading : 0.00 (included in solving)
0.19/0.24 c Original Problem :
0.19/0.24 c Problem name : HOME/instance-3451171-1307067589.opb
0.19/0.24 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.24 c Constraints : 101 initial, 101 maximal
0.19/0.24 c Presolved Problem :
0.19/0.24 c Problem name : t_HOME/instance-3451171-1307067589.opb
0.19/0.24 c Variables : 61 (61 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.24 c Constraints : 77 initial, 77 maximal
0.19/0.24 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.19/0.24 c trivial : 0.00 84 0 0 0 0 0 0 0 0
0.19/0.24 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.24 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.24 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.24 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.24 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.24 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.24 c knapsack : 0.02 0 0 0 0 0 0 0 51 123
0.19/0.24 c setppc : 0.00 24 0 0 0 0 25 0 0 0
0.19/0.24 c linear : 0.00 0 0 0 0 0 31 0 0 0
0.19/0.24 c root node : - 84 - - 84 - - - - -
0.19/0.24 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.19/0.24 c integral : 0 0 0 5 0 2 0 0 25 0 0 0
0.19/0.24 c knapsack : 19 6 8 0 0 0 0 0 12 0 0 0
0.19/0.24 c setppc : 58 6 8 0 0 0 0 0 47 0 0 0
0.19/0.24 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
0.19/0.24 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.19/0.24 c integral : 0.13 0.00 0.00 0.13 0.00 0.00 0.00
0.19/0.24 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.24 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.24 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.24 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.19/0.24 c vbounds : 0 0 0 0
0.19/0.24 c rootredcost : 0 0 0 0
0.19/0.24 c pseudoobj : 0 0 0 0
0.19/0.24 c Propagator Timings : TotalTime Propagate Resprop
0.19/0.24 c vbounds : 0.00 0.00 0.00
0.19/0.24 c rootredcost : 0.00 0.00 0.00
0.19/0.24 c pseudoobj : 0.00 0.00 0.00
0.19/0.24 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.19/0.24 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.19/0.24 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.24 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.24 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.24 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.19/0.24 c applied globally : - - - 0 0.0 - - -
0.19/0.24 c applied locally : - - - 0 0.0 - - -
0.19/0.24 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.19/0.24 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.19/0.24 c redcost : 0.00 6 0 0 0 0
0.19/0.24 c impliedbounds : 0.00 6 0 0 0 0
0.19/0.24 c intobj : 0.00 0 0 0 0 0
0.19/0.24 c gomory : 0.02 6 0 0 5 0
0.19/0.24 c cgmip : 0.00 0 0 0 0 0
0.19/0.24 c closecuts : 0.00 0 0 0 0 0
0.19/0.24 c strongcg : 0.01 6 0 0 133 0
0.19/0.24 c cmir : 0.00 0 0 0 0 0
0.19/0.24 c flowcover : 0.00 0 0 0 0 0
0.19/0.24 c clique : 0.00 6 0 0 30 0
0.19/0.24 c zerohalf : 0.00 0 0 0 0 0
0.19/0.24 c mcf : 0.00 2 0 0 0 0
0.19/0.24 c oddcycle : 0.00 0 0 0 0 0
0.19/0.24 c rapidlearning : 0.02 1 0 0 0 42
0.19/0.24 c Pricers : Time Calls Vars
0.19/0.24 c problem variables: 0.00 0 0
0.19/0.24 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.19/0.24 c relpscost : 0.13 5 0 25 0 0 0
0.19/0.24 c pscost : 0.00 0 0 0 0 0 0
0.19/0.24 c inference : 0.00 0 0 0 0 0 0
0.19/0.24 c mostinf : 0.00 0 0 0 0 0 0
0.19/0.24 c leastinf : 0.00 0 0 0 0 0 0
0.19/0.24 c fullstrong : 0.00 0 0 0 0 0 0
0.19/0.24 c allfullstrong : 0.00 0 0 0 0 0 0
0.19/0.24 c random : 0.00 0 0 0 0 0 0
0.19/0.24 c Primal Heuristics : Time Calls Found
0.19/0.24 c LP solutions : 0.00 - 0
0.19/0.24 c pseudo solutions : 0.00 - 0
0.19/0.24 c trivial : 0.00 1 0
0.19/0.24 c shiftandpropagate: 0.00 0 0
0.19/0.24 c simplerounding : 0.00 0 0
0.19/0.24 c zirounding : 0.00 0 0
0.19/0.24 c rounding : 0.00 0 0
0.19/0.24 c shifting : 0.00 0 0
0.19/0.24 c intshifting : 0.00 0 0
0.19/0.24 c oneopt : 0.00 0 0
0.19/0.24 c twoopt : 0.00 0 0
0.19/0.24 c fixandinfer : 0.00 0 0
0.19/0.24 c feaspump : 0.00 0 0
0.19/0.24 c clique : 0.00 0 0
0.19/0.24 c coefdiving : 0.00 0 0
0.19/0.24 c pscostdiving : 0.00 0 0
0.19/0.24 c fracdiving : 0.00 0 0
0.19/0.24 c veclendiving : 0.00 0 0
0.19/0.24 c intdiving : 0.00 0 0
0.19/0.24 c actconsdiving : 0.00 0 0
0.19/0.24 c objpscostdiving : 0.00 0 0
0.19/0.24 c rootsoldiving : 0.00 0 0
0.19/0.24 c linesearchdiving : 0.00 0 0
0.19/0.24 c guideddiving : 0.00 0 0
0.19/0.24 c octane : 0.00 0 0
0.19/0.24 c rens : 0.00 0 0
0.19/0.24 c rins : 0.00 0 0
0.19/0.24 c localbranching : 0.00 0 0
0.19/0.24 c mutation : 0.00 0 0
0.19/0.24 c crossover : 0.00 0 0
0.19/0.24 c dins : 0.00 0 0
0.19/0.24 c vbounds : 0.00 0 0
0.19/0.24 c undercover : 0.00 0 0
0.19/0.24 c subnlp : 0.00 0 0
0.19/0.24 c trysol : 0.00 0 0
0.19/0.24 c LP : Time Calls Iterations Iter/call Iter/sec
0.19/0.24 c primal LP : 0.00 0 0 0.00 -
0.19/0.24 c dual LP : 0.02 12 746 62.17 40350.50
0.19/0.24 c lex dual LP : 0.00 0 0 0.00 -
0.19/0.24 c barrier LP : 0.00 0 0 0.00 -
0.19/0.24 c diving/probing LP: 0.00 0 0 0.00 -
0.19/0.24 c strong branching : 0.13 43 4770 110.93 36642.14
0.19/0.24 c (at root node) : - 43 4770 110.93 -
0.19/0.24 c conflict analysis: 0.00 0 0 0.00 -
0.19/0.24 c B&B Tree :
0.19/0.24 c number of runs : 3
0.19/0.24 c nodes : 1
0.19/0.24 c nodes (total) : 3
0.19/0.24 c nodes left : 0
0.19/0.24 c max depth : 0
0.19/0.24 c max depth (total): 0
0.19/0.24 c backtracks : 0 (0.0%)
0.19/0.24 c delayed cutoffs : 0
0.19/0.24 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.19/0.24 c avg switch length: 2.00
0.19/0.24 c switching time : 0.00
0.19/0.24 c Solution :
0.19/0.24 c Solutions found : 0 (0 improvements)
0.19/0.24 c Primal Bound : infeasible
0.19/0.24 c Dual Bound : -
0.19/0.24 c Gap : 0.00 %
0.19/0.24 c Root Dual Bound : -
0.19/0.24 c Root Iterations : 746
0.19/0.25 c Time complete: 0.23.