0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 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-2667191-1276276342.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.01/0.02 c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.01/0.03 c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.01/0.03 c presolving (3 rounds):
0.01/0.03 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.03 c 8 implications, 68 cliques
0.01/0.03 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.01/0.03 c 1 constraints of type <knapsack>
0.01/0.03 c 68 constraints of type <setppc>
0.01/0.03 c 4 constraints of type <logicor>
0.01/0.03 c transformed objective value is always integral (scale: 1)
0.01/0.03 c Presolving Time: 0.01
0.01/0.03 c - non default parameters ----------------------------------------------------------------------
0.01/0.03 c # SCIP version 1.2.1.2
0.01/0.03 c
0.01/0.03 c # frequency for displaying node information lines
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.03 c display/freq = 10000
0.01/0.03 c
0.01/0.03 c # maximal time in seconds to run
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03 c limits/time = 1800
0.01/0.03 c
0.01/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03 c limits/memory = 1620
0.01/0.03 c
0.01/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c limits/solutions = 1
0.01/0.03 c
0.01/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.01/0.03 c separating/maxrounds = 1
0.01/0.03 c
0.01/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c separating/maxroundsroot = 5
0.01/0.03 c
0.01/0.03 c # should presolving try to simplify inequalities
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/linear/simplifyinequalities = TRUE
0.01/0.03 c
0.01/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.01/0.03 c constraints/knapsack/disaggregation = FALSE
0.01/0.03 c
0.01/0.03 c # should presolving try to simplify knapsacks
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.03 c
0.01/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c presolving/probing/maxrounds = 0
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/coefdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.01/0.03 c heuristics/crossover/freq = -1
0.01/0.03 c
0.01/0.03 c # number of nodes added to the contingent of the total nodes
0.01/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.03 c heuristics/crossover/nodesofs = 750
0.01/0.03 c
0.01/0.03 c # number of nodes without incumbent change that heuristic should wait
0.01/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.01/0.03 c heuristics/crossover/nwaitingnodes = 100
0.01/0.03 c
0.01/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.01/0.03 c # [type: real, range: [0,1], default: 0.1]
0.01/0.03 c heuristics/crossover/nodesquot = 0.15
0.01/0.03 c
0.01/0.03 c # minimum percentage of integer variables that have to be fixed
0.01/0.03 c # [type: real, range: [0,1], default: 0.666]
0.01/0.03 c heuristics/crossover/minfixingrate = 0.5
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03 c heuristics/feaspump/freq = -1
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/fracdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/guideddiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/intshifting/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/linesearchdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/nlp/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03 c heuristics/objpscostdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.01/0.03 c # [type: real, range: [0,1], default: 0.01]
0.01/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/oneopt/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/pscostdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c heuristics/rens/freq = -1
0.01/0.03 c
0.01/0.03 c # minimum percentage of integer variables that have to be fixable
0.01/0.03 c # [type: real, range: [0,1], default: 0.5]
0.01/0.03 c heuristics/rens/minfixingrate = 0.3
0.01/0.03 c
0.01/0.03 c # number of nodes added to the contingent of the total nodes
0.01/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.03 c heuristics/rens/nodesofs = 2000
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03 c heuristics/rootsoldiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.01/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/rounding/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/shifting/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/simplerounding/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c heuristics/trivial/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/trysol/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/veclendiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/zirounding/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c separating/cmir/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.04 c separating/flowcover/freq = -1
0.01/0.04 c
0.01/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c separating/rapidlearning/freq = 0
0.01/0.04 c
0.01/0.04 c -----------------------------------------------------------------------------------------------
0.01/0.04 c start solving
0.01/0.04 c
0.01/0.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.01/0.04 c 0.0s| 1 | 0 | 113 | - | 743k| 0 | 35 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 147 | - |1157k| 0 | 51 | 169 | 220 | 169 | 86 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 174 | - |1267k| 0 | 57 | 169 | 220 | 169 | 95 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.30 c 0.2s| 1 | 0 | 219 | - |1361k| 0 | 60 | 169 | 220 | 169 | 102 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 255 | - |1430k| 0 | 60 | 169 | 220 | 169 | 108 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.34 c 0.3s| 1 | 0 | 301 | - |1479k| 0 | 61 | 169 | 220 | 169 | 114 | 41 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.63 c 0.6s| 1 | 0 | 325 | - |1454k| 0 | 62 | 169 | 195 | 169 | 114 | 41 | 0 | 12 | 0.000000e+00 | -- | Inf
0.79/0.86 c 0.8s| 1 | 0 | 331 | - |1449k| 0 | 63 | 169 | 191 | 169 | 114 | 41 | 0 | 23 | 0.000000e+00 | -- | Inf
1.10/1.17 c 1.1s| 1 | 0 | 350 | - |1441k| 0 | 63 | 169 | 183 | 169 | 114 | 41 | 0 | 37 | 0.000000e+00 | -- | Inf
1.29/1.34 c 1.3s| 1 | 0 | 361 | - |1427k| 0 | 62 | 169 | 169 | 169 | 114 | 41 | 0 | 45 | 0.000000e+00 | -- | Inf
1.49/1.51 c 1.4s| 1 | 0 | 377 | - |1412k| 0 | 63 | 169 | 154 | 169 | 114 | 41 | 0 | 53 | 0.000000e+00 | -- | Inf
1.59/1.62 c 1.5s| 1 | 0 | 391 | - |1405k| 0 | 64 | 169 | 147 | 169 | 109 | 41 | 0 | 58 | 0.000000e+00 | -- | Inf
1.69/1.72 c 1.6s| 1 | 0 | 403 | - |1397k| 0 | 61 | 169 | 140 | 169 | 109 | 41 | 0 | 64 | 0.000000e+00 | -- | Inf
1.89/1.93 c 1.9s| 1 | 0 | 412 | - |1397k| 0 | 62 | 169 | 140 | 169 | 109 | 41 | 0 | 76 | 0.000000e+00 | -- | Inf
1.99/2.05 c 2.0s| 1 | 0 | 412 | - |1397k| 0 | - | 169 | 140 | 169 | 109 | 41 | 0 | 84 | 0.000000e+00 | -- | Inf
1.99/2.05 c (run 1, node 1) restarting after 37 global fixings of integer variables
1.99/2.05 c
1.99/2.05 c (restart) converted 36 cuts from the global cut pool into linear constraints
1.99/2.05 c
1.99/2.05 c presolving:
1.99/2.06 c (round 1) 37 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 18 impls, 90 clqs
1.99/2.06 c (round 2) 37 del vars, 6 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 18 impls, 90 clqs
1.99/2.06 c (round 3) 37 del vars, 6 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 97 upgd conss, 18 impls, 90 clqs
1.99/2.07 c (round 4) 37 del vars, 8 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 97 upgd conss, 18 impls, 90 clqs
1.99/2.07 c presolving (5 rounds):
1.99/2.07 c 37 deleted vars, 8 deleted constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 0 changed coefficients
1.99/2.07 c 18 implications, 90 cliques
1.99/2.07 c presolved problem has 132 variables (132 bin, 0 int, 0 impl, 0 cont) and 168 constraints
1.99/2.07 c 10 constraints of type <knapsack>
1.99/2.07 c 90 constraints of type <setppc>
1.99/2.07 c 68 constraints of type <logicor>
1.99/2.07 c transformed objective value is always integral (scale: 1)
1.99/2.07 c Presolving Time: 0.02
1.99/2.07 c
1.99/2.08 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.99/2.08 c 2.0s| 1 | 0 | 520 | - | 913k| 0 | 48 | 132 | 168 | 132 | 105 | 0 | 0 | 84 | 0.000000e+00 | -- | Inf
2.10/2.11 c 2.0s| 1 | 0 | 571 | - |1168k| 0 | 53 | 132 | 168 | 132 | 112 | 7 | 0 | 84 | 0.000000e+00 | -- | Inf
2.29/2.36 c 2.3s| 1 | 0 | 580 | - |1168k| 0 | 49 | 132 | 168 | 132 | 112 | 7 | 0 | 103 | 0.000000e+00 | -- | Inf
2.49/2.59 c 2.5s| 1 | 0 | 584 | - |1168k| 0 | 50 | 132 | 168 | 132 | 112 | 7 | 0 | 120 | 0.000000e+00 | -- | Inf
2.79/2.81 c 2.7s| 1 | 0 | 598 | - |1168k| 0 | 51 | 132 | 168 | 132 | 112 | 7 | 0 | 137 | 0.000000e+00 | -- | Inf
2.89/2.93 c 2.8s| 1 | 0 | 605 | - |1168k| 0 | 51 | 132 | 167 | 132 | 112 | 7 | 0 | 146 | 0.000000e+00 | -- | Inf
2.99/3.01 c 2.9s| 1 | 0 | 608 | - |1167k| 0 | 51 | 132 | 167 | 132 | 112 | 7 | 0 | 153 | 0.000000e+00 | -- | Inf
2.99/3.03 c 2.9s| 1 | 0 | 611 | - |1167k| 0 | 50 | 132 | 167 | 132 | 112 | 7 | 0 | 155 | 0.000000e+00 | -- | Inf
2.99/3.05 c 2.9s| 1 | 0 | 614 | - |1167k| 0 | 52 | 132 | 167 | 132 | 112 | 7 | 0 | 157 | 0.000000e+00 | -- | Inf
2.99/3.10 c 3.0s| 1 | 0 | 621 | - |1167k| 0 | 50 | 132 | 165 | 132 | 112 | 7 | 0 | 160 | 0.000000e+00 | -- | Inf
3.09/3.11 c 3.0s| 1 | 0 | 622 | - |1167k| 0 | 50 | 132 | 165 | 132 | 112 | 7 | 0 | 162 | 0.000000e+00 | -- | Inf
3.09/3.13 c 3.0s| 1 | 2 | 622 | - |1167k| 0 | 50 | 132 | 165 | 132 | 112 | 7 | 0 | 163 | 0.000000e+00 | -- | Inf
3.09/3.13 c (run 2, node 1) restarting after 23 global fixings of integer variables
3.09/3.13 c
3.09/3.13 c (restart) converted 4 cuts from the global cut pool into linear constraints
3.09/3.13 c
3.09/3.13 c presolving:
3.09/3.14 c (round 1) 23 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 4 upgd conss, 24 impls, 87 clqs
3.09/3.14 c presolving (2 rounds):
3.09/3.14 c 23 deleted vars, 24 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
3.09/3.14 c 24 implications, 87 cliques
3.09/3.14 c presolved problem has 109 variables (109 bin, 0 int, 0 impl, 0 cont) and 145 constraints
3.09/3.14 c 12 constraints of type <knapsack>
3.09/3.14 c 88 constraints of type <setppc>
3.09/3.14 c 45 constraints of type <logicor>
3.09/3.14 c transformed objective value is always integral (scale: 1)
3.09/3.14 c Presolving Time: 0.03
3.09/3.14 c
3.09/3.15 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.09/3.15 c 3.0s| 1 | 0 | 682 | - | 897k| 0 | 42 | 109 | 145 | 109 | 104 | 0 | 0 | 163 | 0.000000e+00 | -- | Inf
3.09/3.17 c 3.0s| 1 | 0 | 705 | - |1101k| 0 | 50 | 109 | 145 | 109 | 118 | 14 | 0 | 163 | 0.000000e+00 | -- | Inf
3.30/3.33 c 3.2s| 1 | 2 | 705 | - |1102k| 0 | 50 | 109 | 145 | 109 | 118 | 14 | 0 | 180 | 0.000000e+00 | -- | Inf
4.19/4.20 c * 4.0s| 10 | 0 | 1302 | 66.3 |1142k| 5 | - | 109 | 143 | 109 | 79 | 14 | 0 | 427 | 0.000000e+00 | 0.000000e+00 | 0.00%
4.19/4.20 c
4.19/4.20 c SCIP Status : problem is solved [optimal solution found]
4.19/4.20 c Solving Time (sec) : 4.04
4.19/4.20 c Solving Nodes : 10 (total of 12 nodes in 3 runs)
4.19/4.20 c Primal Bound : +0.00000000000000e+00 (1 solutions)
4.19/4.20 c Dual Bound : +0.00000000000000e+00
4.19/4.20 c Gap : 0.00 %
4.19/4.20 s SATISFIABLE
4.19/4.20 v -x169 -x168 x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 x152 -x151 -x150 -x149 -x148
4.19/4.20 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 x133 -x132 -x131 -x130 -x129 -x128 -x127
4.19/4.20 v -x126 -x125 -x124 x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 x112 -x111 -x110 -x109 -x108 -x107 -x106
4.19/4.20 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
4.19/4.20 v -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 x66 -x65 -x64 -x63 -x62 -x61 -x60 x59 -x58 -x57 -x56
4.19/4.20 v -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 x43 -x42 -x41 -x40 -x39 -x38 -x37 x36 -x35 -x34 -x33 -x32 -x31
4.19/4.20 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
4.19/4.20 v -x4 -x3 -x2 -x1
4.19/4.20 c SCIP Status : problem is solved [optimal solution found]
4.19/4.20 c Solving Time : 4.04
4.19/4.20 c Original Problem :
4.19/4.20 c Problem name : HOME/instance-2667191-1276276342.opb
4.19/4.20 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
4.19/4.20 c Constraints : 101 initial, 101 maximal
4.19/4.20 c Presolved Problem :
4.19/4.20 c Problem name : t_HOME/instance-2667191-1276276342.opb
4.19/4.20 c Variables : 109 (109 binary, 0 integer, 0 implicit integer, 0 continuous)
4.19/4.20 c Constraints : 145 initial, 145 maximal
4.19/4.20 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.19/4.20 c trivial : 0.00 60 0 0 0 0 0 0 0
4.19/4.20 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.19/4.20 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.19/4.20 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.19/4.20 c implics : 0.00 0 0 0 0 0 0 0 0
4.19/4.20 c probing : 0.00 0 0 0 0 0 0 0 0
4.19/4.20 c knapsack : 0.01 0 0 0 0 0 0 0 1
4.19/4.20 c setppc : 0.01 0 0 0 0 0 5 0 0
4.19/4.20 c linear : 0.00 0 0 0 0 0 34 2 0
4.19/4.20 c logicor : 0.00 0 0 0 0 0 21 0 0
4.19/4.20 c root node : - 83 - - 83 - - - -
4.19/4.20 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.19/4.20 c integral : 0 0 0 52 0 3 149 0 0 12
4.19/4.20 c knapsack : 12 7 77 1 0 0 9 0 0 0
4.19/4.20 c setppc : 88 7 77 0 0 0 207 0 0 0
4.19/4.20 c logicor : 45 7 30 1 0 0 1 0 0 0
4.19/4.20 c countsols : 0 0 0 1 0 0 0 0 0 0
4.19/4.20 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.19/4.20 c integral : 3.61 0.00 0.00 3.61 0.00
4.19/4.20 c knapsack : 0.00 0.00 0.00 0.00 0.00
4.19/4.20 c setppc : 0.00 0.00 0.00 0.00 0.00
4.19/4.20 c logicor : 0.00 0.00 0.00 0.00 0.00
4.19/4.20 c countsols : 0.00 0.00 0.00 0.00 0.00
4.19/4.20 c Propagators : Time Calls Cutoffs DomReds
4.19/4.20 c vbounds : 0.00 3 0 0
4.19/4.20 c rootredcost : 0.00 0 0 0
4.19/4.20 c pseudoobj : 0.00 0 0 0
4.19/4.20 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.19/4.20 c propagation : 0.00 0 0 0 0.0 0 0.0 -
4.19/4.20 c infeasible LP : 0.00 1 0 0 0.0 0 0.0 0
4.19/4.20 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.19/4.20 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.19/4.20 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.19/4.20 c applied globally : - - - 0 0.0 - - -
4.19/4.20 c applied locally : - - - 0 0.0 - - -
4.19/4.20 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.19/4.20 c cut pool : 0.00 0 - - 0 - (maximal pool size: 78)
4.19/4.20 c redcost : 0.00 16 0 0 0 0
4.19/4.20 c impliedbounds : 0.00 7 0 0 0 0
4.19/4.20 c intobj : 0.00 0 0 0 0 0
4.19/4.20 c cgmip : 0.00 0 0 0 0 0
4.19/4.20 c gomory : 0.06 7 0 0 15 0
4.19/4.20 c strongcg : 0.06 7 0 0 286 0
4.19/4.20 c cmir : 0.00 0 0 0 0 0
4.19/4.20 c flowcover : 0.00 0 0 0 0 0
4.19/4.20 c clique : 0.00 7 0 0 42 0
4.19/4.20 c zerohalf : 0.00 0 0 0 0 0
4.19/4.20 c mcf : 0.00 3 0 0 0 0
4.19/4.20 c rapidlearning : 0.17 1 0 0 0 147
4.19/4.20 c Pricers : Time Calls Vars
4.19/4.20 c problem variables: 0.00 0 0
4.19/4.20 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.19/4.20 c relpscost : 3.61 51 3 149 0 0 12
4.19/4.20 c pscost : 0.00 0 0 0 0 0 0
4.19/4.20 c inference : 0.00 0 0 0 0 0 0
4.19/4.20 c mostinf : 0.00 0 0 0 0 0 0
4.19/4.20 c leastinf : 0.00 0 0 0 0 0 0
4.19/4.20 c fullstrong : 0.00 0 0 0 0 0 0
4.19/4.20 c allfullstrong : 0.00 0 0 0 0 0 0
4.19/4.20 c random : 0.00 0 0 0 0 0 0
4.19/4.20 c Primal Heuristics : Time Calls Found
4.19/4.20 c LP solutions : 0.01 - 1
4.19/4.20 c pseudo solutions : 0.00 - 0
4.19/4.20 c trivial : 0.00 1 0
4.19/4.20 c simplerounding : 0.00 0 0
4.19/4.20 c zirounding : 0.00 0 0
4.19/4.20 c rounding : 0.00 0 0
4.19/4.20 c shifting : 0.00 0 0
4.19/4.20 c intshifting : 0.00 0 0
4.19/4.20 c oneopt : 0.00 0 0
4.19/4.20 c twoopt : 0.00 0 0
4.19/4.20 c fixandinfer : 0.00 0 0
4.19/4.20 c feaspump : 0.00 0 0
4.19/4.20 c coefdiving : 0.00 0 0
4.19/4.20 c pscostdiving : 0.00 0 0
4.19/4.20 c fracdiving : 0.00 0 0
4.19/4.20 c veclendiving : 0.00 0 0
4.19/4.20 c intdiving : 0.00 0 0
4.19/4.20 c actconsdiving : 0.00 0 0
4.19/4.20 c objpscostdiving : 0.00 0 0
4.19/4.20 c rootsoldiving : 0.00 0 0
4.19/4.20 c linesearchdiving : 0.00 0 0
4.19/4.20 c guideddiving : 0.00 0 0
4.19/4.20 c octane : 0.00 0 0
4.19/4.20 c rens : 0.00 0 0
4.19/4.20 c rins : 0.00 0 0
4.19/4.20 c localbranching : 0.00 0 0
4.19/4.20 c mutation : 0.00 0 0
4.19/4.20 c crossover : 0.00 0 0
4.19/4.20 c dins : 0.00 0 0
4.19/4.20 c undercover : 0.00 0 0
4.19/4.20 c nlp : 0.00 0 0
4.19/4.20 c trysol : 0.00 0 0
4.19/4.20 c LP : Time Calls Iterations Iter/call Iter/sec
4.19/4.20 c primal LP : 0.00 0 0 0.00 -
4.19/4.20 c dual LP : 0.07 60 1302 21.70 18600.00
4.19/4.20 c lex dual LP : 0.00 0 0 0.00 -
4.19/4.20 c barrier LP : 0.00 0 0 0.00 -
4.19/4.20 c diving/probing LP: 0.00 0 0 0.00 -
4.19/4.20 c strong branching : 3.61 427 41976 98.30 11627.70
4.19/4.20 c (at root node) : - 180 29120 161.78 -
4.19/4.20 c conflict analysis: 0.00 0 0 0.00 -
4.19/4.20 c B&B Tree :
4.19/4.20 c number of runs : 3
4.19/4.20 c nodes : 10
4.19/4.20 c nodes (total) : 12
4.19/4.20 c nodes left : 0
4.19/4.20 c max depth : 5
4.19/4.20 c max depth (total): 5
4.19/4.20 c backtracks : 0 (0.0%)
4.19/4.20 c delayed cutoffs : 0
4.19/4.20 c repropagations : 3 (0 domain reductions, 0 cutoffs)
4.19/4.20 c avg switch length: 3.20
4.19/4.20 c switching time : 0.00
4.19/4.20 c Solution :
4.19/4.20 c Solutions found : 1 (1 improvements)
4.19/4.20 c First Solution : +0.00000000000000e+00 (in run 3, after 10 nodes, 4.03 seconds, depth 5, found by <relaxation>)
4.19/4.20 c Primal Bound : +0.00000000000000e+00 (in run 3, after 10 nodes, 4.03 seconds, depth 5, found by <relaxation>)
4.19/4.20 c Dual Bound : +0.00000000000000e+00
4.19/4.20 c Gap : 0.00 %
4.19/4.20 c Root Dual Bound : +0.00000000000000e+00
4.19/4.20 c Root Iterations : 705
4.19/4.21 c Time complete: 4.2.