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-1868122-1245115776.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.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.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 | 127 | 593k| 0 | 42 | 169 | 73 | 73 | 169 | 73 | 0 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.05 c 0.0s| 1 | 0 | 166 | 801k| 0 | 54 | 169 | 73 | 73 | 169 | 85 | 12 | 0 | 0 | 1.300000e+01 | -- | Inf
0.05/0.07 c 0.1s| 1 | 0 | 205 | 837k| 0 | 56 | 169 | 73 | 73 | 169 | 92 | 19 | 0 | 0 | 1.300000e+01 | -- | Inf
0.05/0.09 c 0.1s| 1 | 0 | 255 | 862k| 0 | 57 | 169 | 73 | 73 | 169 | 97 | 24 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.11 c 0.1s| 1 | 0 | 299 | 878k| 0 | 61 | 169 | 73 | 73 | 169 | 103 | 30 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 319 | 893k| 0 | 67 | 169 | 73 | 73 | 169 | 109 | 36 | 0 | 0 | 1.300000e+01 | -- | Inf
1.10/1.12 c 1.1s| 1 | 0 | 355 | 893k| 0 | 59 | 169 | 73 | 73 | 169 | 109 | 36 | 0 | 35 | 1.300000e+01 | -- | Inf
1.69/1.70 c 1.7s| 1 | 0 | 376 | 893k| 0 | 59 | 169 | 73 | 73 | 169 | 109 | 36 | 0 | 59 | 1.300000e+01 | -- | Inf
1.89/1.91 c 1.9s| 1 | 0 | 405 | 893k| 0 | 57 | 169 | 73 | 73 | 169 | 109 | 36 | 0 | 67 | 1.300000e+01 | -- | Inf
1.99/2.07 c 2.0s| 1 | 0 | 409 | 893k| 0 | 57 | 169 | 73 | 73 | 169 | 109 | 36 | 0 | 74 | 1.300000e+01 | -- | Inf
2.10/2.17 c 2.1s| 1 | 0 | 412 | 893k| 0 | 57 | 169 | 73 | 73 | 169 | 109 | 36 | 0 | 77 | 1.300000e+01 | -- | Inf
2.20/2.22 c 2.2s| 1 | 0 | 414 | 893k| 0 | 57 | 169 | 73 | 73 | 169 | 108 | 36 | 0 | 80 | 1.300000e+01 | -- | Inf
2.20/2.26 c 2.2s| 1 | 0 | 416 | 893k| 0 | 57 | 169 | 73 | 73 | 169 | 108 | 36 | 0 | 82 | 1.300000e+01 | -- | Inf
2.29/2.30 c 2.2s| 1 | 0 | 417 | 893k| 0 | 57 | 169 | 73 | 73 | 169 | 108 | 36 | 0 | 84 | 1.300000e+01 | -- | Inf
2.29/2.32 c 2.3s| 1 | 0 | 419 | 893k| 0 | 57 | 169 | 73 | 73 | 169 | 108 | 36 | 0 | 85 | 1.300000e+01 | -- | Inf
2.29/2.36 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.29/2.36 c 2.3s| 1 | 0 | 421 | 893k| 0 | 57 | 169 | 73 | 73 | 169 | 108 | 36 | 0 | 87 | 1.300000e+01 | -- | Inf
2.39/2.40 c 2.3s| 1 | 0 | 423 | 893k| 0 | 57 | 169 | 73 | 73 | 169 | 108 | 36 | 0 | 89 | 1.300000e+01 | -- | Inf
2.39/2.44 c 2.4s| 1 | 0 | 425 | 893k| 0 | 57 | 169 | 73 | 73 | 169 | 90 | 36 | 0 | 91 | 1.300000e+01 | -- | Inf
2.39/2.48 c 2.4s| 1 | 0 | 427 | 893k| 0 | 57 | 169 | 73 | 73 | 169 | 90 | 36 | 0 | 93 | 1.300000e+01 | -- | Inf
2.49/2.51 c 2.5s| 1 | 0 | 427 | 893k| 0 | - | 169 | 73 | 73 | 169 | 90 | 36 | 0 | 95 | 1.300000e+01 | -- | Inf
2.49/2.51 c (run 1, node 1) restarting after 34 global fixings of integer variables
2.49/2.51 c
2.49/2.51 (restart) converted 17 cuts from the global cut pool into linear constraints
2.49/2.51 c
2.49/2.51 presolving:
2.49/2.51 c (round 1) 34 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 17 upgd conss, 10 impls, 74 clqs
2.49/2.52 c presolving (2 rounds):
2.49/2.52 c 34 deleted vars, 1 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.49/2.52 c 10 implications, 74 cliques
2.49/2.52 c presolved problem has 135 variables (135 bin, 0 int, 0 impl, 0 cont) and 89 constraints
2.49/2.52 c 11 constraints of type <knapsack>
2.49/2.52 c 75 constraints of type <setppc>
2.49/2.52 c 3 constraints of type <logicor>
2.49/2.52 c transformed objective value is always integral (scale: 1)
2.49/2.52 c Presolving Time: 0.02
2.49/2.52 c
2.49/2.52 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.49/2.52 c 2.5s| 1 | 0 | 507 | 758k| 0 | 46 | 135 | 89 | 89 | 135 | 89 | 0 | 0 | 95 | 1.300000e+01 | -- | Inf
2.49/2.55 c 2.5s| 1 | 0 | 547 |1006k| 0 | 53 | 135 | 89 | 89 | 135 | 102 | 13 | 0 | 95 | 1.300000e+01 | -- | Inf
2.79/2.90 c 2.8s| 1 | 0 | 585 |1006k| 0 | 49 | 135 | 89 | 89 | 135 | 102 | 13 | 0 | 130 | 1.300000e+01 | -- | Inf
2.99/3.04 c 3.0s| 1 | 0 | 614 |1006k| 0 | 50 | 135 | 89 | 89 | 135 | 102 | 13 | 0 | 144 | 1.300000e+01 | -- | Inf
3.09/3.18 c 3.1s| 1 | 0 | 633 |1006k| 0 | 50 | 135 | 89 | 89 | 135 | 102 | 13 | 0 | 155 | 1.300000e+01 | -- | Inf
3.19/3.24 c 3.2s| 1 | 0 | 640 |1006k| 0 | 51 | 135 | 88 | 88 | 135 | 102 | 13 | 0 | 161 | 1.300000e+01 | -- | Inf
3.29/3.30 c 3.2s| 1 | 0 | 649 |1005k| 0 | 50 | 135 | 88 | 88 | 135 | 102 | 13 | 0 | 166 | 1.300000e+01 | -- | Inf
3.29/3.34 c 3.3s| 1 | 0 | 654 |1005k| 0 | 50 | 135 | 88 | 88 | 135 | 102 | 13 | 0 | 169 | 1.300000e+01 | -- | Inf
3.29/3.38 c 3.3s| 1 | 0 | 658 |1005k| 0 | 51 | 135 | 88 | 88 | 135 | 102 | 13 | 0 | 172 | 1.300000e+01 | -- | Inf
3.39/3.41 c 3.3s| 1 | 0 | 662 |1005k| 0 | 51 | 135 | 87 | 87 | 135 | 102 | 13 | 0 | 175 | 1.300000e+01 | -- | Inf
3.39/3.46 c 3.4s| 1 | 0 | 662 |1005k| 0 | - | 135 | 87 | 87 | 135 | 102 | 13 | 0 | 179 | 1.300000e+01 | -- | Inf
3.39/3.46 c (run 2, node 1) restarting after 30 global fixings of integer variables
3.39/3.46 c
3.39/3.46 (restart) converted 13 cuts from the global cut pool into linear constraints
3.39/3.46 c
3.39/3.46 presolving:
3.39/3.47 c (round 1) 30 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 13 upgd conss, 14 impls, 77 clqs
3.39/3.47 c presolving (2 rounds):
3.39/3.47 c 30 deleted vars, 1 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
3.39/3.47 c 14 implications, 77 cliques
3.39/3.47 c presolved problem has 105 variables (105 bin, 0 int, 0 impl, 0 cont) and 99 constraints
3.39/3.47 c 18 constraints of type <knapsack>
3.39/3.47 c 78 constraints of type <setppc>
3.39/3.47 c 3 constraints of type <logicor>
3.39/3.47 c transformed objective value is always integral (scale: 1)
3.39/3.47 c Presolving Time: 0.03
3.39/3.47 c
3.39/3.48 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.39/3.48 c 3.4s| 1 | 0 | 742 | 795k| 0 | 44 | 105 | 99 | 99 | 105 | 99 | 0 | 0 | 179 | 1.300000e+01 | -- | Inf
3.49/3.50 c 3.4s| 1 | 0 | 770 |1008k| 0 | 53 | 105 | 99 | 99 | 105 | 109 | 10 | 0 | 179 | 1.300000e+01 | -- | Inf
3.79/3.80 c 3.7s| 1 | 0 | 791 |1008k| 0 | 52 | 105 | 98 | 98 | 105 | 109 | 10 | 0 | 220 | 1.300000e+01 | -- | Inf
3.89/3.97 c 3.9s| 1 | 0 | 800 |1008k| 0 | 54 | 105 | 98 | 98 | 105 | 109 | 10 | 0 | 230 | 1.300000e+01 | -- | Inf
3.99/4.09 c 4.0s| 1 | 0 | 809 |1008k| 0 | 53 | 105 | 98 | 98 | 105 | 109 | 10 | 0 | 240 | 1.300000e+01 | -- | Inf
4.19/4.20 c 4.1s| 1 | 0 | 816 |1008k| 0 | 53 | 105 | 97 | 97 | 105 | 109 | 10 | 0 | 250 | 1.300000e+01 | -- | Inf
4.19/4.29 c 4.2s| 1 | 0 | 816 |1007k| 0 | - | 105 | 97 | 97 | 105 | 109 | 10 | 0 | 258 | 1.300000e+01 | -- | Inf
4.19/4.29 c (run 3, node 1) restarting after 23 global fixings of integer variables
4.19/4.29 c
4.19/4.29 (restart) converted 10 cuts from the global cut pool into linear constraints
4.19/4.30 c
4.19/4.30 presolving:
4.29/4.30 c (round 1) 23 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 10 upgd conss, 28 impls, 74 clqs
4.29/4.31 c presolving (2 rounds):
4.29/4.31 c 23 deleted vars, 2 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
4.29/4.31 c 28 implications, 74 cliques
4.29/4.31 c presolved problem has 82 variables (82 bin, 0 int, 0 impl, 0 cont) and 105 constraints
4.29/4.31 c 23 constraints of type <knapsack>
4.29/4.31 c 79 constraints of type <setppc>
4.29/4.31 c 3 constraints of type <logicor>
4.29/4.31 c transformed objective value is always integral (scale: 1)
4.29/4.31 c Presolving Time: 0.04
4.29/4.31 c
4.29/4.31 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.29/4.31 c 4.2s| 1 | 0 | 887 | 802k| 0 | 41 | 82 | 105 | 105 | 82 | 105 | 0 | 0 | 258 | 1.300000e+01 | -- | Inf
4.29/4.33 c 4.2s| 1 | 0 | 920 |1040k| 0 | 51 | 82 | 105 | 105 | 82 | 116 | 11 | 0 | 258 | 1.300000e+01 | -- | Inf
4.69/4.78 c 4.7s| 1 | 0 | 997 |1040k| 0 | 52 | 82 | 104 | 104 | 82 | 116 | 11 | 0 | 302 | 1.300000e+01 | -- | Inf
4.89/4.94 c 4.8s| 1 | 0 | 1000 |1040k| 0 | 49 | 82 | 104 | 104 | 82 | 116 | 11 | 0 | 322 | 1.300000e+01 | -- | Inf
4.89/4.94 c 4.8s| 1 | 2 | 1000 |1040k| 0 | 49 | 82 | 104 | 104 | 82 | 116 | 11 | 0 | 322 | 1.300000e+01 | -- | Inf
4.89/4.94 c (run 4, node 1) restarting after 5 global fixings of integer variables
4.89/4.94 c
4.89/4.94 (restart) converted 3 cuts from the global cut pool into linear constraints
4.89/4.95 c
4.89/4.95 presolving:
4.89/4.95 c (round 1) 5 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 3 upgd conss, 30 impls, 76 clqs
4.89/4.95 c (round 2) 5 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 3 upgd conss, 30 impls, 76 clqs
4.89/4.95 c presolving (3 rounds):
4.89/4.96 c 5 deleted vars, 2 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
4.89/4.96 c 30 implications, 76 cliques
4.89/4.96 c presolved problem has 77 variables (77 bin, 0 int, 0 impl, 0 cont) and 105 constraints
4.89/4.96 c 23 constraints of type <knapsack>
4.89/4.96 c 79 constraints of type <setppc>
4.89/4.96 c 3 constraints of type <logicor>
4.89/4.96 c transformed objective value is always integral (scale: 1)
4.89/4.96 c Presolving Time: 0.05
4.89/4.96 c
4.89/4.96 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.89/4.96 c 4.8s| 1 | 0 | 1059 | 795k| 0 | 43 | 77 | 105 | 105 | 77 | 105 | 0 | 0 | 322 | 1.300000e+01 | -- | Inf
4.89/4.98 c 4.8s| 1 | 0 | 1089 |1034k| 0 | 51 | 77 | 105 | 105 | 77 | 115 | 10 | 0 | 322 | 1.300000e+01 | -- | Inf
5.19/5.20 c 5.1s| 1 | 0 | 1121 |1033k| 0 | 49 | 77 | 104 | 104 | 77 | 115 | 10 | 0 | 358 | 1.300000e+01 | -- | Inf
5.29/5.36 c 5.2s| 1 | 0 | 1127 |1033k| 0 | 46 | 77 | 103 | 103 | 77 | 115 | 10 | 0 | 378 | 1.300000e+01 | -- | Inf
5.29/5.36 c 5.2s| 1 | 2 | 1127 |1033k| 0 | 46 | 77 | 103 | 103 | 77 | 115 | 10 | 0 | 379 | 1.300000e+01 | -- | Inf
5.49/5.56 c * 5.4s| 3 | 0 | 1306 |1036k| 1 | - | 77 | 82 | 80 | 77 | 74 | 10 | 0 | 447 | 1.300000e+01 | 1.300000e+01 | 0.00%
5.49/5.56 c
5.49/5.56 c SCIP Status : problem is solved [optimal solution found]
5.49/5.56 c Solving Time (sec) : 5.41
5.49/5.56 c Solving Nodes : 3 (total of 7 nodes in 5 runs)
5.49/5.56 c Primal Bound : +1.30000000000000e+01 (1 solutions)
5.49/5.56 c Dual Bound : +1.30000000000000e+01
5.49/5.56 c Gap : 0.00 %
5.49/5.56 c NODE 3
5.49/5.56 c DUAL BOUND 13
5.49/5.56 c PRIMAL BOUND 13
5.49/5.56 c GAP 0
5.49/5.56 s SATISFIABLE
5.49/5.56 v -x169 x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 x149 -x148
5.49/5.56 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 x132 -x131 -x130 -x129 x128 -x127
5.49/5.56 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 x111 -x110 -x109 -x108 -x107 -x106
5.49/5.56 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
5.49/5.56 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 -x56
5.49/5.56 v -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
5.49/5.56 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
5.49/5.56 v -x4 -x3 -x2 -x1
5.49/5.56 c SCIP Status : problem is solved [optimal solution found]
5.49/5.56 c Solving Time : 5.41
5.49/5.56 c Original Problem :
5.49/5.56 c Problem name : HOME/instance-1868122-1245115776.opb
5.49/5.56 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
5.49/5.56 c Constraints : 101 initial, 101 maximal
5.49/5.56 c Presolved Problem :
5.49/5.56 c Problem name : t_HOME/instance-1868122-1245115776.opb
5.49/5.56 c Variables : 77 (77 binary, 0 integer, 0 implicit integer, 0 continuous)
5.49/5.56 c Constraints : 105 initial, 105 maximal
5.49/5.56 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
5.49/5.56 c trivial : 0.00 92 0 0 0 0 0 0 0
5.49/5.56 c dualfix : 0.00 0 0 0 0 0 0 0 0
5.49/5.56 c boundshift : 0.00 0 0 0 0 0 0 0 0
5.49/5.56 c inttobinary : 0.00 0 0 0 0 0 0 0 0
5.49/5.56 c implics : 0.00 0 0 0 0 0 0 0 0
5.49/5.56 c probing : 0.00 0 0 0 0 0 0 0 0
5.49/5.56 c knapsack : 0.02 0 0 0 0 0 0 0 1
5.49/5.56 c setppc : 0.00 0 0 0 0 0 3 0 0
5.49/5.56 c linear : 0.03 0 0 0 0 0 28 0 0
5.49/5.56 c logicor : 0.00 0 0 0 0 0 3 0 0
5.49/5.56 c root node : - 137 - - 137 - - - -
5.49/5.56 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
5.49/5.56 c integral : 0 0 0 42 0 0 135 0 0 4
5.49/5.56 c knapsack : 23 9 46 1 0 0 0 0 0 0
5.49/5.56 c setppc : 79 9 46 1 0 0 26 0 0 0
5.49/5.56 c logicor : 3 9 7 0 0 0 0 0 0 0
5.49/5.56 c countsols : 0 0 0 1 0 0 0 0 0 0
5.49/5.56 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
5.49/5.56 c integral : 5.03 0.00 0.00 5.03 0.00
5.49/5.56 c knapsack : 0.02 0.02 0.00 0.00 0.00
5.49/5.56 c setppc : 0.00 0.00 0.00 0.00 0.00
5.49/5.56 c logicor : 0.00 0.00 0.00 0.00 0.00
5.49/5.56 c countsols : 0.00 0.00 0.00 0.00 0.00
5.49/5.56 c Propagators : Time Calls Cutoffs DomReds
5.49/5.56 c rootredcost : 0.00 0 0 0
5.49/5.56 c pseudoobj : 0.01 51 0 0
5.49/5.56 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
5.49/5.56 c propagation : 0.00 0 0 0 0.0 0 0.0 -
5.49/5.56 c infeasible LP : 0.00 1 0 0 0.0 0 0.0 0
5.49/5.56 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
5.49/5.56 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
5.49/5.56 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
5.49/5.56 c applied globally : - - - 0 0.0 - - -
5.49/5.56 c applied locally : - - - 0 0.0 - - -
5.49/5.56 c Separators : Time Calls Cutoffs DomReds Cuts Conss
5.49/5.56 c cut pool : 0.00 0 - - 0 - (maximal pool size: 115)
5.49/5.56 c redcost : 0.00 11 0 0 0 0
5.49/5.56 c impliedbounds : 0.00 9 0 0 0 0
5.49/5.56 c intobj : 0.00 0 0 0 0 0
5.49/5.56 c gomory : 0.06 9 0 0 45 0
5.49/5.56 c strongcg : 0.03 9 0 0 401 0
5.49/5.56 c cmir : 0.00 0 0 0 0 0
5.49/5.56 c flowcover : 0.00 0 0 0 0 0
5.49/5.56 c clique : 0.01 9 0 0 47 0
5.49/5.56 c zerohalf : 0.00 0 0 0 0 0
5.49/5.56 c mcf : 0.00 5 0 0 0 0
5.49/5.56 c Pricers : Time Calls Vars
5.49/5.56 c problem variables: 0.00 0 0
5.49/5.56 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
5.49/5.56 c relpscost : 5.03 41 0 135 0 0 4
5.49/5.56 c pscost : 0.00 0 0 0 0 0 0
5.49/5.56 c inference : 0.00 0 0 0 0 0 0
5.49/5.56 c mostinf : 0.00 0 0 0 0 0 0
5.49/5.56 c leastinf : 0.00 0 0 0 0 0 0
5.49/5.56 c fullstrong : 0.00 0 0 0 0 0 0
5.49/5.56 c allfullstrong : 0.00 0 0 0 0 0 0
5.49/5.56 c random : 0.00 0 0 0 0 0 0
5.49/5.56 c Primal Heuristics : Time Calls Found
5.49/5.56 c LP solutions : 0.00 - 1
5.49/5.56 c pseudo solutions : 0.00 - 0
5.49/5.56 c simplerounding : 0.00 0 0
5.49/5.56 c rounding : 0.00 0 0
5.49/5.56 c shifting : 0.00 0 0
5.49/5.56 c intshifting : 0.00 0 0
5.49/5.56 c oneopt : 0.00 0 0
5.49/5.56 c fixandinfer : 0.00 0 0
5.49/5.56 c feaspump : 0.00 0 0
5.49/5.56 c coefdiving : 0.00 0 0
5.49/5.56 c pscostdiving : 0.00 0 0
5.49/5.56 c fracdiving : 0.00 0 0
5.49/5.56 c veclendiving : 0.00 0 0
5.49/5.56 c intdiving : 0.00 0 0
5.49/5.56 c actconsdiving : 0.00 0 0
5.49/5.56 c objpscostdiving : 0.00 0 0
5.49/5.56 c rootsoldiving : 0.00 0 0
5.49/5.56 c linesearchdiving : 0.00 0 0
5.49/5.56 c guideddiving : 0.00 0 0
5.49/5.56 c octane : 0.00 0 0
5.49/5.56 c rens : 0.00 0 0
5.49/5.56 c rins : 0.00 0 0
5.49/5.56 c localbranching : 0.00 0 0
5.49/5.56 c mutation : 0.00 0 0
5.49/5.56 c crossover : 0.00 0 0
5.49/5.56 c dins : 0.00 0 0
5.49/5.56 c LP : Time Calls Iterations Iter/call Iter/sec
5.49/5.56 c primal LP : 0.01 0 0 0.00 0.00
5.49/5.56 c dual LP : 0.18 52 1306 25.12 7255.56
5.49/5.56 c barrier LP : 0.00 0 0 0.00 -
5.49/5.56 c diving/probing LP: 0.00 0 0 0.00 -
5.49/5.56 c strong branching : 5.03 447 50372 112.69 10014.31
5.49/5.56 c (at root node) : - 379 47180 124.49 -
5.49/5.56 c conflict analysis: 0.00 0 0 0.00 -
5.49/5.56 c B&B Tree :
5.49/5.56 c number of runs : 5
5.49/5.56 c nodes : 3
5.49/5.56 c nodes (total) : 7
5.49/5.56 c nodes left : 0
5.49/5.56 c max depth : 1
5.49/5.56 c max depth (total): 1
5.49/5.56 c backtracks : 0 (0.0%)
5.49/5.56 c delayed cutoffs : 0
5.49/5.56 c repropagations : 0 (0 domain reductions, 0 cutoffs)
5.49/5.56 c avg switch length: 2.00
5.49/5.56 c switching time : 0.01
5.49/5.56 c Solution :
5.49/5.56 c Solutions found : 1 (1 improvements)
5.49/5.56 c Primal Bound : +1.30000000000000e+01 (in run 5, after 3 nodes, 5.41 seconds, depth 1, found by <relaxation>)
5.49/5.56 c Dual Bound : +1.30000000000000e+01
5.49/5.56 c Gap : 0.00 %
5.49/5.56 c Root Dual Bound : +1.30000000000000e+01
5.49/5.57 c Time complete: 5.56.