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-2665756-1276275642.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.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.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.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/linesearchdiving/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/linesearchdiving/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/linesearchdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/nlp/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-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/objpscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03 c # [type: real, range: [0,1], default: 0.01]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
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/objpscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/oneopt/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <pscostdiving> (-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/pscostdiving/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/pscostdiving/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/pscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/rens/freq = -1
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixable
0.00/0.03 c # [type: real, range: [0,1], default: 0.5]
0.00/0.03 c heuristics/rens/minfixingrate = 0.3
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/rens/nodesofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-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/rootsoldiving/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.01]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
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/rootsoldiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/rounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <shifting> (-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/shifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/simplerounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/trivial/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/trysol/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <veclendiving> (-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/veclendiving/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/veclendiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 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 | 48 | - | 743k| 0 | 41 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 73 | - |1200k| 0 | 45 | 169 | 209 | 169 | 85 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 95 | - |1475k| 0 | 49 | 169 | 209 | 169 | 93 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 0 | 144 | - |1793k| 0 | 55 | 169 | 209 | 169 | 99 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 208 | - |2093k| 0 | 63 | 169 | 209 | 169 | 106 | 33 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.34 c 0.3s| 1 | 0 | 249 | - |2281k| 0 | 60 | 169 | 209 | 169 | 111 | 38 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.52 c 0.5s| 1 | 0 | 250 | - |2279k| 0 | 60 | 169 | 207 | 169 | 111 | 38 | 0 | 10 | 0.000000e+00 | -- | Inf
0.69/0.73 c 0.7s| 1 | 0 | 260 | - |2206k| 0 | 58 | 169 | 147 | 169 | 111 | 38 | 0 | 22 | 0.000000e+00 | -- | Inf
0.89/0.98 c 0.9s| 1 | 0 | 358 | - |2203k| 0 | 59 | 169 | 145 | 169 | 111 | 38 | 0 | 33 | 0.000000e+00 | -- | Inf
1.19/1.20 c 1.1s| 1 | 0 | 391 | - |2193k| 0 | 59 | 169 | 135 | 169 | 111 | 38 | 0 | 41 | 0.000000e+00 | -- | Inf
1.29/1.36 c 1.3s| 1 | 0 | 435 | - |2188k| 0 | 56 | 169 | 130 | 169 | 111 | 38 | 0 | 48 | 0.000000e+00 | -- | Inf
1.49/1.57 c 1.5s| 1 | 0 | 449 | - |2185k| 0 | 55 | 169 | 128 | 169 | 102 | 38 | 0 | 59 | 0.000000e+00 | -- | Inf
1.59/1.69 c 1.6s| 1 | 0 | 460 | - |2182k| 0 | 55 | 169 | 125 | 169 | 102 | 38 | 0 | 64 | 0.000000e+00 | -- | Inf
1.79/1.86 c 1.8s| 1 | 0 | 523 | - |2178k| 0 | 54 | 169 | 121 | 169 | 102 | 38 | 0 | 74 | 0.000000e+00 | -- | Inf
1.99/2.04 c 1.9s| 1 | 0 | 523 | - |2178k| 0 | - | 169 | 121 | 169 | 102 | 38 | 0 | 86 | 0.000000e+00 | -- | Inf
1.99/2.04 c (run 1, node 1) restarting after 38 global fixings of integer variables
1.99/2.04 c
1.99/2.04 c (restart) converted 29 cuts from the global cut pool into linear constraints
1.99/2.04 c
1.99/2.04 c presolving:
1.99/2.05 c (round 1) 38 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 12 impls, 83 clqs
1.99/2.05 c (round 2) 38 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 74 upgd conss, 12 impls, 83 clqs
1.99/2.07 c (round 3) 38 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 74 upgd conss, 12 impls, 83 clqs
1.99/2.07 c presolving (4 rounds):
1.99/2.07 c 38 deleted vars, 4 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.99/2.07 c 12 implications, 83 cliques
1.99/2.07 c presolved problem has 131 variables (131 bin, 0 int, 0 impl, 0 cont) and 146 constraints
1.99/2.07 c 12 constraints of type <knapsack>
1.99/2.07 c 84 constraints of type <setppc>
1.99/2.07 c 50 constraints of type <logicor>
1.99/2.07 c transformed objective value is always integral (scale: 1)
1.99/2.07 c Presolving Time: 0.03
1.99/2.07 c
1.99/2.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.99/2.07 c 1.9s| 1 | 0 | 608 | - | 953k| 0 | 44 | 131 | 146 | 131 | 101 | 0 | 0 | 86 | 0.000000e+00 | -- | Inf
2.10/2.10 c 2.0s| 1 | 0 | 648 | - |1206k| 0 | 57 | 131 | 146 | 131 | 111 | 10 | 0 | 86 | 0.000000e+00 | -- | Inf
2.39/2.46 c 2.3s| 1 | 0 | 674 | - |1206k| 0 | 58 | 131 | 146 | 131 | 111 | 10 | 0 | 107 | 0.000000e+00 | -- | Inf
2.69/2.77 c 2.6s| 1 | 0 | 684 | - |1204k| 0 | 57 | 131 | 140 | 131 | 111 | 10 | 0 | 125 | 0.000000e+00 | -- | Inf
2.89/2.97 c 2.8s| 1 | 0 | 717 | - |1204k| 0 | 55 | 131 | 139 | 131 | 111 | 10 | 0 | 139 | 0.000000e+00 | -- | Inf
2.99/3.07 c 2.9s| 1 | 0 | 737 | - |1204k| 0 | 55 | 131 | 139 | 131 | 111 | 10 | 0 | 146 | 0.000000e+00 | -- | Inf
3.09/3.14 c 3.0s| 1 | 0 | 751 | - |1204k| 0 | 55 | 131 | 137 | 131 | 111 | 10 | 0 | 151 | 0.000000e+00 | -- | Inf
3.20/3.26 c 3.1s| 1 | 0 | 751 | - |1204k| 0 | - | 131 | 137 | 131 | 111 | 10 | 0 | 158 | 0.000000e+00 | -- | Inf
3.20/3.26 c (run 2, node 1) restarting after 29 global fixings of integer variables
3.20/3.26 c
3.20/3.26 c (restart) converted 10 cuts from the global cut pool into linear constraints
3.20/3.26 c
3.20/3.26 c presolving:
3.20/3.27 c (round 1) 29 del vars, 18 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 22 impls, 81 clqs
3.20/3.28 c (round 2) 29 del vars, 19 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 9 upgd conss, 22 impls, 81 clqs
3.20/3.29 c (round 3) 29 del vars, 20 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 9 upgd conss, 22 impls, 81 clqs
3.20/3.29 c presolving (4 rounds):
3.20/3.29 c 29 deleted vars, 20 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
3.20/3.29 c 22 implications, 81 cliques
3.20/3.29 c presolved problem has 102 variables (102 bin, 0 int, 0 impl, 0 cont) and 127 constraints
3.20/3.29 c 18 constraints of type <knapsack>
3.20/3.29 c 84 constraints of type <setppc>
3.20/3.29 c 25 constraints of type <logicor>
3.20/3.29 c transformed objective value is always integral (scale: 1)
3.20/3.29 c Presolving Time: 0.05
3.20/3.29 c
3.20/3.29 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.20/3.29 c 3.1s| 1 | 0 | 815 | - | 955k| 0 | 46 | 102 | 127 | 102 | 106 | 0 | 0 | 158 | 0.000000e+00 | -- | Inf
3.30/3.32 c 3.1s| 1 | 0 | 872 | - |1160k| 0 | 54 | 102 | 127 | 102 | 115 | 9 | 0 | 158 | 0.000000e+00 | -- | Inf
3.49/3.52 c 3.3s| 1 | 0 | 877 | - |1160k| 0 | 54 | 102 | 127 | 102 | 115 | 9 | 0 | 176 | 0.000000e+00 | -- | Inf
3.69/3.72 c 3.5s| 1 | 0 | 889 | - |1159k| 0 | 54 | 102 | 126 | 102 | 115 | 9 | 0 | 194 | 0.000000e+00 | -- | Inf
3.79/3.83 c 3.6s| 1 | 0 | 1046 | - |1159k| 0 | 50 | 102 | 123 | 102 | 115 | 9 | 0 | 204 | 0.000000e+00 | -- | Inf
3.89/3.94 c 3.7s| 1 | 0 | 1068 | - |1157k| 0 | 48 | 102 | 120 | 102 | 115 | 9 | 0 | 216 | 0.000000e+00 | -- | Inf
3.99/4.04 c 3.8s| 1 | 0 | 1146 | - |1155k| 0 | 46 | 102 | 117 | 102 | 115 | 9 | 0 | 226 | 0.000000e+00 | -- | Inf
4.09/4.12 c 3.9s| 1 | 0 | 1146 | - |1155k| 0 | - | 102 | 117 | 102 | 115 | 9 | 0 | 234 | 0.000000e+00 | -- | Inf
4.09/4.12 c (run 3, node 1) restarting after 24 global fixings of integer variables
4.09/4.12 c
4.09/4.12 c (restart) converted 9 cuts from the global cut pool into linear constraints
4.09/4.12 c
4.09/4.12 c presolving:
4.09/4.13 c (round 1) 24 del vars, 12 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 36 impls, 74 clqs
4.09/4.14 c (round 2) 24 del vars, 14 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 9 upgd conss, 36 impls, 74 clqs
4.09/4.14 c presolving (3 rounds):
4.09/4.14 c 24 deleted vars, 14 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
4.09/4.14 c 36 implications, 74 cliques
4.09/4.14 c presolved problem has 78 variables (78 bin, 0 int, 0 impl, 0 cont) and 112 constraints
4.09/4.14 c 24 constraints of type <knapsack>
4.09/4.14 c 81 constraints of type <setppc>
4.09/4.14 c 7 constraints of type <logicor>
4.09/4.14 c transformed objective value is always integral (scale: 1)
4.09/4.14 c Presolving Time: 0.07
4.09/4.14 c
4.09/4.15 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.09/4.15 c 3.9s| 1 | 0 | 1195 | - | 944k| 0 | 42 | 78 | 112 | 78 | 106 | 0 | 0 | 234 | 0.000000e+00 | -- | Inf
4.09/4.17 c 3.9s| 1 | 0 | 1227 | - |1204k| 0 | 48 | 78 | 112 | 78 | 116 | 10 | 0 | 234 | 0.000000e+00 | -- | Inf
4.30/4.33 c 4.1s| 1 | 0 | 1366 | - |1204k| 0 | 46 | 78 | 112 | 78 | 116 | 10 | 0 | 252 | 0.000000e+00 | -- | Inf
4.30/4.40 c 4.1s| 1 | 0 | 1473 | - |1204k| 0 | 39 | 78 | 111 | 78 | 116 | 10 | 0 | 259 | 0.000000e+00 | -- | Inf
4.40/4.44 c 4.2s| 1 | 0 | 1521 | - |1192k| 0 | 24 | 78 | 71 | 78 | 116 | 10 | 0 | 269 | 0.000000e+00 | -- | Inf
4.40/4.45 c 4.2s| 1 | 0 | 1521 | - |1192k| 0 | - | 78 | 71 | 78 | 116 | 10 | 0 | 274 | 0.000000e+00 | -- | Inf
4.40/4.45 c (run 4, node 1) restarting after 53 global fixings of integer variables
4.40/4.45 c
4.40/4.45 c (restart) converted 10 cuts from the global cut pool into linear constraints
4.40/4.45 c
4.40/4.45 c presolving:
4.40/4.46 c (round 1) 68 del vars, 30 del conss, 0 chg bounds, 43 chg sides, 68 chg coeffs, 0 upgd conss, 60 impls, 6 clqs
4.40/4.46 c (round 2) 77 del vars, 56 del conss, 0 chg bounds, 74 chg sides, 127 chg coeffs, 0 upgd conss, 76 impls, 0 clqs
4.40/4.46 c presolving (3 rounds):
4.40/4.46 c 78 deleted vars, 81 deleted constraints, 0 tightened bounds, 0 added holes, 74 changed sides, 127 changed coefficients
4.40/4.46 c 76 implications, 0 cliques
4.40/4.46 c presolved problem has 0 variables (0 bin, 0 int, 0 impl, 0 cont) and 0 constraints
4.40/4.46 c transformed objective value is always integral (scale: 1)
4.40/4.46 c Presolving Time: 0.08
4.40/4.47 c
4.40/4.47 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.47 c 4.2s| 1 | 0 | 1521 | - | 671k| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 274 | 0.000000e+00 | -- | Inf
4.40/4.47 c * 4.2s| 1 | 0 | 1521 | - | 671k| 0 | - | 0 | 0 | 0 | 0 | 0 | 0 | 274 | 0.000000e+00 | 0.000000e+00 | 0.00%
4.40/4.47 c
4.40/4.47 c SCIP Status : problem is solved [optimal solution found]
4.40/4.47 c Solving Time (sec) : 4.20
4.40/4.47 c Solving Nodes : 1 (total of 5 nodes in 5 runs)
4.40/4.47 c Primal Bound : +0.00000000000000e+00 (1 solutions)
4.40/4.47 c Dual Bound : +0.00000000000000e+00
4.40/4.47 c Gap : 0.00 %
4.40/4.47 s SATISFIABLE
4.40/4.47 v x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
4.40/4.47 v x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 x132 -x131 -x130 -x129 x128 -x127
4.40/4.47 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 x110 -x109 -x108 -x107 -x106
4.40/4.47 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.40/4.47 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
4.40/4.47 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
4.40/4.47 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.40/4.47 v -x4 -x3 -x2 -x1
4.40/4.47 c SCIP Status : problem is solved [optimal solution found]
4.40/4.47 c Solving Time : 4.20
4.40/4.47 c Original Problem :
4.40/4.47 c Problem name : HOME/instance-2665756-1276275642.opb
4.40/4.47 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
4.40/4.47 c Constraints : 101 initial, 101 maximal
4.40/4.47 c Presolved Problem :
4.40/4.47 c Problem name : t_HOME/instance-2665756-1276275642.opb
4.40/4.47 c Variables : 0 (0 binary, 0 integer, 0 implicit integer, 0 continuous)
4.40/4.47 c Constraints : 0 initial, 0 maximal
4.40/4.47 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.40/4.47 c trivial : 0.00 144 0 0 0 0 0 0 0
4.40/4.47 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.40/4.47 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.40/4.47 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.40/4.47 c implics : 0.00 0 0 0 0 0 0 0 0
4.40/4.47 c probing : 0.00 0 0 0 0 0 0 0 0
4.40/4.47 c knapsack : 0.04 1 0 0 0 0 24 68 121
4.40/4.47 c setppc : 0.00 18 5 0 0 0 49 0 0
4.40/4.47 c linear : 0.01 1 0 0 0 0 42 7 7
4.40/4.47 c logicor : 0.01 0 0 0 0 0 32 0 0
4.40/4.47 c root node : - 144 - - 144 - - - -
4.40/4.47 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.40/4.47 c integral : 0 0 0 26 0 0 111 0 0 0
4.40/4.47 c countsols : 0 0 0 1 0 0 0 0 0 0
4.40/4.47 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.40/4.47 c integral : 3.72 0.00 0.00 3.72 0.00
4.40/4.47 c countsols : 0.00 0.00 0.00 0.00 0.00
4.40/4.47 c Propagators : Time Calls Cutoffs DomReds
4.40/4.47 c vbounds : 0.00 5 0 0
4.40/4.47 c rootredcost : 0.00 0 0 0
4.40/4.47 c pseudoobj : 0.00 0 0 0
4.40/4.47 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.40/4.47 c propagation : 0.00 0 0 0 0.0 0 0.0 -
4.40/4.47 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
4.40/4.47 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.40/4.47 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.40/4.47 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.40/4.47 c applied globally : - - - 0 0.0 - - -
4.40/4.47 c applied locally : - - - 0 0.0 - - -
4.40/4.47 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.40/4.47 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
4.40/4.47 c redcost : 0.00 8 0 0 0 0
4.40/4.47 c impliedbounds : 0.00 8 0 0 0 0
4.40/4.47 c intobj : 0.00 0 0 0 0 0
4.40/4.47 c cgmip : 0.00 0 0 0 0 0
4.40/4.47 c gomory : 0.08 8 0 0 42 0
4.40/4.47 c strongcg : 0.07 8 0 0 576 0
4.40/4.47 c cmir : 0.00 0 0 0 0 0
4.40/4.47 c flowcover : 0.00 0 0 0 0 0
4.40/4.47 c clique : 0.01 8 0 0 35 0
4.40/4.47 c zerohalf : 0.00 0 0 0 0 0
4.40/4.47 c mcf : 0.00 4 0 0 0 0
4.40/4.47 c rapidlearning : 0.16 1 0 0 0 136
4.40/4.47 c Pricers : Time Calls Vars
4.40/4.47 c problem variables: 0.00 0 0
4.40/4.47 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.40/4.47 c relpscost : 3.72 25 0 111 0 0 0
4.40/4.47 c pscost : 0.00 0 0 0 0 0 0
4.40/4.47 c inference : 0.00 0 0 0 0 0 0
4.40/4.47 c mostinf : 0.00 0 0 0 0 0 0
4.40/4.47 c leastinf : 0.00 0 0 0 0 0 0
4.40/4.47 c fullstrong : 0.00 0 0 0 0 0 0
4.40/4.47 c allfullstrong : 0.00 0 0 0 0 0 0
4.40/4.47 c random : 0.00 0 0 0 0 0 0
4.40/4.47 c Primal Heuristics : Time Calls Found
4.40/4.47 c LP solutions : 0.00 - 1
4.40/4.47 c pseudo solutions : 0.00 - 0
4.40/4.47 c trivial : 0.00 1 0
4.40/4.47 c simplerounding : 0.00 0 0
4.40/4.47 c zirounding : 0.00 0 0
4.40/4.47 c rounding : 0.00 0 0
4.40/4.47 c shifting : 0.00 0 0
4.40/4.47 c intshifting : 0.00 0 0
4.40/4.47 c oneopt : 0.00 0 0
4.40/4.47 c twoopt : 0.00 0 0
4.40/4.47 c fixandinfer : 0.00 0 0
4.40/4.47 c feaspump : 0.00 0 0
4.40/4.47 c coefdiving : 0.00 0 0
4.40/4.47 c pscostdiving : 0.00 0 0
4.40/4.47 c fracdiving : 0.00 0 0
4.40/4.47 c veclendiving : 0.00 0 0
4.40/4.47 c intdiving : 0.00 0 0
4.40/4.47 c actconsdiving : 0.00 0 0
4.40/4.47 c objpscostdiving : 0.00 0 0
4.40/4.47 c rootsoldiving : 0.00 0 0
4.40/4.47 c linesearchdiving : 0.00 0 0
4.40/4.47 c guideddiving : 0.00 0 0
4.40/4.47 c octane : 0.00 0 0
4.40/4.47 c rens : 0.00 0 0
4.40/4.47 c rins : 0.00 0 0
4.40/4.47 c localbranching : 0.00 0 0
4.40/4.47 c mutation : 0.00 0 0
4.40/4.47 c crossover : 0.00 0 0
4.40/4.47 c dins : 0.00 0 0
4.40/4.47 c undercover : 0.00 0 0
4.40/4.47 c nlp : 0.00 0 0
4.40/4.47 c trysol : 0.00 0 0
4.40/4.47 c LP : Time Calls Iterations Iter/call Iter/sec
4.40/4.47 c primal LP : 0.00 0 0 0.00 -
4.40/4.47 c dual LP : 0.05 33 1521 46.09 30420.00
4.40/4.47 c lex dual LP : 0.00 0 0 0.00 -
4.40/4.47 c barrier LP : 0.00 0 0 0.00 -
4.40/4.47 c diving/probing LP: 0.00 0 0 0.00 -
4.40/4.47 c strong branching : 3.72 274 60690 221.50 16314.52
4.40/4.47 c (at root node) : - 274 60690 221.50 -
4.40/4.47 c conflict analysis: 0.00 0 0 0.00 -
4.40/4.47 c B&B Tree :
4.40/4.47 c number of runs : 5
4.40/4.47 c nodes : 1
4.40/4.47 c nodes (total) : 5
4.40/4.47 c nodes left : 0
4.40/4.47 c max depth : 0
4.40/4.47 c max depth (total): 0
4.40/4.47 c backtracks : 0 (0.0%)
4.40/4.47 c delayed cutoffs : 0
4.40/4.47 c repropagations : 0 (0 domain reductions, 0 cutoffs)
4.40/4.47 c avg switch length: 2.00
4.40/4.47 c switching time : 0.00
4.40/4.47 c Solution :
4.40/4.47 c Solutions found : 1 (1 improvements)
4.40/4.47 c First Solution : +0.00000000000000e+00 (in run 5, after 1 nodes, 4.20 seconds, depth 0, found by <relaxation>)
4.40/4.47 c Primal Bound : +0.00000000000000e+00 (in run 5, after 1 nodes, 4.20 seconds, depth 0, found by <relaxation>)
4.40/4.47 c Dual Bound : +0.00000000000000e+00
4.40/4.47 c Gap : 0.00 %
4.40/4.47 c Root Dual Bound : +0.00000000000000e+00
4.40/4.47 c Root Iterations : 1521
4.40/4.47 c Time complete: 4.47.