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-2667173-1276274497.opb>
0.00/0.01 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.01 c problem read
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.02 c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.03 c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.03 c presolving (3 rounds):
0.00/0.03 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 8 implications, 68 cliques
0.00/0.03 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.03 c 1 constraints of type <knapsack>
0.00/0.03 c 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.02
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.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/linesearchdiving/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/linesearchdiving/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/linesearchdiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <nlp> (-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/nlp/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.04 c heuristics/objpscostdiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.04 c # [type: real, range: [0,1], default: 0.01]
0.00/0.04 c heuristics/objpscostdiving/maxlpiterquot = 0.015
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/objpscostdiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <oneopt> (-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/oneopt/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/pscostdiving/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/pscostdiving/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/pscostdiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c heuristics/rens/freq = -1
0.00/0.04 c
0.00/0.04 c # minimum percentage of integer variables that have to be fixable
0.00/0.04 c # [type: real, range: [0,1], default: 0.5]
0.00/0.04 c heuristics/rens/minfixingrate = 0.3
0.00/0.04 c
0.00/0.04 c # number of nodes added to the contingent of the total nodes
0.00/0.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.04 c heuristics/rens/nodesofs = 2000
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.04 c heuristics/rootsoldiving/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.01]
0.00/0.04 c heuristics/rootsoldiving/maxlpiterquot = 0.015
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/rootsoldiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <rounding> (-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/rounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/shifting/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <simplerounding> (-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/simplerounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c heuristics/trivial/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <trysol> (-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/trysol/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 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 | 94 | - | 743k| 0 | 44 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 130 | - |1170k| 0 | 47 | 169 | 219 | 169 | 85 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 160 | - |1391k| 0 | 59 | 169 | 219 | 169 | 95 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 0 | 211 | - |1539k| 0 | 58 | 169 | 219 | 169 | 102 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 276 | - |1584k| 0 | 57 | 169 | 219 | 169 | 105 | 32 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 311 | - |1630k| 0 | 59 | 169 | 219 | 169 | 110 | 37 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.50 c 0.4s| 1 | 0 | 418 | - |1581k| 0 | 51 | 169 | 175 | 169 | 110 | 37 | 0 | 8 | 0.000000e+00 | -- | Inf
0.69/0.73 c 0.7s| 1 | 0 | 462 | - |1525k| 0 | 44 | 169 | 126 | 169 | 110 | 37 | 0 | 21 | 0.000000e+00 | -- | Inf
0.89/0.91 c 0.8s| 1 | 0 | 498 | - |1523k| 0 | 46 | 169 | 124 | 169 | 110 | 37 | 0 | 34 | 0.000000e+00 | -- | Inf
0.89/0.99 c 0.9s| 1 | 0 | 520 | - |1518k| 0 | 49 | 169 | 119 | 169 | 110 | 37 | 0 | 40 | 0.000000e+00 | -- | Inf
1.00/1.05 c 1.0s| 1 | 0 | 530 | - |1511k| 0 | 48 | 169 | 112 | 169 | 110 | 37 | 0 | 46 | 0.000000e+00 | -- | Inf
1.00/1.10 c 1.0s| 1 | 0 | 547 | - |1506k| 0 | 48 | 169 | 107 | 169 | 102 | 37 | 0 | 51 | 0.000000e+00 | -- | Inf
1.10/1.14 c 1.1s| 1 | 0 | 547 | - |1506k| 0 | - | 169 | 107 | 169 | 102 | 37 | 0 | 56 | 0.000000e+00 | -- | Inf
1.10/1.14 c (run 1, node 1) restarting after 35 global fixings of integer variables
1.10/1.14 c
1.10/1.15 c (restart) converted 29 cuts from the global cut pool into linear constraints
1.10/1.15 c
1.10/1.15 c presolving:
1.10/1.15 c (round 1) 35 del vars, 5 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 10 impls, 90 clqs
1.10/1.15 c (round 2) 35 del vars, 8 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 0 upgd conss, 10 impls, 90 clqs
1.10/1.16 c (round 3) 35 del vars, 8 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 56 upgd conss, 10 impls, 90 clqs
1.10/1.16 c (round 4) 35 del vars, 10 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 56 upgd conss, 10 impls, 90 clqs
1.10/1.16 c presolving (5 rounds):
1.10/1.16 c 35 deleted vars, 10 deleted constraints, 0 tightened bounds, 0 added holes, 3 changed sides, 0 changed coefficients
1.10/1.16 c 10 implications, 90 cliques
1.10/1.16 c presolved problem has 134 variables (134 bin, 0 int, 0 impl, 0 cont) and 126 constraints
1.10/1.16 c 7 constraints of type <knapsack>
1.10/1.16 c 85 constraints of type <setppc>
1.10/1.16 c 34 constraints of type <logicor>
1.10/1.16 c transformed objective value is always integral (scale: 1)
1.10/1.16 c Presolving Time: 0.03
1.10/1.16 c
1.10/1.17 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.10/1.17 c 1.1s| 1 | 0 | 639 | - | 880k| 0 | 43 | 134 | 126 | 134 | 96 | 0 | 0 | 56 | 0.000000e+00 | -- | Inf
1.10/1.19 c 1.1s| 1 | 0 | 706 | - |1085k| 0 | 50 | 134 | 126 | 134 | 112 | 16 | 0 | 56 | 0.000000e+00 | -- | Inf
1.29/1.37 c 1.3s| 1 | 0 | 780 | - |1081k| 0 | 43 | 134 | 112 | 134 | 112 | 16 | 0 | 71 | 0.000000e+00 | -- | Inf
1.39/1.45 c 1.4s| 1 | 0 | 780 | - |1081k| 0 | - | 134 | 112 | 134 | 112 | 16 | 0 | 79 | 0.000000e+00 | -- | Inf
1.39/1.45 c (run 2, node 1) restarting after 32 global fixings of integer variables
1.39/1.45 c
1.39/1.45 c (restart) converted 16 cuts from the global cut pool into linear constraints
1.39/1.45 c
1.39/1.45 c presolving:
1.39/1.46 c (round 1) 32 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 16 upgd conss, 22 impls, 83 clqs
1.39/1.47 c (round 2) 32 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 16 upgd conss, 22 impls, 83 clqs
1.39/1.47 c presolving (3 rounds):
1.39/1.47 c 32 deleted vars, 22 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.39/1.47 c 22 implications, 83 cliques
1.39/1.47 c presolved problem has 102 variables (102 bin, 0 int, 0 impl, 0 cont) and 106 constraints
1.39/1.47 c 17 constraints of type <knapsack>
1.39/1.47 c 80 constraints of type <setppc>
1.39/1.47 c 9 constraints of type <logicor>
1.39/1.47 c transformed objective value is always integral (scale: 1)
1.39/1.47 c Presolving Time: 0.05
1.39/1.47 c
1.39/1.47 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.47 c 1.4s| 1 | 0 | 867 | - | 924k| 0 | 42 | 102 | 106 | 102 | 100 | 0 | 0 | 79 | 0.000000e+00 | -- | Inf
1.49/1.50 c 1.4s| 1 | 0 | 896 | - |1173k| 0 | 48 | 102 | 106 | 102 | 111 | 11 | 0 | 79 | 0.000000e+00 | -- | Inf
1.69/1.76 c 1.7s| 1 | 0 | 944 | - |1173k| 0 | 42 | 102 | 106 | 102 | 111 | 11 | 0 | 99 | 0.000000e+00 | -- | Inf
1.79/1.90 c 1.8s| 1 | 0 | 967 | - |1172k| 0 | 0 | 102 | 105 | 102 | 111 | 11 | 0 | 108 | 0.000000e+00 | -- | Inf
1.79/1.90 c (run 3, node 1) restarting after 10 global fixings of integer variables
1.79/1.90 c
1.79/1.90 c (restart) converted 11 cuts from the global cut pool into linear constraints
1.79/1.90 c
1.89/1.90 c presolving:
1.89/1.91 c (round 1) 10 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 11 upgd conss, 28 impls, 82 clqs
1.89/1.91 c (round 2) 10 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 11 upgd conss, 28 impls, 82 clqs
1.89/1.91 c presolving (3 rounds):
1.89/1.91 c 10 deleted vars, 4 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.89/1.91 c 28 implications, 82 cliques
1.89/1.91 c presolved problem has 92 variables (92 bin, 0 int, 0 impl, 0 cont) and 112 constraints
1.89/1.91 c 24 constraints of type <knapsack>
1.89/1.91 c 79 constraints of type <setppc>
1.89/1.91 c 9 constraints of type <logicor>
1.89/1.91 c transformed objective value is always integral (scale: 1)
1.89/1.91 c Presolving Time: 0.07
1.89/1.91 c
1.89/1.92 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.92 c 1.8s| 1 | 0 | 1055 | - | 957k| 0 | 27 | 92 | 112 | 92 | 106 | 0 | 0 | 108 | 0.000000e+00 | -- | Inf
1.89/1.94 c 1.8s| 1 | 0 | 1150 | - |1038k| 0 | 38 | 92 | 112 | 92 | 112 | 6 | 0 | 108 | 0.000000e+00 | -- | Inf
2.09/2.19 c 2.1s| 1 | 0 | 1174 | - |1038k| 0 | 41 | 92 | 112 | 92 | 112 | 6 | 0 | 128 | 0.000000e+00 | -- | Inf
2.20/2.25 c 2.1s| 1 | 0 | 1195 | - |1038k| 0 | 38 | 92 | 111 | 92 | 112 | 6 | 0 | 133 | 0.000000e+00 | -- | Inf
2.29/2.30 c 2.2s| 1 | 0 | 1211 | - |1038k| 0 | 33 | 92 | 111 | 92 | 112 | 6 | 0 | 138 | 0.000000e+00 | -- | Inf
2.29/2.35 c 2.2s| 1 | 0 | 1222 | - |1038k| 0 | 35 | 92 | 111 | 92 | 112 | 6 | 0 | 144 | 0.000000e+00 | -- | Inf
2.29/2.39 c 2.3s| 1 | 0 | 1229 | - |1034k| 0 | 30 | 92 | 101 | 92 | 112 | 6 | 0 | 150 | 0.000000e+00 | -- | Inf
2.39/2.41 c 2.3s| 1 | 0 | 1234 | - |1032k| 0 | 27 | 92 | 91 | 92 | 112 | 6 | 0 | 155 | 0.000000e+00 | -- | Inf
2.39/2.43 c 2.3s| 1 | 0 | 1250 | - |1031k| 0 | 0 | 92 | 87 | 92 | 112 | 6 | 0 | 161 | 0.000000e+00 | -- | Inf
2.39/2.43 c * 2.3s| 1 | 0 | 1250 | - |1033k| 0 | - | 92 | 87 | 92 | 112 | 6 | 0 | 161 | 0.000000e+00 | 0.000000e+00 | 0.00%
2.39/2.43 c
2.39/2.43 c SCIP Status : problem is solved [optimal solution found]
2.39/2.43 c Solving Time (sec) : 2.31
2.39/2.43 c Solving Nodes : 1 (total of 4 nodes in 4 runs)
2.39/2.43 c Primal Bound : +0.00000000000000e+00 (1 solutions)
2.39/2.43 c Dual Bound : +0.00000000000000e+00
2.39/2.43 c Gap : 0.00 %
2.39/2.43 s SATISFIABLE
2.39/2.43 v -x169 -x168 -x167 x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
2.39/2.43 v -x147 x146 -x145 -x144 x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
2.39/2.43 v x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 x108 -x107 -x106
2.39/2.43 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.39/2.43 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
2.39/2.43 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
2.39/2.43 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.39/2.43 v -x4 -x3 -x2 -x1
2.39/2.43 c SCIP Status : problem is solved [optimal solution found]
2.39/2.43 c Solving Time : 2.31
2.39/2.43 c Original Problem :
2.39/2.43 c Problem name : HOME/instance-2667173-1276274497.opb
2.39/2.43 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
2.39/2.43 c Constraints : 101 initial, 101 maximal
2.39/2.43 c Presolved Problem :
2.39/2.43 c Problem name : t_HOME/instance-2667173-1276274497.opb
2.39/2.43 c Variables : 92 (92 binary, 0 integer, 0 implicit integer, 0 continuous)
2.39/2.43 c Constraints : 112 initial, 112 maximal
2.39/2.43 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.39/2.43 c trivial : 0.00 77 0 0 0 0 0 0 0
2.39/2.43 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.39/2.43 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.39/2.43 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.39/2.43 c implics : 0.00 0 0 0 0 0 0 0 0
2.39/2.43 c probing : 0.00 0 0 0 0 0 0 0 0
2.39/2.43 c knapsack : 0.03 0 0 0 0 0 0 0 0
2.39/2.43 c setppc : 0.00 0 0 0 0 0 12 0 0
2.39/2.43 c linear : 0.02 0 0 0 0 0 35 3 0
2.39/2.43 c logicor : 0.00 0 0 0 0 0 17 0 0
2.39/2.43 c root node : - 133 - - 133 - - - -
2.39/2.43 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.39/2.43 c integral : 0 0 0 20 0 0 90 0 0 0
2.39/2.43 c knapsack : 24 8 24 2 0 0 0 0 0 0
2.39/2.43 c setppc : 79 8 24 2 0 0 43 0 0 0
2.39/2.43 c logicor : 9 8 11 2 0 0 0 0 0 0
2.39/2.43 c countsols : 0 0 0 2 0 0 0 0 0 0
2.39/2.43 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.39/2.43 c integral : 1.85 0.00 0.00 1.85 0.00
2.39/2.43 c knapsack : 0.01 0.01 0.00 0.00 0.00
2.39/2.43 c setppc : 0.00 0.00 0.00 0.00 0.00
2.39/2.43 c logicor : 0.00 0.00 0.00 0.00 0.00
2.39/2.43 c countsols : 0.00 0.00 0.00 0.00 0.00
2.39/2.43 c Propagators : Time Calls Cutoffs DomReds
2.39/2.43 c vbounds : 0.00 4 0 0
2.39/2.43 c rootredcost : 0.00 0 0 0
2.39/2.43 c pseudoobj : 0.00 0 0 0
2.39/2.43 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.39/2.43 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.39/2.43 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.43 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.43 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.43 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.39/2.43 c applied globally : - - - 0 0.0 - - -
2.39/2.43 c applied locally : - - - 0 0.0 - - -
2.39/2.43 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.39/2.43 c cut pool : 0.00 0 - - 0 - (maximal pool size: 35)
2.39/2.43 c redcost : 0.00 8 0 0 0 0
2.39/2.43 c impliedbounds : 0.00 8 0 0 0 0
2.39/2.43 c intobj : 0.00 0 0 0 0 0
2.39/2.43 c cgmip : 0.00 0 0 0 0 0
2.39/2.43 c gomory : 0.06 8 0 0 23 0
2.39/2.43 c strongcg : 0.07 8 0 0 345 0
2.39/2.43 c cmir : 0.00 0 0 0 0 0
2.39/2.43 c flowcover : 0.00 0 0 0 0 0
2.39/2.43 c clique : 0.00 8 0 0 45 0
2.39/2.43 c zerohalf : 0.00 0 0 0 0 0
2.39/2.43 c mcf : 0.00 4 0 0 0 0
2.39/2.43 c rapidlearning : 0.16 1 0 0 0 146
2.39/2.43 c Pricers : Time Calls Vars
2.39/2.43 c problem variables: 0.00 0 0
2.39/2.43 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.39/2.43 c relpscost : 1.85 18 0 90 0 0 0
2.39/2.43 c pscost : 0.00 0 0 0 0 0 0
2.39/2.43 c inference : 0.00 0 0 0 0 0 0
2.39/2.43 c mostinf : 0.00 0 0 0 0 0 0
2.39/2.43 c leastinf : 0.00 0 0 0 0 0 0
2.39/2.43 c fullstrong : 0.00 0 0 0 0 0 0
2.39/2.43 c allfullstrong : 0.00 0 0 0 0 0 0
2.39/2.43 c random : 0.00 0 0 0 0 0 0
2.39/2.43 c Primal Heuristics : Time Calls Found
2.39/2.43 c LP solutions : 0.00 - 1
2.39/2.43 c pseudo solutions : 0.00 - 0
2.39/2.43 c trivial : 0.00 1 0
2.39/2.43 c simplerounding : 0.00 0 0
2.39/2.43 c zirounding : 0.00 0 0
2.39/2.43 c rounding : 0.00 0 0
2.39/2.43 c shifting : 0.00 0 0
2.39/2.43 c intshifting : 0.00 0 0
2.39/2.43 c oneopt : 0.00 0 0
2.39/2.43 c twoopt : 0.00 0 0
2.39/2.43 c fixandinfer : 0.00 0 0
2.39/2.43 c feaspump : 0.00 0 0
2.39/2.43 c coefdiving : 0.00 0 0
2.39/2.43 c pscostdiving : 0.00 0 0
2.39/2.43 c fracdiving : 0.00 0 0
2.39/2.43 c veclendiving : 0.00 0 0
2.39/2.43 c intdiving : 0.00 0 0
2.39/2.43 c actconsdiving : 0.00 0 0
2.39/2.43 c objpscostdiving : 0.00 0 0
2.39/2.43 c rootsoldiving : 0.00 0 0
2.39/2.43 c linesearchdiving : 0.00 0 0
2.39/2.43 c guideddiving : 0.00 0 0
2.39/2.43 c octane : 0.00 0 0
2.39/2.43 c rens : 0.00 0 0
2.39/2.43 c rins : 0.00 0 0
2.39/2.43 c localbranching : 0.00 0 0
2.39/2.43 c mutation : 0.00 0 0
2.39/2.43 c crossover : 0.00 0 0
2.39/2.43 c dins : 0.00 0 0
2.39/2.43 c undercover : 0.00 0 0
2.39/2.43 c nlp : 0.00 0 0
2.39/2.43 c trysol : 0.00 0 0
2.39/2.43 c LP : Time Calls Iterations Iter/call Iter/sec
2.39/2.43 c primal LP : 0.00 0 0 0.00 -
2.39/2.43 c dual LP : 0.07 28 1250 44.64 17857.14
2.39/2.43 c lex dual LP : 0.00 0 0 0.00 -
2.39/2.43 c barrier LP : 0.00 0 0 0.00 -
2.39/2.43 c diving/probing LP: 0.00 0 0 0.00 -
2.39/2.43 c strong branching : 1.85 161 20947 130.11 11322.70
2.39/2.43 c (at root node) : - 161 20947 130.11 -
2.39/2.43 c conflict analysis: 0.00 0 0 0.00 -
2.39/2.43 c B&B Tree :
2.39/2.43 c number of runs : 4
2.39/2.43 c nodes : 1
2.39/2.43 c nodes (total) : 4
2.39/2.43 c nodes left : 0
2.39/2.43 c max depth : 0
2.39/2.43 c max depth (total): 0
2.39/2.43 c backtracks : 0 (0.0%)
2.39/2.43 c delayed cutoffs : 0
2.39/2.43 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.39/2.43 c avg switch length: 2.00
2.39/2.43 c switching time : 0.00
2.39/2.43 c Solution :
2.39/2.43 c Solutions found : 1 (1 improvements)
2.39/2.43 c First Solution : +0.00000000000000e+00 (in run 4, after 1 nodes, 2.31 seconds, depth 0, found by <relaxation>)
2.39/2.43 c Primal Bound : +0.00000000000000e+00 (in run 4, after 1 nodes, 2.31 seconds, depth 0, found by <relaxation>)
2.39/2.43 c Dual Bound : +0.00000000000000e+00
2.39/2.43 c Gap : 0.00 %
2.39/2.43 c Root Dual Bound : +0.00000000000000e+00
2.39/2.43 c Root Iterations : 1250
2.39/2.44 c Time complete: 2.43.