0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2665711-1276271697.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.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.00/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.00/0.03 c presolving (3 rounds):
0.00/0.03 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 8 implications, 68 cliques
0.00/0.03 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.03 c 1 constraints of type <knapsack>
0.00/0.03 c 68 constraints of type <setppc>
0.00/0.03 c 4 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1799.99
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c limits/solutions = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03 c separating/maxrounds = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/maxroundsroot = 5
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03 c constraints/knapsack/disaggregation = FALSE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c presolving/probing/maxrounds = 0
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/coefdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03 c heuristics/crossover/freq = -1
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/crossover/nodesofs = 750
0.00/0.03 c
0.00/0.03 c # number of nodes without incumbent change that heuristic should wait
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03 c heuristics/crossover/nwaitingnodes = 100
0.00/0.03 c
0.00/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03 c # [type: real, range: [0,1], default: 0.1]
0.00/0.03 c heuristics/crossover/nodesquot = 0.15
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixed
0.00/0.03 c # [type: real, range: [0,1], default: 0.666]
0.00/0.03 c heuristics/crossover/minfixingrate = 0.5
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/feaspump/freq = -1
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/fracdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/guideddiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/intshifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/linesearchdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/nlp/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/objpscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03 c # [type: real, range: [0,1], default: 0.01]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/oneopt/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/pscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/rens/freq = -1
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixable
0.00/0.03 c # [type: real, range: [0,1], default: 0.5]
0.00/0.03 c heuristics/rens/minfixingrate = 0.3
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/rens/nodesofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/rootsoldiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/rounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/shifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/simplerounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/trivial/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/trysol/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/veclendiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/zirounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/cmir/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/flowcover/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.04 c
0.00/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.00/0.04 c 0.0s| 1 | 0 | 43 | - | 743k| 0 | 40 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 84 | - |1188k| 0 | 55 | 169 | 201 | 169 | 99 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 176 | - |1193k| 0 | 65 | 169 | 201 | 169 | 107 | 34 | 0 | 0 | 0.000000e+00 | -- | Inf
0.30/0.32 c 0.3s| 1 | 0 | 432 | - |1207k| 0 | 61 | 169 | 201 | 169 | 111 | 38 | 0 | 0 | 0.000000e+00 | -- | Inf
0.30/0.35 c 0.3s| 1 | 0 | 506 | - |1212k| 0 | 67 | 169 | 201 | 169 | 118 | 45 | 0 | 0 | 0.000000e+00 | -- | Inf
0.30/0.38 c 0.3s| 1 | 0 | 612 | - |1215k| 0 | 64 | 169 | 201 | 169 | 122 | 49 | 0 | 0 | 0.000000e+00 | -- | Inf
0.79/0.84 c 0.8s| 1 | 0 | 648 | - |1194k| 0 | 66 | 169 | 182 | 169 | 122 | 49 | 0 | 12 | 0.000000e+00 | -- | Inf
1.19/1.29 c 1.2s| 1 | 0 | 676 | - |1193k| 0 | 67 | 169 | 181 | 169 | 122 | 49 | 0 | 23 | 0.000000e+00 | -- | Inf
1.69/1.78 c 1.7s| 1 | 0 | 915 | - |1190k| 0 | 66 | 169 | 179 | 169 | 122 | 49 | 0 | 33 | 0.000000e+00 | -- | Inf
2.20/2.25 c 2.2s| 1 | 0 | 1025 | - |1190k| 0 | 65 | 169 | 179 | 169 | 122 | 49 | 0 | 44 | 0.000000e+00 | -- | Inf
2.59/2.69 c 2.6s| 1 | 0 | 1052 | - |1179k| 0 | 64 | 169 | 169 | 169 | 122 | 49 | 0 | 55 | 0.000000e+00 | -- | Inf
3.20/3.25 c 3.2s| 1 | 0 | 1165 | - |1129k| 0 | 59 | 169 | 123 | 169 | 106 | 49 | 0 | 68 | 0.000000e+00 | -- | Inf
3.59/3.61 c 3.5s| 1 | 0 | 1186 | - |1129k| 0 | 61 | 169 | 123 | 169 | 106 | 49 | 0 | 78 | 0.000000e+00 | -- | Inf
3.99/4.02 c 3.9s| 1 | 0 | 1200 | - |1129k| 0 | 62 | 169 | 123 | 169 | 106 | 49 | 0 | 90 | 0.000000e+00 | -- | Inf
4.09/4.18 c 4.1s| 1 | 0 | 1201 | - |1129k| 0 | 62 | 169 | 123 | 169 | 106 | 49 | 0 | 95 | 0.000000e+00 | -- | Inf
4.19/4.21 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.19/4.21 c 4.1s| 1 | 0 | 1203 | - |1128k| 0 | 61 | 169 | 122 | 169 | 106 | 49 | 0 | 96 | 0.000000e+00 | -- | Inf
4.19/4.21 c 4.1s| 1 | 2 | 1203 | - |1128k| 0 | 61 | 169 | 122 | 169 | 106 | 49 | 0 | 96 | 0.000000e+00 | -- | Inf
4.19/4.21 c (run 1, node 1) restarting after 20 global fixings of integer variables
4.19/4.21 c
4.19/4.21 c (restart) converted 26 cuts from the global cut pool into linear constraints
4.19/4.21 c
4.19/4.21 c presolving:
4.19/4.22 c (round 1) 20 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 75 upgd conss, 10 impls, 81 clqs
4.19/4.23 c (round 2) 20 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 75 upgd conss, 10 impls, 81 clqs
4.19/4.23 c presolving (3 rounds):
4.19/4.23 c 20 deleted vars, 3 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
4.19/4.23 c 10 implications, 81 cliques
4.19/4.23 c presolved problem has 149 variables (149 bin, 0 int, 0 impl, 0 cont) and 145 constraints
4.19/4.23 c 13 constraints of type <knapsack>
4.19/4.23 c 81 constraints of type <setppc>
4.19/4.23 c 51 constraints of type <logicor>
4.19/4.23 c transformed objective value is always integral (scale: 1)
4.19/4.23 c Presolving Time: 0.03
4.19/4.23 c
4.19/4.24 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.19/4.24 c 4.1s| 1 | 0 | 1285 | - | 957k| 0 | 46 | 149 | 145 | 149 | 96 | 0 | 0 | 96 | 0.000000e+00 | -- | Inf
4.19/4.29 c 4.2s| 1 | 0 | 1535 | - |1352k| 0 | 50 | 149 | 145 | 149 | 105 | 9 | 0 | 96 | 0.000000e+00 | -- | Inf
4.59/4.61 c 4.5s| 1 | 0 | 1545 | - |1352k| 0 | 55 | 149 | 145 | 149 | 105 | 9 | 0 | 115 | 0.000000e+00 | -- | Inf
4.79/4.87 c 4.7s| 1 | 0 | 1727 | - |1352k| 0 | 54 | 149 | 145 | 149 | 105 | 9 | 0 | 125 | 0.000000e+00 | -- | Inf
4.99/5.08 c 5.0s| 1 | 0 | 1902 | - |1352k| 0 | 43 | 149 | 145 | 149 | 105 | 9 | 0 | 135 | 0.000000e+00 | -- | Inf
5.09/5.15 c 5.0s| 1 | 0 | 1953 | - |1352k| 0 | 44 | 149 | 145 | 149 | 105 | 9 | 0 | 141 | 0.000000e+00 | -- | Inf
5.19/5.26 c 5.1s| 1 | 0 | 2006 | - |1351k| 0 | 42 | 149 | 144 | 149 | 105 | 9 | 0 | 152 | 0.000000e+00 | -- | Inf
5.29/5.33 c 5.2s| 1 | 0 | 2020 | - |1351k| 0 | 43 | 149 | 143 | 149 | 105 | 9 | 0 | 160 | 0.000000e+00 | -- | Inf
5.39/5.44 c 5.3s| 1 | 0 | 2020 | - |1351k| 0 | - | 149 | 143 | 149 | 105 | 9 | 0 | 171 | 0.000000e+00 | -- | Inf
5.39/5.44 c (run 2, node 1) restarting after 32 global fixings of integer variables
5.39/5.44 c
5.39/5.44 c (restart) converted 9 cuts from the global cut pool into linear constraints
5.39/5.44 c
5.39/5.44 c presolving:
5.39/5.45 c (round 1) 33 del vars, 30 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 18 impls, 81 clqs
5.39/5.46 c (round 2) 33 del vars, 34 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 18 impls, 81 clqs
5.39/5.47 c presolving (3 rounds):
5.39/5.47 c 33 deleted vars, 34 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
5.39/5.47 c 18 implications, 81 cliques
5.39/5.47 c presolved problem has 116 variables (116 bin, 0 int, 0 impl, 0 cont) and 118 constraints
5.39/5.47 c 17 constraints of type <knapsack>
5.39/5.47 c 82 constraints of type <setppc>
5.39/5.47 c 19 constraints of type <logicor>
5.39/5.47 c transformed objective value is always integral (scale: 1)
5.39/5.47 c Presolving Time: 0.04
5.39/5.47 c
5.39/5.47 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
5.39/5.47 c 5.3s| 1 | 0 | 2094 | - | 952k| 0 | 42 | 116 | 118 | 116 | 100 | 0 | 0 | 171 | 0.000000e+00 | -- | Inf
5.50/5.50 c 5.3s| 1 | 0 | 2166 | - |1280k| 0 | 51 | 116 | 118 | 116 | 110 | 10 | 0 | 171 | 0.000000e+00 | -- | Inf
5.59/5.66 c 5.5s| 1 | 0 | 2206 | - |1280k| 0 | 48 | 116 | 118 | 116 | 110 | 10 | 0 | 187 | 0.000000e+00 | -- | Inf
5.69/5.73 c 5.5s| 1 | 0 | 2245 | - |1279k| 0 | 47 | 116 | 117 | 116 | 110 | 10 | 0 | 194 | 0.000000e+00 | -- | Inf
5.69/5.78 c 5.6s| 1 | 0 | 2318 | - |1276k| 0 | 35 | 116 | 107 | 116 | 110 | 10 | 0 | 200 | 0.000000e+00 | -- | Inf
5.79/5.80 c 5.6s| 1 | 0 | 2318 | - |1275k| 0 | - | 116 | 107 | 116 | 110 | 10 | 0 | 205 | 0.000000e+00 | -- | Inf
5.79/5.80 c (run 3, node 1) restarting after 34 global fixings of integer variables
5.79/5.80 c
5.79/5.80 c (restart) converted 10 cuts from the global cut pool into linear constraints
5.79/5.80 c
5.79/5.81 c presolving:
5.79/5.82 c (round 1) 34 del vars, 9 del conss, 0 chg bounds, 21 chg sides, 33 chg coeffs, 10 upgd conss, 42 impls, 66 clqs
5.79/5.83 c (round 2) 34 del vars, 17 del conss, 0 chg bounds, 22 chg sides, 40 chg coeffs, 10 upgd conss, 42 impls, 66 clqs
5.79/5.83 c (round 3) 34 del vars, 17 del conss, 0 chg bounds, 22 chg sides, 45 chg coeffs, 10 upgd conss, 42 impls, 66 clqs
5.79/5.83 c (round 4) 34 del vars, 17 del conss, 0 chg bounds, 22 chg sides, 48 chg coeffs, 10 upgd conss, 42 impls, 66 clqs
5.79/5.83 c (round 5) 34 del vars, 17 del conss, 0 chg bounds, 22 chg sides, 51 chg coeffs, 10 upgd conss, 42 impls, 66 clqs
5.79/5.84 c (round 6) 34 del vars, 17 del conss, 0 chg bounds, 22 chg sides, 54 chg coeffs, 10 upgd conss, 42 impls, 66 clqs
5.79/5.84 c (round 7) 34 del vars, 17 del conss, 0 chg bounds, 22 chg sides, 56 chg coeffs, 10 upgd conss, 42 impls, 66 clqs
5.79/5.84 c (round 8) 34 del vars, 17 del conss, 0 chg bounds, 22 chg sides, 58 chg coeffs, 10 upgd conss, 42 impls, 66 clqs
5.79/5.84 c (round 9) 34 del vars, 17 del conss, 0 chg bounds, 22 chg sides, 60 chg coeffs, 10 upgd conss, 42 impls, 66 clqs
5.79/5.84 c (round 10) 34 del vars, 17 del conss, 0 chg bounds, 22 chg sides, 62 chg coeffs, 10 upgd conss, 42 impls, 66 clqs
5.79/5.85 c (round 11) 34 del vars, 17 del conss, 0 chg bounds, 22 chg sides, 64 chg coeffs, 10 upgd conss, 42 impls, 66 clqs
5.79/5.85 c (round 12) 34 del vars, 17 del conss, 0 chg bounds, 22 chg sides, 66 chg coeffs, 10 upgd conss, 42 impls, 66 clqs
5.79/5.85 c (round 13) 34 del vars, 17 del conss, 0 chg bounds, 22 chg sides, 68 chg coeffs, 10 upgd conss, 42 impls, 66 clqs
5.79/5.85 c (round 14) 34 del vars, 17 del conss, 0 chg bounds, 22 chg sides, 70 chg coeffs, 10 upgd conss, 42 impls, 66 clqs
5.79/5.85 c (round 15) 34 del vars, 17 del conss, 0 chg bounds, 22 chg sides, 72 chg coeffs, 10 upgd conss, 42 impls, 66 clqs
5.79/5.85 c (round 16) 34 del vars, 17 del conss, 0 chg bounds, 22 chg sides, 74 chg coeffs, 10 upgd conss, 42 impls, 66 clqs
5.79/5.86 c (round 17) 34 del vars, 17 del conss, 0 chg bounds, 22 chg sides, 76 chg coeffs, 10 upgd conss, 42 impls, 66 clqs
5.79/5.86 c (round 18) 34 del vars, 17 del conss, 0 chg bounds, 22 chg sides, 80 chg coeffs, 10 upgd conss, 42 impls, 66 clqs
5.79/5.86 c presolving (19 rounds):
5.79/5.86 c 34 deleted vars, 17 deleted constraints, 0 tightened bounds, 0 added holes, 22 changed sides, 80 changed coefficients
5.79/5.86 c 42 implications, 66 cliques
5.79/5.86 c presolved problem has 82 variables (82 bin, 0 int, 0 impl, 0 cont) and 100 constraints
5.79/5.86 c 23 constraints of type <knapsack>
5.79/5.86 c 69 constraints of type <setppc>
5.79/5.86 c 8 constraints of type <logicor>
5.79/5.86 c transformed objective value is always integral (scale: 1)
5.79/5.86 c Presolving Time: 0.07
5.79/5.86 c
5.79/5.87 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
5.79/5.87 c 5.7s| 1 | 0 | 2379 | - | 925k| 0 | - | 82 | 100 | 82 | 94 | 0 | 0 | 205 | -- | -- | 0.00%
5.79/5.87 c 5.7s| 1 | 0 | 2379 | - | 925k| 0 | - | 82 | 100 | 82 | 94 | 0 | 0 | 205 | -- | -- | 0.00%
5.79/5.87 c
5.79/5.87 c SCIP Status : problem is solved [infeasible]
5.79/5.87 c Solving Time (sec) : 5.66
5.79/5.87 c Solving Nodes : 1 (total of 4 nodes in 4 runs)
5.79/5.87 c Primal Bound : +1.00000000000000e+20 (0 solutions)
5.79/5.87 c Dual Bound : +1.00000000000000e+20
5.79/5.87 c Gap : 0.00 %
5.79/5.87 s UNSATISFIABLE
5.79/5.87 c SCIP Status : problem is solved [infeasible]
5.79/5.87 c Solving Time : 5.66
5.79/5.87 c Original Problem :
5.79/5.87 c Problem name : HOME/instance-2665711-1276271697.opb
5.79/5.87 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
5.79/5.87 c Constraints : 101 initial, 101 maximal
5.79/5.87 c Presolved Problem :
5.79/5.87 c Problem name : t_HOME/instance-2665711-1276271697.opb
5.79/5.87 c Variables : 82 (82 binary, 0 integer, 0 implicit integer, 0 continuous)
5.79/5.87 c Constraints : 100 initial, 100 maximal
5.79/5.87 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
5.79/5.87 c trivial : 0.00 86 0 0 0 0 0 0 0
5.79/5.87 c dualfix : 0.00 0 0 0 0 0 0 0 0
5.79/5.87 c boundshift : 0.00 0 0 0 0 0 0 0 0
5.79/5.87 c inttobinary : 0.00 0 0 0 0 0 0 0 0
5.79/5.87 c implics : 0.00 0 0 0 0 0 0 0 0
5.79/5.87 c probing : 0.00 0 0 0 0 0 0 0 0
5.79/5.87 c knapsack : 0.06 0 0 0 0 0 0 22 80
5.79/5.87 c setppc : 0.00 0 1 0 0 0 14 0 0
5.79/5.87 c linear : 0.00 0 0 0 0 0 28 0 0
5.79/5.87 c logicor : 0.00 0 0 0 0 0 40 0 0
5.79/5.87 c root node : - 86 - - 86 - - - -
5.79/5.87 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
5.79/5.87 c integral : 0 0 0 22 0 0 72 0 0 2
5.79/5.87 c knapsack : 23 7 25 0 0 0 5 0 0 0
5.79/5.87 c setppc : 69 7 25 0 0 0 9 0 0 0
5.79/5.87 c logicor : 8 7 11 0 0 0 0 0 0 0
5.79/5.87 c countsols : 0 0 0 0 0 0 0 0 0 0
5.79/5.87 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
5.79/5.87 c integral : 5.07 0.00 0.00 5.07 0.00
5.79/5.87 c knapsack : 0.02 0.02 0.00 0.00 0.00
5.79/5.87 c setppc : 0.00 0.00 0.00 0.00 0.00
5.79/5.87 c logicor : 0.00 0.00 0.00 0.00 0.00
5.79/5.87 c countsols : 0.00 0.00 0.00 0.00 0.00
5.79/5.87 c Propagators : Time Calls Cutoffs DomReds
5.79/5.87 c vbounds : 0.00 4 0 0
5.79/5.87 c rootredcost : 0.00 0 0 0
5.79/5.87 c pseudoobj : 0.00 0 0 0
5.79/5.87 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
5.79/5.87 c propagation : 0.00 0 0 0 0.0 0 0.0 -
5.79/5.87 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
5.79/5.87 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
5.79/5.87 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
5.79/5.87 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
5.79/5.87 c applied globally : - - - 0 0.0 - - -
5.79/5.87 c applied locally : - - - 0 0.0 - - -
5.79/5.87 c Separators : Time Calls Cutoffs DomReds Cuts Conss
5.79/5.87 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
5.79/5.87 c redcost : 0.00 7 0 0 0 0
5.79/5.87 c impliedbounds : 0.00 7 0 0 0 0
5.79/5.87 c intobj : 0.00 0 0 0 0 0
5.79/5.87 c cgmip : 0.00 0 0 0 0 0
5.79/5.87 c gomory : 0.04 7 0 0 93 0
5.79/5.87 c strongcg : 0.07 7 0 0 216 0
5.79/5.87 c cmir : 0.00 0 0 0 0 0
5.79/5.87 c flowcover : 0.00 0 0 0 0 0
5.79/5.87 c clique : 0.00 7 0 0 32 0
5.79/5.87 c zerohalf : 0.00 0 0 0 0 0
5.79/5.87 c mcf : 0.00 3 0 0 0 0
5.79/5.87 c rapidlearning : 0.17 1 0 0 0 128
5.79/5.87 c Pricers : Time Calls Vars
5.79/5.87 c problem variables: 0.00 0 0
5.79/5.87 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
5.79/5.87 c relpscost : 5.07 22 0 72 0 0 2
5.79/5.87 c pscost : 0.00 0 0 0 0 0 0
5.79/5.87 c inference : 0.00 0 0 0 0 0 0
5.79/5.87 c mostinf : 0.00 0 0 0 0 0 0
5.79/5.87 c leastinf : 0.00 0 0 0 0 0 0
5.79/5.87 c fullstrong : 0.00 0 0 0 0 0 0
5.79/5.87 c allfullstrong : 0.00 0 0 0 0 0 0
5.79/5.87 c random : 0.00 0 0 0 0 0 0
5.79/5.87 c Primal Heuristics : Time Calls Found
5.79/5.87 c LP solutions : 0.00 - 0
5.79/5.87 c pseudo solutions : 0.00 - 0
5.79/5.87 c trivial : 0.00 1 0
5.79/5.87 c simplerounding : 0.00 0 0
5.79/5.87 c zirounding : 0.00 0 0
5.79/5.87 c rounding : 0.00 0 0
5.79/5.87 c shifting : 0.00 0 0
5.79/5.87 c intshifting : 0.00 0 0
5.79/5.87 c oneopt : 0.00 0 0
5.79/5.87 c twoopt : 0.00 0 0
5.79/5.87 c fixandinfer : 0.00 0 0
5.79/5.87 c feaspump : 0.00 0 0
5.79/5.87 c coefdiving : 0.00 0 0
5.79/5.87 c pscostdiving : 0.00 0 0
5.79/5.87 c fracdiving : 0.00 0 0
5.79/5.87 c veclendiving : 0.00 0 0
5.79/5.87 c intdiving : 0.00 0 0
5.79/5.87 c actconsdiving : 0.00 0 0
5.79/5.87 c objpscostdiving : 0.00 0 0
5.79/5.87 c rootsoldiving : 0.00 0 0
5.79/5.87 c linesearchdiving : 0.00 0 0
5.79/5.87 c guideddiving : 0.00 0 0
5.79/5.87 c octane : 0.00 0 0
5.79/5.87 c rens : 0.00 0 0
5.79/5.87 c rins : 0.00 0 0
5.79/5.87 c localbranching : 0.00 0 0
5.79/5.87 c mutation : 0.00 0 0
5.79/5.87 c crossover : 0.00 0 0
5.79/5.87 c dins : 0.00 0 0
5.79/5.87 c undercover : 0.00 0 0
5.79/5.87 c nlp : 0.00 0 0
5.79/5.87 c trysol : 0.00 0 0
5.79/5.87 c LP : Time Calls Iterations Iter/call Iter/sec
5.79/5.87 c primal LP : 0.00 0 0 0.00 -
5.79/5.87 c dual LP : 0.18 30 2379 79.30 13216.67
5.79/5.87 c lex dual LP : 0.00 0 0 0.00 -
5.79/5.87 c barrier LP : 0.00 0 0 0.00 -
5.79/5.87 c diving/probing LP: 0.00 0 0 0.00 -
5.79/5.87 c strong branching : 5.07 205 76586 373.59 15105.72
5.79/5.87 c (at root node) : - 205 76586 373.59 -
5.79/5.87 c conflict analysis: 0.00 0 0 0.00 -
5.79/5.87 c B&B Tree :
5.79/5.87 c number of runs : 4
5.79/5.87 c nodes : 1
5.79/5.87 c nodes (total) : 4
5.79/5.87 c nodes left : 0
5.79/5.87 c max depth : 0
5.79/5.87 c max depth (total): 0
5.79/5.87 c backtracks : 0 (0.0%)
5.79/5.87 c delayed cutoffs : 0
5.79/5.87 c repropagations : 0 (0 domain reductions, 0 cutoffs)
5.79/5.87 c avg switch length: 2.00
5.79/5.87 c switching time : 0.00
5.79/5.87 c Solution :
5.79/5.87 c Solutions found : 0 (0 improvements)
5.79/5.87 c Primal Bound : infeasible
5.79/5.87 c Dual Bound : -
5.79/5.87 c Gap : 0.00 %
5.79/5.87 c Root Dual Bound : -
5.79/5.87 c Root Iterations : 2379
5.79/5.87 c Time complete: 5.86.