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-1868116-1245115744.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.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.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 | 168 | 593k| 0 | 42 | 169 | 73 | 73 | 169 | 73 | 0 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.05 c 0.0s| 1 | 0 | 216 | 881k| 0 | 51 | 169 | 73 | 73 | 169 | 83 | 10 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.07 c 0.1s| 1 | 0 | 255 | 916k| 0 | 55 | 169 | 73 | 73 | 169 | 91 | 18 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.09 c 0.1s| 1 | 0 | 291 | 965k| 0 | 56 | 169 | 73 | 73 | 169 | 97 | 24 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.11 c 0.1s| 1 | 0 | 333 |1019k| 0 | 58 | 169 | 73 | 73 | 169 | 102 | 29 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.14 c 0.1s| 1 | 0 | 378 |1077k| 0 | 55 | 169 | 73 | 73 | 169 | 106 | 33 | 0 | 0 | 1.300000e+01 | -- | Inf
0.69/0.77 c 0.7s| 1 | 0 | 391 |1077k| 0 | 55 | 169 | 73 | 73 | 169 | 106 | 33 | 0 | 34 | 1.300000e+01 | -- | Inf
0.99/1.09 c 1.1s| 1 | 0 | 408 |1077k| 0 | 55 | 169 | 73 | 73 | 169 | 106 | 33 | 0 | 50 | 1.300000e+01 | -- | Inf
1.20/1.28 c 1.2s| 1 | 0 | 444 |1077k| 0 | 51 | 169 | 73 | 73 | 169 | 106 | 33 | 0 | 61 | 1.300000e+01 | -- | Inf
1.39/1.41 c 1.4s| 1 | 0 | 465 |1077k| 0 | 53 | 169 | 73 | 73 | 169 | 106 | 33 | 0 | 68 | 1.300000e+01 | -- | Inf
1.39/1.49 c 1.4s| 1 | 0 | 473 |1077k| 0 | 50 | 169 | 73 | 73 | 169 | 106 | 33 | 0 | 73 | 1.300000e+01 | -- | Inf
1.49/1.55 c 1.5s| 1 | 0 | 480 |1077k| 0 | 50 | 169 | 73 | 73 | 169 | 106 | 33 | 0 | 76 | 1.300000e+01 | -- | Inf
1.59/1.60 c 1.6s| 1 | 0 | 487 |1077k| 0 | 51 | 169 | 73 | 73 | 169 | 106 | 33 | 0 | 79 | 1.300000e+01 | -- | Inf
1.59/1.68 c 1.6s| 1 | 0 | 496 |1077k| 0 | 51 | 169 | 73 | 73 | 169 | 106 | 33 | 0 | 84 | 1.300000e+01 | -- | Inf
1.69/1.75 c 1.7s| 1 | 0 | 510 |1077k| 0 | 51 | 169 | 73 | 73 | 169 | 106 | 33 | 0 | 88 | 1.300000e+01 | -- | Inf
1.79/1.83 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.79/1.83 c 1.8s| 1 | 0 | 510 |1077k| 0 | - | 169 | 73 | 73 | 169 | 106 | 33 | 0 | 93 | 1.300000e+01 | -- | Inf
1.79/1.83 c (run 1, node 1) restarting after 38 global fixings of integer variables
1.79/1.83 c
1.79/1.83 (restart) converted 33 cuts from the global cut pool into linear constraints
1.79/1.83 c
1.79/1.83 presolving:
1.79/1.83 c (round 1) 38 del vars, 1 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 14 impls, 87 clqs
1.79/1.84 c (round 2) 38 del vars, 1 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 32 upgd conss, 14 impls, 87 clqs
1.79/1.84 c (round 3) 38 del vars, 3 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 32 upgd conss, 14 impls, 87 clqs
1.79/1.84 c presolving (4 rounds):
1.79/1.84 c 38 deleted vars, 3 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
1.79/1.84 c 14 implications, 87 cliques
1.79/1.84 c presolved problem has 131 variables (131 bin, 0 int, 0 impl, 0 cont) and 103 constraints
1.79/1.84 c 12 constraints of type <knapsack>
1.79/1.84 c 85 constraints of type <setppc>
1.79/1.84 c 6 constraints of type <logicor>
1.79/1.84 c transformed objective value is always integral (scale: 1)
1.79/1.84 c Presolving Time: 0.02
1.79/1.84 c
1.79/1.85 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.79/1.85 c 1.8s| 1 | 0 | 612 | 806k| 0 | 49 | 131 | 103 | 103 | 131 | 103 | 0 | 0 | 93 | 1.300000e+01 | -- | Inf
1.79/1.88 c 1.8s| 1 | 0 | 639 |1037k| 0 | 49 | 131 | 103 | 103 | 131 | 113 | 10 | 0 | 93 | 1.300000e+01 | -- | Inf
2.09/2.18 c 2.1s| 1 | 0 | 655 |1037k| 0 | 52 | 131 | 103 | 103 | 131 | 113 | 10 | 0 | 125 | 1.300000e+01 | -- | Inf
2.20/2.26 c 2.2s| 1 | 0 | 680 |1035k| 0 | 44 | 131 | 97 | 97 | 131 | 113 | 10 | 0 | 132 | 1.300000e+01 | -- | Inf
2.29/2.33 c 2.3s| 1 | 0 | 680 |1035k| 0 | - | 131 | 97 | 97 | 131 | 113 | 10 | 0 | 139 | 1.300000e+01 | -- | Inf
2.29/2.33 c (run 2, node 1) restarting after 36 global fixings of integer variables
2.29/2.33 c
2.29/2.33 (restart) converted 10 cuts from the global cut pool into linear constraints
2.29/2.33 c
2.29/2.33 presolving:
2.29/2.34 c (round 1) 36 del vars, 7 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 28 impls, 78 clqs
2.29/2.34 c (round 2) 36 del vars, 7 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 9 upgd conss, 28 impls, 78 clqs
2.29/2.34 c (round 3) 36 del vars, 7 del conss, 0 chg bounds, 0 chg sides, 3 chg coeffs, 9 upgd conss, 28 impls, 78 clqs
2.29/2.34 c (round 4) 36 del vars, 7 del conss, 0 chg bounds, 0 chg sides, 4 chg coeffs, 9 upgd conss, 28 impls, 78 clqs
2.29/2.34 c presolving (5 rounds):
2.29/2.34 c 36 deleted vars, 7 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 4 changed coefficients
2.29/2.34 c 28 implications, 78 cliques
2.29/2.34 c presolved problem has 95 variables (95 bin, 0 int, 0 impl, 0 cont) and 100 constraints
2.29/2.34 c 17 constraints of type <knapsack>
2.29/2.34 c 78 constraints of type <setppc>
2.29/2.34 c 5 constraints of type <logicor>
2.29/2.34 c transformed objective value is always integral (scale: 1)
2.29/2.34 c Presolving Time: 0.03
2.29/2.34 c
2.29/2.35 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.29/2.35 c 2.3s| 1 | 0 | 749 | 804k| 0 | 41 | 95 | 100 | 100 | 95 | 100 | 0 | 0 | 139 | 1.300000e+01 | -- | Inf
2.29/2.37 c 2.3s| 1 | 0 | 778 |1011k| 0 | 47 | 95 | 100 | 100 | 95 | 114 | 14 | 0 | 139 | 1.300000e+01 | -- | Inf
2.49/2.57 c 2.5s| 1 | 0 | 802 |1011k| 0 | 47 | 95 | 100 | 100 | 95 | 114 | 14 | 0 | 164 | 1.300000e+01 | -- | Inf
2.59/2.66 c 2.6s| 1 | 0 | 835 |1011k| 0 | 43 | 95 | 99 | 99 | 95 | 114 | 14 | 0 | 172 | 1.300000e+01 | -- | Inf
2.69/2.71 c 2.6s| 1 | 0 | 862 |1010k| 0 | 42 | 95 | 97 | 97 | 95 | 114 | 14 | 0 | 181 | 1.300000e+01 | -- | Inf
2.69/2.75 c 2.7s| 1 | 0 | 862 |1010k| 0 | - | 95 | 97 | 97 | 95 | 114 | 14 | 0 | 188 | 1.300000e+01 | -- | Inf
2.69/2.75 c (run 3, node 1) restarting after 20 global fixings of integer variables
2.69/2.75 c
2.69/2.75 (restart) converted 14 cuts from the global cut pool into linear constraints
2.69/2.75 c
2.69/2.75 presolving:
2.69/2.76 c (round 1) 20 del vars, 3 del conss, 0 chg bounds, 3 chg sides, 11 chg coeffs, 14 upgd conss, 58 impls, 62 clqs
2.69/2.76 c (round 2) 20 del vars, 15 del conss, 0 chg bounds, 3 chg sides, 17 chg coeffs, 14 upgd conss, 58 impls, 62 clqs
2.69/2.76 c (round 3) 20 del vars, 15 del conss, 0 chg bounds, 3 chg sides, 23 chg coeffs, 14 upgd conss, 58 impls, 62 clqs
2.69/2.77 c (round 4) 20 del vars, 15 del conss, 0 chg bounds, 3 chg sides, 28 chg coeffs, 14 upgd conss, 58 impls, 62 clqs
2.69/2.77 c (round 5) 20 del vars, 15 del conss, 0 chg bounds, 3 chg sides, 30 chg coeffs, 14 upgd conss, 58 impls, 62 clqs
2.69/2.77 c (round 6) 20 del vars, 15 del conss, 0 chg bounds, 3 chg sides, 31 chg coeffs, 14 upgd conss, 58 impls, 62 clqs
2.69/2.77 c presolving (7 rounds):
2.69/2.77 c 20 deleted vars, 15 deleted constraints, 0 tightened bounds, 0 added holes, 3 changed sides, 31 changed coefficients
2.69/2.77 c 58 implications, 62 cliques
2.69/2.77 c presolved problem has 75 variables (75 bin, 0 int, 0 impl, 0 cont) and 96 constraints
2.69/2.77 c 26 constraints of type <knapsack>
2.69/2.77 c 64 constraints of type <setppc>
2.69/2.77 c 6 constraints of type <logicor>
2.69/2.77 c transformed objective value is always integral (scale: 1)
2.69/2.77 c Presolving Time: 0.04
2.69/2.77 c
2.69/2.77 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.69/2.77 c 2.7s| 1 | 0 | 914 | 826k| 0 | 33 | 75 | 96 | 96 | 75 | 96 | 0 | 0 | 188 | 1.300000e+01 | -- | Inf
2.69/2.79 c 2.7s| 1 | 0 | 996 |1054k| 0 | 36 | 75 | 96 | 96 | 75 | 114 | 18 | 0 | 188 | 1.300000e+01 | -- | Inf
2.89/2.91 c 2.8s| 1 | 0 | 1080 |1050k| 0 | 32 | 75 | 89 | 89 | 75 | 114 | 18 | 0 | 197 | 1.300000e+01 | -- | Inf
2.89/2.94 c 2.9s| 1 | 0 | 1080 |1050k| 0 | - | 75 | 89 | 89 | 75 | 114 | 18 | 0 | 202 | 1.300000e+01 | -- | Inf
2.89/2.94 c (run 4, node 1) restarting after 23 global fixings of integer variables
2.89/2.94 c
2.89/2.94 (restart) converted 18 cuts from the global cut pool into linear constraints
2.89/2.94 c
2.89/2.94 presolving:
2.89/2.94 c (round 1) 37 del vars, 13 del conss, 0 chg bounds, 7 chg sides, 27 chg coeffs, 0 upgd conss, 86 impls, 35 clqs
2.89/2.95 c (round 2) 37 del vars, 18 del conss, 0 chg bounds, 7 chg sides, 54 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.95 c (round 3) 37 del vars, 22 del conss, 0 chg bounds, 9 chg sides, 83 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.95 c (round 4) 37 del vars, 22 del conss, 0 chg bounds, 9 chg sides, 103 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.95 c (round 5) 37 del vars, 22 del conss, 0 chg bounds, 9 chg sides, 119 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.95 c (round 6) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 132 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.95 c (round 7) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 141 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.95 c (round 8) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 148 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.95 c (round 9) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 156 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.95 c (round 10) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 159 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.95 c (round 11) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 162 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.95 c (round 12) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 165 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.95 c (round 13) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 167 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.95 c (round 14) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 168 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 15) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 169 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 16) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 170 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 17) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 171 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 18) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 172 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 19) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 173 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 20) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 174 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 21) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 175 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 22) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 176 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 23) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 177 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 24) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 178 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 25) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 179 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 26) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 180 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 27) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 181 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 28) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 182 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 29) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 183 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 30) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 184 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 31) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 185 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 32) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 186 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 33) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 187 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 34) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 188 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 35) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 189 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 36) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 190 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 37) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 191 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 38) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 192 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 39) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 193 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 40) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 194 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 41) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 195 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 42) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 196 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 43) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 197 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 44) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 198 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 45) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 199 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 46) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 200 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 47) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 201 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 48) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 202 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c (round 49) 37 del vars, 22 del conss, 0 chg bounds, 11 chg sides, 203 chg coeffs, 16 upgd conss, 86 impls, 35 clqs
2.89/2.96 c presolving (50 rounds):
2.89/2.96 c 37 deleted vars, 22 deleted constraints, 0 tightened bounds, 0 added holes, 11 changed sides, 203 changed coefficients
2.89/2.96 c 86 implications, 35 cliques
2.89/2.96 c presolved problem has 38 variables (38 bin, 0 int, 0 impl, 0 cont) and 85 constraints
2.89/2.96 c 39 constraints of type <knapsack>
2.89/2.96 c 43 constraints of type <setppc>
2.89/2.96 c 3 constraints of type <logicor>
2.89/2.96 c transformed objective value is always integral (scale: 1)
2.89/2.96 c Presolving Time: 0.06
2.89/2.96 c
2.89/2.96 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.89/2.96 c 2.9s| 1 | 0 | 1133 | 799k| 0 | 0 | 38 | 85 | 85 | 38 | 85 | 0 | 0 | 202 | 1.300000e+01 | -- | Inf
2.89/2.97 c * 2.9s| 1 | 0 | 1133 | 801k| 0 | - | 38 | 85 | 85 | 38 | 85 | 0 | 0 | 202 | 1.300000e+01 | 1.300000e+01 | 0.00%
2.89/2.97 c
2.89/2.97 c SCIP Status : problem is solved [optimal solution found]
2.89/2.97 c Solving Time (sec) : 2.87
2.89/2.97 c Solving Nodes : 1 (total of 5 nodes in 5 runs)
2.89/2.97 c Primal Bound : +1.30000000000000e+01 (1 solutions)
2.89/2.97 c Dual Bound : +1.30000000000000e+01
2.89/2.97 c Gap : 0.00 %
2.89/2.97 c NODE 1
2.89/2.97 c DUAL BOUND 13
2.89/2.97 c PRIMAL BOUND 13
2.89/2.97 c GAP 0
2.89/2.97 s SATISFIABLE
2.89/2.97 v -x169 -x168 -x167 x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
2.89/2.97 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
2.89/2.97 v -x126 -x125 -x124 -x123 -x122 -x121 x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
2.89/2.97 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.89/2.97 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.89/2.97 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.89/2.97 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.89/2.97 v -x4 -x3 x2 -x1
2.89/2.97 c SCIP Status : problem is solved [optimal solution found]
2.89/2.97 c Solving Time : 2.87
2.89/2.97 c Original Problem :
2.89/2.97 c Problem name : HOME/instance-1868116-1245115744.opb
2.89/2.97 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
2.89/2.97 c Constraints : 101 initial, 101 maximal
2.89/2.97 c Presolved Problem :
2.89/2.97 c Problem name : t_HOME/instance-1868116-1245115744.opb
2.89/2.97 c Variables : 38 (38 binary, 0 integer, 0 implicit integer, 0 continuous)
2.89/2.97 c Constraints : 85 initial, 85 maximal
2.89/2.97 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.89/2.97 c trivial : 0.00 117 0 0 0 0 0 0 0
2.89/2.97 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.89/2.97 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.89/2.97 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.89/2.97 c implics : 0.00 0 0 0 0 0 0 0 0
2.89/2.97 c probing : 0.00 0 0 0 0 0 0 0 0
2.89/2.97 c knapsack : 0.03 0 0 0 0 0 0 14 238
2.89/2.97 c setppc : 0.01 12 2 0 0 0 37 0 0
2.89/2.97 c linear : 0.01 0 0 0 0 0 32 1 0
2.89/2.97 c logicor : 0.01 0 0 0 0 0 6 0 0
2.89/2.97 c root node : - 117 - - 117 - - - -
2.89/2.97 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.89/2.97 c integral : 0 0 0 20 0 0 83 0 0 0
2.89/2.97 c knapsack : 39 9 22 1 0 0 0 0 0 0
2.89/2.97 c setppc : 43 9 22 1 0 0 34 0 0 0
2.89/2.97 c logicor : 3 9 5 1 0 0 0 0 0 0
2.89/2.97 c countsols : 0 0 0 1 0 0 0 0 0 0
2.89/2.97 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.89/2.97 c integral : 2.61 0.00 0.00 2.61 0.00
2.89/2.97 c knapsack : 0.01 0.01 0.00 0.00 0.00
2.89/2.97 c setppc : 0.00 0.00 0.00 0.00 0.00
2.89/2.97 c logicor : 0.00 0.00 0.00 0.00 0.00
2.89/2.97 c countsols : 0.00 0.00 0.00 0.00 0.00
2.89/2.97 c Propagators : Time Calls Cutoffs DomReds
2.89/2.97 c rootredcost : 0.00 0 0 0
2.89/2.97 c pseudoobj : 0.00 27 0 0
2.89/2.97 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.89/2.97 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.89/2.97 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.89/2.97 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.89/2.97 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.89/2.97 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.89/2.97 c applied globally : - - - 0 0.0 - - -
2.89/2.97 c applied locally : - - - 0 0.0 - - -
2.89/2.97 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.89/2.97 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
2.89/2.97 c redcost : 0.00 9 0 0 0 0
2.89/2.97 c impliedbounds : 0.00 8 0 0 0 0
2.89/2.97 c intobj : 0.00 0 0 0 0 0
2.89/2.97 c gomory : 0.07 9 0 0 74 0
2.89/2.97 c strongcg : 0.04 9 0 0 322 0
2.89/2.97 c cmir : 0.00 0 0 0 0 0
2.89/2.97 c flowcover : 0.00 0 0 0 0 0
2.89/2.97 c clique : 0.00 9 0 0 40 0
2.89/2.97 c zerohalf : 0.00 0 0 0 0 0
2.89/2.97 c mcf : 0.00 5 0 0 0 0
2.89/2.97 c Pricers : Time Calls Vars
2.89/2.97 c problem variables: 0.00 0 0
2.89/2.97 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.89/2.97 c relpscost : 2.61 19 0 83 0 0 0
2.89/2.97 c pscost : 0.00 0 0 0 0 0 0
2.89/2.97 c inference : 0.00 0 0 0 0 0 0
2.89/2.97 c mostinf : 0.00 0 0 0 0 0 0
2.89/2.97 c leastinf : 0.00 0 0 0 0 0 0
2.89/2.97 c fullstrong : 0.00 0 0 0 0 0 0
2.89/2.97 c allfullstrong : 0.00 0 0 0 0 0 0
2.89/2.97 c random : 0.00 0 0 0 0 0 0
2.89/2.97 c Primal Heuristics : Time Calls Found
2.89/2.97 c LP solutions : 0.00 - 1
2.89/2.97 c pseudo solutions : 0.00 - 0
2.89/2.97 c simplerounding : 0.00 0 0
2.89/2.97 c rounding : 0.00 0 0
2.89/2.97 c shifting : 0.00 0 0
2.89/2.97 c intshifting : 0.00 0 0
2.89/2.97 c oneopt : 0.00 0 0
2.89/2.97 c fixandinfer : 0.00 0 0
2.89/2.97 c feaspump : 0.00 0 0
2.89/2.97 c coefdiving : 0.00 0 0
2.89/2.97 c pscostdiving : 0.00 0 0
2.89/2.97 c fracdiving : 0.00 0 0
2.89/2.97 c veclendiving : 0.00 0 0
2.89/2.97 c intdiving : 0.00 0 0
2.89/2.97 c actconsdiving : 0.00 0 0
2.89/2.97 c objpscostdiving : 0.00 0 0
2.89/2.97 c rootsoldiving : 0.00 0 0
2.89/2.97 c linesearchdiving : 0.00 0 0
2.89/2.97 c guideddiving : 0.00 0 0
2.89/2.97 c octane : 0.00 0 0
2.89/2.97 c rens : 0.00 0 0
2.89/2.97 c rins : 0.00 0 0
2.89/2.97 c localbranching : 0.00 0 0
2.89/2.97 c mutation : 0.00 0 0
2.89/2.97 c crossover : 0.00 0 0
2.89/2.97 c dins : 0.00 0 0
2.89/2.97 c LP : Time Calls Iterations Iter/call Iter/sec
2.89/2.97 c primal LP : 0.00 0 0 0.00 -
2.89/2.97 c dual LP : 0.06 28 1133 40.46 18883.33
2.89/2.97 c barrier LP : 0.00 0 0 0.00 -
2.89/2.97 c diving/probing LP: 0.00 0 0 0.00 -
2.89/2.97 c strong branching : 2.61 202 26969 133.51 10332.95
2.89/2.97 c (at root node) : - 202 26969 133.51 -
2.89/2.97 c conflict analysis: 0.00 0 0 0.00 -
2.89/2.97 c B&B Tree :
2.89/2.97 c number of runs : 5
2.89/2.97 c nodes : 1
2.89/2.97 c nodes (total) : 5
2.89/2.97 c nodes left : 0
2.89/2.97 c max depth : 0
2.89/2.97 c max depth (total): 0
2.89/2.97 c backtracks : 0 (0.0%)
2.89/2.97 c delayed cutoffs : 0
2.89/2.97 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.89/2.97 c avg switch length: 2.00
2.89/2.97 c switching time : 0.00
2.89/2.97 c Solution :
2.89/2.97 c Solutions found : 1 (1 improvements)
2.89/2.97 c Primal Bound : +1.30000000000000e+01 (in run 5, after 1 nodes, 2.87 seconds, depth 0, found by <relaxation>)
2.89/2.97 c Dual Bound : +1.30000000000000e+01
2.89/2.97 c Gap : 0.00 %
2.89/2.97 c Root Dual Bound : +1.30000000000000e+01
2.89/2.97 c Time complete: 2.97.