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-2667193-1276276444.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.04 c heuristics/veclendiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 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 | 98 | - | 743k| 0 | 44 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 128 | - |1158k| 0 | 52 | 169 | 203 | 169 | 84 | 11 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 156 | - |1410k| 0 | 59 | 169 | 203 | 169 | 91 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 201 | - |1526k| 0 | 58 | 169 | 203 | 169 | 97 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 265 | - |1543k| 0 | 60 | 169 | 203 | 169 | 102 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.35 c 0.3s| 1 | 0 | 320 | - |1558k| 0 | 64 | 169 | 203 | 169 | 110 | 37 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.57 c 0.5s| 1 | 0 | 345 | - |1515k| 0 | 68 | 169 | 162 | 169 | 110 | 37 | 0 | 10 | 0.000000e+00 | -- | Inf
0.79/0.82 c 0.8s| 1 | 0 | 356 | - |1509k| 0 | 69 | 169 | 157 | 169 | 110 | 37 | 0 | 22 | 0.000000e+00 | -- | Inf
1.00/1.09 c 1.0s| 1 | 0 | 359 | - |1500k| 0 | 68 | 169 | 150 | 169 | 110 | 37 | 0 | 33 | 0.000000e+00 | -- | Inf
1.29/1.33 c 1.2s| 1 | 0 | 401 | - |1498k| 0 | 59 | 169 | 149 | 169 | 110 | 37 | 0 | 43 | 0.000000e+00 | -- | Inf
1.49/1.56 c 1.5s| 1 | 0 | 426 | - |1497k| 0 | 59 | 169 | 148 | 169 | 110 | 37 | 0 | 54 | 0.000000e+00 | -- | Inf
1.69/1.75 c 1.7s| 1 | 0 | 467 | - |1496k| 0 | 58 | 169 | 147 | 169 | 104 | 37 | 0 | 63 | 0.000000e+00 | -- | Inf
1.89/1.96 c 1.9s| 1 | 0 | 522 | - |1496k| 0 | 54 | 169 | 147 | 169 | 104 | 37 | 0 | 75 | 0.000000e+00 | -- | Inf
2.10/2.18 c 2.1s| 1 | 0 | 563 | - |1494k| 0 | 49 | 169 | 145 | 169 | 104 | 37 | 0 | 88 | 0.000000e+00 | -- | Inf
2.20/2.27 c 2.2s| 1 | 0 | 630 | - |1487k| 0 | 50 | 169 | 138 | 169 | 104 | 37 | 0 | 94 | 0.000000e+00 | -- | Inf
2.29/2.30 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.29/2.30 c 2.2s| 1 | 0 | 641 | - |1483k| 0 | 50 | 169 | 135 | 169 | 104 | 37 | 0 | 99 | 0.000000e+00 | -- | Inf
2.29/2.35 c 2.2s| 1 | 0 | 641 | - |1483k| 0 | - | 169 | 135 | 169 | 104 | 37 | 0 | 104 | 0.000000e+00 | -- | Inf
2.29/2.35 c (run 1, node 1) restarting after 38 global fixings of integer variables
2.29/2.35 c
2.29/2.35 c (restart) converted 31 cuts from the global cut pool into linear constraints
2.29/2.35 c
2.29/2.35 c presolving:
2.29/2.36 c (round 1) 38 del vars, 5 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 12 impls, 87 clqs
2.29/2.36 c (round 2) 38 del vars, 7 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 12 impls, 87 clqs
2.29/2.36 c (round 3) 38 del vars, 8 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 86 upgd conss, 12 impls, 87 clqs
2.29/2.37 c (round 4) 38 del vars, 10 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 86 upgd conss, 12 impls, 87 clqs
2.29/2.37 c presolving (5 rounds):
2.29/2.37 c 38 deleted vars, 10 deleted constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 0 changed coefficients
2.29/2.37 c 12 implications, 87 cliques
2.29/2.37 c presolved problem has 131 variables (131 bin, 0 int, 0 impl, 0 cont) and 156 constraints
2.29/2.37 c 11 constraints of type <knapsack>
2.29/2.37 c 85 constraints of type <setppc>
2.29/2.37 c 60 constraints of type <logicor>
2.29/2.37 c transformed objective value is always integral (scale: 1)
2.29/2.37 c Presolving Time: 0.03
2.29/2.37 c
2.29/2.38 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.29/2.38 c 2.3s| 1 | 0 | 738 | - | 929k| 0 | 48 | 131 | 156 | 131 | 100 | 0 | 0 | 104 | 0.000000e+00 | -- | Inf
2.39/2.40 c 2.3s| 1 | 0 | 765 | - |1224k| 0 | 52 | 131 | 156 | 131 | 109 | 9 | 0 | 104 | 0.000000e+00 | -- | Inf
2.49/2.57 c 2.5s| 1 | 0 | 772 | - |1224k| 0 | 52 | 131 | 155 | 131 | 109 | 9 | 0 | 124 | 0.000000e+00 | -- | Inf
2.59/2.64 c 2.5s| 1 | 0 | 793 | - |1223k| 0 | 49 | 131 | 154 | 131 | 109 | 9 | 0 | 134 | 0.000000e+00 | -- | Inf
2.69/2.71 c 2.6s| 1 | 0 | 824 | - |1222k| 0 | 48 | 131 | 152 | 131 | 109 | 9 | 0 | 142 | 0.000000e+00 | -- | Inf
2.79/2.80 c 2.7s| 1 | 0 | 830 | - |1217k| 0 | 44 | 131 | 137 | 131 | 109 | 9 | 0 | 148 | 0.000000e+00 | -- | Inf
2.79/2.89 c 2.8s| 1 | 0 | 830 | - |1217k| 0 | - | 131 | 137 | 131 | 109 | 9 | 0 | 158 | 0.000000e+00 | -- | Inf
2.79/2.89 c (run 2, node 1) restarting after 38 global fixings of integer variables
2.79/2.89 c
2.79/2.89 c (restart) converted 9 cuts from the global cut pool into linear constraints
2.79/2.89 c
2.79/2.89 c presolving:
2.79/2.89 c (round 1) 38 del vars, 30 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 22 impls, 76 clqs
2.89/2.90 c (round 2) 38 del vars, 36 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 8 upgd conss, 22 impls, 76 clqs
2.89/2.90 c presolving (3 rounds):
2.89/2.90 c 38 deleted vars, 36 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
2.89/2.90 c 22 implications, 76 cliques
2.89/2.90 c presolved problem has 93 variables (93 bin, 0 int, 0 impl, 0 cont) and 110 constraints
2.89/2.90 c 14 constraints of type <knapsack>
2.89/2.90 c 75 constraints of type <setppc>
2.89/2.90 c 21 constraints of type <logicor>
2.89/2.90 c transformed objective value is always integral (scale: 1)
2.89/2.90 c Presolving Time: 0.04
2.89/2.90 c
2.89/2.91 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.89/2.91 c 2.8s| 1 | 0 | 897 | - | 889k| 0 | 41 | 93 | 110 | 93 | 91 | 0 | 0 | 158 | 0.000000e+00 | -- | Inf
2.89/2.93 c 2.8s| 1 | 0 | 933 | - |1119k| 0 | 45 | 93 | 110 | 93 | 102 | 11 | 0 | 158 | 0.000000e+00 | -- | Inf
2.99/3.03 c 2.9s| 1 | 0 | 962 | - |1118k| 0 | 45 | 93 | 107 | 93 | 102 | 11 | 0 | 172 | 0.000000e+00 | -- | Inf
2.99/3.07 c 2.9s| 1 | 0 | 1008 | - |1118k| 0 | 43 | 93 | 107 | 93 | 102 | 11 | 0 | 177 | 0.000000e+00 | -- | Inf
3.09/3.10 c 3.0s| 1 | 0 | 1051 | - |1116k| 0 | 31 | 93 | 98 | 93 | 102 | 11 | 0 | 186 | 0.000000e+00 | -- | Inf
3.09/3.13 c 3.0s| 1 | 0 | 1051 | - |1115k| 0 | - | 93 | 98 | 93 | 102 | 11 | 0 | 194 | 0.000000e+00 | -- | Inf
3.09/3.13 c (run 3, node 1) restarting after 36 global fixings of integer variables
3.09/3.13 c
3.09/3.13 c (restart) converted 11 cuts from the global cut pool into linear constraints
3.09/3.13 c
3.09/3.13 c presolving:
3.09/3.13 c (round 1) 50 del vars, 19 del conss, 0 chg bounds, 0 chg sides, 5 chg coeffs, 0 upgd conss, 64 impls, 41 clqs
3.09/3.14 c (round 2) 51 del vars, 23 del conss, 0 chg bounds, 0 chg sides, 6 chg coeffs, 10 upgd conss, 80 impls, 41 clqs
3.09/3.14 c (round 3) 51 del vars, 25 del conss, 1 chg bounds, 0 chg sides, 15 chg coeffs, 10 upgd conss, 159 impls, 41 clqs
3.09/3.14 c (round 4) 52 del vars, 33 del conss, 1 chg bounds, 1 chg sides, 22 chg coeffs, 10 upgd conss, 159 impls, 40 clqs
3.09/3.14 c (round 5) 52 del vars, 33 del conss, 1 chg bounds, 1 chg sides, 26 chg coeffs, 10 upgd conss, 159 impls, 40 clqs
3.09/3.15 c (round 6) 52 del vars, 33 del conss, 1 chg bounds, 1 chg sides, 29 chg coeffs, 10 upgd conss, 159 impls, 40 clqs
3.09/3.15 c (round 7) 52 del vars, 33 del conss, 1 chg bounds, 1 chg sides, 30 chg coeffs, 10 upgd conss, 159 impls, 40 clqs
3.09/3.15 c (round 8) 52 del vars, 33 del conss, 1 chg bounds, 1 chg sides, 31 chg coeffs, 10 upgd conss, 159 impls, 40 clqs
3.09/3.15 c (round 9) 52 del vars, 33 del conss, 1 chg bounds, 1 chg sides, 32 chg coeffs, 10 upgd conss, 159 impls, 40 clqs
3.09/3.15 c (round 10) 52 del vars, 33 del conss, 1 chg bounds, 1 chg sides, 33 chg coeffs, 10 upgd conss, 159 impls, 40 clqs
3.09/3.15 c (round 11) 52 del vars, 33 del conss, 1 chg bounds, 1 chg sides, 34 chg coeffs, 10 upgd conss, 159 impls, 40 clqs
3.09/3.15 c (round 12) 52 del vars, 33 del conss, 1 chg bounds, 1 chg sides, 35 chg coeffs, 10 upgd conss, 159 impls, 40 clqs
3.09/3.15 c (round 13) 52 del vars, 33 del conss, 1 chg bounds, 1 chg sides, 36 chg coeffs, 10 upgd conss, 159 impls, 40 clqs
3.09/3.15 c (round 14) 52 del vars, 33 del conss, 1 chg bounds, 1 chg sides, 37 chg coeffs, 10 upgd conss, 159 impls, 40 clqs
3.09/3.15 c (round 15) 52 del vars, 33 del conss, 1 chg bounds, 1 chg sides, 38 chg coeffs, 10 upgd conss, 159 impls, 40 clqs
3.09/3.15 c (round 16) 52 del vars, 33 del conss, 1 chg bounds, 1 chg sides, 39 chg coeffs, 10 upgd conss, 159 impls, 40 clqs
3.09/3.15 c (round 17) 52 del vars, 33 del conss, 1 chg bounds, 1 chg sides, 40 chg coeffs, 10 upgd conss, 159 impls, 40 clqs
3.09/3.16 c (round 18) 52 del vars, 33 del conss, 1 chg bounds, 1 chg sides, 41 chg coeffs, 10 upgd conss, 159 impls, 40 clqs
3.09/3.16 c (round 19) 52 del vars, 33 del conss, 1 chg bounds, 1 chg sides, 42 chg coeffs, 10 upgd conss, 159 impls, 40 clqs
3.09/3.16 c (round 20) 52 del vars, 33 del conss, 1 chg bounds, 1 chg sides, 43 chg coeffs, 10 upgd conss, 159 impls, 40 clqs
3.09/3.16 c (round 21) 52 del vars, 33 del conss, 1 chg bounds, 1 chg sides, 44 chg coeffs, 10 upgd conss, 159 impls, 40 clqs
3.09/3.16 c (round 22) 52 del vars, 33 del conss, 1 chg bounds, 1 chg sides, 45 chg coeffs, 10 upgd conss, 159 impls, 40 clqs
3.09/3.16 c (round 23) 52 del vars, 33 del conss, 1 chg bounds, 1 chg sides, 46 chg coeffs, 10 upgd conss, 159 impls, 40 clqs
3.09/3.16 c (round 24) 52 del vars, 33 del conss, 1 chg bounds, 1 chg sides, 47 chg coeffs, 10 upgd conss, 159 impls, 40 clqs
3.09/3.16 c (round 25) 52 del vars, 33 del conss, 1 chg bounds, 1 chg sides, 48 chg coeffs, 10 upgd conss, 159 impls, 40 clqs
3.09/3.16 c presolving (26 rounds):
3.09/3.16 c 52 deleted vars, 33 deleted constraints, 1 tightened bounds, 0 added holes, 1 changed sides, 48 changed coefficients
3.09/3.16 c 159 implications, 40 cliques
3.09/3.16 c presolved problem has 41 variables (41 bin, 0 int, 0 impl, 0 cont) and 76 constraints
3.09/3.16 c 19 constraints of type <knapsack>
3.09/3.16 c 50 constraints of type <setppc>
3.09/3.16 c 7 constraints of type <logicor>
3.09/3.16 c transformed objective value is always integral (scale: 1)
3.09/3.16 c Presolving Time: 0.07
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 | 1085 | - | 824k| 0 | 25 | 41 | 76 | 41 | 72 | 0 | 0 | 194 | 0.000000e+00 | -- | Inf
3.09/3.17 c 3.0s| 1 | 0 | 1094 | - | 956k| 0 | 0 | 41 | 76 | 41 | 80 | 8 | 0 | 194 | 0.000000e+00 | -- | Inf
3.09/3.17 c * 3.0s| 1 | 0 | 1094 | - | 958k| 0 | - | 41 | 76 | 41 | 80 | 8 | 0 | 194 | 0.000000e+00 | 0.000000e+00 | 0.00%
3.09/3.17 c
3.09/3.17 c SCIP Status : problem is solved [optimal solution found]
3.09/3.17 c Solving Time (sec) : 3.04
3.09/3.17 c Solving Nodes : 1 (total of 4 nodes in 4 runs)
3.09/3.17 c Primal Bound : +0.00000000000000e+00 (1 solutions)
3.09/3.17 c Dual Bound : +0.00000000000000e+00
3.09/3.17 c Gap : 0.00 %
3.09/3.17 s SATISFIABLE
3.09/3.17 v -x169 -x168 -x167 x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
3.09/3.17 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
3.09/3.17 v -x126 -x125 -x124 -x123 -x122 -x121 x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
3.09/3.17 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
3.09/3.17 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
3.09/3.17 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
3.09/3.17 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
3.09/3.17 v -x4 -x3 x2 -x1
3.09/3.17 c SCIP Status : problem is solved [optimal solution found]
3.09/3.17 c Solving Time : 3.04
3.09/3.17 c Original Problem :
3.09/3.17 c Problem name : HOME/instance-2667193-1276276444.opb
3.09/3.17 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
3.09/3.17 c Constraints : 101 initial, 101 maximal
3.09/3.17 c Presolved Problem :
3.09/3.17 c Problem name : t_HOME/instance-2667193-1276276444.opb
3.09/3.17 c Variables : 41 (41 binary, 0 integer, 0 implicit integer, 0 continuous)
3.09/3.17 c Constraints : 76 initial, 76 maximal
3.09/3.17 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.09/3.17 c trivial : 0.00 113 0 0 0 0 0 0 0
3.09/3.17 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.09/3.17 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.09/3.17 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.09/3.17 c implics : 0.00 0 0 0 0 0 0 0 0
3.09/3.17 c probing : 0.00 0 0 0 0 0 0 0 0
3.09/3.17 c knapsack : 0.05 0 0 0 1 0 0 0 49
3.09/3.17 c setppc : 0.00 12 3 0 0 0 31 1 0
3.09/3.17 c linear : 0.01 0 0 0 0 0 37 2 0
3.09/3.17 c logicor : 0.00 0 0 0 0 0 39 0 0
3.09/3.17 c root node : - 112 - - 112 - - - -
3.09/3.17 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.09/3.17 c integral : 0 0 0 21 0 0 81 0 0 0
3.09/3.17 c knapsack : 19 8 23 1 0 0 0 0 0 0
3.09/3.17 c setppc : 50 8 23 1 0 0 31 0 0 0
3.09/3.17 c logicor : 7 8 11 1 0 0 0 0 0 0
3.09/3.17 c countsols : 0 0 0 1 0 0 0 0 0 0
3.09/3.17 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.09/3.17 c integral : 2.56 0.00 0.00 2.56 0.00
3.09/3.17 c knapsack : 0.00 0.00 0.00 0.00 0.00
3.09/3.17 c setppc : 0.00 0.00 0.00 0.00 0.00
3.09/3.17 c logicor : 0.00 0.00 0.00 0.00 0.00
3.09/3.17 c countsols : 0.00 0.00 0.00 0.00 0.00
3.09/3.17 c Propagators : Time Calls Cutoffs DomReds
3.09/3.17 c vbounds : 0.00 4 0 0
3.09/3.17 c rootredcost : 0.00 0 0 0
3.09/3.17 c pseudoobj : 0.00 0 0 0
3.09/3.17 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.09/3.17 c propagation : 0.00 0 0 0 0.0 0 0.0 -
3.09/3.17 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.09/3.17 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.09/3.17 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.09/3.17 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.09/3.17 c applied globally : - - - 0 0.0 - - -
3.09/3.17 c applied locally : - - - 0 0.0 - - -
3.09/3.17 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.09/3.17 c cut pool : 0.00 0 - - 0 - (maximal pool size: 108)
3.09/3.17 c redcost : 0.00 8 0 0 0 0
3.09/3.17 c impliedbounds : 0.00 8 0 0 0 0
3.09/3.17 c intobj : 0.00 0 0 0 0 0
3.09/3.17 c cgmip : 0.00 0 0 0 0 0
3.09/3.17 c gomory : 0.05 8 0 0 92 0
3.09/3.17 c strongcg : 0.05 8 0 0 369 0
3.09/3.17 c cmir : 0.00 0 0 0 0 0
3.09/3.17 c flowcover : 0.00 0 0 0 0 0
3.09/3.17 c clique : 0.00 8 0 0 49 0
3.09/3.17 c zerohalf : 0.00 0 0 0 0 0
3.09/3.17 c mcf : 0.00 4 0 0 0 0
3.09/3.17 c rapidlearning : 0.17 1 0 0 0 130
3.09/3.17 c Pricers : Time Calls Vars
3.09/3.17 c problem variables: 0.00 0 0
3.09/3.17 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.09/3.17 c relpscost : 2.56 20 0 81 0 0 0
3.09/3.17 c pscost : 0.00 0 0 0 0 0 0
3.09/3.17 c inference : 0.00 0 0 0 0 0 0
3.09/3.17 c mostinf : 0.00 0 0 0 0 0 0
3.09/3.17 c leastinf : 0.00 0 0 0 0 0 0
3.09/3.17 c fullstrong : 0.00 0 0 0 0 0 0
3.09/3.17 c allfullstrong : 0.00 0 0 0 0 0 0
3.09/3.17 c random : 0.00 0 0 0 0 0 0
3.09/3.17 c Primal Heuristics : Time Calls Found
3.09/3.17 c LP solutions : 0.00 - 1
3.09/3.17 c pseudo solutions : 0.00 - 0
3.09/3.17 c trivial : 0.00 1 0
3.09/3.17 c simplerounding : 0.00 0 0
3.09/3.17 c zirounding : 0.00 0 0
3.09/3.17 c rounding : 0.00 0 0
3.09/3.17 c shifting : 0.00 0 0
3.09/3.17 c intshifting : 0.00 0 0
3.09/3.17 c oneopt : 0.00 0 0
3.09/3.17 c twoopt : 0.00 0 0
3.09/3.17 c fixandinfer : 0.00 0 0
3.09/3.17 c feaspump : 0.00 0 0
3.09/3.17 c coefdiving : 0.00 0 0
3.09/3.17 c pscostdiving : 0.00 0 0
3.09/3.17 c fracdiving : 0.00 0 0
3.09/3.17 c veclendiving : 0.00 0 0
3.09/3.17 c intdiving : 0.00 0 0
3.09/3.17 c actconsdiving : 0.00 0 0
3.09/3.17 c objpscostdiving : 0.00 0 0
3.09/3.17 c rootsoldiving : 0.00 0 0
3.09/3.17 c linesearchdiving : 0.00 0 0
3.09/3.17 c guideddiving : 0.00 0 0
3.09/3.17 c octane : 0.00 0 0
3.09/3.17 c rens : 0.00 0 0
3.09/3.17 c rins : 0.00 0 0
3.09/3.17 c localbranching : 0.00 0 0
3.09/3.17 c mutation : 0.00 0 0
3.09/3.17 c crossover : 0.00 0 0
3.09/3.17 c dins : 0.00 0 0
3.09/3.17 c undercover : 0.00 0 0
3.09/3.17 c nlp : 0.00 0 0
3.09/3.17 c trysol : 0.00 0 0
3.09/3.17 c LP : Time Calls Iterations Iter/call Iter/sec
3.09/3.17 c primal LP : 0.00 0 0 0.00 -
3.09/3.17 c dual LP : 0.09 29 1094 37.72 12155.56
3.09/3.17 c lex dual LP : 0.00 0 0 0.00 -
3.09/3.17 c barrier LP : 0.00 0 0 0.00 -
3.09/3.17 c diving/probing LP: 0.00 0 0 0.00 -
3.09/3.17 c strong branching : 2.56 194 26338 135.76 10288.28
3.09/3.17 c (at root node) : - 194 26338 135.76 -
3.09/3.17 c conflict analysis: 0.00 0 0 0.00 -
3.09/3.17 c B&B Tree :
3.09/3.17 c number of runs : 4
3.09/3.17 c nodes : 1
3.09/3.17 c nodes (total) : 4
3.09/3.17 c nodes left : 0
3.09/3.17 c max depth : 0
3.09/3.17 c max depth (total): 0
3.09/3.17 c backtracks : 0 (0.0%)
3.09/3.17 c delayed cutoffs : 0
3.09/3.17 c repropagations : 0 (0 domain reductions, 0 cutoffs)
3.09/3.17 c avg switch length: 2.00
3.09/3.17 c switching time : 0.00
3.09/3.17 c Solution :
3.09/3.17 c Solutions found : 1 (1 improvements)
3.09/3.17 c First Solution : +0.00000000000000e+00 (in run 4, after 1 nodes, 3.04 seconds, depth 0, found by <relaxation>)
3.09/3.17 c Primal Bound : +0.00000000000000e+00 (in run 4, after 1 nodes, 3.04 seconds, depth 0, found by <relaxation>)
3.09/3.17 c Dual Bound : +0.00000000000000e+00
3.09/3.17 c Gap : 0.00 %
3.09/3.17 c Root Dual Bound : +0.00000000000000e+00
3.09/3.17 c Root Iterations : 1094
3.09/3.18 c Time complete: 3.17.