0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2704046-1278548340.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.02 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 72 constraints of type <setppc>
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.3
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 = 1790
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 # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.03 c # [type: int, range: [1,2], default: 1]
0.00/0.03 c timing/clocktype = 2
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 # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/indicator/addCouplingCons = 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.03 c
0.03/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.03/0.04 c 0.0s| 1 | 0 | 102 | - | 743k| 0 | 45 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 137 | - |1131k| 0 | 50 | 169 | 208 | 169 | 80 | 7 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 158 | - |1360k| 0 | 52 | 169 | 208 | 169 | 86 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 191 | - |1461k| 0 | 56 | 169 | 208 | 169 | 91 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.3s| 1 | 0 | 218 | - |1494k| 0 | 60 | 169 | 208 | 169 | 95 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.3s| 1 | 0 | 247 | - |1523k| 0 | 54 | 169 | 208 | 169 | 98 | 25 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.42 c 0.4s| 1 | 0 | 280 | - |1503k| 0 | 57 | 169 | 190 | 169 | 98 | 25 | 0 | 12 | 0.000000e+00 | -- | Inf
0.49/0.54 c 0.5s| 1 | 0 | 284 | - |1498k| 0 | 58 | 169 | 185 | 169 | 98 | 25 | 0 | 22 | 0.000000e+00 | -- | Inf
0.59/0.67 c 0.7s| 1 | 0 | 291 | - |1470k| 0 | 57 | 169 | 156 | 169 | 98 | 25 | 0 | 32 | 0.000000e+00 | -- | Inf
0.69/0.76 c 0.7s| 1 | 0 | 318 | - |1467k| 0 | 61 | 169 | 153 | 169 | 98 | 25 | 0 | 39 | 0.000000e+00 | -- | Inf
0.79/0.87 c 0.9s| 1 | 0 | 334 | - |1461k| 0 | 59 | 169 | 146 | 169 | 98 | 25 | 0 | 47 | 0.000000e+00 | -- | Inf
0.89/0.94 c 0.9s| 1 | 0 | 342 | - |1453k| 0 | 59 | 169 | 138 | 169 | 96 | 25 | 0 | 53 | 0.000000e+00 | -- | Inf
1.00/1.06 c 1.0s| 1 | 0 | 355 | - |1452k| 0 | 56 | 169 | 137 | 169 | 96 | 25 | 0 | 64 | 0.000000e+00 | -- | Inf
1.10/1.14 c 1.1s| 1 | 0 | 355 | - |1452k| 0 | - | 169 | 137 | 169 | 96 | 25 | 0 | 72 | 0.000000e+00 | -- | Inf
1.10/1.14 c (run 1, node 1) restarting after 34 global fixings of integer variables
1.10/1.14 c
1.10/1.14 c (restart) converted 22 cuts from the global cut pool into linear constraints
1.10/1.14 c
1.10/1.15 c presolving:
1.10/1.15 c (round 1) 34 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 8 impls, 84 clqs
1.10/1.16 c (round 2) 34 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 85 upgd conss, 8 impls, 84 clqs
1.10/1.17 c (round 3) 34 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 85 upgd conss, 8 impls, 84 clqs
1.10/1.17 c presolving (4 rounds):
1.10/1.17 c 34 deleted vars, 4 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.10/1.17 c 8 implications, 84 cliques
1.10/1.17 c presolved problem has 135 variables (135 bin, 0 int, 0 impl, 0 cont) and 155 constraints
1.10/1.17 c 7 constraints of type <knapsack>
1.10/1.17 c 85 constraints of type <setppc>
1.10/1.17 c 63 constraints of type <logicor>
1.10/1.17 c transformed objective value is always integral (scale: 1)
1.10/1.17 c Presolving Time: 0.04
1.10/1.17 c
1.10/1.17 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.10/1.17 c 1.2s| 1 | 0 | 435 | - | 887k| 0 | 45 | 135 | 155 | 135 | 92 | 0 | 0 | 72 | 0.000000e+00 | -- | Inf
1.10/1.19 c 1.2s| 1 | 0 | 461 | - |1106k| 0 | 52 | 135 | 155 | 135 | 101 | 9 | 0 | 72 | 0.000000e+00 | -- | Inf
1.29/1.33 c 1.3s| 1 | 0 | 479 | - |1106k| 0 | 55 | 135 | 155 | 135 | 101 | 9 | 0 | 92 | 0.000000e+00 | -- | Inf
1.29/1.38 c 1.4s| 1 | 0 | 490 | - |1105k| 0 | 55 | 135 | 149 | 135 | 101 | 9 | 0 | 98 | 0.000000e+00 | -- | Inf
1.39/1.45 c 1.4s| 1 | 0 | 499 | - |1103k| 0 | 53 | 135 | 145 | 135 | 101 | 9 | 0 | 108 | 0.000000e+00 | -- | Inf
1.50/1.54 c 1.5s| 1 | 0 | 520 | - |1103k| 0 | 50 | 135 | 144 | 135 | 101 | 9 | 0 | 120 | 0.000000e+00 | -- | Inf
1.59/1.63 c 1.6s| 1 | 0 | 547 | - |1103k| 0 | 50 | 135 | 142 | 135 | 101 | 9 | 0 | 133 | 0.000000e+00 | -- | Inf
1.59/1.67 c 1.7s| 1 | 0 | 547 | - |1103k| 0 | - | 135 | 142 | 135 | 101 | 9 | 0 | 142 | 0.000000e+00 | -- | Inf
1.59/1.67 c (run 2, node 1) restarting after 28 global fixings of integer variables
1.59/1.67 c
1.59/1.67 c (restart) converted 9 cuts from the global cut pool into linear constraints
1.59/1.67 c
1.59/1.67 c presolving:
1.59/1.68 c (round 1) 28 del vars, 29 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 18 impls, 84 clqs
1.59/1.69 c (round 2) 28 del vars, 32 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 18 impls, 84 clqs
1.59/1.69 c presolving (3 rounds):
1.59/1.69 c 28 deleted vars, 32 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.59/1.69 c 18 implications, 84 cliques
1.59/1.69 c presolved problem has 107 variables (107 bin, 0 int, 0 impl, 0 cont) and 119 constraints
1.59/1.69 c 10 constraints of type <knapsack>
1.59/1.69 c 87 constraints of type <setppc>
1.59/1.69 c 22 constraints of type <logicor>
1.59/1.69 c transformed objective value is always integral (scale: 1)
1.59/1.69 c Presolving Time: 0.05
1.59/1.69 c
1.59/1.69 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.59/1.69 c 1.7s| 1 | 0 | 642 | - | 875k| 0 | 45 | 107 | 119 | 107 | 97 | 0 | 0 | 142 | 0.000000e+00 | -- | Inf
1.69/1.72 c 1.7s| 1 | 0 | 685 | - |1090k| 0 | 52 | 107 | 119 | 107 | 109 | 12 | 0 | 142 | 0.000000e+00 | -- | Inf
1.80/1.88 c 1.9s| 1 | 0 | 694 | - |1090k| 0 | 52 | 107 | 119 | 107 | 109 | 12 | 0 | 163 | 0.000000e+00 | -- | Inf
1.89/1.99 c 2.0s| 1 | 0 | 754 | - |1090k| 0 | 47 | 107 | 119 | 107 | 109 | 12 | 0 | 175 | 0.000000e+00 | -- | Inf
1.99/2.03 c 2.0s| 1 | 0 | 769 | - |1089k| 0 | 45 | 107 | 117 | 107 | 109 | 12 | 0 | 181 | 0.000000e+00 | -- | Inf
1.99/2.05 c 2.0s| 1 | 0 | 775 | - |1088k| 0 | 45 | 107 | 113 | 107 | 109 | 12 | 0 | 186 | 0.000000e+00 | -- | Inf
1.99/2.07 c 2.1s| 1 | 0 | 775 | - |1087k| 0 | - | 107 | 113 | 107 | 109 | 12 | 0 | 191 | 0.000000e+00 | -- | Inf
1.99/2.07 c (run 3, node 1) restarting after 24 global fixings of integer variables
1.99/2.07 c
1.99/2.07 c (restart) converted 12 cuts from the global cut pool into linear constraints
1.99/2.07 c
1.99/2.08 c presolving:
1.99/2.08 c (round 1) 24 del vars, 15 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 38 impls, 75 clqs
1.99/2.09 c (round 2) 24 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 11 upgd conss, 38 impls, 75 clqs
1.99/2.09 c (round 3) 24 del vars, 25 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 11 upgd conss, 38 impls, 75 clqs
1.99/2.09 c presolving (4 rounds):
1.99/2.09 c 24 deleted vars, 25 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.99/2.09 c 38 implications, 75 cliques
1.99/2.09 c presolved problem has 83 variables (83 bin, 0 int, 0 impl, 0 cont) and 100 constraints
1.99/2.09 c 17 constraints of type <knapsack>
1.99/2.09 c 76 constraints of type <setppc>
1.99/2.09 c 7 constraints of type <logicor>
1.99/2.09 c transformed objective value is always integral (scale: 1)
1.99/2.09 c Presolving Time: 0.07
1.99/2.09 c
2.10/2.10 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.10/2.10 c 2.1s| 1 | 0 | 860 | - | 881k| 0 | 42 | 83 | 100 | 83 | 93 | 0 | 0 | 191 | 0.000000e+00 | -- | Inf
2.10/2.12 c 2.1s| 1 | 0 | 894 | - |1166k| 0 | 47 | 83 | 100 | 83 | 106 | 13 | 0 | 191 | 0.000000e+00 | -- | Inf
2.10/2.18 c 2.2s| 1 | 0 | 967 | - |1163k| 0 | 41 | 83 | 94 | 83 | 106 | 13 | 0 | 196 | 0.000000e+00 | -- | Inf
2.10/2.20 c 2.2s| 1 | 0 | 967 | - |1163k| 0 | 41 | 83 | 94 | 83 | 106 | 13 | 0 | 197 | -- | -- | 0.00%
2.10/2.20 c
2.10/2.20 c SCIP Status : problem is solved [infeasible]
2.10/2.20 c Solving Time (sec) : 2.18
2.10/2.20 c Solving Nodes : 1 (total of 4 nodes in 4 runs)
2.10/2.20 c Primal Bound : +1.00000000000000e+20 (0 solutions)
2.10/2.20 c Dual Bound : +1.00000000000000e+20
2.10/2.20 c Gap : 0.00 %
2.10/2.20 s UNSATISFIABLE
2.10/2.20 c SCIP Status : problem is solved [infeasible]
2.10/2.20 c Solving Time : 2.18
2.10/2.20 c Original Problem :
2.10/2.20 c Problem name : HOME/instance-2704046-1278548340.opb
2.10/2.20 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
2.10/2.20 c Constraints : 101 initial, 101 maximal
2.10/2.20 c Presolved Problem :
2.10/2.20 c Problem name : t_HOME/instance-2704046-1278548340.opb
2.10/2.20 c Variables : 83 (83 binary, 0 integer, 0 implicit integer, 0 continuous)
2.10/2.20 c Constraints : 100 initial, 100 maximal
2.10/2.20 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.10/2.20 c trivial : 0.00 86 0 0 0 0 0 0 0
2.10/2.20 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.10/2.20 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.10/2.20 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.10/2.20 c implics : 0.00 0 0 0 0 0 0 0 0
2.10/2.20 c probing : 0.00 0 0 0 0 0 0 0 0
2.10/2.20 c knapsack : 0.03 0 0 0 0 0 0 0 0
2.10/2.20 c setppc : 0.01 0 0 0 0 0 16 0 0
2.10/2.20 c linear : 0.01 0 0 0 0 0 32 0 0
2.10/2.20 c logicor : 0.00 0 0 0 0 0 41 0 0
2.10/2.20 c root node : - 101 - - 101 - - - -
2.10/2.20 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.10/2.20 c integral : 0 0 0 21 0 1 91 0 0 0
2.10/2.20 c knapsack : 17 8 22 0 0 0 0 0 0 0
2.10/2.20 c setppc : 76 8 22 0 0 0 10 0 0 0
2.10/2.20 c logicor : 7 3 12 0 0 0 0 0 0 0
2.10/2.20 c countsols : 0 0 0 0 0 0 0 0 0 0
2.10/2.20 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.10/2.20 c integral : 1.74 0.00 0.00 1.74 0.00
2.10/2.20 c knapsack : 0.01 0.01 0.00 0.00 0.00
2.10/2.20 c setppc : 0.00 0.00 0.00 0.00 0.00
2.10/2.20 c logicor : 0.00 0.00 0.00 0.00 0.00
2.10/2.20 c countsols : 0.00 0.00 0.00 0.00 0.00
2.10/2.20 c Propagators : Time Calls Cutoffs DomReds
2.10/2.20 c vbounds : 0.00 4 0 0
2.10/2.20 c rootredcost : 0.00 0 0 0
2.10/2.20 c pseudoobj : 0.00 0 0 0
2.10/2.20 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.10/2.20 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.10/2.20 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.10/2.20 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.10/2.20 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.10/2.20 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.10/2.20 c applied globally : - - - 0 0.0 - - -
2.10/2.20 c applied locally : - - - 0 0.0 - - -
2.10/2.20 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.10/2.20 c cut pool : 0.00 0 - - 0 - (maximal pool size: 127)
2.10/2.20 c redcost : 0.00 8 0 0 0 0
2.10/2.20 c impliedbounds : 0.00 8 0 0 0 0
2.10/2.20 c intobj : 0.00 0 0 0 0 0
2.10/2.20 c cgmip : 0.00 0 0 0 0 0
2.10/2.20 c gomory : 0.05 8 0 0 61 0
2.10/2.20 c strongcg : 0.05 8 0 0 373 0
2.10/2.20 c cmir : 0.00 0 0 0 0 0
2.10/2.20 c flowcover : 0.00 0 0 0 0 0
2.10/2.20 c clique : 0.01 8 0 0 40 0
2.10/2.20 c zerohalf : 0.00 0 0 0 0 0
2.10/2.20 c mcf : 0.00 4 0 0 0 0
2.10/2.20 c rapidlearning : 0.16 1 0 0 0 135
2.10/2.20 c Pricers : Time Calls Vars
2.10/2.20 c problem variables: 0.00 0 0
2.10/2.20 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.10/2.20 c relpscost : 1.74 21 1 91 0 0 0
2.10/2.20 c pscost : 0.00 0 0 0 0 0 0
2.10/2.20 c inference : 0.00 0 0 0 0 0 0
2.10/2.20 c mostinf : 0.00 0 0 0 0 0 0
2.10/2.20 c leastinf : 0.00 0 0 0 0 0 0
2.10/2.20 c fullstrong : 0.00 0 0 0 0 0 0
2.10/2.20 c allfullstrong : 0.00 0 0 0 0 0 0
2.10/2.20 c random : 0.00 0 0 0 0 0 0
2.10/2.20 c Primal Heuristics : Time Calls Found
2.10/2.20 c LP solutions : 0.00 - 0
2.10/2.20 c pseudo solutions : 0.00 - 0
2.10/2.20 c trivial : 0.00 1 0
2.10/2.20 c simplerounding : 0.00 0 0
2.10/2.20 c zirounding : 0.00 0 0
2.10/2.20 c rounding : 0.00 0 0
2.10/2.20 c shifting : 0.00 0 0
2.10/2.20 c intshifting : 0.00 0 0
2.10/2.20 c oneopt : 0.00 0 0
2.10/2.20 c twoopt : 0.00 0 0
2.10/2.20 c fixandinfer : 0.00 0 0
2.10/2.20 c feaspump : 0.00 0 0
2.10/2.20 c coefdiving : 0.00 0 0
2.10/2.20 c pscostdiving : 0.00 0 0
2.10/2.20 c fracdiving : 0.00 0 0
2.10/2.20 c veclendiving : 0.00 0 0
2.10/2.20 c intdiving : 0.00 0 0
2.10/2.20 c actconsdiving : 0.00 0 0
2.10/2.20 c objpscostdiving : 0.00 0 0
2.10/2.20 c rootsoldiving : 0.00 0 0
2.10/2.20 c linesearchdiving : 0.00 0 0
2.10/2.20 c guideddiving : 0.00 0 0
2.10/2.20 c octane : 0.00 0 0
2.10/2.20 c rens : 0.00 0 0
2.10/2.20 c rins : 0.00 0 0
2.10/2.20 c localbranching : 0.00 0 0
2.10/2.20 c mutation : 0.00 0 0
2.10/2.20 c crossover : 0.00 0 0
2.10/2.20 c dins : 0.00 0 0
2.10/2.20 c undercover : 0.00 0 0
2.10/2.20 c nlp : 0.00 0 0
2.10/2.20 c trysol : 0.00 0 0
2.10/2.20 c LP : Time Calls Iterations Iter/call Iter/sec
2.10/2.20 c primal LP : 0.00 0 0 0.00 -
2.10/2.20 c dual LP : 0.07 29 967 33.34 14433.70
2.10/2.20 c lex dual LP : 0.00 0 0 0.00 -
2.10/2.20 c barrier LP : 0.00 0 0 0.00 -
2.10/2.20 c diving/probing LP: 0.00 0 0 0.00 -
2.10/2.20 c strong branching : 1.74 197 20619 104.66 11830.02
2.10/2.20 c (at root node) : - 197 20619 104.66 -
2.10/2.20 c conflict analysis: 0.00 0 0 0.00 -
2.10/2.20 c B&B Tree :
2.10/2.20 c number of runs : 4
2.10/2.20 c nodes : 1
2.10/2.20 c nodes (total) : 4
2.10/2.20 c nodes left : 0
2.10/2.20 c max depth : 0
2.10/2.20 c max depth (total): 0
2.10/2.20 c backtracks : 0 (0.0%)
2.10/2.20 c delayed cutoffs : 0
2.10/2.20 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.10/2.20 c avg switch length: 2.00
2.10/2.20 c switching time : 0.00
2.10/2.20 c Solution :
2.10/2.20 c Solutions found : 0 (0 improvements)
2.10/2.20 c Primal Bound : infeasible
2.10/2.20 c Dual Bound : -
2.10/2.20 c Gap : 0.00 %
2.10/2.20 c Root Dual Bound : -
2.10/2.20 c Root Iterations : 967
2.20/2.21 c Time complete: 2.2.