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-2665736-1276273938.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 = 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.04 c heuristics/fracdiving/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/fracdiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 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 | 46 | - | 743k| 0 | 41 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 78 | - |1110k| 0 | 48 | 169 | 211 | 169 | 93 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 101 | - |1442k| 0 | 46 | 169 | 211 | 169 | 104 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.30 c 0.3s| 1 | 0 | 179 | - |1809k| 0 | 62 | 169 | 211 | 169 | 113 | 40 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 202 | - |2082k| 0 | 57 | 169 | 211 | 169 | 117 | 44 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.37 c 0.3s| 1 | 0 | 267 | - |2325k| 0 | 66 | 169 | 211 | 169 | 118 | 45 | 0 | 0 | 0.000000e+00 | -- | Inf
0.79/0.82 c 0.8s| 1 | 0 | 355 | - |2320k| 0 | 65 | 169 | 207 | 169 | 118 | 45 | 0 | 10 | 0.000000e+00 | -- | Inf
1.10/1.14 c 1.1s| 1 | 0 | 423 | - |2309k| 0 | 60 | 169 | 196 | 169 | 118 | 45 | 0 | 22 | 0.000000e+00 | -- | Inf
1.29/1.32 c 1.2s| 1 | 0 | 434 | - |2305k| 0 | 60 | 169 | 193 | 169 | 118 | 45 | 0 | 32 | 0.000000e+00 | -- | Inf
1.48/1.53 c 1.4s| 1 | 0 | 444 | - |2304k| 0 | 62 | 169 | 192 | 169 | 118 | 45 | 0 | 43 | 0.000000e+00 | -- | Inf
1.79/1.80 c 1.7s| 1 | 0 | 562 | - |2295k| 0 | 62 | 169 | 183 | 169 | 118 | 45 | 0 | 53 | 0.000000e+00 | -- | Inf
1.99/2.09 c 2.0s| 1 | 0 | 582 | - |2290k| 0 | 60 | 169 | 179 | 169 | 103 | 45 | 0 | 65 | 0.000000e+00 | -- | Inf
2.19/2.26 c 2.1s| 1 | 0 | 627 | - |2284k| 0 | 60 | 169 | 173 | 169 | 103 | 45 | 0 | 72 | 0.000000e+00 | -- | Inf
2.49/2.52 c 2.4s| 1 | 0 | 645 | - |2282k| 0 | 59 | 169 | 172 | 169 | 103 | 45 | 0 | 85 | 0.000000e+00 | -- | Inf
2.59/2.69 c 2.6s| 1 | 0 | 677 | - |2282k| 0 | 58 | 169 | 172 | 169 | 103 | 45 | 0 | 97 | 0.000000e+00 | -- | Inf
2.68/2.79 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.68/2.79 c 2.7s| 1 | 0 | 677 | - |2282k| 0 | - | 169 | 172 | 169 | 103 | 45 | 0 | 103 | 0.000000e+00 | -- | Inf
2.68/2.79 c (run 1, node 1) restarting after 34 global fixings of integer variables
2.68/2.79 c
2.68/2.79 c (restart) converted 30 cuts from the global cut pool into linear constraints
2.68/2.79 c
2.68/2.79 c presolving:
2.79/2.80 c (round 1) 34 del vars, 20 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 16 impls, 77 clqs
2.79/2.80 c (round 2) 34 del vars, 22 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 16 impls, 77 clqs
2.79/2.81 c (round 3) 34 del vars, 23 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 107 upgd conss, 16 impls, 77 clqs
2.79/2.82 c presolving (4 rounds):
2.79/2.82 c 34 deleted vars, 23 deleted constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 0 changed coefficients
2.79/2.82 c 16 implications, 77 cliques
2.79/2.82 c presolved problem has 135 variables (135 bin, 0 int, 0 impl, 0 cont) and 179 constraints
2.79/2.82 c 18 constraints of type <knapsack>
2.79/2.82 c 80 constraints of type <setppc>
2.79/2.82 c 81 constraints of type <logicor>
2.79/2.82 c transformed objective value is always integral (scale: 1)
2.79/2.82 c Presolving Time: 0.03
2.79/2.82 c
2.79/2.83 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.83 c 2.7s| 1 | 0 | 803 | - |1038k| 0 | 48 | 135 | 179 | 135 | 103 | 0 | 0 | 103 | 0.000000e+00 | -- | Inf
2.79/2.86 c 2.7s| 1 | 0 | 849 | - |1314k| 0 | 56 | 135 | 179 | 135 | 115 | 12 | 0 | 103 | 0.000000e+00 | -- | Inf
3.08/3.19 c 3.0s| 1 | 0 | 894 | - |1314k| 0 | 55 | 135 | 179 | 135 | 115 | 12 | 0 | 123 | 0.000000e+00 | -- | Inf
3.38/3.46 c 3.3s| 1 | 0 | 901 | - |1313k| 0 | 56 | 135 | 178 | 135 | 115 | 12 | 0 | 141 | 0.000000e+00 | -- | Inf
3.69/3.73 c 3.5s| 1 | 0 | 913 | - |1313k| 0 | 57 | 135 | 178 | 135 | 115 | 12 | 0 | 158 | 0.000000e+00 | -- | Inf
3.89/3.99 c 3.8s| 1 | 0 | 921 | - |1313k| 0 | 57 | 135 | 178 | 135 | 115 | 12 | 0 | 173 | 0.000000e+00 | -- | Inf
4.09/4.14 c 3.9s| 1 | 0 | 942 | - |1313k| 0 | 55 | 135 | 176 | 135 | 115 | 12 | 0 | 182 | 0.000000e+00 | -- | Inf
4.19/4.21 c 4.0s| 1 | 0 | 956 | - |1313k| 0 | 54 | 135 | 176 | 135 | 115 | 12 | 0 | 187 | 0.000000e+00 | -- | Inf
4.19/4.28 c 4.1s| 1 | 0 | 960 | - |1311k| 0 | 56 | 135 | 170 | 135 | 115 | 12 | 0 | 192 | 0.000000e+00 | -- | Inf
4.29/4.32 c 4.1s| 1 | 0 | 961 | - |1311k| 0 | 56 | 135 | 170 | 135 | 115 | 12 | 0 | 194 | 0.000000e+00 | -- | Inf
4.29/4.34 c 4.1s| 1 | 0 | 965 | - |1311k| 0 | 56 | 135 | 168 | 135 | 115 | 12 | 0 | 195 | 0.000000e+00 | -- | Inf
4.29/4.36 c 4.1s| 1 | 0 | 966 | - |1311k| 0 | 56 | 135 | 168 | 135 | 115 | 12 | 0 | 196 | 0.000000e+00 | -- | Inf
4.29/4.39 c 4.2s| 1 | 0 | 966 | - |1310k| 0 | - | 135 | 168 | 135 | 115 | 12 | 0 | 197 | 0.000000e+00 | -- | Inf
4.29/4.39 c (run 2, node 1) restarting after 28 global fixings of integer variables
4.29/4.39 c
4.29/4.39 c (restart) converted 12 cuts from the global cut pool into linear constraints
4.29/4.39 c
4.29/4.39 c presolving:
4.40/4.40 c (round 1) 28 del vars, 38 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 12 upgd conss, 22 impls, 80 clqs
4.40/4.42 c presolving (2 rounds):
4.40/4.42 c 28 deleted vars, 38 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
4.40/4.42 c 22 implications, 80 cliques
4.40/4.42 c presolved problem has 107 variables (107 bin, 0 int, 0 impl, 0 cont) and 142 constraints
4.40/4.42 c 24 constraints of type <knapsack>
4.40/4.42 c 84 constraints of type <setppc>
4.40/4.42 c 34 constraints of type <logicor>
4.40/4.42 c transformed objective value is always integral (scale: 1)
4.40/4.42 c Presolving Time: 0.06
4.40/4.42 c
4.40/4.42 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.40/4.42 c 4.2s| 1 | 0 | 1030 | - |1030k| 0 | 45 | 107 | 142 | 107 | 112 | 0 | 0 | 197 | 0.000000e+00 | -- | Inf
4.40/4.45 c 4.2s| 1 | 0 | 1067 | - |1300k| 0 | 56 | 107 | 142 | 107 | 123 | 11 | 0 | 197 | 0.000000e+00 | -- | Inf
4.59/4.67 c 4.4s| 1 | 0 | 1071 | - |1300k| 0 | 54 | 107 | 142 | 107 | 123 | 11 | 0 | 217 | 0.000000e+00 | -- | Inf
4.79/4.81 c 4.5s| 1 | 2 | 1071 | - |1300k| 0 | 54 | 107 | 142 | 107 | 123 | 11 | 0 | 232 | 0.000000e+00 | -- | Inf
4.88/4.98 c * 4.7s| 4 | 0 | 1327 | 85.3 |1338k| 2 | - | 107 | 142 | 107 | 83 | 11 | 0 | 271 | 0.000000e+00 | 0.000000e+00 | 0.00%
4.88/4.99 c
4.88/4.99 c SCIP Status : problem is solved [optimal solution found]
4.88/4.99 c Solving Time (sec) : 4.71
4.88/4.99 c Solving Nodes : 4 (total of 6 nodes in 3 runs)
4.88/4.99 c Primal Bound : +0.00000000000000e+00 (1 solutions)
4.88/4.99 c Dual Bound : +0.00000000000000e+00
4.88/4.99 c Gap : 0.00 %
4.88/4.99 s SATISFIABLE
4.88/4.99 v -x169 -x168 -x167 x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 x151 -x150 -x149 -x148
4.88/4.99 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
4.88/4.99 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 x111 -x110 -x109 -x108 -x107 -x106
4.88/4.99 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.88/4.99 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.88/4.99 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.88/4.99 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.88/4.99 v -x4 x3 -x2 -x1
4.88/4.99 c SCIP Status : problem is solved [optimal solution found]
4.88/4.99 c Solving Time : 4.71
4.88/4.99 c Original Problem :
4.88/4.99 c Problem name : HOME/instance-2665736-1276273938.opb
4.88/4.99 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
4.88/4.99 c Constraints : 101 initial, 101 maximal
4.88/4.99 c Presolved Problem :
4.88/4.99 c Problem name : t_HOME/instance-2665736-1276273938.opb
4.88/4.99 c Variables : 107 (107 binary, 0 integer, 0 implicit integer, 0 continuous)
4.88/4.99 c Constraints : 142 initial, 142 maximal
4.88/4.99 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.88/4.99 c trivial : 0.00 62 0 0 0 0 0 0 0
4.88/4.99 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.88/4.99 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.88/4.99 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.88/4.99 c implics : 0.00 0 0 0 0 0 0 0 0
4.88/4.99 c probing : 0.00 0 0 0 0 0 0 0 0
4.88/4.99 c knapsack : 0.03 0 0 0 0 0 0 0 0
4.88/4.99 c setppc : 0.01 0 0 0 0 0 2 0 0
4.88/4.99 c linear : 0.00 0 0 0 0 0 50 2 0
4.88/4.99 c logicor : 0.01 0 0 0 0 0 37 0 0
4.88/4.99 c root node : - 66 - - 66 - - - -
4.88/4.99 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.88/4.99 c integral : 0 0 0 29 0 0 85 0 0 4
4.88/4.99 c knapsack : 24 7 42 1 0 0 1 0 0 0
4.88/4.99 c setppc : 84 7 41 0 0 0 115 0 0 0
4.88/4.99 c logicor : 34 7 22 1 0 0 0 0 0 0
4.88/4.99 c countsols : 0 0 0 1 0 0 0 0 0 0
4.88/4.99 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.88/4.99 c integral : 4.18 0.00 0.00 4.18 0.00
4.88/4.99 c knapsack : 0.02 0.02 0.00 0.00 0.00
4.88/4.99 c setppc : 0.01 0.00 0.01 0.00 0.00
4.88/4.99 c logicor : 0.00 0.00 0.00 0.00 0.00
4.88/4.99 c countsols : 0.00 0.00 0.00 0.00 0.00
4.88/4.99 c Propagators : Time Calls Cutoffs DomReds
4.88/4.99 c vbounds : 0.00 3 0 0
4.88/4.99 c rootredcost : 0.00 0 0 0
4.88/4.99 c pseudoobj : 0.00 0 0 0
4.88/4.99 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.88/4.99 c propagation : 0.00 0 0 0 0.0 0 0.0 -
4.88/4.99 c infeasible LP : 0.00 1 0 0 0.0 0 0.0 0
4.88/4.99 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.88/4.99 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.88/4.99 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.88/4.99 c applied globally : - - - 0 0.0 - - -
4.88/4.99 c applied locally : - - - 0 0.0 - - -
4.88/4.99 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.88/4.99 c cut pool : 0.00 0 - - 0 - (maximal pool size: 100)
4.88/4.99 c redcost : 0.00 10 0 0 0 0
4.88/4.99 c impliedbounds : 0.00 7 0 0 0 0
4.88/4.99 c intobj : 0.00 0 0 0 0 0
4.88/4.99 c cgmip : 0.00 0 0 0 0 0
4.88/4.99 c gomory : 0.05 7 0 0 10 0
4.88/4.99 c strongcg : 0.09 7 0 0 520 0
4.88/4.99 c cmir : 0.00 0 0 0 0 0
4.88/4.99 c flowcover : 0.00 0 0 0 0 0
4.88/4.99 c clique : 0.00 7 0 0 26 0
4.88/4.99 c zerohalf : 0.00 0 0 0 0 0
4.88/4.99 c mcf : 0.00 3 0 0 0 0
4.88/4.99 c rapidlearning : 0.16 1 0 0 0 138
4.88/4.99 c Pricers : Time Calls Vars
4.88/4.99 c problem variables: 0.00 0 0
4.88/4.99 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.88/4.99 c relpscost : 4.18 28 0 85 0 0 4
4.88/4.99 c pscost : 0.00 0 0 0 0 0 0
4.88/4.99 c inference : 0.00 0 0 0 0 0 0
4.88/4.99 c mostinf : 0.00 0 0 0 0 0 0
4.88/4.99 c leastinf : 0.00 0 0 0 0 0 0
4.88/4.99 c fullstrong : 0.00 0 0 0 0 0 0
4.88/4.99 c allfullstrong : 0.00 0 0 0 0 0 0
4.88/4.99 c random : 0.00 0 0 0 0 0 0
4.88/4.99 c Primal Heuristics : Time Calls Found
4.88/4.99 c LP solutions : 0.00 - 1
4.88/4.99 c pseudo solutions : 0.00 - 0
4.88/4.99 c trivial : 0.00 1 0
4.88/4.99 c simplerounding : 0.00 0 0
4.88/4.99 c zirounding : 0.00 0 0
4.88/4.99 c rounding : 0.00 0 0
4.88/4.99 c shifting : 0.00 0 0
4.88/4.99 c intshifting : 0.00 0 0
4.88/4.99 c oneopt : 0.00 0 0
4.88/4.99 c twoopt : 0.00 0 0
4.88/4.99 c fixandinfer : 0.00 0 0
4.88/4.99 c feaspump : 0.00 0 0
4.88/4.99 c coefdiving : 0.00 0 0
4.88/4.99 c pscostdiving : 0.00 0 0
4.88/4.99 c fracdiving : 0.00 0 0
4.88/4.99 c veclendiving : 0.00 0 0
4.88/4.99 c intdiving : 0.00 0 0
4.88/4.99 c actconsdiving : 0.00 0 0
4.88/4.99 c objpscostdiving : 0.00 0 0
4.88/4.99 c rootsoldiving : 0.00 0 0
4.88/4.99 c linesearchdiving : 0.00 0 0
4.88/4.99 c guideddiving : 0.00 0 0
4.88/4.99 c octane : 0.00 0 0
4.88/4.99 c rens : 0.00 0 0
4.88/4.99 c rins : 0.00 0 0
4.88/4.99 c localbranching : 0.00 0 0
4.88/4.99 c mutation : 0.00 0 0
4.88/4.99 c crossover : 0.00 0 0
4.88/4.99 c dins : 0.00 0 0
4.88/4.99 c undercover : 0.00 0 0
4.88/4.99 c nlp : 0.00 0 0
4.88/4.99 c trysol : 0.00 0 0
4.88/4.99 c LP : Time Calls Iterations Iter/call Iter/sec
4.88/4.99 c primal LP : 0.00 0 0 0.00 -
4.88/4.99 c dual LP : 0.09 37 1327 35.86 14744.44
4.88/4.99 c lex dual LP : 0.00 0 0 0.00 -
4.88/4.99 c barrier LP : 0.00 0 0 0.00 -
4.88/4.99 c diving/probing LP: 0.00 0 0 0.00 -
4.88/4.99 c strong branching : 4.18 271 63839 235.57 15272.49
4.88/4.99 c (at root node) : - 232 60790 262.03 -
4.88/4.99 c conflict analysis: 0.00 0 0 0.00 -
4.88/4.99 c B&B Tree :
4.88/4.99 c number of runs : 3
4.88/4.99 c nodes : 4
4.88/4.99 c nodes (total) : 6
4.88/4.99 c nodes left : 0
4.88/4.99 c max depth : 2
4.88/4.99 c max depth (total): 2
4.88/4.99 c backtracks : 0 (0.0%)
4.88/4.99 c delayed cutoffs : 0
4.88/4.99 c repropagations : 0 (0 domain reductions, 0 cutoffs)
4.88/4.99 c avg switch length: 2.00
4.88/4.99 c switching time : 0.00
4.88/4.99 c Solution :
4.88/4.99 c Solutions found : 1 (1 improvements)
4.88/4.99 c First Solution : +0.00000000000000e+00 (in run 3, after 4 nodes, 4.71 seconds, depth 2, found by <relaxation>)
4.88/4.99 c Primal Bound : +0.00000000000000e+00 (in run 3, after 4 nodes, 4.71 seconds, depth 2, found by <relaxation>)
4.88/4.99 c Dual Bound : +0.00000000000000e+00
4.88/4.99 c Gap : 0.00 %
4.88/4.99 c Root Dual Bound : +0.00000000000000e+00
4.88/4.99 c Root Iterations : 1071
4.88/4.99 c Time complete: 4.98.