0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: a3bf3a4-dirty]
0.00/0.00 c Copyright (c) 2002-2012 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-3690441-1338016924.opb>
0.00/0.00 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.00 c problem read in 0.00
0.00/0.00 c No objective function, only one solution is needed.
0.00/0.00 c presolving settings loaded
0.00/0.00 c presolving:
0.00/0.01 c (round 1) 0 del vars, 28 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.01 c (round 2) 0 del vars, 28 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.01 c presolving (3 rounds):
0.00/0.01 c 0 deleted vars, 28 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 8 implications, 68 cliques
0.00/0.01 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.01 c 1 constraints of type <knapsack>
0.00/0.01 c 72 constraints of type <setppc>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.01
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 2.1.1.4
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 = 1797
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 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 # 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 # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c propagating/probing/maxprerounds = 0
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 # frequency for calling primal heuristic <indoneopt> (-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/indoneopt/freq = -1
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.01 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.01 c 0.0s| 1 | 0 | 98 | - | 811k| 0 | 42 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.03/0.07 c 0.1s| 1 | 0 | 122 | - |1420k| 0 | 48 | 169 | 334 | 169 | 84 | 11 | 0 | 0 | 0.000000e+00 | -- | Inf
0.03/0.08 c 0.1s| 1 | 0 | 167 | - |1665k| 0 | 49 | 169 | 334 | 169 | 91 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
0.03/0.09 c 0.1s| 1 | 0 | 199 | - |1864k| 0 | 54 | 169 | 334 | 169 | 98 | 25 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 232 | - |2002k| 0 | 56 | 169 | 334 | 169 | 104 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.11 c 0.1s| 1 | 0 | 264 | - |2085k| 0 | 52 | 169 | 334 | 169 | 108 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 355 | - |1996k| 0 | 51 | 169 | 252 | 169 | 108 | 35 | 0 | 7 | 0.000000e+00 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 394 | - |1928k| 0 | 39 | 169 | 183 | 169 | 108 | 35 | 0 | 12 | 0.000000e+00 | -- | Inf
0.09/0.16 c 0.2s| 1 | 0 | 421 | - |1922k| 0 | 45 | 169 | 177 | 169 | 108 | 35 | 0 | 21 | 0.000000e+00 | -- | Inf
0.09/0.17 c 0.2s| 1 | 0 | 434 | - |1904k| 0 | 44 | 169 | 158 | 169 | 108 | 35 | 0 | 26 | 0.000000e+00 | -- | Inf
0.09/0.18 c 0.2s| 1 | 0 | 458 | - |1828k| 0 | 41 | 169 | 79 | 169 | 108 | 35 | 0 | 34 | 0.000000e+00 | -- | Inf
0.09/0.19 c 0.2s| 1 | 0 | 458 | - |1828k| 0 | - | 169 | 79 | 169 | 108 | 35 | 0 | 39 | 0.000000e+00 | -- | Inf
0.09/0.19 c (run 1, node 1) restarting after 62 global fixings of integer variables
0.09/0.19 c
0.09/0.19 c (restart) converted 35 cuts from the global cut pool into linear constraints
0.09/0.19 c
0.09/0.19 c presolving:
0.09/0.19 c (round 1) 62 del vars, 6 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 30 impls, 71 clqs
0.09/0.19 c (round 2) 62 del vars, 7 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 30 impls, 71 clqs
0.09/0.19 c (round 3) 62 del vars, 7 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 42 upgd conss, 30 impls, 71 clqs
0.09/0.19 c (round 4) 62 del vars, 12 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 42 upgd conss, 30 impls, 71 clqs
0.09/0.19 c presolving (5 rounds):
0.09/0.19 c 62 deleted vars, 12 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
0.09/0.19 c 30 implications, 71 cliques
0.09/0.19 c presolved problem has 107 variables (107 bin, 0 int, 0 impl, 0 cont) and 102 constraints
0.09/0.19 c 13 constraints of type <knapsack>
0.09/0.19 c 77 constraints of type <setppc>
0.09/0.19 c 12 constraints of type <logicor>
0.09/0.19 c transformed objective value is always integral (scale: 1)
0.09/0.19 c Presolving Time: 0.01
0.09/0.20 c
0.19/0.20 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.20 c 0.2s| 1 | 0 | 533 | - |1002k| 0 | 39 | 107 | 102 | 107 | 90 | 0 | 0 | 39 | 0.000000e+00 | -- | Inf
0.19/0.21 c 0.2s| 1 | 0 | 567 | - |1323k| 0 | 41 | 107 | 102 | 107 | 104 | 14 | 0 | 39 | 0.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 629 | - |1319k| 0 | 35 | 107 | 92 | 107 | 104 | 14 | 0 | 44 | 0.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 629 | - |1319k| 0 | - | 107 | 92 | 107 | 104 | 14 | 0 | 49 | 0.000000e+00 | -- | Inf
0.19/0.23 c (run 2, node 1) restarting after 30 global fixings of integer variables
0.19/0.23 c
0.19/0.23 c (restart) converted 14 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) 69 del vars, 28 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 0 upgd conss, 58 impls, 34 clqs
0.19/0.23 c (round 2) 69 del vars, 35 del conss, 0 add conss, 0 chg bounds, 32 chg sides, 48 chg coeffs, 11 upgd conss, 58 impls, 36 clqs
0.19/0.23 c (round 3) 69 del vars, 42 del conss, 0 add conss, 0 chg bounds, 32 chg sides, 60 chg coeffs, 11 upgd conss, 62 impls, 37 clqs
0.19/0.23 c (round 4) 69 del vars, 42 del conss, 0 add conss, 0 chg bounds, 32 chg sides, 74 chg coeffs, 11 upgd conss, 62 impls, 37 clqs
0.19/0.23 c (round 5) 69 del vars, 42 del conss, 0 add conss, 0 chg bounds, 32 chg sides, 83 chg coeffs, 11 upgd conss, 62 impls, 37 clqs
0.19/0.23 c (round 6) 69 del vars, 42 del conss, 0 add conss, 0 chg bounds, 32 chg sides, 89 chg coeffs, 11 upgd conss, 70 impls, 37 clqs
0.19/0.24 c (round 7) 69 del vars, 42 del conss, 0 add conss, 0 chg bounds, 32 chg sides, 94 chg coeffs, 11 upgd conss, 70 impls, 37 clqs
0.19/0.24 c (round 8) 69 del vars, 42 del conss, 0 add conss, 0 chg bounds, 32 chg sides, 97 chg coeffs, 11 upgd conss, 70 impls, 37 clqs
0.19/0.24 c (round 9) 69 del vars, 42 del conss, 0 add conss, 0 chg bounds, 32 chg sides, 99 chg coeffs, 11 upgd conss, 70 impls, 37 clqs
0.19/0.24 c presolving (10 rounds):
0.19/0.24 c 69 deleted vars, 42 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 32 changed sides, 99 changed coefficients
0.19/0.24 c 70 implications, 37 cliques
0.19/0.24 c presolved problem has 38 variables (38 bin, 0 int, 0 impl, 0 cont) and 64 constraints
0.19/0.24 c 21 constraints of type <knapsack>
0.19/0.24 c 43 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.02
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 | 663 | - | 908k| 0 | 13 | 38 | 64 | 38 | 64 | 0 | 0 | 49 | 0.000000e+00 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 674 | - | 949k| 0 | 0 | 38 | 64 | 38 | 65 | 1 | 0 | 49 | 0.000000e+00 | -- | Inf
0.19/0.24 c * 0.2s| 1 | 0 | 674 | - | 951k| 0 | - | 38 | 64 | 38 | 65 | 1 | 0 | 49 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.19/0.24 c
0.19/0.24 c SCIP Status : problem is solved [optimal solution found]
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 : +0.00000000000000e+00 (1 solutions)
0.19/0.24 c Dual Bound : +0.00000000000000e+00
0.19/0.24 c Gap : 0.00 %
0.19/0.24 s SATISFIABLE
0.19/0.24 v -x169 -x168 -x167 -x166 -x165 x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 x149 -x148
0.19/0.24 v -x147 -x146 -x145 -x144 -x143 -x142 x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
0.19/0.24 v -x126 -x125 -x124 -x123 -x122 -x121 x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
0.19/0.24 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.19/0.24 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
0.19/0.24 v -x56 -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.19/0.24 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.19/0.24 v x4 -x3 -x2 -x1
0.19/0.24 c SCIP Status : problem is solved [optimal solution found]
0.19/0.24 c Total Time : 0.24
0.19/0.24 c solving : 0.24
0.19/0.24 c presolving : 0.02 (included in solving)
0.19/0.24 c reading : 0.00 (included in solving)
0.19/0.24 c copying : 0.00 (1 #copies) (minimal 0.00, maximal 0.00, average 0.00)
0.19/0.24 c Original Problem :
0.19/0.24 c Problem name : HOME/instance-3690441-1338016924.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 Objective sense : minimize
0.19/0.24 c Presolved Problem :
0.19/0.24 c Problem name : t_HOME/instance-3690441-1338016924.opb
0.19/0.24 c Variables : 38 (38 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.24 c Constraints : 64 initial, 64 maximal
0.19/0.24 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.19/0.24 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.19/0.24 c trivial : 0.00 0.00 92 0 0 0 0 0 0 0 0
0.19/0.24 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.19/0.24 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.19/0.24 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.19/0.24 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.19/0.24 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.19/0.24 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.19/0.24 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.19/0.24 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.19/0.24 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.19/0.24 c knapsack : 0.01 0.00 0 0 0 0 0 0 0 32 99
0.19/0.24 c setppc : 0.00 0.00 37 2 0 0 0 34 0 0 0
0.19/0.24 c linear : 0.00 0.00 0 0 0 0 0 37 0 1 0
0.19/0.24 c logicor : 0.00 0.00 0 0 0 0 0 11 0 0 0
0.19/0.24 c root node : - - 92 - - 92 - - - - -
0.19/0.24 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.19/0.24 c integral : 0 0 0 0 9 0 5 0 0 40 0 0 0
0.19/0.24 c knapsack : 21 21 7 11 1 0 0 0 0 0 2 0 0
0.19/0.24 c setppc : 43 43 7 11 1 0 0 0 0 52 0 0 0
0.19/0.24 c countsols : 0 0 0 0 1 0 2 0 0 0 0 0 0
0.19/0.24 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.19/0.24 c integral : 0.09 0.00 0.00 0.00 0.09 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.00
0.19/0.24 c setppc : 0.00 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.00
0.19/0.24 c Propagators : #Propagate #ResProp Cutoffs DomReds
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 vbounds : 0 0 0 0
0.19/0.24 c redcost : 16 0 0 0
0.19/0.24 c probing : 0 0 0 0
0.19/0.24 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.19/0.24 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.19/0.24 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.19/0.24 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.19/0.24 c redcost : 0.00 0.00 0.00 0.00 0.00
0.19/0.24 c probing : 0.00 0.00 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 : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.19/0.24 c cut pool : 0.00 0 - - 0 - (maximal pool size: 30)
0.19/0.24 c closecuts : 0.00 0.00 0 0 0 0 0
0.19/0.24 c impliedbounds : 0.00 0.00 7 0 0 0 0
0.19/0.24 c intobj : 0.00 0.00 0 0 0 0 0
0.19/0.24 c gomory : 0.02 0.00 7 0 0 65 0
0.19/0.24 c cgmip : 0.00 0.00 0 0 0 0 0
0.19/0.24 c strongcg : 0.02 0.00 7 0 0 302 0
0.19/0.24 c cmir : 0.00 0.00 0 0 0 0 0
0.19/0.24 c flowcover : 0.00 0.00 0 0 0 0 0
0.19/0.24 c clique : 0.00 0.00 7 0 0 32 0
0.19/0.24 c zerohalf : 0.00 0.00 0 0 0 0 0
0.19/0.24 c mcf : 0.00 0.00 3 0 0 0 0
0.19/0.24 c oddcycle : 0.00 0.00 0 0 0 0 0
0.19/0.24 c rapidlearning : 0.05 0.00 1 0 0 0 261
0.19/0.24 c Pricers : ExecTime SetupTime Calls Vars
0.19/0.24 c problem variables: 0.00 - 0 0
0.19/0.24 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.19/0.24 c relpscost : 0.09 0.00 8 0 40 0 0 0
0.19/0.24 c pscost : 0.00 0.00 0 0 0 0 0 0
0.19/0.24 c inference : 0.00 0.00 0 0 0 0 0 0
0.19/0.24 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.19/0.24 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.19/0.24 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.19/0.24 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.19/0.24 c random : 0.00 0.00 0 0 0 0 0 0
0.19/0.24 c Primal Heuristics : ExecTime SetupTime Calls Found
0.19/0.24 c LP solutions : 0.00 - - 1
0.19/0.24 c pseudo solutions : 0.00 - - 0
0.19/0.24 c smallcard : 0.00 0.00 0 0
0.19/0.24 c trivial : 0.00 0.00 1 0
0.19/0.24 c shiftandpropagate: 0.00 0.00 0 0
0.19/0.24 c simplerounding : 0.00 0.00 0 0
0.19/0.24 c zirounding : 0.00 0.00 0 0
0.19/0.24 c rounding : 0.00 0.00 0 0
0.19/0.24 c shifting : 0.00 0.00 0 0
0.19/0.24 c intshifting : 0.00 0.00 0 0
0.19/0.24 c oneopt : 0.00 0.00 0 0
0.19/0.24 c twoopt : 0.00 0.00 0 0
0.19/0.24 c indtwoopt : 0.00 0.00 0 0
0.19/0.24 c indoneopt : 0.00 0.00 0 0
0.19/0.24 c fixandinfer : 0.00 0.00 0 0
0.19/0.24 c feaspump : 0.00 0.00 0 0
0.19/0.24 c clique : 0.00 0.00 0 0
0.19/0.24 c indrounding : 0.00 0.00 0 0
0.19/0.24 c indcoefdiving : 0.00 0.00 0 0
0.19/0.24 c coefdiving : 0.00 0.00 0 0
0.19/0.24 c pscostdiving : 0.00 0.00 0 0
0.19/0.24 c nlpdiving : 0.00 0.00 0 0
0.19/0.24 c fracdiving : 0.00 0.00 0 0
0.19/0.24 c veclendiving : 0.00 0.00 0 0
0.19/0.24 c intdiving : 0.00 0.00 0 0
0.19/0.24 c actconsdiving : 0.00 0.00 0 0
0.19/0.24 c objpscostdiving : 0.00 0.00 0 0
0.19/0.24 c rootsoldiving : 0.00 0.00 0 0
0.19/0.24 c linesearchdiving : 0.00 0.00 0 0
0.19/0.24 c guideddiving : 0.00 0.00 0 0
0.19/0.24 c octane : 0.00 0.00 0 0
0.19/0.24 c rens : 0.00 0.00 0 0
0.19/0.24 c rins : 0.00 0.00 0 0
0.19/0.24 c localbranching : 0.00 0.00 0 0
0.19/0.24 c mutation : 0.00 0.00 0 0
0.19/0.24 c crossover : 0.00 0.00 0 0
0.19/0.24 c dins : 0.00 0.00 0 0
0.19/0.24 c vbounds : 0.00 0.00 0 0
0.19/0.24 c undercover : 0.00 0.00 0 0
0.19/0.24 c subnlp : 0.00 0.00 0 0
0.19/0.24 c trysol : 0.00 0.00 0 0
0.19/0.24 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.19/0.24 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.19/0.24 c dual LP : 0.02 16 674 42.12 40990.09 0.00 0
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.00 0
0.19/0.24 c diving/probing LP: 0.00 0 0 0.00 -
0.19/0.24 c strong branching : 0.09 49 3441 70.22 37750.96
0.19/0.24 c (at root node) : - 49 3441 70.22 -
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 : 1 (1 improvements)
0.19/0.24 c First Solution : +0.00000000000000e+00 (in run 3, after 1 nodes, 0.24 seconds, depth 0, found by <relaxation>)
0.19/0.24 c Primal Bound : +0.00000000000000e+00 (in run 3, after 1 nodes, 0.24 seconds, depth 0, found by <relaxation>)
0.19/0.24 c Dual Bound : +0.00000000000000e+00
0.19/0.24 c Gap : 0.00 %
0.19/0.24 c Root Dual Bound : +0.00000000000000e+00
0.19/0.24 c Root Iterations : 674
0.19/0.24 c Time complete: 0.23.