0.00/0.01 c SCIP version 1.1.0.7
0.00/0.01 c LP-Solver SoPlex 1.4.1
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c read problem <HOME/instance-1868102-1245115708.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 No objective function, only one solution is needed.
0.00/0.01 c start presolving problem
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.02 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.02 c presolving (3 rounds):
0.00/0.02 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 8 implications, 68 cliques
0.00/0.02 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.02 c 1 constraints of type <knapsack>
0.00/0.02 c 68 constraints of type <setppc>
0.00/0.02 c 4 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c SATUNSAT-LIN
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/flowcover/freq = c -1
0.00/0.02 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/cmir/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/veclendiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/simplerounding/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/shifting/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/rounding/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.02 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/rootsoldiving/freq = c -1
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/rens/nodesofs = c 2000
0.00/0.02 c # minimum percentage of integer variables that have to be fixable
0.00/0.02 c # [type: real, range: [0,1], default: 0.5]
0.00/0.02 c heuristics/rens/minfixingrate = c 0.3
0.00/0.02 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/rens/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/pscostdiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/oneopt/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.02 c # [type: real, range: [0,1], default: 0.01]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.02 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/objpscostdiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/linesearchdiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/intshifting/freq = c -1
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/guideddiving/freq = c -1
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 = c 1500
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 = c 0.075
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 = c -1
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 = c 2000
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 = c -1
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 = c 0.5
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 = c 0.15
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 = c 100
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 = c 750
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 = c -1
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 = c 1500
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 = c 0.075
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 = c -1
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 = c 0
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 = c TRUE
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 = c FALSE
0.00/0.03 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c constraints/knapsack/maxnumcardlift = c 0
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 = c TRUE
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 = c 5
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 = c 1
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 = c 1
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 = c 1620
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 = c 1791
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 = c 10000
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving problem
0.00/0.03 c
0.00/0.03 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.03 c 0.0s| 1 | 0 | 148 | 593k| 0 | 43 | 169 | 73 | 73 | 169 | 73 | 0 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.05 c 0.0s| 1 | 0 | 179 | 862k| 0 | 50 | 169 | 73 | 73 | 169 | 84 | 11 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.07 c 0.1s| 1 | 0 | 209 | 974k| 0 | 53 | 169 | 73 | 73 | 169 | 92 | 19 | 0 | 0 | 1.300000e+01 | -- | Inf
0.06/0.09 c 0.1s| 1 | 0 | 244 |1030k| 0 | 56 | 169 | 73 | 73 | 169 | 100 | 27 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 272 |1058k| 0 | 54 | 169 | 73 | 73 | 169 | 105 | 32 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 301 |1071k| 0 | 61 | 169 | 73 | 73 | 169 | 112 | 39 | 0 | 0 | 1.300000e+01 | -- | Inf
0.79/0.84 c 0.8s| 1 | 0 | 337 |1071k| 0 | 62 | 169 | 73 | 73 | 169 | 112 | 39 | 0 | 35 | 1.300000e+01 | -- | Inf
1.10/1.18 c 1.1s| 1 | 0 | 369 |1070k| 0 | 62 | 169 | 73 | 73 | 169 | 112 | 39 | 0 | 50 | 1.300000e+01 | -- | Inf
1.29/1.34 c 1.3s| 1 | 0 | 401 |1070k| 0 | 64 | 169 | 73 | 73 | 169 | 112 | 39 | 0 | 57 | 1.300000e+01 | -- | Inf
1.49/1.53 c 1.5s| 1 | 0 | 423 |1070k| 0 | 58 | 169 | 73 | 73 | 169 | 112 | 39 | 0 | 65 | 1.300000e+01 | -- | Inf
1.58/1.68 c 1.6s| 1 | 0 | 441 |1070k| 0 | 58 | 169 | 73 | 73 | 169 | 112 | 39 | 0 | 72 | 1.300000e+01 | -- | Inf
1.79/1.88 c 1.8s| 1 | 0 | 457 |1070k| 0 | 57 | 169 | 73 | 73 | 169 | 108 | 39 | 0 | 82 | 1.300000e+01 | -- | Inf
1.98/2.03 c 2.0s| 1 | 0 | 457 |1070k| 0 | - | 169 | 73 | 73 | 169 | 108 | 39 | 0 | 90 | 1.300000e+01 | -- | Inf
1.98/2.03 c (run 1, node 1) restarting after 35 global fixings of integer variables
1.98/2.03 c
1.98/2.03 (restart) converted 35 cuts from the global cut pool into linear constraints
1.98/2.03 c
1.98/2.03 presolving:
1.98/2.03 c (round 1) 35 del vars, 3 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 18 impls, 87 clqs
1.98/2.03 c (round 2) 35 del vars, 3 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 34 upgd conss, 18 impls, 87 clqs
1.98/2.04 c presolving (3 rounds):
1.98/2.04 c 35 deleted vars, 3 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
1.98/2.04 c 18 implications, 87 cliques
1.98/2.04 c presolved problem has 134 variables (134 bin, 0 int, 0 impl, 0 cont) and 105 constraints
1.98/2.04 c 12 constraints of type <knapsack>
1.98/2.04 c 89 constraints of type <setppc>
1.98/2.04 c 4 constraints of type <logicor>
1.98/2.04 c transformed objective value is always integral (scale: 1)
1.98/2.04 c Presolving Time: 0.03
1.98/2.04 c
1.98/2.05 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.98/2.05 c 2.0s| 1 | 0 | 561 | 802k| 0 | 46 | 134 | 105 | 105 | 134 | 105 | 0 | 0 | 90 | 1.300000e+01 | -- | Inf
1.98/2.08 c 2.0s| 1 | 0 | 586 |1085k| 0 | 51 | 134 | 105 | 105 | 134 | 114 | 9 | 0 | 90 | 1.300000e+01 | -- | Inf
2.38/2.44 c 2.4s| 1 | 0 | 602 |1085k| 0 | 53 | 134 | 105 | 105 | 134 | 114 | 9 | 0 | 126 | 1.300000e+01 | -- | Inf
2.49/2.54 c 2.5s| 1 | 0 | 625 |1085k| 0 | 49 | 134 | 105 | 105 | 134 | 114 | 9 | 0 | 137 | 1.300000e+01 | -- | Inf
2.59/2.63 c 2.5s| 1 | 0 | 635 |1084k| 0 | 51 | 134 | 104 | 104 | 134 | 114 | 9 | 0 | 146 | 1.300000e+01 | -- | Inf
2.59/2.69 c 2.6s| 1 | 0 | 653 |1084k| 0 | 50 | 134 | 104 | 104 | 134 | 114 | 9 | 0 | 152 | 1.300000e+01 | -- | Inf
2.79/2.81 c 2.7s| 1 | 0 | 667 |1084k| 0 | 50 | 134 | 104 | 104 | 134 | 114 | 9 | 0 | 162 | 1.300000e+01 | -- | Inf
2.79/2.88 c 2.8s| 1 | 0 | 667 |1084k| 0 | - | 134 | 104 | 104 | 134 | 114 | 9 | 0 | 168 | 1.300000e+01 | -- | Inf
2.79/2.88 c (run 2, node 1) restarting after 27 global fixings of integer variables
2.79/2.88 c
2.79/2.88 (restart) converted 9 cuts from the global cut pool into linear constraints
2.79/2.88 c
2.79/2.88 presolving:
2.79/2.88 c (round 1) 27 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 28 impls, 86 clqs
2.79/2.89 c (round 2) 27 del vars, 5 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 28 impls, 86 clqs
2.79/2.89 c presolving (3 rounds):
2.79/2.89 c 27 deleted vars, 5 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.79/2.89 c 28 implications, 86 cliques
2.79/2.89 c presolved problem has 107 variables (107 bin, 0 int, 0 impl, 0 cont) and 108 constraints
2.79/2.89 c 16 constraints of type <knapsack>
2.79/2.89 c 88 constraints of type <setppc>
2.79/2.89 c 4 constraints of type <logicor>
2.79/2.89 c transformed objective value is always integral (scale: 1)
2.79/2.89 c Presolving Time: 0.04
2.79/2.89 c
2.89/2.90 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.89/2.90 c 2.8s| 1 | 0 | 785 | 823k| 0 | 47 | 107 | 108 | 108 | 107 | 108 | 0 | 0 | 168 | 1.300000e+01 | -- | Inf
2.89/2.92 c 2.8s| 1 | 0 | 816 | 915k| 0 | 53 | 107 | 108 | 108 | 107 | 113 | 5 | 0 | 168 | 1.300000e+01 | -- | Inf
3.49/3.54 c 3.4s| 1 | 0 | 879 | 915k| 0 | 48 | 107 | 108 | 108 | 107 | 113 | 5 | 0 | 203 | 1.300000e+01 | -- | Inf
3.69/3.72 c 3.6s| 1 | 0 | 930 | 914k| 0 | 45 | 107 | 107 | 107 | 107 | 113 | 5 | 0 | 218 | 1.300000e+01 | -- | Inf
3.69/3.80 c 3.7s| 1 | 0 | 944 | 914k| 0 | 44 | 107 | 106 | 106 | 107 | 113 | 5 | 0 | 229 | 1.300000e+01 | -- | Inf
3.79/3.84 c 3.7s| 1 | 0 | 962 | 914k| 0 | 49 | 107 | 106 | 106 | 107 | 113 | 5 | 0 | 235 | 1.300000e+01 | -- | Inf
3.79/3.88 c 3.8s| 1 | 0 | 962 | 914k| 0 | - | 107 | 106 | 106 | 107 | 113 | 5 | 0 | 240 | 1.300000e+01 | -- | Inf
3.79/3.88 c (run 3, node 1) restarting after 24 global fixings of integer variables
3.79/3.88 c
3.79/3.88 (restart) converted 5 cuts from the global cut pool into linear constraints
3.79/3.88 c
3.79/3.88 presolving:
3.79/3.89 c (round 1) 24 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 5 upgd conss, 52 impls, 76 clqs
3.79/3.89 c presolving (2 rounds):
3.79/3.89 c 24 deleted vars, 8 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
3.79/3.89 c 52 implications, 76 cliques
3.79/3.89 c presolved problem has 83 variables (83 bin, 0 int, 0 impl, 0 cont) and 103 constraints
3.79/3.89 c 17 constraints of type <knapsack>
3.79/3.89 c 82 constraints of type <setppc>
3.79/3.89 c 4 constraints of type <logicor>
3.79/3.89 c transformed objective value is always integral (scale: 1)
3.79/3.89 c Presolving Time: 0.05
3.79/3.89 c
3.79/3.89 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.79/3.89 c 3.8s| 1 | 0 | 1018 | 794k| 0 | 43 | 83 | 103 | 103 | 83 | 103 | 0 | 0 | 240 | 1.300000e+01 | -- | Inf
3.89/3.91 c 3.8s| 1 | 0 | 1042 | 981k| 0 | 51 | 83 | 103 | 103 | 83 | 117 | 14 | 0 | 240 | 1.300000e+01 | -- | Inf
4.19/4.23 c 4.1s| 1 | 0 | 1080 | 980k| 0 | 49 | 83 | 102 | 102 | 83 | 117 | 14 | 0 | 270 | 1.300000e+01 | -- | Inf
4.29/4.36 c 4.2s| 1 | 0 | 1129 | 980k| 0 | 43 | 83 | 102 | 102 | 83 | 117 | 14 | 0 | 281 | 1.300000e+01 | -- | Inf
4.40/4.41 c 4.3s| 1 | 0 | 1144 | 978k| 0 | 43 | 83 | 99 | 99 | 83 | 117 | 14 | 0 | 287 | 1.300000e+01 | -- | Inf
4.40/4.45 c 4.3s| 1 | 0 | 1144 | 977k| 0 | - | 83 | 99 | 99 | 83 | 117 | 14 | 0 | 294 | 1.300000e+01 | -- | Inf
4.40/4.45 c (run 4, node 1) restarting after 20 global fixings of integer variables
4.40/4.45 c
4.40/4.45 (restart) converted 14 cuts from the global cut pool into linear constraints
4.40/4.45 c
4.40/4.45 presolving:
4.40/4.45 c (round 1) 25 del vars, 6 del conss, 0 chg bounds, 4 chg sides, 13 chg coeffs, 0 upgd conss, 90 impls, 58 clqs
4.40/4.46 c (round 2) 26 del vars, 7 del conss, 0 chg bounds, 4 chg sides, 15 chg coeffs, 14 upgd conss, 94 impls, 58 clqs
4.40/4.46 c (round 3) 26 del vars, 15 del conss, 0 chg bounds, 4 chg sides, 17 chg coeffs, 14 upgd conss, 94 impls, 58 clqs
4.40/4.46 c presolving (4 rounds):
4.40/4.46 c 26 deleted vars, 15 deleted constraints, 0 tightened bounds, 0 added holes, 4 changed sides, 17 changed coefficients
4.40/4.46 c 94 implications, 58 cliques
4.40/4.46 c presolved problem has 57 variables (57 bin, 0 int, 0 impl, 0 cont) and 98 constraints
4.40/4.46 c 26 constraints of type <knapsack>
4.40/4.46 c 69 constraints of type <setppc>
4.40/4.46 c 3 constraints of type <logicor>
4.40/4.46 c transformed objective value is always integral (scale: 1)
4.40/4.46 c Presolving Time: 0.07
4.40/4.46 c
4.40/4.47 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.40/4.47 c 4.3s| 1 | 0 | 1203 | 796k| 0 | 35 | 57 | 98 | 98 | 57 | 97 | 0 | 0 | 294 | 1.300000e+01 | -- | Inf
4.40/4.48 c 4.4s| 1 | 0 | 1258 | 842k| 0 | 34 | 57 | 98 | 98 | 57 | 101 | 4 | 0 | 294 | 1.300000e+01 | -- | Inf
4.49/4.51 c 4.4s| 1 | 0 | 1313 | 828k| 0 | 4 | 57 | 62 | 62 | 57 | 101 | 4 | 0 | 299 | 1.300000e+01 | -- | Inf
4.49/4.51 c 4.4s| 1 | 0 | 1313 | 828k| 0 | - | 57 | 62 | 62 | 57 | 101 | 4 | 0 | 303 | 1.300000e+01 | -- | Inf
4.49/4.51 c (run 5, node 1) restarting after 37 global fixings of integer variables
4.49/4.51 c
4.49/4.51 (restart) converted 4 cuts from the global cut pool into linear constraints
4.49/4.52 c
4.49/4.52 presolving:
4.49/4.52 c (round 1) 57 del vars, 29 del conss, 2 chg bounds, 11 chg sides, 48 chg coeffs, 0 upgd conss, 102 impls, 0 clqs
4.49/4.52 c presolving (2 rounds):
4.49/4.52 c 57 deleted vars, 66 deleted constraints, 2 tightened bounds, 0 added holes, 11 changed sides, 48 changed coefficients
4.49/4.52 c 102 implications, 0 cliques
4.49/4.52 c presolved problem has 0 variables (0 bin, 0 int, 0 impl, 0 cont) and 0 constraints
4.49/4.52 c transformed objective value is always integral (scale: 1)
4.49/4.52 c Presolving Time: 0.07
4.49/4.52 c
4.49/4.52 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.49/4.52 c 4.4s| 1 | 0 | 1313 | 568k| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 303 | 1.300000e+01 | -- | Inf
4.49/4.52 c * 4.4s| 1 | 0 | 1313 | 568k| 0 | - | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 303 | 1.300000e+01 | 1.300000e+01 | 0.00%
4.49/4.52 c
4.49/4.52 c SCIP Status : problem is solved [optimal solution found]
4.49/4.52 c Solving Time (sec) : 4.39
4.49/4.52 c Solving Nodes : 1 (total of 6 nodes in 6 runs)
4.49/4.52 c Primal Bound : +1.30000000000000e+01 (1 solutions)
4.49/4.52 c Dual Bound : +1.30000000000000e+01
4.49/4.52 c Gap : 0.00 %
4.49/4.52 c NODE 1
4.49/4.52 c DUAL BOUND 13
4.49/4.52 c PRIMAL BOUND 13
4.49/4.52 c GAP 0
4.49/4.52 s SATISFIABLE
4.49/4.52 v x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
4.49/4.52 v x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 x132 -x131 -x130 -x129 x128 -x127
4.49/4.52 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 x110 -x109 -x108 -x107 -x106
4.49/4.52 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.49/4.52 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.49/4.52 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.49/4.52 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.49/4.52 v -x4 -x3 -x2 -x1
4.49/4.52 c SCIP Status : problem is solved [optimal solution found]
4.49/4.52 c Solving Time : 4.39
4.49/4.52 c Original Problem :
4.49/4.52 c Problem name : HOME/instance-1868102-1245115708.opb
4.49/4.52 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
4.49/4.52 c Constraints : 101 initial, 101 maximal
4.49/4.52 c Presolved Problem :
4.49/4.52 c Problem name : t_HOME/instance-1868102-1245115708.opb
4.49/4.52 c Variables : 0 (0 binary, 0 integer, 0 implicit integer, 0 continuous)
4.49/4.52 c Constraints : 0 initial, 0 maximal
4.49/4.52 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.49/4.52 c trivial : 0.00 143 0 0 0 0 0 0 0
4.49/4.52 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.49/4.52 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.49/4.52 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.49/4.52 c implics : 0.00 0 0 0 0 0 0 0 0
4.49/4.52 c probing : 0.00 0 0 0 0 0 0 0 0
4.49/4.52 c knapsack : 0.04 0 0 0 0 0 26 14 65
4.49/4.52 c setppc : 0.02 13 8 0 0 0 61 0 0
4.49/4.52 c linear : 0.01 5 0 0 2 0 33 2 0
4.49/4.52 c logicor : 0.00 0 0 0 0 0 5 0 0
4.49/4.52 c root node : - 143 - - 143 - - - -
4.49/4.52 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.49/4.52 c integral : 0 0 0 25 0 0 115 0 0 0
4.49/4.52 c countsols : 0 0 0 1 0 0 0 0 0 0
4.49/4.52 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.49/4.52 c integral : 4.09 0.00 0.00 4.09 0.00
4.49/4.52 c countsols : 0.00 0.00 0.00 0.00 0.00
4.49/4.52 c Propagators : Time Calls Cutoffs DomReds
4.49/4.52 c rootredcost : 0.00 0 0 0
4.49/4.52 c pseudoobj : 0.00 31 0 0
4.49/4.52 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.49/4.52 c propagation : 0.00 0 0 0 0.0 0 0.0 -
4.49/4.52 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
4.49/4.52 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.49/4.52 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.49/4.52 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.49/4.52 c applied globally : - - - 0 0.0 - - -
4.49/4.52 c applied locally : - - - 0 0.0 - - -
4.49/4.52 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.49/4.52 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
4.49/4.52 c redcost : 0.00 9 0 0 0 0
4.49/4.52 c impliedbounds : 0.00 9 0 0 0 0
4.49/4.52 c intobj : 0.00 0 0 0 0 0
4.49/4.52 c gomory : 0.07 9 0 0 32 0
4.49/4.52 c strongcg : 0.04 9 0 0 331 0
4.49/4.52 c cmir : 0.00 0 0 0 0 0
4.49/4.52 c flowcover : 0.00 0 0 0 0 0
4.49/4.52 c clique : 0.01 10 0 0 48 0
4.49/4.52 c zerohalf : 0.00 0 0 0 0 0
4.49/4.52 c mcf : 0.00 5 0 0 0 0
4.49/4.52 c Pricers : Time Calls Vars
4.49/4.52 c problem variables: 0.00 0 0
4.49/4.52 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.49/4.52 c relpscost : 4.09 24 0 115 0 0 0
4.49/4.52 c pscost : 0.00 0 0 0 0 0 0
4.49/4.52 c inference : 0.00 0 0 0 0 0 0
4.49/4.52 c mostinf : 0.00 0 0 0 0 0 0
4.49/4.52 c leastinf : 0.00 0 0 0 0 0 0
4.49/4.52 c fullstrong : 0.00 0 0 0 0 0 0
4.49/4.52 c allfullstrong : 0.00 0 0 0 0 0 0
4.49/4.52 c random : 0.00 0 0 0 0 0 0
4.49/4.52 c Primal Heuristics : Time Calls Found
4.49/4.52 c LP solutions : 0.00 - 1
4.49/4.52 c pseudo solutions : 0.00 - 0
4.49/4.52 c simplerounding : 0.00 0 0
4.49/4.52 c rounding : 0.00 0 0
4.49/4.52 c shifting : 0.00 0 0
4.49/4.52 c intshifting : 0.00 0 0
4.49/4.52 c oneopt : 0.00 0 0
4.49/4.52 c fixandinfer : 0.00 0 0
4.49/4.52 c feaspump : 0.00 0 0
4.49/4.52 c coefdiving : 0.00 0 0
4.49/4.52 c pscostdiving : 0.00 0 0
4.49/4.52 c fracdiving : 0.00 0 0
4.49/4.52 c veclendiving : 0.00 0 0
4.49/4.52 c intdiving : 0.00 0 0
4.49/4.52 c actconsdiving : 0.00 0 0
4.49/4.52 c objpscostdiving : 0.00 0 0
4.49/4.52 c rootsoldiving : 0.00 0 0
4.49/4.52 c linesearchdiving : 0.00 0 0
4.49/4.52 c guideddiving : 0.00 0 0
4.49/4.52 c octane : 0.00 0 0
4.49/4.52 c rens : 0.00 0 0
4.49/4.52 c rins : 0.00 0 0
4.49/4.52 c localbranching : 0.00 0 0
4.49/4.52 c mutation : 0.00 0 0
4.49/4.52 c crossover : 0.00 0 0
4.49/4.52 c dins : 0.00 0 0
4.49/4.52 c LP : Time Calls Iterations Iter/call Iter/sec
4.49/4.52 c primal LP : 0.00 0 0 0.00 -
4.49/4.52 c dual LP : 0.09 33 1313 39.79 14588.89
4.49/4.52 c barrier LP : 0.00 0 0 0.00 -
4.49/4.52 c diving/probing LP: 0.00 0 0 0.00 -
4.49/4.52 c strong branching : 4.09 303 40762 134.53 9966.26
4.49/4.52 c (at root node) : - 303 40762 134.53 -
4.49/4.52 c conflict analysis: 0.00 0 0 0.00 -
4.49/4.52 c B&B Tree :
4.49/4.52 c number of runs : 6
4.49/4.52 c nodes : 1
4.49/4.52 c nodes (total) : 6
4.49/4.52 c nodes left : 0
4.49/4.52 c max depth : 0
4.49/4.52 c max depth (total): 0
4.49/4.52 c backtracks : 0 (0.0%)
4.49/4.52 c delayed cutoffs : 0
4.49/4.52 c repropagations : 0 (0 domain reductions, 0 cutoffs)
4.49/4.52 c avg switch length: 2.00
4.49/4.52 c switching time : 0.00
4.49/4.52 c Solution :
4.49/4.52 c Solutions found : 1 (1 improvements)
4.49/4.52 c Primal Bound : +1.30000000000000e+01 (in run 6, after 1 nodes, 4.39 seconds, depth 0, found by <relaxation>)
4.49/4.52 c Dual Bound : +1.30000000000000e+01
4.49/4.52 c Gap : 0.00 %
4.49/4.52 c Root Dual Bound : +1.30000000000000e+01
4.49/4.53 c Time complete: 4.52.