0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2665720-1276272536.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.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 = 1799.99
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.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/guideddiving/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/guideddiving/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/guideddiving/maxlpiterofs = 1500
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/intdiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <intshifting> (-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/intshifting/freq = -1
0.00/0.04 c
0.00/0.04 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 | 45 | - | 743k| 0 | 39 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 70 | - |1199k| 0 | 46 | 169 | 230 | 169 | 91 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 167 | - |1501k| 0 | 53 | 169 | 230 | 169 | 97 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 303 | - |1619k| 0 | 59 | 169 | 230 | 169 | 105 | 32 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 496 | - |1678k| 0 | 55 | 169 | 230 | 169 | 111 | 38 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.36 c 0.3s| 1 | 0 | 732 | - |1795k| 0 | 57 | 169 | 230 | 169 | 115 | 42 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.62 c 0.6s| 1 | 0 | 997 | - |1748k| 0 | 50 | 169 | 186 | 169 | 115 | 42 | 0 | 8 | 0.000000e+00 | -- | Inf
0.69/0.74 c 0.7s| 1 | 0 | 1106 | - |1713k| 0 | 49 | 169 | 153 | 169 | 115 | 42 | 0 | 14 | 0.000000e+00 | -- | Inf
0.89/0.93 c 0.9s| 1 | 0 | 1242 | - |1702k| 0 | 45 | 169 | 143 | 169 | 115 | 42 | 0 | 22 | 0.000000e+00 | -- | Inf
0.89/1.00 c 0.9s| 1 | 0 | 1340 | - |1668k| 0 | 47 | 169 | 113 | 169 | 115 | 42 | 0 | 27 | 0.000000e+00 | -- | Inf
0.99/1.05 c 1.0s| 1 | 0 | 1436 | - |1667k| 0 | 45 | 169 | 111 | 169 | 115 | 42 | 0 | 32 | 0.000000e+00 | -- | Inf
0.99/1.07 c 1.0s| 1 | 0 | 1450 | - |1667k| 0 | 46 | 169 | 111 | 169 | 99 | 42 | 0 | 37 | 0.000000e+00 | -- | Inf
1.10/1.13 c 1.1s| 1 | 0 | 1450 | - |1667k| 0 | - | 169 | 111 | 169 | 99 | 42 | 0 | 43 | 0.000000e+00 | -- | Inf
1.10/1.13 c (run 1, node 1) restarting after 35 global fixings of integer variables
1.10/1.13 c
1.10/1.13 c (restart) converted 26 cuts from the global cut pool into linear constraints
1.10/1.13 c
1.10/1.13 c presolving:
1.10/1.14 c (round 1) 35 del vars, 6 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 16 impls, 83 clqs
1.10/1.14 c (round 2) 35 del vars, 7 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 58 upgd conss, 16 impls, 83 clqs
1.10/1.16 c (round 3) 35 del vars, 9 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 58 upgd conss, 16 impls, 83 clqs
1.10/1.16 c presolving (4 rounds):
1.10/1.16 c 35 deleted vars, 9 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.10/1.16 c 16 implications, 83 cliques
1.10/1.16 c presolved problem has 134 variables (134 bin, 0 int, 0 impl, 0 cont) and 128 constraints
1.10/1.16 c 8 constraints of type <knapsack>
1.10/1.16 c 83 constraints of type <setppc>
1.10/1.16 c 37 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.16 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.16 c 1.1s| 1 | 0 | 1559 | - | 903k| 0 | 41 | 134 | 128 | 134 | 96 | 0 | 0 | 43 | 0.000000e+00 | -- | Inf
1.19/1.20 c 1.1s| 1 | 0 | 1770 | - |1236k| 0 | 41 | 134 | 128 | 134 | 106 | 10 | 0 | 43 | 0.000000e+00 | -- | Inf
1.19/1.24 c 1.1s| 1 | 0 | 1840 | - |1227k| 0 | 0 | 134 | 95 | 134 | 106 | 10 | 0 | 48 | 0.000000e+00 | -- | Inf
1.19/1.24 c (run 2, node 1) restarting after 53 global fixings of integer variables
1.19/1.24 c
1.19/1.24 c (restart) converted 10 cuts from the global cut pool into linear constraints
1.19/1.24 c
1.19/1.24 c presolving:
1.19/1.25 c (round 1) 53 del vars, 21 del conss, 0 chg bounds, 0 chg sides, 3 chg coeffs, 0 upgd conss, 42 impls, 60 clqs
1.19/1.26 c (round 2) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 6 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.19/1.26 c (round 3) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 8 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.19/1.26 c (round 4) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 10 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.19/1.27 c (round 5) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 12 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.19/1.27 c (round 6) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 13 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.19/1.27 c (round 7) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 14 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.19/1.27 c (round 8) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 15 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.19/1.27 c (round 9) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 16 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.19/1.28 c (round 10) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 17 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.19/1.28 c (round 11) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 18 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.19/1.28 c (round 12) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 19 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.19/1.28 c (round 13) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 20 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.19/1.28 c (round 14) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 21 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.19/1.29 c (round 15) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 22 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.19/1.29 c (round 16) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 23 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.19/1.29 c (round 17) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 24 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.19/1.29 c (round 18) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 25 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.19/1.29 c (round 19) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 26 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.19/1.30 c (round 20) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 27 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.30 c (round 21) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 28 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.30 c (round 22) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 29 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.30 c (round 23) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 30 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.30 c (round 24) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 31 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.31 c (round 25) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 32 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.31 c (round 26) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 33 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.31 c (round 27) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 34 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.31 c (round 28) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 35 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.31 c (round 29) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 36 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.32 c (round 30) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 37 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.32 c (round 31) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 38 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.32 c (round 32) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 39 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.32 c (round 33) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 40 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.32 c (round 34) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 41 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.32 c (round 35) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 42 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.33 c (round 36) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 43 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.33 c (round 37) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 44 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.33 c (round 38) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 45 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.33 c (round 39) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 46 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.33 c (round 40) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 47 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.34 c (round 41) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 48 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.34 c (round 42) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 49 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.34 c (round 43) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 50 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.34 c (round 44) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 51 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.34 c (round 45) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 52 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.35 c (round 46) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 53 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.35 c (round 47) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 54 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.35 c (round 48) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 55 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.35 c (round 49) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 56 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.35 c (round 50) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 57 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.36 c (round 51) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 58 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.36 c (round 52) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 59 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.36 c (round 53) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 60 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.36 c (round 54) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 61 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.36 c (round 55) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 62 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.37 c (round 56) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 63 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.37 c (round 57) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 64 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.37 c (round 58) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 65 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.37 c (round 59) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 66 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.37 c (round 60) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 67 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.38 c (round 61) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 68 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.38 c (round 62) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 69 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.38 c (round 63) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 70 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.38 c (round 64) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 71 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.38 c (round 65) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 72 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.39 c (round 66) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 73 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.39 c (round 67) 53 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 74 chg coeffs, 8 upgd conss, 42 impls, 60 clqs
1.29/1.39 c presolving (68 rounds):
1.29/1.39 c 53 deleted vars, 22 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 74 changed coefficients
1.29/1.39 c 42 implications, 60 cliques
1.29/1.39 c presolved problem has 81 variables (81 bin, 0 int, 0 impl, 0 cont) and 83 constraints
1.29/1.39 c 12 constraints of type <knapsack>
1.29/1.39 c 62 constraints of type <setppc>
1.29/1.39 c 9 constraints of type <logicor>
1.29/1.39 c transformed objective value is always integral (scale: 1)
1.29/1.39 c Presolving Time: 0.12
1.29/1.39 c
1.29/1.39 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.29/1.39 c 1.2s| 1 | 0 | 1883 | - | 858k| 0 | 0 | 81 | 83 | 81 | 80 | 0 | 0 | 48 | 0.000000e+00 | -- | Inf
1.29/1.39 c * 1.2s| 1 | 0 | 1883 | - | 861k| 0 | - | 81 | 83 | 81 | 80 | 0 | 0 | 48 | 0.000000e+00 | 0.000000e+00 | 0.00%
1.29/1.39 c
1.29/1.39 c SCIP Status : problem is solved [optimal solution found]
1.29/1.39 c Solving Time (sec) : 1.24
1.29/1.39 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
1.29/1.39 c Primal Bound : +0.00000000000000e+00 (1 solutions)
1.29/1.39 c Dual Bound : +0.00000000000000e+00
1.29/1.39 c Gap : 0.00 %
1.29/1.39 s SATISFIABLE
1.29/1.39 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 x152 -x151 -x150 -x149 -x148
1.29/1.39 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
1.29/1.39 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 x118 -x117 -x116 -x115 -x114 -x113 x112 -x111 -x110 -x109 -x108 -x107 -x106
1.29/1.39 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
1.29/1.39 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
1.29/1.39 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
1.29/1.39 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
1.29/1.39 v -x4 -x3 -x2 -x1
1.29/1.39 c SCIP Status : problem is solved [optimal solution found]
1.29/1.39 c Solving Time : 1.24
1.29/1.39 c Original Problem :
1.29/1.39 c Problem name : HOME/instance-2665720-1276272536.opb
1.29/1.39 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.39 c Constraints : 101 initial, 101 maximal
1.29/1.39 c Presolved Problem :
1.29/1.39 c Problem name : t_HOME/instance-2665720-1276272536.opb
1.29/1.39 c Variables : 81 (81 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.39 c Constraints : 83 initial, 83 maximal
1.29/1.39 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.29/1.39 c trivial : 0.00 88 0 0 0 0 0 0 0
1.29/1.39 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.29/1.39 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.29/1.39 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.29/1.39 c implics : 0.00 0 0 0 0 0 0 0 0
1.29/1.39 c probing : 0.00 0 0 0 0 0 0 0 0
1.29/1.39 c knapsack : 0.10 0 0 0 0 0 0 0 74
1.29/1.39 c setppc : 0.00 0 0 0 0 0 10 0 0
1.29/1.39 c linear : 0.00 0 0 0 0 0 36 0 0
1.29/1.39 c logicor : 0.01 0 0 0 0 0 13 0 0
1.29/1.39 c root node : - 88 - - 88 - - - -
1.29/1.39 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.29/1.39 c integral : 0 0 0 10 0 0 40 0 0 0
1.29/1.39 c knapsack : 12 7 11 2 0 0 0 0 0 0
1.29/1.39 c setppc : 62 7 11 2 0 0 48 0 0 0
1.29/1.39 c logicor : 9 7 4 2 0 0 0 0 0 0
1.29/1.39 c countsols : 0 0 0 2 0 0 0 0 0 0
1.29/1.39 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.29/1.39 c integral : 0.74 0.00 0.00 0.74 0.00
1.29/1.39 c knapsack : 0.00 0.00 0.00 0.00 0.00
1.29/1.39 c setppc : 0.00 0.00 0.00 0.00 0.00
1.29/1.39 c logicor : 0.00 0.00 0.00 0.00 0.00
1.29/1.39 c countsols : 0.00 0.00 0.00 0.00 0.00
1.29/1.39 c Propagators : Time Calls Cutoffs DomReds
1.29/1.39 c vbounds : 0.00 3 0 0
1.29/1.39 c rootredcost : 0.00 0 0 0
1.29/1.39 c pseudoobj : 0.00 0 0 0
1.29/1.39 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.29/1.39 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.29/1.39 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.39 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.39 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.39 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.29/1.39 c applied globally : - - - 0 0.0 - - -
1.29/1.39 c applied locally : - - - 0 0.0 - - -
1.29/1.39 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.29/1.39 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.29/1.39 c redcost : 0.00 7 0 0 0 0
1.29/1.39 c impliedbounds : 0.00 6 0 0 0 0
1.29/1.39 c intobj : 0.00 0 0 0 0 0
1.29/1.39 c cgmip : 0.00 0 0 0 0 0
1.29/1.39 c gomory : 0.05 6 0 0 51 0
1.29/1.39 c strongcg : 0.06 6 0 0 261 0
1.29/1.39 c cmir : 0.00 0 0 0 0 0
1.29/1.39 c flowcover : 0.00 0 0 0 0 0
1.29/1.39 c clique : 0.00 6 0 0 30 0
1.29/1.39 c zerohalf : 0.00 0 0 0 0 0
1.29/1.39 c mcf : 0.00 2 0 0 0 0
1.29/1.39 c rapidlearning : 0.14 1 0 0 0 157
1.29/1.39 c Pricers : Time Calls Vars
1.29/1.39 c problem variables: 0.00 0 0
1.29/1.39 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.29/1.39 c relpscost : 0.74 8 0 40 0 0 0
1.29/1.39 c pscost : 0.00 0 0 0 0 0 0
1.29/1.39 c inference : 0.00 0 0 0 0 0 0
1.29/1.39 c mostinf : 0.00 0 0 0 0 0 0
1.29/1.39 c leastinf : 0.00 0 0 0 0 0 0
1.29/1.39 c fullstrong : 0.00 0 0 0 0 0 0
1.29/1.39 c allfullstrong : 0.00 0 0 0 0 0 0
1.29/1.39 c random : 0.00 0 0 0 0 0 0
1.29/1.39 c Primal Heuristics : Time Calls Found
1.29/1.39 c LP solutions : 0.00 - 1
1.29/1.39 c pseudo solutions : 0.00 - 0
1.29/1.39 c trivial : 0.00 1 0
1.29/1.39 c simplerounding : 0.00 0 0
1.29/1.39 c zirounding : 0.00 0 0
1.29/1.39 c rounding : 0.00 0 0
1.29/1.39 c shifting : 0.00 0 0
1.29/1.39 c intshifting : 0.00 0 0
1.29/1.39 c oneopt : 0.00 0 0
1.29/1.39 c twoopt : 0.00 0 0
1.29/1.39 c fixandinfer : 0.00 0 0
1.29/1.39 c feaspump : 0.00 0 0
1.29/1.39 c coefdiving : 0.00 0 0
1.29/1.39 c pscostdiving : 0.00 0 0
1.29/1.39 c fracdiving : 0.00 0 0
1.29/1.39 c veclendiving : 0.00 0 0
1.29/1.39 c intdiving : 0.00 0 0
1.29/1.39 c actconsdiving : 0.00 0 0
1.29/1.39 c objpscostdiving : 0.00 0 0
1.29/1.39 c rootsoldiving : 0.00 0 0
1.29/1.39 c linesearchdiving : 0.00 0 0
1.29/1.39 c guideddiving : 0.00 0 0
1.29/1.39 c octane : 0.00 0 0
1.29/1.39 c rens : 0.00 0 0
1.29/1.39 c rins : 0.00 0 0
1.29/1.39 c localbranching : 0.00 0 0
1.29/1.39 c mutation : 0.00 0 0
1.29/1.39 c crossover : 0.00 0 0
1.29/1.39 c dins : 0.00 0 0
1.29/1.39 c undercover : 0.00 0 0
1.29/1.39 c nlp : 0.00 0 0
1.29/1.39 c trysol : 0.00 0 0
1.29/1.39 c LP : Time Calls Iterations Iter/call Iter/sec
1.29/1.39 c primal LP : 0.00 0 0 0.00 -
1.29/1.39 c dual LP : 0.12 16 1883 117.69 15691.67
1.29/1.39 c lex dual LP : 0.00 0 0 0.00 -
1.29/1.39 c barrier LP : 0.00 0 0 0.00 -
1.29/1.39 c diving/probing LP: 0.00 0 0 0.00 -
1.29/1.39 c strong branching : 0.73 48 11812 246.08 16180.82
1.29/1.39 c (at root node) : - 48 11812 246.08 -
1.29/1.39 c conflict analysis: 0.00 0 0 0.00 -
1.29/1.39 c B&B Tree :
1.29/1.39 c number of runs : 3
1.29/1.39 c nodes : 1
1.29/1.39 c nodes (total) : 3
1.29/1.39 c nodes left : 0
1.29/1.39 c max depth : 0
1.29/1.39 c max depth (total): 0
1.29/1.39 c backtracks : 0 (0.0%)
1.29/1.39 c delayed cutoffs : 0
1.29/1.39 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.29/1.39 c avg switch length: 2.00
1.29/1.39 c switching time : 0.00
1.29/1.39 c Solution :
1.29/1.39 c Solutions found : 1 (1 improvements)
1.29/1.39 c First Solution : +0.00000000000000e+00 (in run 3, after 1 nodes, 1.24 seconds, depth 0, found by <relaxation>)
1.29/1.39 c Primal Bound : +0.00000000000000e+00 (in run 3, after 1 nodes, 1.24 seconds, depth 0, found by <relaxation>)
1.29/1.39 c Dual Bound : +0.00000000000000e+00
1.29/1.39 c Gap : 0.00 %
1.29/1.39 c Root Dual Bound : +0.00000000000000e+00
1.29/1.39 c Root Iterations : 1883
1.39/1.40 c Time complete: 1.39.