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-2667153-1276272651.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 = 1800
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.04 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/zirounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c separating/cmir/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c separating/flowcover/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 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 | 103 | - | 743k| 0 | 41 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 125 | - |1129k| 0 | 47 | 169 | 193 | 169 | 89 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 172 | - |1380k| 0 | 59 | 169 | 193 | 169 | 98 | 25 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 0 | 215 | - |1464k| 0 | 62 | 169 | 193 | 169 | 103 | 30 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 265 | - |1550k| 0 | 64 | 169 | 193 | 169 | 108 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.35 c 0.3s| 1 | 0 | 389 | - |1558k| 0 | 59 | 169 | 193 | 169 | 111 | 38 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.57 c 0.5s| 1 | 0 | 393 | - |1556k| 0 | 58 | 169 | 190 | 169 | 111 | 38 | 0 | 10 | 0.000000e+00 | -- | Inf
0.79/0.82 c 0.8s| 1 | 0 | 396 | - |1554k| 0 | 60 | 169 | 189 | 169 | 111 | 38 | 0 | 21 | 0.000000e+00 | -- | Inf
1.10/1.15 c 1.1s| 1 | 0 | 409 | - |1553k| 0 | 62 | 169 | 188 | 169 | 111 | 38 | 0 | 34 | 0.000000e+00 | -- | Inf
1.29/1.32 c 1.3s| 1 | 0 | 421 | - |1544k| 0 | 60 | 169 | 180 | 169 | 111 | 38 | 0 | 41 | 0.000000e+00 | -- | Inf
1.39/1.46 c 1.4s| 1 | 0 | 428 | - |1532k| 0 | 58 | 169 | 170 | 169 | 111 | 38 | 0 | 47 | 0.000000e+00 | -- | Inf
1.60/1.65 c 1.6s| 1 | 0 | 441 | - |1529k| 0 | 60 | 169 | 168 | 169 | 105 | 38 | 0 | 56 | 0.000000e+00 | -- | Inf
1.69/1.79 c 1.7s| 1 | 0 | 487 | - |1526k| 0 | 60 | 169 | 165 | 169 | 105 | 38 | 0 | 63 | 0.000000e+00 | -- | Inf
1.89/1.93 c 1.9s| 1 | 0 | 509 | - |1499k| 0 | 62 | 169 | 141 | 169 | 105 | 38 | 0 | 71 | 0.000000e+00 | -- | Inf
2.10/2.16 c 2.1s| 1 | 0 | 509 | - |1499k| 0 | - | 169 | 141 | 169 | 105 | 38 | 0 | 84 | 0.000000e+00 | -- | Inf
2.10/2.16 c (run 1, node 1) restarting after 36 global fixings of integer variables
2.10/2.16 c
2.10/2.16 c (restart) converted 32 cuts from the global cut pool into linear constraints
2.10/2.16 c
2.10/2.16 c presolving:
2.10/2.17 c (round 1) 36 del vars, 7 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 14 impls, 84 clqs
2.10/2.17 c (round 2) 36 del vars, 10 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 0 upgd conss, 14 impls, 84 clqs
2.10/2.17 c (round 3) 36 del vars, 10 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 93 upgd conss, 14 impls, 84 clqs
2.10/2.18 c (round 4) 36 del vars, 11 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 93 upgd conss, 14 impls, 84 clqs
2.10/2.18 c presolving (5 rounds):
2.10/2.18 c 36 deleted vars, 11 deleted constraints, 0 tightened bounds, 0 added holes, 3 changed sides, 0 changed coefficients
2.10/2.18 c 14 implications, 84 cliques
2.10/2.18 c presolved problem has 133 variables (133 bin, 0 int, 0 impl, 0 cont) and 162 constraints
2.10/2.18 c 13 constraints of type <knapsack>
2.10/2.18 c 84 constraints of type <setppc>
2.10/2.18 c 65 constraints of type <logicor>
2.10/2.18 c transformed objective value is always integral (scale: 1)
2.10/2.18 c Presolving Time: 0.03
2.10/2.18 c
2.10/2.19 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.19 c 2.1s| 1 | 0 | 611 | - | 952k| 0 | 46 | 133 | 162 | 133 | 99 | 0 | 0 | 84 | 0.000000e+00 | -- | Inf
2.19/2.22 c 2.1s| 1 | 0 | 644 | - |1216k| 0 | 47 | 133 | 162 | 133 | 108 | 9 | 0 | 84 | 0.000000e+00 | -- | Inf
2.39/2.44 c 2.3s| 1 | 0 | 659 | - |1216k| 0 | 49 | 133 | 162 | 133 | 108 | 9 | 0 | 104 | 0.000000e+00 | -- | Inf
2.49/2.57 c 2.5s| 1 | 0 | 668 | - |1216k| 0 | 49 | 133 | 162 | 133 | 108 | 9 | 0 | 120 | 0.000000e+00 | -- | Inf
2.59/2.67 c 2.6s| 1 | 0 | 674 | - |1215k| 0 | 49 | 133 | 158 | 133 | 108 | 9 | 0 | 126 | 0.000000e+00 | -- | Inf
2.79/2.83 c 2.7s| 1 | 0 | 693 | - |1215k| 0 | 50 | 133 | 158 | 133 | 108 | 9 | 0 | 140 | 0.000000e+00 | -- | Inf
2.89/2.91 c 2.8s| 1 | 0 | 709 | - |1215k| 0 | 49 | 133 | 158 | 133 | 108 | 9 | 0 | 145 | 0.000000e+00 | -- | Inf
2.99/3.06 c 3.0s| 1 | 0 | 728 | - |1214k| 0 | 47 | 133 | 155 | 133 | 108 | 9 | 0 | 157 | 0.000000e+00 | -- | Inf
3.09/3.14 c 3.0s| 1 | 0 | 728 | - |1214k| 0 | - | 133 | 155 | 133 | 108 | 9 | 0 | 164 | 0.000000e+00 | -- | Inf
3.09/3.14 c (run 2, node 1) restarting after 29 global fixings of integer variables
3.09/3.14 c
3.09/3.14 c (restart) converted 9 cuts from the global cut pool into linear constraints
3.09/3.14 c
3.09/3.14 c presolving:
3.09/3.15 c (round 1) 29 del vars, 34 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 20 impls, 86 clqs
3.09/3.15 c (round 2) 29 del vars, 35 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 20 impls, 86 clqs
3.09/3.15 c presolving (3 rounds):
3.09/3.15 c 29 deleted vars, 35 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
3.09/3.15 c 20 implications, 86 cliques
3.09/3.15 c presolved problem has 104 variables (104 bin, 0 int, 0 impl, 0 cont) and 129 constraints
3.09/3.15 c 16 constraints of type <knapsack>
3.09/3.15 c 84 constraints of type <setppc>
3.09/3.15 c 29 constraints of type <logicor>
3.09/3.15 c transformed objective value is always integral (scale: 1)
3.09/3.15 c Presolving Time: 0.04
3.09/3.16 c
3.09/3.16 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.16 c 3.0s| 1 | 0 | 795 | - | 931k| 0 | 45 | 104 | 129 | 104 | 103 | 0 | 0 | 164 | 0.000000e+00 | -- | Inf
3.09/3.18 c 3.1s| 1 | 0 | 822 | - |1218k| 0 | 52 | 104 | 129 | 104 | 109 | 6 | 0 | 164 | 0.000000e+00 | -- | Inf
3.30/3.39 c 3.3s| 1 | 0 | 832 | - |1218k| 0 | 51 | 104 | 129 | 104 | 109 | 6 | 0 | 185 | 0.000000e+00 | -- | Inf
3.39/3.49 c 3.4s| 1 | 0 | 841 | - |1218k| 0 | 51 | 104 | 129 | 104 | 109 | 6 | 0 | 195 | 0.000000e+00 | -- | Inf
3.49/3.58 c 3.5s| 1 | 0 | 853 | - |1218k| 0 | 49 | 104 | 129 | 104 | 109 | 6 | 0 | 206 | 0.000000e+00 | -- | Inf
3.59/3.69 c 3.6s| 1 | 0 | 880 | - |1218k| 0 | 50 | 104 | 128 | 104 | 109 | 6 | 0 | 222 | 0.000000e+00 | -- | Inf
3.69/3.78 c 3.6s| 1 | 0 | 880 | - |1218k| 0 | - | 104 | 128 | 104 | 109 | 6 | 0 | 234 | 0.000000e+00 | -- | Inf
3.69/3.78 c (run 3, node 1) restarting after 23 global fixings of integer variables
3.69/3.78 c
3.69/3.78 c (restart) converted 6 cuts from the global cut pool into linear constraints
3.69/3.78 c
3.69/3.79 c presolving:
3.69/3.79 c (round 1) 23 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 6 upgd conss, 38 impls, 78 clqs
3.79/3.80 c (round 2) 23 del vars, 9 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 6 upgd conss, 38 impls, 78 clqs
3.79/3.80 c presolving (3 rounds):
3.79/3.80 c 23 deleted vars, 9 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
3.79/3.80 c 38 implications, 78 cliques
3.79/3.80 c presolved problem has 81 variables (81 bin, 0 int, 0 impl, 0 cont) and 125 constraints
3.79/3.80 c 19 constraints of type <knapsack>
3.79/3.80 c 80 constraints of type <setppc>
3.79/3.80 c 26 constraints of type <logicor>
3.79/3.80 c transformed objective value is always integral (scale: 1)
3.79/3.80 c Presolving Time: 0.05
3.79/3.80 c
3.79/3.80 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.79/3.80 c 3.7s| 1 | 0 | 942 | - | 915k| 0 | 41 | 81 | 125 | 81 | 102 | 0 | 0 | 234 | 0.000000e+00 | -- | Inf
3.79/3.82 c 3.7s| 1 | 0 | 958 | - |1225k| 0 | 47 | 81 | 125 | 81 | 112 | 10 | 0 | 234 | 0.000000e+00 | -- | Inf
3.99/4.01 c 3.9s| 1 | 0 | 963 | - |1225k| 0 | 48 | 81 | 125 | 81 | 112 | 10 | 0 | 255 | 0.000000e+00 | -- | Inf
4.09/4.13 c 4.0s| 1 | 0 | 976 | - |1224k| 0 | 46 | 81 | 124 | 81 | 112 | 10 | 0 | 273 | 0.000000e+00 | -- | Inf
4.19/4.26 c 4.1s| 1 | 0 | 997 | - |1224k| 0 | 42 | 81 | 124 | 81 | 112 | 10 | 0 | 287 | 0.000000e+00 | -- | Inf
4.30/4.33 c 4.2s| 1 | 0 | 1005 | - |1224k| 0 | 44 | 81 | 124 | 81 | 112 | 10 | 0 | 296 | 0.000000e+00 | -- | Inf
4.30/4.39 c 4.2s| 1 | 0 | 1005 | - |1224k| 0 | - | 81 | 124 | 81 | 112 | 10 | 0 | 301 | 0.000000e+00 | -- | Inf
4.30/4.39 c (run 4, node 1) restarting after 19 global fixings of integer variables
4.30/4.39 c
4.30/4.39 c (restart) converted 10 cuts from the global cut pool into linear constraints
4.30/4.39 c
4.30/4.39 c presolving:
4.30/4.39 c (round 1) 19 del vars, 5 del conss, 0 chg bounds, 1 chg sides, 3 chg coeffs, 10 upgd conss, 60 impls, 65 clqs
4.30/4.40 c (round 2) 19 del vars, 11 del conss, 0 chg bounds, 1 chg sides, 5 chg coeffs, 10 upgd conss, 60 impls, 65 clqs
4.30/4.40 c presolving (3 rounds):
4.30/4.40 c 19 deleted vars, 11 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 5 changed coefficients
4.30/4.40 c 60 implications, 65 cliques
4.30/4.40 c presolved problem has 62 variables (62 bin, 0 int, 0 impl, 0 cont) and 123 constraints
4.30/4.40 c 25 constraints of type <knapsack>
4.30/4.40 c 76 constraints of type <setppc>
4.30/4.40 c 22 constraints of type <logicor>
4.30/4.40 c transformed objective value is always integral (scale: 1)
4.30/4.40 c Presolving Time: 0.06
4.30/4.40 c
4.30/4.40 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.30/4.40 c 4.2s| 1 | 0 | 1051 | - | 916k| 0 | 38 | 62 | 123 | 62 | 103 | 0 | 0 | 301 | 0.000000e+00 | -- | Inf
4.39/4.42 c 4.3s| 1 | 0 | 1075 | - |1183k| 0 | 46 | 62 | 123 | 62 | 117 | 14 | 0 | 301 | 0.000000e+00 | -- | Inf
4.39/4.49 c 4.3s| 1 | 0 | 1099 | - |1183k| 0 | 40 | 62 | 122 | 62 | 117 | 14 | 0 | 308 | 0.000000e+00 | -- | Inf
4.59/4.67 c 4.5s| 1 | 0 | 1113 | - |1182k| 0 | 0 | 62 | 121 | 62 | 117 | 14 | 0 | 329 | 0.000000e+00 | -- | Inf
4.59/4.67 c (run 5, node 1) restarting after 9 global fixings of integer variables
4.59/4.67 c
4.59/4.67 c (restart) converted 14 cuts from the global cut pool into linear constraints
4.59/4.67 c
4.59/4.67 c presolving:
4.59/4.68 c (round 1) 12 del vars, 9 del conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 14 upgd conss, 94 impls, 52 clqs
4.59/4.68 c (round 2) 12 del vars, 10 del conss, 0 chg bounds, 4 chg sides, 14 chg coeffs, 14 upgd conss, 94 impls, 52 clqs
4.59/4.69 c (round 3) 12 del vars, 19 del conss, 0 chg bounds, 4 chg sides, 21 chg coeffs, 14 upgd conss, 94 impls, 52 clqs
4.59/4.69 c (round 4) 12 del vars, 19 del conss, 0 chg bounds, 4 chg sides, 23 chg coeffs, 14 upgd conss, 94 impls, 52 clqs
4.59/4.69 c (round 5) 12 del vars, 19 del conss, 0 chg bounds, 4 chg sides, 24 chg coeffs, 14 upgd conss, 94 impls, 52 clqs
4.59/4.69 c (round 6) 12 del vars, 19 del conss, 0 chg bounds, 4 chg sides, 26 chg coeffs, 14 upgd conss, 94 impls, 52 clqs
4.59/4.69 c (round 7) 12 del vars, 19 del conss, 0 chg bounds, 4 chg sides, 27 chg coeffs, 14 upgd conss, 94 impls, 52 clqs
4.59/4.69 c presolving (8 rounds):
4.59/4.69 c 12 deleted vars, 19 deleted constraints, 0 tightened bounds, 0 added holes, 4 changed sides, 27 changed coefficients
4.59/4.69 c 94 implications, 52 cliques
4.59/4.69 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 116 constraints
4.59/4.69 c 35 constraints of type <knapsack>
4.59/4.69 c 62 constraints of type <setppc>
4.59/4.69 c 19 constraints of type <logicor>
4.59/4.69 c transformed objective value is always integral (scale: 1)
4.59/4.69 c Presolving Time: 0.08
4.59/4.69 c
4.59/4.69 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.59/4.69 c 4.5s| 1 | 0 | 1151 | - | 934k| 0 | 30 | 50 | 116 | 50 | 102 | 0 | 0 | 329 | 0.000000e+00 | -- | Inf
4.69/4.71 c 4.5s| 1 | 0 | 1152 | - |1157k| 0 | 0 | 50 | 116 | 50 | 113 | 11 | 0 | 329 | 0.000000e+00 | -- | Inf
4.69/4.71 c * 4.5s| 1 | 0 | 1152 | - |1159k| 0 | - | 50 | 116 | 50 | 113 | 11 | 0 | 329 | 0.000000e+00 | 0.000000e+00 | 0.00%
4.69/4.71 c
4.69/4.71 c SCIP Status : problem is solved [optimal solution found]
4.69/4.71 c Solving Time (sec) : 4.54
4.69/4.71 c Solving Nodes : 1 (total of 6 nodes in 6 runs)
4.69/4.71 c Primal Bound : +0.00000000000000e+00 (1 solutions)
4.69/4.71 c Dual Bound : +0.00000000000000e+00
4.69/4.71 c Gap : 0.00 %
4.69/4.71 s SATISFIABLE
4.69/4.71 v -x169 -x168 -x167 -x166 x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 x149 -x148
4.69/4.71 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
4.69/4.71 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 x119 -x118 -x117 -x116 x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
4.69/4.71 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.69/4.71 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
4.69/4.71 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
4.69/4.71 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.69/4.71 v x4 -x3 -x2 -x1
4.69/4.71 c SCIP Status : problem is solved [optimal solution found]
4.69/4.71 c Solving Time : 4.54
4.69/4.71 c Original Problem :
4.69/4.71 c Problem name : HOME/instance-2667153-1276272651.opb
4.69/4.71 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
4.69/4.71 c Constraints : 101 initial, 101 maximal
4.69/4.71 c Presolved Problem :
4.69/4.71 c Problem name : t_HOME/instance-2667153-1276272651.opb
4.69/4.71 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
4.69/4.71 c Constraints : 116 initial, 116 maximal
4.69/4.71 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.69/4.71 c trivial : 0.00 116 0 0 0 0 0 0 0
4.69/4.71 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.69/4.71 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.69/4.71 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.69/4.71 c implics : 0.00 0 0 0 0 0 0 0 0
4.69/4.71 c probing : 0.00 0 0 0 0 0 0 0 0
4.69/4.71 c knapsack : 0.04 0 0 0 0 0 0 5 32
4.69/4.71 c setppc : 0.02 0 3 0 0 0 31 0 0
4.69/4.71 c linear : 0.01 0 0 0 0 0 36 3 0
4.69/4.71 c logicor : 0.00 0 0 0 0 0 46 0 0
4.69/4.71 c root node : - 116 - - 116 - - - -
4.69/4.71 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.69/4.71 c integral : 0 0 0 30 0 0 116 0 0 0
4.69/4.71 c knapsack : 35 10 30 2 0 0 0 0 0 0
4.69/4.71 c setppc : 62 10 30 2 0 0 0 0 0 0
4.69/4.71 c logicor : 19 10 18 2 0 0 0 0 0 0
4.69/4.71 c countsols : 0 0 0 2 0 0 0 0 0 0
4.69/4.71 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.69/4.71 c integral : 3.94 0.00 0.00 3.94 0.00
4.69/4.71 c knapsack : 0.01 0.00 0.01 0.00 0.00
4.69/4.71 c setppc : 0.00 0.00 0.00 0.00 0.00
4.69/4.71 c logicor : 0.00 0.00 0.00 0.00 0.00
4.69/4.71 c countsols : 0.00 0.00 0.00 0.00 0.00
4.69/4.71 c Propagators : Time Calls Cutoffs DomReds
4.69/4.71 c vbounds : 0.00 6 0 0
4.69/4.71 c rootredcost : 0.00 0 0 0
4.69/4.71 c pseudoobj : 0.00 0 0 0
4.69/4.71 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.69/4.71 c propagation : 0.00 0 0 0 0.0 0 0.0 -
4.69/4.71 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
4.69/4.71 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.69/4.71 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.69/4.71 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.69/4.71 c applied globally : - - - 0 0.0 - - -
4.69/4.71 c applied locally : - - - 0 0.0 - - -
4.69/4.71 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.69/4.71 c cut pool : 0.00 0 - - 0 - (maximal pool size: 155)
4.69/4.71 c redcost : 0.00 10 0 0 0 0
4.69/4.71 c impliedbounds : 0.00 10 0 0 0 0
4.69/4.71 c intobj : 0.00 0 0 0 0 0
4.69/4.71 c cgmip : 0.00 0 0 0 0 0
4.69/4.71 c gomory : 0.08 10 0 0 261 0
4.69/4.71 c strongcg : 0.08 10 0 0 585 0
4.69/4.71 c cmir : 0.00 0 0 0 0 0
4.69/4.71 c flowcover : 0.00 0 0 0 0 0
4.69/4.71 c clique : 0.00 10 0 0 46 0
4.69/4.71 c zerohalf : 0.00 0 0 0 0 0
4.69/4.71 c mcf : 0.00 6 0 0 0 0
4.69/4.71 c rapidlearning : 0.16 1 0 0 0 120
4.69/4.71 c Pricers : Time Calls Vars
4.69/4.71 c problem variables: 0.00 0 0
4.69/4.71 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.69/4.71 c relpscost : 3.94 28 0 116 0 0 0
4.69/4.71 c pscost : 0.00 0 0 0 0 0 0
4.69/4.71 c inference : 0.00 0 0 0 0 0 0
4.69/4.71 c mostinf : 0.00 0 0 0 0 0 0
4.69/4.71 c leastinf : 0.00 0 0 0 0 0 0
4.69/4.71 c fullstrong : 0.00 0 0 0 0 0 0
4.69/4.71 c allfullstrong : 0.00 0 0 0 0 0 0
4.69/4.71 c random : 0.00 0 0 0 0 0 0
4.69/4.71 c Primal Heuristics : Time Calls Found
4.69/4.71 c LP solutions : 0.00 - 1
4.69/4.71 c pseudo solutions : 0.00 - 0
4.69/4.71 c trivial : 0.00 1 0
4.69/4.71 c simplerounding : 0.00 0 0
4.69/4.71 c zirounding : 0.00 0 0
4.69/4.71 c rounding : 0.00 0 0
4.69/4.71 c shifting : 0.00 0 0
4.69/4.71 c intshifting : 0.00 0 0
4.69/4.71 c oneopt : 0.00 0 0
4.69/4.71 c twoopt : 0.00 0 0
4.69/4.71 c fixandinfer : 0.00 0 0
4.69/4.71 c feaspump : 0.00 0 0
4.69/4.71 c coefdiving : 0.00 0 0
4.69/4.71 c pscostdiving : 0.00 0 0
4.69/4.71 c fracdiving : 0.00 0 0
4.69/4.71 c veclendiving : 0.00 0 0
4.69/4.71 c intdiving : 0.00 0 0
4.69/4.71 c actconsdiving : 0.00 0 0
4.69/4.71 c objpscostdiving : 0.00 0 0
4.69/4.71 c rootsoldiving : 0.00 0 0
4.69/4.71 c linesearchdiving : 0.00 0 0
4.69/4.71 c guideddiving : 0.00 0 0
4.69/4.71 c octane : 0.00 0 0
4.69/4.71 c rens : 0.00 0 0
4.69/4.71 c rins : 0.00 0 0
4.69/4.71 c localbranching : 0.00 0 0
4.69/4.71 c mutation : 0.00 0 0
4.69/4.71 c crossover : 0.00 0 0
4.69/4.71 c dins : 0.00 0 0
4.69/4.71 c undercover : 0.00 0 0
4.69/4.71 c nlp : 0.00 0 0
4.69/4.71 c trysol : 0.00 0 0
4.69/4.71 c LP : Time Calls Iterations Iter/call Iter/sec
4.69/4.71 c primal LP : 0.00 0 0 0.00 -
4.69/4.71 c dual LP : 0.13 40 1152 28.80 8861.54
4.69/4.71 c lex dual LP : 0.00 0 0 0.00 -
4.69/4.71 c barrier LP : 0.00 0 0 0.00 -
4.69/4.71 c diving/probing LP: 0.00 0 0 0.00 -
4.69/4.71 c strong branching : 3.93 329 41575 126.37 10578.88
4.69/4.71 c (at root node) : - 329 41575 126.37 -
4.69/4.71 c conflict analysis: 0.00 0 0 0.00 -
4.69/4.71 c B&B Tree :
4.69/4.71 c number of runs : 6
4.69/4.71 c nodes : 1
4.69/4.71 c nodes (total) : 6
4.69/4.71 c nodes left : 0
4.69/4.71 c max depth : 0
4.69/4.71 c max depth (total): 0
4.69/4.71 c backtracks : 0 (0.0%)
4.69/4.71 c delayed cutoffs : 0
4.69/4.71 c repropagations : 0 (0 domain reductions, 0 cutoffs)
4.69/4.71 c avg switch length: 2.00
4.69/4.71 c switching time : 0.00
4.69/4.71 c Solution :
4.69/4.71 c Solutions found : 1 (1 improvements)
4.69/4.71 c First Solution : +0.00000000000000e+00 (in run 6, after 1 nodes, 4.54 seconds, depth 0, found by <relaxation>)
4.69/4.71 c Primal Bound : +0.00000000000000e+00 (in run 6, after 1 nodes, 4.54 seconds, depth 0, found by <relaxation>)
4.69/4.71 c Dual Bound : +0.00000000000000e+00
4.69/4.71 c Gap : 0.00 %
4.69/4.71 c Root Dual Bound : +0.00000000000000e+00
4.69/4.71 c Root Iterations : 1152
4.69/4.72 c Time complete: 4.7.