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-2667203-1276277385.opb>
0.00/0.01 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.01 c problem read
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c presolving settings loaded
0.00/0.01 c presolving:
0.01/0.02 c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.01/0.03 c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.01/0.03 c presolving (3 rounds):
0.01/0.03 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.03 c 8 implications, 68 cliques
0.01/0.03 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.01/0.03 c 1 constraints of type <knapsack>
0.01/0.03 c 68 constraints of type <setppc>
0.01/0.03 c 4 constraints of type <logicor>
0.01/0.03 c transformed objective value is always integral (scale: 1)
0.01/0.03 c Presolving Time: 0.01
0.01/0.03 c - non default parameters ----------------------------------------------------------------------
0.01/0.03 c # SCIP version 1.2.1.2
0.01/0.03 c
0.01/0.03 c # frequency for displaying node information lines
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.03 c display/freq = 10000
0.01/0.03 c
0.01/0.03 c # maximal time in seconds to run
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03 c limits/time = 1800
0.01/0.03 c
0.01/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03 c limits/memory = 1620
0.01/0.03 c
0.01/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c limits/solutions = 1
0.01/0.03 c
0.01/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.01/0.03 c separating/maxrounds = 1
0.01/0.03 c
0.01/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c separating/maxroundsroot = 5
0.01/0.03 c
0.01/0.03 c # should presolving try to simplify inequalities
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/linear/simplifyinequalities = TRUE
0.01/0.03 c
0.01/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.01/0.03 c constraints/knapsack/disaggregation = FALSE
0.01/0.03 c
0.01/0.03 c # should presolving try to simplify knapsacks
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.03 c
0.01/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c presolving/probing/maxrounds = 0
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/coefdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.01/0.03 c heuristics/crossover/freq = -1
0.01/0.03 c
0.01/0.03 c # number of nodes added to the contingent of the total nodes
0.01/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.03 c heuristics/crossover/nodesofs = 750
0.01/0.03 c
0.01/0.03 c # number of nodes without incumbent change that heuristic should wait
0.01/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.01/0.03 c heuristics/crossover/nwaitingnodes = 100
0.01/0.03 c
0.01/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.01/0.03 c # [type: real, range: [0,1], default: 0.1]
0.01/0.03 c heuristics/crossover/nodesquot = 0.15
0.01/0.03 c
0.01/0.03 c # minimum percentage of integer variables that have to be fixed
0.01/0.03 c # [type: real, range: [0,1], default: 0.666]
0.01/0.03 c heuristics/crossover/minfixingrate = 0.5
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03 c heuristics/feaspump/freq = -1
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/fracdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/guideddiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/intshifting/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/linesearchdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/nlp/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03 c heuristics/objpscostdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.01/0.03 c # [type: real, range: [0,1], default: 0.01]
0.01/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/oneopt/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/pscostdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c heuristics/rens/freq = -1
0.01/0.03 c
0.01/0.03 c # minimum percentage of integer variables that have to be fixable
0.01/0.03 c # [type: real, range: [0,1], default: 0.5]
0.01/0.03 c heuristics/rens/minfixingrate = 0.3
0.01/0.03 c
0.01/0.03 c # number of nodes added to the contingent of the total nodes
0.01/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.03 c heuristics/rens/nodesofs = 2000
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03 c heuristics/rootsoldiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.01/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/rounding/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/shifting/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/simplerounding/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c heuristics/trivial/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/trysol/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/veclendiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/zirounding/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c separating/cmir/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c separating/flowcover/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c separating/rapidlearning/freq = 0
0.01/0.03 c
0.01/0.03 c -----------------------------------------------------------------------------------------------
0.01/0.03 c start solving
0.01/0.04 c
0.01/0.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.01/0.04 c 0.0s| 1 | 0 | 113 | - | 743k| 0 | 43 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 132 | - |1193k| 0 | 48 | 169 | 209 | 169 | 82 | 9 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 0 | 160 | - |1405k| 0 | 52 | 169 | 209 | 169 | 90 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 184 | - |1628k| 0 | 57 | 169 | 209 | 169 | 96 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.34 c 0.3s| 1 | 0 | 219 | - |1805k| 0 | 54 | 169 | 209 | 169 | 100 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.36 c 0.3s| 1 | 0 | 253 | - |1899k| 0 | 60 | 169 | 209 | 169 | 106 | 33 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.56 c 0.5s| 1 | 0 | 264 | - |1801k| 0 | 58 | 169 | 121 | 169 | 106 | 33 | 0 | 13 | 0.000000e+00 | -- | Inf
0.59/0.65 c 0.6s| 1 | 0 | 274 | - |1800k| 0 | 58 | 169 | 120 | 169 | 106 | 33 | 0 | 19 | 0.000000e+00 | -- | Inf
0.79/0.85 c 0.8s| 1 | 0 | 326 | - |1797k| 0 | 59 | 169 | 118 | 169 | 106 | 33 | 0 | 33 | 0.000000e+00 | -- | Inf
1.00/1.06 c 1.0s| 1 | 0 | 383 | - |1790k| 0 | 53 | 169 | 112 | 169 | 106 | 33 | 0 | 46 | 0.000000e+00 | -- | Inf
1.10/1.16 c 1.1s| 1 | 0 | 418 | - |1788k| 0 | 50 | 169 | 110 | 169 | 106 | 33 | 0 | 53 | 0.000000e+00 | -- | Inf
1.19/1.27 c 1.2s| 1 | 0 | 495 | - |1786k| 0 | 50 | 169 | 108 | 169 | 101 | 33 | 0 | 61 | 0.000000e+00 | -- | Inf
1.29/1.32 c 1.2s| 1 | 0 | 524 | - |1782k| 0 | 47 | 169 | 105 | 169 | 101 | 33 | 0 | 67 | 0.000000e+00 | -- | Inf
1.39/1.40 c 1.3s| 1 | 0 | 524 | - |1782k| 0 | - | 169 | 105 | 169 | 101 | 33 | 0 | 79 | 0.000000e+00 | -- | Inf
1.39/1.40 c (run 1, node 1) restarting after 38 global fixings of integer variables
1.39/1.40 c
1.39/1.40 c (restart) converted 27 cuts from the global cut pool into linear constraints
1.39/1.40 c
1.39/1.40 c presolving:
1.39/1.41 c (round 1) 38 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 14 impls, 87 clqs
1.39/1.42 c (round 2) 38 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 57 upgd conss, 14 impls, 87 clqs
1.39/1.42 c presolving (3 rounds):
1.39/1.42 c 38 deleted vars, 4 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.39/1.42 c 14 implications, 87 cliques
1.39/1.42 c presolved problem has 131 variables (131 bin, 0 int, 0 impl, 0 cont) and 128 constraints
1.39/1.42 c 6 constraints of type <knapsack>
1.39/1.42 c 87 constraints of type <setppc>
1.39/1.42 c 35 constraints of type <logicor>
1.39/1.42 c transformed objective value is always integral (scale: 1)
1.39/1.42 c Presolving Time: 0.03
1.39/1.42 c
1.39/1.43 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.39/1.43 c 1.4s| 1 | 0 | 604 | - | 861k| 0 | 50 | 131 | 128 | 131 | 98 | 0 | 0 | 79 | 0.000000e+00 | -- | Inf
1.39/1.45 c 1.4s| 1 | 0 | 649 | - |1087k| 0 | 55 | 131 | 128 | 131 | 110 | 12 | 0 | 79 | 0.000000e+00 | -- | Inf
1.68/1.71 c 1.6s| 1 | 0 | 694 | - |1087k| 0 | 50 | 131 | 127 | 131 | 110 | 12 | 0 | 99 | 0.000000e+00 | -- | Inf
1.79/1.84 c 1.7s| 1 | 0 | 739 | - |1086k| 0 | 47 | 131 | 127 | 131 | 110 | 12 | 0 | 110 | 0.000000e+00 | -- | Inf
1.79/1.86 c 1.8s| 1 | 0 | 746 | - |1086k| 0 | 45 | 131 | 125 | 131 | 110 | 12 | 0 | 115 | 0.000000e+00 | -- | Inf
1.79/1.89 c 1.8s| 1 | 0 | 758 | - |1086k| 0 | 50 | 131 | 124 | 131 | 110 | 12 | 0 | 121 | 0.000000e+00 | -- | Inf
1.89/1.91 c 1.8s| 1 | 0 | 768 | - |1085k| 0 | 46 | 131 | 123 | 131 | 110 | 12 | 0 | 126 | 0.000000e+00 | -- | Inf
1.89/1.94 c 1.8s| 1 | 0 | 768 | - |1085k| 0 | - | 131 | 123 | 131 | 110 | 12 | 0 | 132 | 0.000000e+00 | -- | Inf
1.89/1.94 c (run 2, node 1) restarting after 30 global fixings of integer variables
1.89/1.94 c
1.89/1.94 c (restart) converted 12 cuts from the global cut pool into linear constraints
1.89/1.94 c
1.89/1.94 c presolving:
1.89/1.95 c (round 1) 30 del vars, 15 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 12 upgd conss, 18 impls, 87 clqs
1.89/1.96 c presolving (2 rounds):
1.89/1.96 c 30 deleted vars, 15 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.89/1.96 c 18 implications, 87 cliques
1.89/1.96 c presolved problem has 101 variables (101 bin, 0 int, 0 impl, 0 cont) and 120 constraints
1.89/1.96 c 13 constraints of type <knapsack>
1.89/1.96 c 85 constraints of type <setppc>
1.89/1.96 c 22 constraints of type <logicor>
1.89/1.96 c transformed objective value is always integral (scale: 1)
1.89/1.96 c Presolving Time: 0.04
1.89/1.96 c
1.89/1.96 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.89/1.96 c 1.9s| 1 | 0 | 841 | - | 878k| 0 | 47 | 101 | 120 | 101 | 102 | 0 | 0 | 132 | 0.000000e+00 | -- | Inf
1.89/1.99 c 1.9s| 1 | 0 | 886 | - |1162k| 0 | 48 | 101 | 120 | 101 | 110 | 8 | 0 | 132 | 0.000000e+00 | -- | Inf
2.10/2.12 c 2.0s| 1 | 0 | 926 | - |1162k| 0 | 47 | 101 | 120 | 101 | 110 | 8 | 0 | 143 | 0.000000e+00 | -- | Inf
2.10/2.19 c 2.1s| 1 | 0 | 983 | - |1161k| 0 | 43 | 101 | 120 | 101 | 110 | 8 | 0 | 150 | 0.000000e+00 | -- | Inf
2.20/2.26 c 2.1s| 1 | 0 | 1081 | - |1160k| 0 | 0 | 101 | 118 | 101 | 110 | 8 | 0 | 156 | 0.000000e+00 | -- | Inf
2.20/2.26 c (run 3, node 1) restarting after 15 global fixings of integer variables
2.20/2.26 c
2.20/2.26 c (restart) converted 8 cuts from the global cut pool into linear constraints
2.20/2.26 c
2.20/2.26 c presolving:
2.20/2.27 c (round 1) 17 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 7 chg coeffs, 8 upgd conss, 60 impls, 67 clqs
2.20/2.28 c (round 2) 17 del vars, 19 del conss, 0 chg bounds, 4 chg sides, 20 chg coeffs, 8 upgd conss, 60 impls, 67 clqs
2.20/2.28 c (round 3) 17 del vars, 19 del conss, 0 chg bounds, 7 chg sides, 30 chg coeffs, 8 upgd conss, 60 impls, 67 clqs
2.20/2.29 c (round 4) 17 del vars, 19 del conss, 0 chg bounds, 7 chg sides, 37 chg coeffs, 8 upgd conss, 60 impls, 67 clqs
2.20/2.29 c (round 5) 17 del vars, 19 del conss, 0 chg bounds, 7 chg sides, 41 chg coeffs, 8 upgd conss, 60 impls, 67 clqs
2.20/2.29 c (round 6) 17 del vars, 19 del conss, 0 chg bounds, 7 chg sides, 44 chg coeffs, 8 upgd conss, 60 impls, 67 clqs
2.20/2.29 c (round 7) 17 del vars, 19 del conss, 0 chg bounds, 7 chg sides, 46 chg coeffs, 8 upgd conss, 60 impls, 67 clqs
2.20/2.29 c (round 8) 17 del vars, 19 del conss, 0 chg bounds, 7 chg sides, 47 chg coeffs, 8 upgd conss, 60 impls, 67 clqs
2.29/2.30 c (round 9) 17 del vars, 19 del conss, 0 chg bounds, 7 chg sides, 48 chg coeffs, 8 upgd conss, 60 impls, 67 clqs
2.29/2.30 c (round 10) 17 del vars, 19 del conss, 0 chg bounds, 7 chg sides, 49 chg coeffs, 8 upgd conss, 60 impls, 67 clqs
2.29/2.30 c presolving (11 rounds):
2.29/2.30 c 17 deleted vars, 19 deleted constraints, 0 tightened bounds, 0 added holes, 7 changed sides, 49 changed coefficients
2.29/2.30 c 60 implications, 67 cliques
2.29/2.30 c presolved problem has 84 variables (84 bin, 0 int, 0 impl, 0 cont) and 107 constraints
2.29/2.30 c 16 constraints of type <knapsack>
2.29/2.30 c 75 constraints of type <setppc>
2.29/2.30 c 16 constraints of type <logicor>
2.29/2.30 c transformed objective value is always integral (scale: 1)
2.29/2.30 c Presolving Time: 0.07
2.29/2.30 c
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 | 1159 | - | 877k| 0 | 0 | 84 | 107 | 84 | 95 | 0 | 0 | 156 | 0.000000e+00 | -- | Inf
2.29/2.31 c * 2.2s| 1 | 0 | 1159 | - | 879k| 0 | - | 84 | 107 | 84 | 95 | 0 | 0 | 156 | 0.000000e+00 | 0.000000e+00 | 0.00%
2.29/2.31 c
2.29/2.31 c SCIP Status : problem is solved [optimal solution found]
2.29/2.31 c Solving Time (sec) : 2.17
2.29/2.31 c Solving Nodes : 1 (total of 4 nodes in 4 runs)
2.29/2.31 c Primal Bound : +0.00000000000000e+00 (1 solutions)
2.29/2.31 c Dual Bound : +0.00000000000000e+00
2.29/2.31 c Gap : 0.00 %
2.29/2.31 s SATISFIABLE
2.29/2.31 v x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
2.29/2.31 v x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 x129 -x128 -x127
2.29/2.31 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 x107 -x106
2.29/2.31 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
2.29/2.31 v -x81 -x80 -x79 -x78 -x77 x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 x61 -x60 -x59 -x58 -x57 -x56
2.29/2.31 v -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 x32 -x31
2.29/2.31 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
2.29/2.31 v -x4 -x3 -x2 -x1
2.29/2.31 c SCIP Status : problem is solved [optimal solution found]
2.29/2.31 c Solving Time : 2.17
2.29/2.31 c Original Problem :
2.29/2.31 c Problem name : HOME/instance-2667203-1276277385.opb
2.29/2.31 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
2.29/2.31 c Constraints : 101 initial, 101 maximal
2.29/2.31 c Presolved Problem :
2.29/2.31 c Problem name : t_HOME/instance-2667203-1276277385.opb
2.29/2.31 c Variables : 84 (84 binary, 0 integer, 0 implicit integer, 0 continuous)
2.29/2.31 c Constraints : 107 initial, 107 maximal
2.29/2.31 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.29/2.31 c trivial : 0.00 83 0 0 0 0 0 0 0
2.29/2.31 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.29/2.31 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.29/2.31 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.29/2.31 c implics : 0.00 0 0 0 0 0 0 0 0
2.29/2.31 c probing : 0.00 0 0 0 0 0 0 0 0
2.29/2.31 c knapsack : 0.03 0 0 0 0 0 0 7 49
2.29/2.31 c setppc : 0.00 0 2 0 0 0 14 0 0
2.29/2.31 c linear : 0.01 0 0 0 0 0 30 0 0
2.29/2.31 c logicor : 0.00 0 0 0 0 0 22 0 0
2.29/2.31 c root node : - 83 - - 83 - - - -
2.29/2.31 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.29/2.31 c integral : 0 0 0 19 0 0 83 0 0 0
2.29/2.31 c knapsack : 16 8 19 2 0 0 0 0 0 0
2.29/2.31 c setppc : 75 8 19 2 0 0 0 0 0 0
2.29/2.31 c logicor : 16 8 10 0 0 0 0 0 0 0
2.29/2.31 c countsols : 0 0 0 2 0 0 0 0 0 0
2.29/2.31 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.29/2.31 c integral : 1.67 0.00 0.00 1.67 0.00
2.29/2.31 c knapsack : 0.01 0.01 0.00 0.00 0.00
2.29/2.31 c setppc : 0.00 0.00 0.00 0.00 0.00
2.29/2.31 c logicor : 0.00 0.00 0.00 0.00 0.00
2.29/2.31 c countsols : 0.00 0.00 0.00 0.00 0.00
2.29/2.31 c Propagators : Time Calls Cutoffs DomReds
2.29/2.31 c vbounds : 0.00 4 0 0
2.29/2.31 c rootredcost : 0.00 0 0 0
2.29/2.31 c pseudoobj : 0.00 0 0 0
2.29/2.31 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.29/2.31 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.29/2.31 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.29/2.31 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.29/2.31 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.29/2.31 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.29/2.31 c applied globally : - - - 0 0.0 - - -
2.29/2.31 c applied locally : - - - 0 0.0 - - -
2.29/2.31 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.29/2.31 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
2.29/2.31 c redcost : 0.00 8 0 0 0 0
2.29/2.31 c impliedbounds : 0.00 7 0 0 0 0
2.29/2.31 c intobj : 0.00 0 0 0 0 0
2.29/2.31 c cgmip : 0.00 0 0 0 0 0
2.29/2.31 c gomory : 0.05 7 0 0 36 0
2.29/2.31 c strongcg : 0.05 7 0 0 385 0
2.29/2.31 c cmir : 0.00 0 0 0 0 0
2.29/2.31 c flowcover : 0.00 0 0 0 0 0
2.29/2.31 c clique : 0.01 7 0 0 39 0
2.29/2.31 c zerohalf : 0.00 0 0 0 0 0
2.29/2.31 c mcf : 0.01 3 0 0 0 0
2.29/2.31 c rapidlearning : 0.18 1 0 0 0 136
2.29/2.31 c Pricers : Time Calls Vars
2.29/2.31 c problem variables: 0.00 0 0
2.29/2.31 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.29/2.31 c relpscost : 1.67 17 0 83 0 0 0
2.29/2.31 c pscost : 0.00 0 0 0 0 0 0
2.29/2.31 c inference : 0.00 0 0 0 0 0 0
2.29/2.31 c mostinf : 0.00 0 0 0 0 0 0
2.29/2.31 c leastinf : 0.00 0 0 0 0 0 0
2.29/2.31 c fullstrong : 0.00 0 0 0 0 0 0
2.29/2.31 c allfullstrong : 0.00 0 0 0 0 0 0
2.29/2.31 c random : 0.00 0 0 0 0 0 0
2.29/2.31 c Primal Heuristics : Time Calls Found
2.29/2.31 c LP solutions : 0.00 - 1
2.29/2.31 c pseudo solutions : 0.00 - 0
2.29/2.31 c trivial : 0.00 1 0
2.29/2.31 c simplerounding : 0.00 0 0
2.29/2.31 c zirounding : 0.00 0 0
2.29/2.31 c rounding : 0.00 0 0
2.29/2.31 c shifting : 0.00 0 0
2.29/2.31 c intshifting : 0.00 0 0
2.29/2.31 c oneopt : 0.00 0 0
2.29/2.31 c twoopt : 0.00 0 0
2.29/2.31 c fixandinfer : 0.00 0 0
2.29/2.31 c feaspump : 0.00 0 0
2.29/2.31 c coefdiving : 0.00 0 0
2.29/2.31 c pscostdiving : 0.00 0 0
2.29/2.31 c fracdiving : 0.00 0 0
2.29/2.31 c veclendiving : 0.00 0 0
2.29/2.31 c intdiving : 0.00 0 0
2.29/2.31 c actconsdiving : 0.00 0 0
2.29/2.31 c objpscostdiving : 0.00 0 0
2.29/2.31 c rootsoldiving : 0.00 0 0
2.29/2.31 c linesearchdiving : 0.00 0 0
2.29/2.31 c guideddiving : 0.00 0 0
2.29/2.31 c octane : 0.00 0 0
2.29/2.31 c rens : 0.00 0 0
2.29/2.31 c rins : 0.00 0 0
2.29/2.31 c localbranching : 0.00 0 0
2.29/2.31 c mutation : 0.00 0 0
2.29/2.31 c crossover : 0.00 0 0
2.29/2.31 c dins : 0.00 0 0
2.29/2.31 c undercover : 0.00 0 0
2.29/2.31 c nlp : 0.00 0 0
2.29/2.31 c trysol : 0.00 0 0
2.29/2.31 c LP : Time Calls Iterations Iter/call Iter/sec
2.29/2.31 c primal LP : 0.00 0 0 0.00 -
2.29/2.31 c dual LP : 0.09 26 1159 44.58 12877.78
2.29/2.31 c lex dual LP : 0.00 0 0 0.00 -
2.29/2.31 c barrier LP : 0.00 0 0 0.00 -
2.29/2.31 c diving/probing LP: 0.00 0 0 0.00 -
2.29/2.31 c strong branching : 1.67 156 19346 124.01 11584.43
2.29/2.31 c (at root node) : - 156 19346 124.01 -
2.29/2.31 c conflict analysis: 0.00 0 0 0.00 -
2.29/2.31 c B&B Tree :
2.29/2.31 c number of runs : 4
2.29/2.31 c nodes : 1
2.29/2.31 c nodes (total) : 4
2.29/2.31 c nodes left : 0
2.29/2.31 c max depth : 0
2.29/2.31 c max depth (total): 0
2.29/2.31 c backtracks : 0 (0.0%)
2.29/2.31 c delayed cutoffs : 0
2.29/2.31 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.29/2.31 c avg switch length: 2.00
2.29/2.31 c switching time : 0.00
2.29/2.31 c Solution :
2.29/2.31 c Solutions found : 1 (1 improvements)
2.29/2.31 c First Solution : +0.00000000000000e+00 (in run 4, after 1 nodes, 2.17 seconds, depth 0, found by <relaxation>)
2.29/2.31 c Primal Bound : +0.00000000000000e+00 (in run 4, after 1 nodes, 2.17 seconds, depth 0, found by <relaxation>)
2.29/2.31 c Dual Bound : +0.00000000000000e+00
2.29/2.31 c Gap : 0.00 %
2.29/2.31 c Root Dual Bound : +0.00000000000000e+00
2.29/2.31 c Root Iterations : 1159
2.29/2.31 c Time complete: 2.31.