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-2665743-1276274494.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.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <zirounding> (-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/zirounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/cmir/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/flowcover/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 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 | 40 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 117 | - |1196k| 0 | 55 | 169 | 219 | 169 | 91 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 377 | - |1206k| 0 | 53 | 169 | 219 | 169 | 96 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.30 c 0.3s| 1 | 0 | 441 | - |1216k| 0 | 59 | 169 | 219 | 169 | 104 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 502 | - |1219k| 0 | 63 | 169 | 219 | 169 | 109 | 36 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.35 c 0.3s| 1 | 0 | 562 | - |1223k| 0 | 61 | 169 | 219 | 169 | 113 | 40 | 0 | 0 | 0.000000e+00 | -- | Inf
0.79/0.81 c 0.8s| 1 | 0 | 674 | - |1210k| 0 | 59 | 169 | 208 | 169 | 113 | 40 | 0 | 13 | 0.000000e+00 | -- | Inf
1.10/1.15 c 1.1s| 1 | 0 | 721 | - |1201k| 0 | 55 | 169 | 201 | 169 | 113 | 40 | 0 | 24 | 0.000000e+00 | -- | Inf
1.39/1.42 c 1.4s| 1 | 0 | 745 | - |1191k| 0 | 54 | 169 | 191 | 169 | 113 | 40 | 0 | 36 | 0.000000e+00 | -- | Inf
1.59/1.62 c 1.6s| 1 | 0 | 938 | - |1178k| 0 | 49 | 169 | 177 | 169 | 113 | 40 | 0 | 44 | 0.000000e+00 | -- | Inf
1.69/1.76 c 1.7s| 1 | 0 | 1103 | - |1176k| 0 | 42 | 169 | 176 | 169 | 113 | 40 | 0 | 51 | 0.000000e+00 | -- | Inf
1.79/1.89 c 1.8s| 1 | 0 | 1119 | - |1170k| 0 | 43 | 169 | 170 | 169 | 98 | 40 | 0 | 62 | 0.000000e+00 | -- | Inf
1.89/1.95 c 1.9s| 1 | 0 | 1137 | - |1122k| 0 | 42 | 169 | 124 | 169 | 98 | 40 | 0 | 67 | 0.000000e+00 | -- | Inf
1.99/2.00 c 1.9s| 1 | 0 | 1152 | - |1121k| 0 | 40 | 169 | 123 | 169 | 98 | 40 | 0 | 72 | 0.000000e+00 | -- | Inf
1.99/2.08 c 2.0s| 1 | 0 | 1152 | - |1121k| 0 | - | 169 | 123 | 169 | 98 | 40 | 0 | 80 | 0.000000e+00 | -- | Inf
1.99/2.08 c (run 1, node 1) restarting after 38 global fixings of integer variables
1.99/2.08 c
1.99/2.08 c (restart) converted 25 cuts from the global cut pool into linear constraints
1.99/2.08 c
1.99/2.08 c presolving:
1.99/2.09 c (round 1) 38 del vars, 2 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 14 impls, 83 clqs
2.10/2.10 c (round 2) 38 del vars, 2 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 74 upgd conss, 14 impls, 83 clqs
2.10/2.10 c presolving (3 rounds):
2.10/2.10 c 38 deleted vars, 2 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
2.10/2.10 c 14 implications, 83 cliques
2.10/2.10 c presolved problem has 131 variables (131 bin, 0 int, 0 impl, 0 cont) and 146 constraints
2.10/2.10 c 8 constraints of type <knapsack>
2.10/2.10 c 84 constraints of type <setppc>
2.10/2.10 c 54 constraints of type <logicor>
2.10/2.10 c transformed objective value is always integral (scale: 1)
2.10/2.10 c Presolving Time: 0.02
2.10/2.10 c
2.10/2.11 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.10/2.11 c 2.0s| 1 | 0 | 1237 | - | 875k| 0 | 48 | 131 | 146 | 131 | 96 | 0 | 0 | 80 | 0.000000e+00 | -- | Inf
2.10/2.14 c 2.1s| 1 | 0 | 1302 | - |1166k| 0 | 56 | 131 | 146 | 131 | 106 | 10 | 0 | 80 | 0.000000e+00 | -- | Inf
2.20/2.25 c 2.2s| 1 | 0 | 1405 | - |1160k| 0 | 38 | 131 | 128 | 131 | 106 | 10 | 0 | 87 | 0.000000e+00 | -- | Inf
2.29/2.31 c 2.2s| 1 | 0 | 1405 | - |1160k| 0 | - | 131 | 128 | 131 | 106 | 10 | 0 | 98 | 0.000000e+00 | -- | Inf
2.29/2.31 c (run 2, node 1) restarting after 42 global fixings of integer variables
2.29/2.31 c
2.29/2.31 c (restart) converted 10 cuts from the global cut pool into linear constraints
2.29/2.31 c
2.29/2.31 c presolving:
2.29/2.32 c (round 1) 42 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 10 upgd conss, 30 impls, 73 clqs
2.29/2.33 c (round 2) 42 del vars, 29 del conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 10 upgd conss, 30 impls, 73 clqs
2.29/2.33 c presolving (3 rounds):
2.29/2.33 c 42 deleted vars, 29 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 2 changed coefficients
2.29/2.33 c 30 implications, 73 cliques
2.29/2.33 c presolved problem has 89 variables (89 bin, 0 int, 0 impl, 0 cont) and 109 constraints
2.29/2.33 c 12 constraints of type <knapsack>
2.29/2.33 c 79 constraints of type <setppc>
2.29/2.33 c 18 constraints of type <logicor>
2.29/2.33 c transformed objective value is always integral (scale: 1)
2.29/2.33 c Presolving Time: 0.03
2.29/2.33 c
2.29/2.33 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.29/2.33 c 2.2s| 1 | 0 | 1471 | - | 851k| 0 | 33 | 89 | 109 | 89 | 93 | 0 | 0 | 98 | 0.000000e+00 | -- | Inf
2.29/2.35 c 2.3s| 1 | 0 | 1546 | - |1101k| 0 | 37 | 89 | 109 | 89 | 98 | 5 | 0 | 98 | 0.000000e+00 | -- | Inf
2.39/2.41 c 2.3s| 1 | 0 | 1576 | - |1101k| 0 | 39 | 89 | 109 | 89 | 98 | 5 | 0 | 112 | 0.000000e+00 | -- | Inf
2.39/2.44 c 2.4s| 1 | 0 | 1601 | - |1101k| 0 | 39 | 89 | 108 | 89 | 98 | 5 | 0 | 122 | 0.000000e+00 | -- | Inf
2.39/2.47 c 2.4s| 1 | 0 | 1625 | - |1100k| 0 | 29 | 89 | 105 | 89 | 98 | 5 | 0 | 127 | 0.000000e+00 | -- | Inf
2.49/2.51 c 2.4s| 1 | 0 | 1625 | - |1100k| 0 | - | 89 | 105 | 89 | 98 | 5 | 0 | 138 | 0.000000e+00 | -- | Inf
2.49/2.51 c (run 3, node 1) restarting after 20 global fixings of integer variables
2.49/2.51 c
2.49/2.51 c (restart) converted 5 cuts from the global cut pool into linear constraints
2.49/2.51 c
2.49/2.51 c presolving:
2.49/2.52 c (round 1) 21 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 5 chg coeffs, 5 upgd conss, 48 impls, 63 clqs
2.49/2.53 c (round 2) 21 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 19 chg coeffs, 5 upgd conss, 48 impls, 63 clqs
2.49/2.53 c (round 3) 21 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 27 chg coeffs, 5 upgd conss, 48 impls, 63 clqs
2.49/2.53 c (round 4) 21 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 33 chg coeffs, 5 upgd conss, 48 impls, 63 clqs
2.49/2.54 c (round 5) 21 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 37 chg coeffs, 5 upgd conss, 48 impls, 63 clqs
2.49/2.54 c (round 6) 21 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 43 chg coeffs, 5 upgd conss, 48 impls, 63 clqs
2.49/2.54 c (round 7) 21 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 48 chg coeffs, 5 upgd conss, 48 impls, 63 clqs
2.49/2.54 c (round 8) 21 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 52 chg coeffs, 5 upgd conss, 48 impls, 63 clqs
2.49/2.54 c (round 9) 21 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 57 chg coeffs, 5 upgd conss, 48 impls, 63 clqs
2.49/2.54 c (round 10) 21 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 61 chg coeffs, 5 upgd conss, 48 impls, 63 clqs
2.49/2.55 c (round 11) 21 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 65 chg coeffs, 5 upgd conss, 48 impls, 63 clqs
2.49/2.55 c (round 12) 21 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 67 chg coeffs, 5 upgd conss, 48 impls, 63 clqs
2.49/2.55 c (round 13) 21 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 70 chg coeffs, 5 upgd conss, 48 impls, 63 clqs
2.49/2.55 c (round 14) 21 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 73 chg coeffs, 5 upgd conss, 48 impls, 63 clqs
2.49/2.55 c (round 15) 21 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 76 chg coeffs, 5 upgd conss, 48 impls, 63 clqs
2.49/2.56 c (round 16) 21 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 79 chg coeffs, 5 upgd conss, 48 impls, 63 clqs
2.49/2.56 c (round 17) 21 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 81 chg coeffs, 5 upgd conss, 48 impls, 63 clqs
2.49/2.56 c (round 18) 21 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 82 chg coeffs, 5 upgd conss, 48 impls, 63 clqs
2.49/2.56 c (round 19) 21 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 83 chg coeffs, 5 upgd conss, 48 impls, 63 clqs
2.49/2.56 c (round 20) 21 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 84 chg coeffs, 5 upgd conss, 48 impls, 63 clqs
2.49/2.56 c (round 21) 21 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 85 chg coeffs, 5 upgd conss, 48 impls, 63 clqs
2.49/2.57 c presolving (22 rounds):
2.49/2.57 c 21 deleted vars, 13 deleted constraints, 0 tightened bounds, 0 added holes, 6 changed sides, 85 changed coefficients
2.49/2.57 c 48 implications, 63 cliques
2.49/2.57 c presolved problem has 68 variables (68 bin, 0 int, 0 impl, 0 cont) and 97 constraints
2.49/2.57 c 13 constraints of type <knapsack>
2.49/2.57 c 70 constraints of type <setppc>
2.49/2.57 c 14 constraints of type <logicor>
2.49/2.57 c transformed objective value is always integral (scale: 1)
2.49/2.57 c Presolving Time: 0.07
2.49/2.57 c
2.49/2.57 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.49/2.57 c 2.5s| 1 | 0 | 1685 | - | 828k| 0 | 30 | 68 | 97 | 68 | 87 | 0 | 0 | 138 | 0.000000e+00 | -- | Inf
2.49/2.59 c 2.5s| 1 | 0 | 1720 | - |1066k| 0 | 0 | 68 | 97 | 68 | 93 | 6 | 0 | 138 | 0.000000e+00 | -- | Inf
2.49/2.59 c * 2.5s| 1 | 0 | 1720 | - |1068k| 0 | - | 68 | 97 | 68 | 93 | 6 | 0 | 138 | 0.000000e+00 | 0.000000e+00 | 0.00%
2.49/2.59 c
2.49/2.59 c SCIP Status : problem is solved [optimal solution found]
2.49/2.59 c Solving Time (sec) : 2.47
2.49/2.59 c Solving Nodes : 1 (total of 4 nodes in 4 runs)
2.49/2.59 c Primal Bound : +0.00000000000000e+00 (1 solutions)
2.49/2.59 c Dual Bound : +0.00000000000000e+00
2.49/2.59 c Gap : 0.00 %
2.49/2.59 s SATISFIABLE
2.49/2.59 v -x169 -x168 -x167 x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
2.49/2.59 v -x147 x146 -x145 -x144 x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
2.49/2.59 v x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 x108 -x107 -x106
2.49/2.59 v -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 x83 -x82
2.49/2.59 v -x81 -x80 -x79 -x78 x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57
2.49/2.59 v -x56 -x55 -x54 x53 -x52 -x51 -x50 -x49 -x48 -x47 x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 x37 -x36 -x35 -x34 -x33 -x32 -x31
2.49/2.59 v -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 x8 -x7 -x6 -x5
2.49/2.59 v -x4 -x3 -x2 -x1
2.49/2.59 c SCIP Status : problem is solved [optimal solution found]
2.49/2.59 c Solving Time : 2.47
2.49/2.59 c Original Problem :
2.49/2.59 c Problem name : HOME/instance-2665743-1276274494.opb
2.49/2.59 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
2.49/2.59 c Constraints : 101 initial, 101 maximal
2.49/2.59 c Presolved Problem :
2.49/2.59 c Problem name : t_HOME/instance-2665743-1276274494.opb
2.49/2.59 c Variables : 68 (68 binary, 0 integer, 0 implicit integer, 0 continuous)
2.49/2.59 c Constraints : 97 initial, 97 maximal
2.49/2.59 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.49/2.59 c trivial : 0.00 100 0 0 0 0 0 0 0
2.49/2.59 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.49/2.59 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.49/2.59 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.49/2.59 c implics : 0.00 0 0 0 0 0 0 0 0
2.49/2.59 c probing : 0.00 0 0 0 0 0 0 0 0
2.49/2.59 c knapsack : 0.04 0 0 0 0 0 0 6 87
2.49/2.59 c setppc : 0.02 0 1 0 0 0 12 0 0
2.49/2.59 c linear : 0.00 0 0 0 0 0 29 1 0
2.49/2.59 c logicor : 0.00 0 0 0 0 0 31 0 0
2.49/2.59 c root node : - 100 - - 100 - - - -
2.49/2.59 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.49/2.59 c integral : 0 0 0 16 0 0 68 0 0 0
2.49/2.59 c knapsack : 13 8 17 1 0 0 0 0 0 0
2.49/2.59 c setppc : 70 8 17 1 0 0 32 0 0 0
2.49/2.59 c logicor : 14 8 8 1 0 0 0 0 0 0
2.49/2.59 c countsols : 0 0 0 1 0 0 0 0 0 0
2.49/2.59 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.49/2.59 c integral : 1.94 0.00 0.00 1.94 0.00
2.49/2.59 c knapsack : 0.01 0.01 0.00 0.00 0.00
2.49/2.59 c setppc : 0.00 0.00 0.00 0.00 0.00
2.49/2.59 c logicor : 0.00 0.00 0.00 0.00 0.00
2.49/2.59 c countsols : 0.00 0.00 0.00 0.00 0.00
2.49/2.59 c Propagators : Time Calls Cutoffs DomReds
2.49/2.59 c vbounds : 0.00 4 0 0
2.49/2.59 c rootredcost : 0.00 0 0 0
2.49/2.59 c pseudoobj : 0.00 0 0 0
2.49/2.59 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.49/2.59 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.49/2.59 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.49/2.59 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.49/2.59 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.49/2.59 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.49/2.59 c applied globally : - - - 0 0.0 - - -
2.49/2.59 c applied locally : - - - 0 0.0 - - -
2.49/2.59 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.49/2.59 c cut pool : 0.00 0 - - 0 - (maximal pool size: 117)
2.49/2.59 c redcost : 0.00 8 0 0 0 0
2.49/2.59 c impliedbounds : 0.00 8 0 0 0 0
2.49/2.59 c intobj : 0.00 0 0 0 0 0
2.49/2.59 c cgmip : 0.00 0 0 0 0 0
2.49/2.59 c gomory : 0.06 8 0 0 182 0
2.49/2.59 c strongcg : 0.06 8 0 0 282 0
2.49/2.59 c cmir : 0.00 0 0 0 0 0
2.49/2.59 c flowcover : 0.00 0 0 0 0 0
2.49/2.59 c clique : 0.00 8 0 0 40 0
2.49/2.59 c zerohalf : 0.00 0 0 0 0 0
2.49/2.59 c mcf : 0.00 4 0 0 0 0
2.49/2.59 c rapidlearning : 0.16 1 0 0 0 146
2.49/2.59 c Pricers : Time Calls Vars
2.49/2.59 c problem variables: 0.00 0 0
2.49/2.59 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.49/2.59 c relpscost : 1.94 15 0 68 0 0 0
2.49/2.59 c pscost : 0.00 0 0 0 0 0 0
2.49/2.59 c inference : 0.00 0 0 0 0 0 0
2.49/2.59 c mostinf : 0.00 0 0 0 0 0 0
2.49/2.59 c leastinf : 0.00 0 0 0 0 0 0
2.49/2.59 c fullstrong : 0.00 0 0 0 0 0 0
2.49/2.59 c allfullstrong : 0.00 0 0 0 0 0 0
2.49/2.59 c random : 0.00 0 0 0 0 0 0
2.49/2.59 c Primal Heuristics : Time Calls Found
2.49/2.59 c LP solutions : 0.00 - 1
2.49/2.59 c pseudo solutions : 0.00 - 0
2.49/2.59 c trivial : 0.00 1 0
2.49/2.59 c simplerounding : 0.00 0 0
2.49/2.59 c zirounding : 0.00 0 0
2.49/2.59 c rounding : 0.00 0 0
2.49/2.59 c shifting : 0.00 0 0
2.49/2.59 c intshifting : 0.00 0 0
2.49/2.59 c oneopt : 0.00 0 0
2.49/2.59 c twoopt : 0.00 0 0
2.49/2.59 c fixandinfer : 0.00 0 0
2.49/2.59 c feaspump : 0.00 0 0
2.49/2.59 c coefdiving : 0.00 0 0
2.49/2.59 c pscostdiving : 0.00 0 0
2.49/2.59 c fracdiving : 0.00 0 0
2.49/2.59 c veclendiving : 0.00 0 0
2.49/2.59 c intdiving : 0.00 0 0
2.49/2.59 c actconsdiving : 0.00 0 0
2.49/2.59 c objpscostdiving : 0.00 0 0
2.49/2.59 c rootsoldiving : 0.00 0 0
2.49/2.59 c linesearchdiving : 0.00 0 0
2.49/2.59 c guideddiving : 0.00 0 0
2.49/2.59 c octane : 0.00 0 0
2.49/2.59 c rens : 0.00 0 0
2.49/2.59 c rins : 0.00 0 0
2.49/2.59 c localbranching : 0.00 0 0
2.49/2.59 c mutation : 0.00 0 0
2.49/2.59 c crossover : 0.00 0 0
2.49/2.59 c dins : 0.00 0 0
2.49/2.59 c undercover : 0.00 0 0
2.49/2.59 c nlp : 0.00 0 0
2.49/2.59 c trysol : 0.00 0 0
2.49/2.59 c LP : Time Calls Iterations Iter/call Iter/sec
2.49/2.59 c primal LP : 0.00 0 0 0.00 -
2.49/2.59 c dual LP : 0.13 24 1720 71.67 13230.77
2.49/2.59 c lex dual LP : 0.00 0 0 0.00 -
2.49/2.59 c barrier LP : 0.00 0 0 0.00 -
2.49/2.59 c diving/probing LP: 0.00 0 0 0.00 -
2.49/2.59 c strong branching : 1.94 138 33435 242.28 17234.54
2.49/2.59 c (at root node) : - 138 33435 242.28 -
2.49/2.59 c conflict analysis: 0.00 0 0 0.00 -
2.49/2.59 c B&B Tree :
2.49/2.59 c number of runs : 4
2.49/2.59 c nodes : 1
2.49/2.59 c nodes (total) : 4
2.49/2.59 c nodes left : 0
2.49/2.59 c max depth : 0
2.49/2.59 c max depth (total): 0
2.49/2.59 c backtracks : 0 (0.0%)
2.49/2.59 c delayed cutoffs : 0
2.49/2.59 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.49/2.59 c avg switch length: 2.00
2.49/2.59 c switching time : 0.00
2.49/2.59 c Solution :
2.49/2.59 c Solutions found : 1 (1 improvements)
2.49/2.59 c First Solution : +0.00000000000000e+00 (in run 4, after 1 nodes, 2.47 seconds, depth 0, found by <relaxation>)
2.49/2.59 c Primal Bound : +0.00000000000000e+00 (in run 4, after 1 nodes, 2.47 seconds, depth 0, found by <relaxation>)
2.49/2.59 c Dual Bound : +0.00000000000000e+00
2.49/2.59 c Gap : 0.00 %
2.49/2.59 c Root Dual Bound : +0.00000000000000e+00
2.49/2.59 c Root Iterations : 1720
2.49/2.59 c Time complete: 2.58.