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-2667152-1276272601.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.02/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.02/0.03 c presolving (3 rounds):
0.02/0.03 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.02/0.03 c 8 implications, 68 cliques
0.02/0.03 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.02/0.03 c 1 constraints of type <knapsack>
0.02/0.03 c 68 constraints of type <setppc>
0.02/0.03 c 4 constraints of type <logicor>
0.02/0.03 c transformed objective value is always integral (scale: 1)
0.02/0.03 c Presolving Time: 0.01
0.02/0.03 c - non default parameters ----------------------------------------------------------------------
0.02/0.03 c # SCIP version 1.2.1.2
0.02/0.03 c
0.02/0.03 c # frequency for displaying node information lines
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.03 c display/freq = 10000
0.02/0.03 c
0.02/0.03 c # maximal time in seconds to run
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.03 c limits/time = 1800
0.02/0.03 c
0.02/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.03 c limits/memory = 1620
0.02/0.03 c
0.02/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.03 c limits/solutions = 1
0.02/0.03 c
0.02/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.02/0.03 c separating/maxrounds = 1
0.02/0.03 c
0.02/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.03 c separating/maxroundsroot = 5
0.02/0.03 c
0.02/0.03 c # should presolving try to simplify inequalities
0.02/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.03 c constraints/linear/simplifyinequalities = TRUE
0.02/0.03 c
0.02/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.02/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.02/0.03 c constraints/knapsack/disaggregation = FALSE
0.02/0.03 c
0.02/0.03 c # should presolving try to simplify knapsacks
0.02/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.03 c
0.02/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.03 c presolving/probing/maxrounds = 0
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/coefdiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.02/0.03 c heuristics/crossover/freq = -1
0.02/0.03 c
0.02/0.03 c # number of nodes added to the contingent of the total nodes
0.02/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.03 c heuristics/crossover/nodesofs = 750
0.02/0.03 c
0.02/0.03 c # number of nodes without incumbent change that heuristic should wait
0.02/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.02/0.03 c heuristics/crossover/nwaitingnodes = 100
0.02/0.03 c
0.02/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.02/0.03 c # [type: real, range: [0,1], default: 0.1]
0.02/0.03 c heuristics/crossover/nodesquot = 0.15
0.02/0.03 c
0.02/0.03 c # minimum percentage of integer variables that have to be fixed
0.02/0.03 c # [type: real, range: [0,1], default: 0.666]
0.02/0.03 c heuristics/crossover/minfixingrate = 0.5
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.03 c heuristics/feaspump/freq = -1
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/fracdiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/guideddiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/intshifting/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/linesearchdiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/nlp/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.03 c heuristics/objpscostdiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.02/0.03 c # [type: real, range: [0,1], default: 0.01]
0.02/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/oneopt/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/pscostdiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.03 c heuristics/rens/freq = -1
0.02/0.03 c
0.02/0.03 c # minimum percentage of integer variables that have to be fixable
0.02/0.03 c # [type: real, range: [0,1], default: 0.5]
0.02/0.03 c heuristics/rens/minfixingrate = 0.3
0.02/0.03 c
0.02/0.03 c # number of nodes added to the contingent of the total nodes
0.02/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.03 c heuristics/rens/nodesofs = 2000
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.03 c heuristics/rootsoldiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.02/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/rounding/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/shifting/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/simplerounding/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.03 c heuristics/trivial/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/trysol/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/veclendiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/zirounding/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.03 c separating/cmir/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.03 c separating/flowcover/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.03 c separating/rapidlearning/freq = 0
0.02/0.03 c
0.02/0.03 c -----------------------------------------------------------------------------------------------
0.02/0.03 c start solving
0.02/0.03 c
0.02/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.02/0.04 c 0.0s| 1 | 0 | 121 | - | 743k| 0 | 44 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 155 | - |1165k| 0 | 59 | 169 | 209 | 169 | 93 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 204 | - |1399k| 0 | 60 | 169 | 209 | 169 | 99 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 267 | - |1469k| 0 | 61 | 169 | 209 | 169 | 105 | 32 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 308 | - |1497k| 0 | 71 | 169 | 209 | 169 | 110 | 37 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.36 c 0.3s| 1 | 0 | 358 | - |1506k| 0 | 69 | 169 | 209 | 169 | 114 | 41 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.68 c 0.6s| 1 | 0 | 397 | - |1445k| 0 | 69 | 169 | 152 | 169 | 114 | 41 | 0 | 13 | 0.000000e+00 | -- | Inf
0.89/0.97 c 0.9s| 1 | 0 | 410 | - |1438k| 0 | 68 | 169 | 144 | 169 | 114 | 41 | 0 | 24 | 0.000000e+00 | -- | Inf
1.19/1.25 c 1.2s| 1 | 0 | 419 | - |1437k| 0 | 67 | 169 | 143 | 169 | 114 | 41 | 0 | 35 | 0.000000e+00 | -- | Inf
1.50/1.53 c 1.5s| 1 | 0 | 421 | - |1437k| 0 | 67 | 169 | 143 | 169 | 114 | 41 | 0 | 46 | 0.000000e+00 | -- | Inf
1.69/1.77 c 1.7s| 1 | 0 | 432 | - |1437k| 0 | 66 | 169 | 143 | 169 | 114 | 41 | 0 | 56 | 0.000000e+00 | -- | Inf
1.99/2.06 c 2.0s| 1 | 0 | 438 | - |1437k| 0 | 66 | 169 | 143 | 169 | 105 | 41 | 0 | 67 | 0.000000e+00 | -- | Inf
2.20/2.29 c 2.2s| 1 | 0 | 444 | - |1437k| 0 | 65 | 169 | 143 | 169 | 105 | 41 | 0 | 78 | 0.000000e+00 | -- | Inf
2.49/2.53 c 2.4s| 1 | 0 | 461 | - |1414k| 0 | 65 | 169 | 121 | 169 | 105 | 41 | 0 | 90 | 0.000000e+00 | -- | Inf
2.49/2.58 c 2.5s| 1 | 0 | 465 | - |1413k| 0 | 66 | 169 | 120 | 169 | 105 | 41 | 0 | 93 | 0.000000e+00 | -- | Inf
2.59/2.66 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.59/2.66 c 2.5s| 1 | 0 | 468 | - |1412k| 0 | 67 | 169 | 119 | 169 | 105 | 41 | 0 | 97 | 0.000000e+00 | -- | Inf
2.69/2.70 c 2.6s| 1 | 0 | 470 | - |1412k| 0 | 67 | 169 | 119 | 169 | 105 | 41 | 0 | 99 | 0.000000e+00 | -- | Inf
2.69/2.74 c 2.6s| 1 | 0 | 472 | - |1411k| 0 | 67 | 169 | 118 | 169 | 99 | 41 | 0 | 101 | 0.000000e+00 | -- | Inf
2.69/2.78 c 2.7s| 1 | 0 | 474 | - |1411k| 0 | 66 | 169 | 118 | 169 | 99 | 41 | 0 | 103 | 0.000000e+00 | -- | Inf
2.79/2.82 c 2.7s| 1 | 0 | 476 | - |1409k| 0 | 66 | 169 | 117 | 169 | 99 | 41 | 0 | 105 | 0.000000e+00 | -- | Inf
2.79/2.83 c 2.7s| 1 | 0 | 477 | - |1409k| 0 | 66 | 169 | 117 | 169 | 99 | 41 | 0 | 106 | 0.000000e+00 | -- | Inf
2.79/2.85 c 2.7s| 1 | 0 | 478 | - |1409k| 0 | 66 | 169 | 117 | 169 | 99 | 41 | 0 | 107 | 0.000000e+00 | -- | Inf
2.79/2.85 c 2.7s| 1 | 2 | 478 | - |1410k| 0 | 66 | 169 | 117 | 169 | 99 | 41 | 0 | 107 | 0.000000e+00 | -- | Inf
2.79/2.85 c (run 1, node 1) restarting after 33 global fixings of integer variables
2.79/2.85 c
2.79/2.85 c (restart) converted 26 cuts from the global cut pool into linear constraints
2.79/2.85 c
2.79/2.86 c presolving:
2.79/2.86 c (round 1) 33 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 70 upgd conss, 12 impls, 81 clqs
2.79/2.87 c (round 2) 33 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 70 upgd conss, 12 impls, 81 clqs
2.79/2.87 c presolving (3 rounds):
2.79/2.87 c 33 deleted vars, 4 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.79/2.87 c 12 implications, 81 cliques
2.79/2.87 c presolved problem has 136 variables (136 bin, 0 int, 0 impl, 0 cont) and 139 constraints
2.79/2.87 c 12 constraints of type <knapsack>
2.79/2.87 c 82 constraints of type <setppc>
2.79/2.87 c 45 constraints of type <logicor>
2.79/2.87 c transformed objective value is always integral (scale: 1)
2.79/2.87 c Presolving Time: 0.02
2.79/2.87 c
2.79/2.88 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.79/2.88 c 2.8s| 1 | 0 | 578 | - | 929k| 0 | 48 | 136 | 139 | 136 | 95 | 0 | 0 | 107 | 0.000000e+00 | -- | Inf
2.89/2.90 c 2.8s| 1 | 0 | 607 | - |1141k| 0 | 59 | 136 | 139 | 136 | 108 | 13 | 0 | 107 | 0.000000e+00 | -- | Inf
3.09/3.19 c 3.1s| 1 | 0 | 622 | - |1141k| 0 | 59 | 136 | 139 | 136 | 108 | 13 | 0 | 125 | 0.000000e+00 | -- | Inf
3.39/3.48 c 3.4s| 1 | 0 | 638 | - |1141k| 0 | 60 | 136 | 139 | 136 | 108 | 13 | 0 | 145 | 0.000000e+00 | -- | Inf
3.59/3.70 c 3.6s| 1 | 2 | 638 | - |1142k| 0 | 60 | 136 | 139 | 136 | 108 | 13 | 0 | 159 | 0.000000e+00 | -- | Inf
3.59/3.70 c (run 2, node 1) restarting after 9 global fixings of integer variables
3.59/3.70 c
3.69/3.70 c (restart) converted 12 cuts from the global cut pool into linear constraints
3.69/3.70 c
3.69/3.70 c presolving:
3.69/3.71 c (round 1) 9 del vars, 13 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 12 upgd conss, 16 impls, 84 clqs
3.69/3.72 c (round 2) 9 del vars, 14 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 12 upgd conss, 16 impls, 84 clqs
3.69/3.72 c presolving (3 rounds):
3.69/3.72 c 9 deleted vars, 14 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
3.69/3.72 c 16 implications, 84 cliques
3.69/3.72 c presolved problem has 127 variables (127 bin, 0 int, 0 impl, 0 cont) and 137 constraints
3.69/3.72 c 19 constraints of type <knapsack>
3.69/3.72 c 86 constraints of type <setppc>
3.69/3.72 c 32 constraints of type <logicor>
3.69/3.72 c transformed objective value is always integral (scale: 1)
3.69/3.72 c Presolving Time: 0.04
3.69/3.72 c
3.69/3.72 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.69/3.72 c 3.6s| 1 | 0 | 715 | - | 983k| 0 | 45 | 127 | 137 | 127 | 106 | 0 | 0 | 159 | 0.000000e+00 | -- | Inf
3.69/3.75 c 3.6s| 1 | 0 | 739 | - |1249k| 0 | 55 | 127 | 137 | 127 | 117 | 11 | 0 | 159 | 0.000000e+00 | -- | Inf
3.89/3.96 c 3.8s| 1 | 2 | 739 | - |1250k| 0 | 55 | 127 | 137 | 127 | 117 | 11 | 0 | 176 | 0.000000e+00 | -- | Inf
4.09/4.19 c * 4.0s| 3 | 0 | 934 | 97.5 |1285k| 2 | - | 127 | 137 | 127 | 83 | 11 | 0 | 264 | 0.000000e+00 | 0.000000e+00 | 0.00%
4.09/4.19 c
4.09/4.19 c SCIP Status : problem is solved [optimal solution found]
4.09/4.19 c Solving Time (sec) : 4.03
4.09/4.19 c Solving Nodes : 3 (total of 5 nodes in 3 runs)
4.09/4.19 c Primal Bound : +0.00000000000000e+00 (1 solutions)
4.09/4.19 c Dual Bound : +0.00000000000000e+00
4.09/4.19 c Gap : 0.00 %
4.09/4.19 s SATISFIABLE
4.09/4.19 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 x160 -x159 -x158 -x157 x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
4.09/4.19 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
4.09/4.19 v -x126 x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 x107 -x106
4.09/4.19 v -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 x92 -x91 -x90 -x89 -x88 -x87 -x86 x85 -x84 -x83 -x82
4.09/4.19 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
4.09/4.19 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
4.09/4.19 v -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 x5
4.09/4.19 v -x4 -x3 -x2 -x1
4.09/4.19 c SCIP Status : problem is solved [optimal solution found]
4.09/4.19 c Solving Time : 4.03
4.09/4.19 c Original Problem :
4.09/4.19 c Problem name : HOME/instance-2667152-1276272601.opb
4.09/4.19 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
4.09/4.19 c Constraints : 101 initial, 101 maximal
4.09/4.19 c Presolved Problem :
4.09/4.19 c Problem name : t_HOME/instance-2667152-1276272601.opb
4.09/4.19 c Variables : 127 (127 binary, 0 integer, 0 implicit integer, 0 continuous)
4.09/4.19 c Constraints : 137 initial, 137 maximal
4.09/4.19 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.09/4.19 c trivial : 0.00 42 0 0 0 0 0 0 0
4.09/4.19 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.09/4.19 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.09/4.19 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.09/4.19 c implics : 0.00 0 0 0 0 0 0 0 0
4.09/4.19 c probing : 0.00 0 0 0 0 0 0 0 0
4.09/4.19 c knapsack : 0.03 0 0 0 0 0 0 0 0
4.09/4.19 c setppc : 0.00 0 0 0 0 0 2 0 0
4.09/4.19 c linear : 0.00 0 0 0 0 0 28 0 0
4.09/4.19 c logicor : 0.00 0 0 0 0 0 16 0 0
4.09/4.19 c root node : - 42 - - 42 - - - -
4.09/4.19 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.09/4.19 c integral : 0 0 0 36 0 0 101 0 0 8
4.09/4.19 c knapsack : 19 7 42 1 0 0 0 0 0 0
4.09/4.19 c setppc : 86 7 42 1 0 0 38 0 0 0
4.09/4.19 c logicor : 32 7 13 1 0 0 0 0 0 0
4.09/4.19 c countsols : 0 0 0 1 0 0 0 0 0 0
4.09/4.19 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.09/4.19 c integral : 3.60 0.00 0.00 3.60 0.00
4.09/4.19 c knapsack : 0.00 0.00 0.00 0.00 0.00
4.09/4.19 c setppc : 0.00 0.00 0.00 0.00 0.00
4.09/4.19 c logicor : 0.00 0.00 0.00 0.00 0.00
4.09/4.19 c countsols : 0.00 0.00 0.00 0.00 0.00
4.09/4.19 c Propagators : Time Calls Cutoffs DomReds
4.09/4.19 c vbounds : 0.00 3 0 0
4.09/4.19 c rootredcost : 0.00 0 0 0
4.09/4.19 c pseudoobj : 0.00 0 0 0
4.09/4.19 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.09/4.19 c propagation : 0.00 0 0 0 0.0 0 0.0 -
4.09/4.19 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
4.09/4.19 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.09/4.19 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.09/4.19 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.09/4.19 c applied globally : - - - 0 0.0 - - -
4.09/4.19 c applied locally : - - - 0 0.0 - - -
4.09/4.19 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.09/4.19 c cut pool : 0.00 0 - - 0 - (maximal pool size: 86)
4.09/4.19 c redcost : 0.00 9 0 0 0 0
4.09/4.19 c impliedbounds : 0.00 7 0 0 0 0
4.09/4.19 c intobj : 0.00 0 0 0 0 0
4.09/4.19 c cgmip : 0.00 0 0 0 0 0
4.09/4.19 c gomory : 0.06 7 0 0 0 0
4.09/4.19 c strongcg : 0.06 7 0 0 290 0
4.09/4.19 c cmir : 0.00 0 0 0 0 0
4.09/4.19 c flowcover : 0.00 0 0 0 0 0
4.09/4.19 c clique : 0.00 7 0 0 37 0
4.09/4.19 c zerohalf : 0.00 0 0 0 0 0
4.09/4.19 c mcf : 0.00 3 0 0 0 0
4.09/4.19 c rapidlearning : 0.17 1 0 0 0 136
4.09/4.19 c Pricers : Time Calls Vars
4.09/4.19 c problem variables: 0.00 0 0
4.09/4.19 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.09/4.19 c relpscost : 3.60 35 0 101 0 0 8
4.09/4.19 c pscost : 0.00 0 0 0 0 0 0
4.09/4.19 c inference : 0.00 0 0 0 0 0 0
4.09/4.19 c mostinf : 0.00 0 0 0 0 0 0
4.09/4.19 c leastinf : 0.00 0 0 0 0 0 0
4.09/4.19 c fullstrong : 0.00 0 0 0 0 0 0
4.09/4.19 c allfullstrong : 0.00 0 0 0 0 0 0
4.09/4.19 c random : 0.00 0 0 0 0 0 0
4.09/4.19 c Primal Heuristics : Time Calls Found
4.09/4.19 c LP solutions : 0.00 - 1
4.09/4.19 c pseudo solutions : 0.00 - 0
4.09/4.19 c trivial : 0.00 1 0
4.09/4.19 c simplerounding : 0.00 0 0
4.09/4.19 c zirounding : 0.00 0 0
4.09/4.19 c rounding : 0.00 0 0
4.09/4.19 c shifting : 0.00 0 0
4.09/4.19 c intshifting : 0.00 0 0
4.09/4.19 c oneopt : 0.00 0 0
4.09/4.19 c twoopt : 0.00 0 0
4.09/4.19 c fixandinfer : 0.00 0 0
4.09/4.19 c feaspump : 0.00 0 0
4.09/4.19 c coefdiving : 0.00 0 0
4.09/4.19 c pscostdiving : 0.00 0 0
4.09/4.19 c fracdiving : 0.00 0 0
4.09/4.19 c veclendiving : 0.00 0 0
4.09/4.19 c intdiving : 0.00 0 0
4.09/4.19 c actconsdiving : 0.00 0 0
4.09/4.19 c objpscostdiving : 0.00 0 0
4.09/4.19 c rootsoldiving : 0.00 0 0
4.09/4.19 c linesearchdiving : 0.00 0 0
4.09/4.19 c guideddiving : 0.00 0 0
4.09/4.19 c octane : 0.00 0 0
4.09/4.19 c rens : 0.00 0 0
4.09/4.19 c rins : 0.00 0 0
4.09/4.19 c localbranching : 0.00 0 0
4.09/4.19 c mutation : 0.00 0 0
4.09/4.19 c crossover : 0.00 0 0
4.09/4.19 c dins : 0.00 0 0
4.09/4.19 c undercover : 0.00 0 0
4.09/4.19 c nlp : 0.00 0 0
4.09/4.19 c trysol : 0.00 0 0
4.09/4.19 c LP : Time Calls Iterations Iter/call Iter/sec
4.09/4.19 c primal LP : 0.00 0 0 0.00 -
4.09/4.19 c dual LP : 0.05 43 934 21.72 18680.00
4.09/4.19 c lex dual LP : 0.00 0 0 0.00 -
4.09/4.19 c barrier LP : 0.00 0 0 0.00 -
4.09/4.19 c diving/probing LP: 0.00 0 0 0.00 -
4.09/4.19 c strong branching : 3.60 264 33543 127.06 9317.50
4.09/4.19 c (at root node) : - 176 30145 171.28 -
4.09/4.19 c conflict analysis: 0.00 0 0 0.00 -
4.09/4.19 c B&B Tree :
4.09/4.19 c number of runs : 3
4.09/4.19 c nodes : 3
4.09/4.19 c nodes (total) : 5
4.09/4.19 c nodes left : 0
4.09/4.19 c max depth : 2
4.09/4.19 c max depth (total): 2
4.09/4.19 c backtracks : 0 (0.0%)
4.09/4.19 c delayed cutoffs : 0
4.09/4.19 c repropagations : 0 (0 domain reductions, 0 cutoffs)
4.09/4.19 c avg switch length: 2.00
4.09/4.19 c switching time : 0.00
4.09/4.19 c Solution :
4.09/4.19 c Solutions found : 1 (1 improvements)
4.09/4.19 c First Solution : +0.00000000000000e+00 (in run 3, after 3 nodes, 4.03 seconds, depth 2, found by <relaxation>)
4.09/4.19 c Primal Bound : +0.00000000000000e+00 (in run 3, after 3 nodes, 4.03 seconds, depth 2, found by <relaxation>)
4.09/4.19 c Dual Bound : +0.00000000000000e+00
4.09/4.19 c Gap : 0.00 %
4.09/4.19 c Root Dual Bound : +0.00000000000000e+00
4.09/4.19 c Root Iterations : 739
4.19/4.20 c Time complete: 4.19.