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-1868010-1245115250.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.00
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.02 c heuristics/guideddiving/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/fracdiving/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/fracdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <fracdiving> (-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/fracdiving/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/feaspump/maxlpiterofs = c 2000
0.00/0.02 c # frequency for calling primal heuristic <feaspump> (-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/feaspump/freq = c -1
0.00/0.02 c # minimum percentage of integer variables that have to be fixed
0.00/0.02 c # [type: real, range: [0,1], default: 0.666]
0.00/0.02 c heuristics/crossover/minfixingrate = c 0.5
0.00/0.02 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.02 c # [type: real, range: [0,1], default: 0.1]
0.00/0.02 c heuristics/crossover/nodesquot = c 0.15
0.00/0.02 c # number of nodes without incumbent change that heuristic should wait
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.02 c heuristics/crossover/nwaitingnodes = c 100
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/crossover/nodesofs = c 750
0.00/0.02 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.02 c heuristics/crossover/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/coefdiving/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/coefdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <coefdiving> (-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/coefdiving/freq = c -1
0.00/0.02 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c presolving/probing/maxrounds = c 0
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.02 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.02 c constraints/knapsack/disaggregation = c FALSE
0.00/0.02 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c constraints/knapsack/maxnumcardlift = c 0
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = c TRUE
0.00/0.02 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/maxroundsroot = c 5
0.00/0.02 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.02 c separating/maxrounds = c 1
0.00/0.02 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c limits/solutions = c 1
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = c 1620
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = c 1791
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = c 10000
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving problem
0.00/0.02 c
0.02/0.03 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.02/0.03 c 0.0s| 1 | 0 | 129 | 593k| 0 | 40 | 169 | 73 | 73 | 169 | 73 | 0 | 0 | 0 | 1.300000e+01 | -- | Inf
0.02/0.05 c 0.0s| 1 | 0 | 160 | 801k| 0 | 47 | 169 | 73 | 73 | 169 | 83 | 10 | 0 | 0 | 1.300000e+01 | -- | Inf
0.02/0.06 c 0.1s| 1 | 0 | 191 | 916k| 0 | 51 | 169 | 73 | 73 | 169 | 88 | 15 | 0 | 0 | 1.300000e+01 | -- | Inf
0.02/0.08 c 0.1s| 1 | 0 | 213 | 989k| 0 | 52 | 169 | 73 | 73 | 169 | 94 | 21 | 0 | 0 | 1.300000e+01 | -- | Inf
0.02/0.10 c 0.1s| 1 | 0 | 234 |1015k| 0 | 52 | 169 | 73 | 73 | 169 | 96 | 23 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.12 c 0.1s| 1 | 0 | 271 |1038k| 0 | 55 | 169 | 73 | 73 | 169 | 101 | 28 | 0 | 0 | 1.300000e+01 | -- | Inf
0.59/0.65 c 0.6s| 1 | 0 | 287 |1038k| 0 | 56 | 169 | 73 | 73 | 169 | 101 | 28 | 0 | 34 | 1.300000e+01 | -- | Inf
0.89/0.91 c 0.9s| 1 | 0 | 310 |1038k| 0 | 58 | 169 | 73 | 73 | 169 | 101 | 28 | 0 | 49 | 1.300000e+01 | -- | Inf
1.00/1.01 c 1.0s| 1 | 0 | 330 |1038k| 0 | 55 | 169 | 73 | 73 | 169 | 101 | 28 | 0 | 55 | 1.300000e+01 | -- | Inf
1.10/1.17 c 1.1s| 1 | 0 | 345 |1038k| 0 | 57 | 169 | 73 | 73 | 169 | 101 | 28 | 0 | 65 | 1.300000e+01 | -- | Inf
1.19/1.28 c 1.2s| 1 | 0 | 361 |1038k| 0 | 58 | 169 | 73 | 73 | 169 | 101 | 28 | 0 | 71 | 1.300000e+01 | -- | Inf
1.28/1.38 c 1.3s| 1 | 0 | 374 |1038k| 0 | 56 | 169 | 72 | 72 | 169 | 99 | 28 | 0 | 77 | 1.300000e+01 | -- | Inf
1.39/1.46 c 1.4s| 1 | 0 | 382 |1038k| 0 | 58 | 169 | 72 | 72 | 169 | 99 | 28 | 0 | 82 | 1.300000e+01 | -- | Inf
1.49/1.57 c 1.5s| 1 | 0 | 382 |1038k| 0 | - | 169 | 72 | 72 | 169 | 99 | 28 | 0 | 89 | 1.300000e+01 | -- | Inf
1.49/1.57 c (run 1, node 1) restarting after 36 global fixings of integer variables
1.49/1.57 c
1.49/1.57 (restart) converted 26 cuts from the global cut pool into linear constraints
1.49/1.58 c
1.49/1.58 presolving:
1.49/1.58 c (round 1) 36 del vars, 1 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 12 impls, 83 clqs
1.49/1.58 c (round 2) 36 del vars, 1 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 25 upgd conss, 12 impls, 83 clqs
1.49/1.59 c (round 3) 36 del vars, 2 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 25 upgd conss, 12 impls, 83 clqs
1.49/1.59 c presolving (4 rounds):
1.49/1.59 c 36 deleted vars, 2 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
1.49/1.59 c 12 implications, 83 cliques
1.49/1.59 c presolved problem has 133 variables (133 bin, 0 int, 0 impl, 0 cont) and 96 constraints
1.49/1.59 c 9 constraints of type <knapsack>
1.49/1.59 c 83 constraints of type <setppc>
1.49/1.59 c 4 constraints of type <logicor>
1.49/1.59 c transformed objective value is always integral (scale: 1)
1.49/1.59 c Presolving Time: 0.01
1.49/1.59 c
1.49/1.59 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.49/1.59 c 1.6s| 1 | 0 | 502 | 734k| 0 | 45 | 133 | 96 | 96 | 133 | 96 | 0 | 0 | 89 | 1.300000e+01 | -- | Inf
1.59/1.62 c 1.6s| 1 | 0 | 532 | 979k| 0 | 51 | 133 | 96 | 96 | 133 | 109 | 13 | 0 | 89 | 1.300000e+01 | -- | Inf
1.89/1.91 c 1.9s| 1 | 0 | 540 | 978k| 0 | 50 | 133 | 96 | 96 | 133 | 109 | 13 | 0 | 136 | 1.300000e+01 | -- | Inf
1.89/1.98 c 1.9s| 1 | 0 | 550 | 978k| 0 | 52 | 133 | 95 | 95 | 133 | 109 | 13 | 0 | 144 | 1.300000e+01 | -- | Inf
1.99/2.04 c 2.0s| 1 | 0 | 555 | 978k| 0 | 52 | 133 | 95 | 95 | 133 | 109 | 13 | 0 | 150 | 1.300000e+01 | -- | Inf
2.09/2.11 c 2.0s| 1 | 0 | 561 | 977k| 0 | 52 | 133 | 95 | 95 | 133 | 109 | 13 | 0 | 157 | 1.300000e+01 | -- | Inf
2.09/2.17 c 2.1s| 1 | 0 | 569 | 977k| 0 | 52 | 133 | 95 | 95 | 133 | 109 | 13 | 0 | 162 | 1.300000e+01 | -- | Inf
2.19/2.23 c 2.2s| 1 | 0 | 569 | 977k| 0 | - | 133 | 95 | 95 | 133 | 109 | 13 | 0 | 169 | 1.300000e+01 | -- | Inf
2.19/2.23 c (run 2, node 1) restarting after 30 global fixings of integer variables
2.19/2.23 c
2.19/2.23 (restart) converted 13 cuts from the global cut pool into linear constraints
2.19/2.23 c
2.19/2.23 presolving:
2.19/2.24 c (round 1) 30 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 13 upgd conss, 22 impls, 83 clqs
2.19/2.24 c (round 2) 30 del vars, 6 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 13 upgd conss, 22 impls, 83 clqs
2.19/2.24 c presolving (3 rounds):
2.19/2.24 c 30 deleted vars, 6 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.19/2.24 c 22 implications, 83 cliques
2.19/2.24 c presolved problem has 103 variables (103 bin, 0 int, 0 impl, 0 cont) and 102 constraints
2.19/2.24 c 17 constraints of type <knapsack>
2.19/2.24 c 83 constraints of type <setppc>
2.19/2.24 c 2 constraints of type <logicor>
2.19/2.24 c transformed objective value is always integral (scale: 1)
2.19/2.24 c Presolving Time: 0.02
2.19/2.24 c
2.19/2.25 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.19/2.25 c 2.2s| 1 | 0 | 655 | 780k| 0 | 47 | 103 | 102 | 102 | 103 | 102 | 0 | 0 | 169 | 1.300000e+01 | -- | Inf
2.19/2.27 c 2.2s| 1 | 0 | 714 | 997k| 0 | 51 | 103 | 102 | 102 | 103 | 111 | 9 | 0 | 169 | 1.300000e+01 | -- | Inf
2.79/2.86 c 2.8s| 1 | 0 | 747 | 997k| 0 | 48 | 103 | 101 | 101 | 103 | 111 | 9 | 0 | 212 | 1.300000e+01 | -- | Inf
2.89/2.96 c 2.9s| 1 | 0 | 754 | 997k| 0 | 48 | 103 | 101 | 101 | 103 | 111 | 9 | 0 | 222 | 1.300000e+01 | -- | Inf
2.99/3.01 c 2.9s| 1 | 0 | 764 | 996k| 0 | 48 | 103 | 100 | 100 | 103 | 111 | 9 | 0 | 229 | 1.300000e+01 | -- | Inf
2.99/3.05 c 3.0s| 1 | 0 | 768 | 996k| 0 | 49 | 103 | 100 | 100 | 103 | 111 | 9 | 0 | 234 | 1.300000e+01 | -- | Inf
2.99/3.09 c 3.0s| 1 | 0 | 778 | 996k| 0 | 49 | 103 | 100 | 100 | 103 | 111 | 9 | 0 | 238 | 1.300000e+01 | -- | Inf
3.09/3.15 c 3.1s| 1 | 0 | 778 | 996k| 0 | - | 103 | 100 | 100 | 103 | 111 | 9 | 0 | 245 | 1.300000e+01 | -- | Inf
3.09/3.15 c (run 3, node 1) restarting after 24 global fixings of integer variables
3.09/3.15 c
3.09/3.15 (restart) converted 9 cuts from the global cut pool into linear constraints
3.09/3.15 c
3.09/3.15 presolving:
3.09/3.16 c (round 1) 24 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 34 impls, 82 clqs
3.09/3.16 c (round 2) 24 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 34 impls, 82 clqs
3.09/3.16 c presolving (3 rounds):
3.09/3.16 c 24 deleted vars, 3 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
3.09/3.16 c 34 implications, 82 cliques
3.09/3.16 c presolved problem has 79 variables (79 bin, 0 int, 0 impl, 0 cont) and 106 constraints
3.09/3.16 c 21 constraints of type <knapsack>
3.09/3.16 c 84 constraints of type <setppc>
3.09/3.16 c 1 constraints of type <logicor>
3.09/3.16 c transformed objective value is always integral (scale: 1)
3.09/3.16 c Presolving Time: 0.03
3.09/3.16 c
3.09/3.17 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.09/3.17 c 3.1s| 1 | 0 | 842 | 777k| 0 | 44 | 79 | 106 | 106 | 79 | 106 | 0 | 0 | 245 | 1.300000e+01 | -- | Inf
3.09/3.19 c 3.1s| 1 | 0 | 860 |1007k| 0 | 49 | 79 | 106 | 106 | 79 | 113 | 7 | 0 | 245 | 1.300000e+01 | -- | Inf
3.38/3.45 c 3.4s| 1 | 0 | 870 |1007k| 0 | 49 | 79 | 106 | 106 | 79 | 113 | 7 | 0 | 283 | 1.300000e+01 | -- | Inf
3.49/3.57 c 3.5s| 1 | 0 | 876 |1007k| 0 | 48 | 79 | 106 | 106 | 79 | 113 | 7 | 0 | 298 | 1.300000e+01 | -- | Inf
3.59/3.61 c 3.5s| 1 | 0 | 882 |1006k| 0 | 46 | 79 | 105 | 105 | 79 | 113 | 7 | 0 | 304 | 1.300000e+01 | -- | Inf
3.59/3.64 c 3.5s| 1 | 0 | 889 |1006k| 0 | 47 | 79 | 105 | 105 | 79 | 113 | 7 | 0 | 308 | 1.300000e+01 | -- | Inf
3.59/3.68 c 3.6s| 1 | 0 | 889 |1006k| 0 | - | 79 | 105 | 105 | 79 | 113 | 7 | 0 | 313 | 1.300000e+01 | -- | Inf
3.59/3.68 c (run 4, node 1) restarting after 18 global fixings of integer variables
3.59/3.68 c
3.59/3.68 (restart) converted 7 cuts from the global cut pool into linear constraints
3.59/3.68 c
3.59/3.68 presolving:
3.59/3.69 c (round 1) 18 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 7 upgd conss, 58 impls, 70 clqs
3.59/3.69 c (round 2) 18 del vars, 9 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 7 upgd conss, 58 impls, 70 clqs
3.59/3.69 c presolving (3 rounds):
3.59/3.69 c 18 deleted vars, 9 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
3.59/3.69 c 58 implications, 70 cliques
3.59/3.69 c presolved problem has 61 variables (61 bin, 0 int, 0 impl, 0 cont) and 103 constraints
3.59/3.69 c 25 constraints of type <knapsack>
3.59/3.69 c 76 constraints of type <setppc>
3.59/3.69 c 2 constraints of type <logicor>
3.59/3.69 c transformed objective value is always integral (scale: 1)
3.59/3.69 c Presolving Time: 0.04
3.59/3.69 c
3.59/3.70 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.59/3.70 c 3.6s| 1 | 0 | 945 | 771k| 0 | 41 | 61 | 103 | 103 | 61 | 103 | 0 | 0 | 313 | 1.300000e+01 | -- | Inf
3.69/3.71 c 3.6s| 1 | 0 | 959 |1026k| 0 | 48 | 61 | 103 | 103 | 61 | 114 | 11 | 0 | 313 | 1.300000e+01 | -- | Inf
3.78/3.80 c 3.7s| 1 | 0 | 987 |1026k| 0 | 49 | 61 | 102 | 102 | 61 | 114 | 11 | 0 | 327 | 1.300000e+01 | -- | Inf
3.88/3.93 c 3.8s| 1 | 0 | 1094 |1024k| 0 | 39 | 61 | 101 | 101 | 61 | 114 | 11 | 0 | 335 | 1.300000e+01 | -- | Inf
3.88/3.93 c 3.8s| 1 | 0 | 1094 |1024k| 0 | 39 | 61 | 101 | 101 | 61 | 114 | 11 | 0 | 336 | -- | -- | 0.00%
3.88/3.93 c
3.88/3.93 c SCIP Status : problem is solved [infeasible]
3.88/3.93 c Solving Time (sec) : 3.82
3.88/3.93 c Solving Nodes : 1 (total of 5 nodes in 5 runs)
3.88/3.93 c Primal Bound : +1.00000000000000e+20 (0 solutions)
3.88/3.93 c Dual Bound : +1.00000000000000e+20
3.88/3.93 c Gap : 0.00 %
3.88/3.93 c NODE 1
3.88/3.93 c DUAL BOUND 1e+20
3.88/3.93 c PRIMAL BOUND 1e+20
3.88/3.93 c GAP 0
3.88/3.93 s UNSATISFIABLE
3.88/3.93 c SCIP Status : problem is solved [infeasible]
3.88/3.93 c Solving Time : 3.82
3.88/3.93 c Original Problem :
3.88/3.93 c Problem name : HOME/instance-1868010-1245115250.opb
3.88/3.93 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
3.88/3.93 c Constraints : 101 initial, 101 maximal
3.88/3.93 c Presolved Problem :
3.88/3.93 c Problem name : t_HOME/instance-1868010-1245115250.opb
3.88/3.93 c Variables : 61 (61 binary, 0 integer, 0 implicit integer, 0 continuous)
3.88/3.93 c Constraints : 103 initial, 103 maximal
3.88/3.93 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.88/3.93 c trivial : 0.00 108 0 0 0 0 0 0 0
3.88/3.93 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.88/3.93 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.88/3.93 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.88/3.93 c implics : 0.00 0 0 0 0 0 0 0 0
3.88/3.93 c probing : 0.00 0 0 0 0 0 0 0 0
3.88/3.93 c knapsack : 0.02 0 0 0 0 0 0 0 1
3.88/3.93 c setppc : 0.00 0 0 0 0 0 15 0 0
3.88/3.93 c linear : 0.01 0 0 0 0 0 29 1 0
3.88/3.93 c logicor : 0.00 0 0 0 0 0 4 0 0
3.88/3.93 c root node : - 118 - - 118 - - - -
3.88/3.93 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.88/3.93 c integral : 0 0 0 28 0 1 118 0 0 0
3.88/3.93 c knapsack : 25 9 28 0 0 0 0 0 0 0
3.88/3.93 c setppc : 76 9 28 0 0 0 0 0 0 0
3.88/3.93 c logicor : 2 9 5 0 0 0 0 0 0 0
3.88/3.93 c countsols : 0 0 0 0 0 0 0 0 0 0
3.88/3.93 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.88/3.93 c integral : 3.53 0.00 0.00 3.53 0.00
3.88/3.93 c knapsack : 0.00 0.00 0.00 0.00 0.00
3.88/3.93 c setppc : 0.00 0.00 0.00 0.00 0.00
3.88/3.93 c logicor : 0.00 0.00 0.00 0.00 0.00
3.88/3.93 c countsols : 0.00 0.00 0.00 0.00 0.00
3.88/3.93 c Propagators : Time Calls Cutoffs DomReds
3.88/3.93 c rootredcost : 0.00 0 0 0
3.88/3.93 c pseudoobj : 0.00 33 0 0
3.88/3.93 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.88/3.93 c propagation : 0.00 0 0 0 0.0 0 0.0 -
3.88/3.93 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.88/3.93 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.88/3.93 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.88/3.93 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.88/3.93 c applied globally : - - - 0 0.0 - - -
3.88/3.93 c applied locally : - - - 0 0.0 - - -
3.88/3.93 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.88/3.93 c cut pool : 0.00 0 - - 0 - (maximal pool size: 148)
3.88/3.93 c redcost : 0.00 9 0 0 0 0
3.88/3.93 c impliedbounds : 0.00 9 0 0 0 0
3.88/3.93 c intobj : 0.00 0 0 0 0 0
3.88/3.93 c gomory : 0.07 9 0 0 107 0
3.88/3.93 c strongcg : 0.06 9 0 0 443 0
3.88/3.93 c cmir : 0.00 0 0 0 0 0
3.88/3.93 c flowcover : 0.00 0 0 0 0 0
3.88/3.93 c clique : 0.00 9 0 0 38 0
3.88/3.93 c zerohalf : 0.00 0 0 0 0 0
3.88/3.93 c mcf : 0.00 5 0 0 0 0
3.88/3.93 c Pricers : Time Calls Vars
3.88/3.93 c problem variables: 0.00 0 0
3.88/3.93 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.88/3.93 c relpscost : 3.53 28 1 118 0 0 0
3.88/3.93 c pscost : 0.00 0 0 0 0 0 0
3.88/3.93 c inference : 0.00 0 0 0 0 0 0
3.88/3.93 c mostinf : 0.00 0 0 0 0 0 0
3.88/3.93 c leastinf : 0.00 0 0 0 0 0 0
3.88/3.93 c fullstrong : 0.00 0 0 0 0 0 0
3.88/3.93 c allfullstrong : 0.00 0 0 0 0 0 0
3.88/3.93 c random : 0.00 0 0 0 0 0 0
3.88/3.93 c Primal Heuristics : Time Calls Found
3.88/3.93 c LP solutions : 0.00 - 0
3.88/3.93 c pseudo solutions : 0.00 - 0
3.88/3.93 c simplerounding : 0.00 0 0
3.88/3.93 c rounding : 0.00 0 0
3.88/3.93 c shifting : 0.00 0 0
3.88/3.93 c intshifting : 0.00 0 0
3.88/3.93 c oneopt : 0.00 0 0
3.88/3.93 c fixandinfer : 0.00 0 0
3.88/3.93 c feaspump : 0.00 0 0
3.88/3.93 c coefdiving : 0.00 0 0
3.88/3.93 c pscostdiving : 0.00 0 0
3.88/3.93 c fracdiving : 0.00 0 0
3.88/3.93 c veclendiving : 0.00 0 0
3.88/3.93 c intdiving : 0.00 0 0
3.88/3.93 c actconsdiving : 0.00 0 0
3.88/3.93 c objpscostdiving : 0.00 0 0
3.88/3.93 c rootsoldiving : 0.00 0 0
3.88/3.93 c linesearchdiving : 0.00 0 0
3.88/3.93 c guideddiving : 0.00 0 0
3.88/3.93 c octane : 0.00 0 0
3.88/3.93 c rens : 0.00 0 0
3.88/3.93 c rins : 0.00 0 0
3.88/3.93 c localbranching : 0.00 0 0
3.88/3.93 c mutation : 0.00 0 0
3.88/3.93 c crossover : 0.00 0 0
3.88/3.93 c dins : 0.00 0 0
3.88/3.93 c LP : Time Calls Iterations Iter/call Iter/sec
3.88/3.93 c primal LP : 0.00 0 0 0.00 -
3.88/3.93 c dual LP : 0.10 37 1094 29.57 10940.00
3.88/3.93 c barrier LP : 0.00 0 0 0.00 -
3.88/3.93 c diving/probing LP: 0.00 0 0 0.00 -
3.88/3.93 c strong branching : 3.53 336 38155 113.56 10808.78
3.88/3.93 c (at root node) : - 336 38155 113.56 -
3.88/3.93 c conflict analysis: 0.00 0 0 0.00 -
3.88/3.93 c B&B Tree :
3.88/3.93 c number of runs : 5
3.88/3.93 c nodes : 1
3.88/3.93 c nodes (total) : 5
3.88/3.93 c nodes left : 0
3.88/3.93 c max depth : 0
3.88/3.93 c max depth (total): 0
3.88/3.93 c backtracks : 0 (0.0%)
3.88/3.93 c delayed cutoffs : 0
3.88/3.93 c repropagations : 0 (0 domain reductions, 0 cutoffs)
3.88/3.93 c avg switch length: 2.00
3.88/3.93 c switching time : 0.00
3.88/3.93 c Solution :
3.88/3.93 c Solutions found : 0 (0 improvements)
3.88/3.93 c Primal Bound : infeasible
3.88/3.93 c Dual Bound : -
3.88/3.93 c Gap : 0.00 %
3.88/3.93 c Root Dual Bound : -
3.88/3.94 c Time complete: 3.94.