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-1868074-1245115621.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.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.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 | 102 | 593k| 0 | 44 | 169 | 73 | 73 | 169 | 73 | 0 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.05 c 0.0s| 1 | 0 | 136 | 813k| 0 | 53 | 169 | 73 | 73 | 169 | 87 | 14 | 0 | 0 | 1.300000e+01 | -- | Inf
0.05/0.07 c 0.1s| 1 | 0 | 179 | 984k| 0 | 56 | 169 | 73 | 73 | 169 | 94 | 21 | 0 | 0 | 1.300000e+01 | -- | Inf
0.05/0.09 c 0.1s| 1 | 0 | 215 |1052k| 0 | 60 | 169 | 73 | 73 | 169 | 101 | 28 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.11 c 0.1s| 1 | 0 | 266 |1083k| 0 | 60 | 169 | 73 | 73 | 169 | 103 | 30 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 278 |1088k| 0 | 61 | 169 | 73 | 73 | 169 | 108 | 35 | 0 | 0 | 1.300000e+01 | -- | Inf
0.79/0.89 c 0.9s| 1 | 0 | 350 |1088k| 0 | 59 | 169 | 73 | 73 | 169 | 108 | 35 | 0 | 37 | 1.300000e+01 | -- | Inf
1.00/1.09 c 1.1s| 1 | 0 | 388 |1088k| 0 | 60 | 169 | 73 | 73 | 169 | 108 | 35 | 0 | 47 | 1.300000e+01 | -- | Inf
1.19/1.26 c 1.2s| 1 | 0 | 437 |1088k| 0 | 55 | 169 | 73 | 73 | 169 | 108 | 35 | 0 | 56 | 1.300000e+01 | -- | Inf
1.29/1.36 c 1.3s| 1 | 0 | 455 |1088k| 0 | 55 | 169 | 73 | 73 | 169 | 108 | 35 | 0 | 61 | 1.300000e+01 | -- | Inf
1.39/1.43 c 1.4s| 1 | 0 | 472 |1088k| 0 | 58 | 169 | 73 | 73 | 169 | 108 | 35 | 0 | 66 | 1.300000e+01 | -- | Inf
1.49/1.55 c 1.5s| 1 | 0 | 492 |1087k| 0 | 52 | 169 | 73 | 73 | 169 | 105 | 35 | 0 | 74 | 1.300000e+01 | -- | Inf
1.59/1.60 c 1.6s| 1 | 0 | 492 |1087k| 0 | - | 169 | 73 | 73 | 169 | 105 | 35 | 0 | 79 | 1.300000e+01 | -- | Inf
1.59/1.60 c (run 1, node 1) restarting after 34 global fixings of integer variables
1.59/1.60 c
1.59/1.60 (restart) converted 32 cuts from the global cut pool into linear constraints
1.59/1.60 c
1.59/1.60 presolving:
1.59/1.61 c (round 1) 34 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 32 upgd conss, 12 impls, 88 clqs
1.59/1.61 c (round 2) 34 del vars, 5 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 32 upgd conss, 12 impls, 88 clqs
1.59/1.61 c presolving (3 rounds):
1.59/1.61 c 34 deleted vars, 5 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.59/1.61 c 12 implications, 88 cliques
1.59/1.61 c presolved problem has 135 variables (135 bin, 0 int, 0 impl, 0 cont) and 100 constraints
1.59/1.61 c 11 constraints of type <knapsack>
1.59/1.61 c 88 constraints of type <setppc>
1.59/1.61 c 1 constraints of type <logicor>
1.59/1.61 c transformed objective value is always integral (scale: 1)
1.59/1.61 c Presolving Time: 0.03
1.59/1.61 c
1.59/1.62 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.59/1.62 c 1.6s| 1 | 0 | 581 | 774k| 0 | 46 | 135 | 100 | 100 | 135 | 100 | 0 | 0 | 79 | 1.300000e+01 | -- | Inf
1.59/1.64 c 1.6s| 1 | 0 | 623 |1021k| 0 | 50 | 135 | 100 | 100 | 135 | 115 | 15 | 0 | 79 | 1.300000e+01 | -- | Inf
2.10/2.12 c 2.1s| 1 | 0 | 655 |1021k| 0 | 54 | 135 | 100 | 100 | 135 | 115 | 15 | 0 | 117 | 1.300000e+01 | -- | Inf
2.19/2.26 c 2.2s| 1 | 0 | 666 |1021k| 0 | 51 | 135 | 100 | 100 | 135 | 115 | 15 | 0 | 127 | 1.300000e+01 | -- | Inf
2.29/2.36 c 2.3s| 1 | 0 | 683 |1021k| 0 | 54 | 135 | 100 | 100 | 135 | 115 | 15 | 0 | 134 | 1.300000e+01 | -- | Inf
2.39/2.46 c 2.4s| 1 | 0 | 708 |1021k| 0 | 55 | 135 | 100 | 100 | 135 | 115 | 15 | 0 | 141 | 1.300000e+01 | -- | Inf
2.49/2.56 c 2.5s| 1 | 0 | 722 |1021k| 0 | 53 | 135 | 100 | 100 | 135 | 115 | 15 | 0 | 147 | 1.300000e+01 | -- | Inf
2.59/2.67 c 2.6s| 1 | 0 | 722 |1021k| 0 | - | 135 | 100 | 100 | 135 | 115 | 15 | 0 | 153 | 1.300000e+01 | -- | Inf
2.59/2.67 c (run 2, node 1) restarting after 30 global fixings of integer variables
2.59/2.67 c
2.59/2.67 (restart) converted 15 cuts from the global cut pool into linear constraints
2.59/2.67 c
2.59/2.67 presolving:
2.59/2.68 c (round 1) 30 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 15 upgd conss, 32 impls, 84 clqs
2.59/2.69 c (round 2) 30 del vars, 5 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 15 upgd conss, 32 impls, 84 clqs
2.59/2.69 c presolving (3 rounds):
2.59/2.69 c 30 deleted vars, 5 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.59/2.69 c 32 implications, 84 cliques
2.59/2.69 c presolved problem has 105 variables (105 bin, 0 int, 0 impl, 0 cont) and 110 constraints
2.59/2.69 c 18 constraints of type <knapsack>
2.59/2.69 c 89 constraints of type <setppc>
2.59/2.69 c 3 constraints of type <logicor>
2.59/2.69 c transformed objective value is always integral (scale: 1)
2.59/2.69 c Presolving Time: 0.04
2.59/2.69 c
2.59/2.69 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.59/2.69 c 2.6s| 1 | 0 | 802 | 821k| 0 | 43 | 105 | 110 | 110 | 105 | 110 | 0 | 0 | 153 | 1.300000e+01 | -- | Inf
2.69/2.71 c 2.6s| 1 | 0 | 857 |1078k| 0 | 52 | 105 | 110 | 110 | 105 | 121 | 11 | 0 | 153 | 1.300000e+01 | -- | Inf
3.09/3.15 c 3.1s| 1 | 0 | 917 |1077k| 0 | 46 | 105 | 109 | 109 | 105 | 121 | 11 | 0 | 191 | 1.300000e+01 | -- | Inf
3.20/3.28 c 3.2s| 1 | 0 | 942 |1077k| 0 | 45 | 105 | 109 | 109 | 105 | 121 | 11 | 0 | 202 | 1.300000e+01 | -- | Inf
3.29/3.32 c 3.2s| 1 | 0 | 975 |1077k| 0 | 39 | 105 | 108 | 108 | 105 | 121 | 11 | 0 | 207 | 1.300000e+01 | -- | Inf
3.29/3.38 c 3.3s| 1 | 0 | 989 |1077k| 0 | 45 | 105 | 107 | 107 | 105 | 121 | 11 | 0 | 214 | 1.300000e+01 | -- | Inf
3.39/3.43 c 3.3s| 1 | 0 | 989 |1077k| 0 | - | 105 | 107 | 107 | 105 | 121 | 11 | 0 | 219 | 1.300000e+01 | -- | Inf
3.39/3.43 c (run 3, node 1) restarting after 25 global fixings of integer variables
3.39/3.43 c
3.39/3.43 (restart) converted 11 cuts from the global cut pool into linear constraints
3.39/3.43 c
3.39/3.43 presolving:
3.39/3.44 c (round 1) 25 del vars, 5 del conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 11 upgd conss, 52 impls, 77 clqs
3.39/3.44 c (round 2) 25 del vars, 6 del conss, 0 chg bounds, 0 chg sides, 4 chg coeffs, 11 upgd conss, 52 impls, 77 clqs
3.39/3.44 c presolving (3 rounds):
3.39/3.44 c 25 deleted vars, 6 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 4 changed coefficients
3.39/3.44 c 52 implications, 77 cliques
3.39/3.44 c presolved problem has 80 variables (80 bin, 0 int, 0 impl, 0 cont) and 112 constraints
3.39/3.44 c 24 constraints of type <knapsack>
3.39/3.44 c 83 constraints of type <setppc>
3.39/3.44 c 5 constraints of type <logicor>
3.39/3.44 c transformed objective value is always integral (scale: 1)
3.39/3.44 c Presolving Time: 0.05
3.39/3.44 c
3.39/3.45 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.39/3.45 c 3.4s| 1 | 0 | 1059 | 829k| 0 | 44 | 80 | 112 | 112 | 80 | 112 | 0 | 0 | 219 | 1.300000e+01 | -- | Inf
3.39/3.47 c 3.4s| 1 | 0 | 1081 |1149k| 0 | 48 | 80 | 112 | 112 | 80 | 122 | 10 | 0 | 219 | 1.300000e+01 | -- | Inf
3.59/3.66 c 3.6s| 1 | 0 | 1162 |1149k| 0 | 44 | 80 | 112 | 112 | 80 | 122 | 10 | 0 | 233 | 1.300000e+01 | -- | Inf
3.69/3.79 c 3.7s| 1 | 0 | 1229 |1148k| 0 | 40 | 80 | 111 | 111 | 80 | 122 | 10 | 0 | 247 | 1.300000e+01 | -- | Inf
3.79/3.83 c 3.7s| 1 | 0 | 1252 |1146k| 0 | 40 | 80 | 108 | 108 | 80 | 122 | 10 | 0 | 253 | 1.300000e+01 | -- | Inf
3.79/3.86 c 3.8s| 1 | 0 | 1252 |1146k| 0 | - | 80 | 108 | 108 | 80 | 122 | 10 | 0 | 262 | 1.300000e+01 | -- | Inf
3.79/3.86 c (run 4, node 1) restarting after 20 global fixings of integer variables
3.79/3.86 c
3.79/3.86 (restart) converted 10 cuts from the global cut pool into linear constraints
3.79/3.86 c
3.79/3.86 presolving:
3.79/3.87 c (round 1) 29 del vars, 9 del conss, 0 chg bounds, 2 chg sides, 8 chg coeffs, 10 upgd conss, 78 impls, 57 clqs
3.79/3.87 c (round 2) 30 del vars, 12 del conss, 0 chg bounds, 3 chg sides, 17 chg coeffs, 10 upgd conss, 86 impls, 57 clqs
3.79/3.88 c (round 3) 31 del vars, 22 del conss, 0 chg bounds, 3 chg sides, 26 chg coeffs, 10 upgd conss, 90 impls, 53 clqs
3.79/3.88 c (round 4) 32 del vars, 23 del conss, 0 chg bounds, 3 chg sides, 31 chg coeffs, 10 upgd conss, 94 impls, 53 clqs
3.79/3.88 c (round 5) 32 del vars, 24 del conss, 0 chg bounds, 3 chg sides, 38 chg coeffs, 10 upgd conss, 94 impls, 53 clqs
3.79/3.89 c (round 6) 32 del vars, 24 del conss, 0 chg bounds, 3 chg sides, 39 chg coeffs, 10 upgd conss, 94 impls, 53 clqs
3.79/3.89 c presolving (7 rounds):
3.79/3.89 c 32 deleted vars, 24 deleted constraints, 0 tightened bounds, 0 added holes, 3 changed sides, 39 changed coefficients
3.79/3.89 c 94 implications, 53 cliques
3.79/3.89 c presolved problem has 48 variables (48 bin, 0 int, 0 impl, 0 cont) and 94 constraints
3.79/3.89 c 31 constraints of type <knapsack>
3.79/3.89 c 59 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.08
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 | 1321 | 803k| 0 | 0 | 48 | 94 | 94 | 48 | 94 | 0 | 0 | 262 | 1.300000e+01 | -- | Inf
3.79/3.89 c * 3.8s| 1 | 0 | 1321 | 805k| 0 | - | 48 | 94 | 94 | 48 | 94 | 0 | 0 | 262 | 1.300000e+01 | 1.300000e+01 | 0.00%
3.79/3.89 c
3.79/3.89 c SCIP Status : problem is solved [optimal solution found]
3.79/3.89 c Solving Time (sec) : 3.78
3.79/3.89 c Solving Nodes : 1 (total of 5 nodes in 5 runs)
3.79/3.89 c Primal Bound : +1.30000000000000e+01 (1 solutions)
3.79/3.89 c Dual Bound : +1.30000000000000e+01
3.79/3.89 c Gap : 0.00 %
3.79/3.89 c NODE 1
3.79/3.89 c DUAL BOUND 13
3.79/3.89 c PRIMAL BOUND 13
3.79/3.89 c GAP 0
3.79/3.89 s SATISFIABLE
3.79/3.89 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 x161 -x160 -x159 -x158 -x157 x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
3.79/3.89 v -x147 -x146 -x145 -x144 -x143 -x142 x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
3.79/3.89 v x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 x106
3.79/3.89 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
3.79/3.89 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
3.79/3.89 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
3.79/3.89 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
3.79/3.89 v x4 -x3 -x2 -x1
3.79/3.89 c SCIP Status : problem is solved [optimal solution found]
3.79/3.89 c Solving Time : 3.78
3.79/3.89 c Original Problem :
3.79/3.89 c Problem name : HOME/instance-1868074-1245115621.opb
3.79/3.89 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
3.79/3.89 c Constraints : 101 initial, 101 maximal
3.79/3.89 c Presolved Problem :
3.79/3.89 c Problem name : t_HOME/instance-1868074-1245115621.opb
3.79/3.89 c Variables : 48 (48 binary, 0 integer, 0 implicit integer, 0 continuous)
3.79/3.89 c Constraints : 94 initial, 94 maximal
3.79/3.89 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.79/3.89 c trivial : 0.00 109 0 0 0 0 0 0 0
3.79/3.89 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.79/3.89 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.79/3.89 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.79/3.89 c implics : 0.00 0 0 0 0 0 0 0 0
3.79/3.89 c probing : 0.00 0 0 0 0 0 0 0 0
3.79/3.89 c knapsack : 0.05 0 0 0 0 0 0 3 43
3.79/3.89 c setppc : 0.02 10 2 0 0 0 34 0 0
3.79/3.89 c linear : 0.01 0 0 0 0 0 28 0 0
3.79/3.89 c logicor : 0.00 0 0 0 0 0 6 0 0
3.79/3.89 c root node : - 109 - - 109 - - - -
3.79/3.89 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.79/3.89 c integral : 0 0 0 23 0 0 109 0 0 0
3.79/3.89 c knapsack : 31 9 23 1 0 0 0 0 0 0
3.79/3.89 c setppc : 59 9 23 1 0 0 0 0 0 0
3.79/3.89 c logicor : 4 9 5 0 0 0 0 0 0 0
3.79/3.89 c countsols : 0 0 0 1 0 0 0 0 0 0
3.79/3.89 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.79/3.89 c integral : 3.46 0.00 0.00 3.46 0.00
3.79/3.89 c knapsack : 0.00 0.00 0.00 0.00 0.00
3.79/3.89 c setppc : 0.00 0.00 0.00 0.00 0.00
3.79/3.89 c logicor : 0.00 0.00 0.00 0.00 0.00
3.79/3.89 c countsols : 0.00 0.00 0.00 0.00 0.00
3.79/3.89 c Propagators : Time Calls Cutoffs DomReds
3.79/3.89 c rootredcost : 0.00 0 0 0
3.79/3.89 c pseudoobj : 0.00 28 0 0
3.79/3.89 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.79/3.89 c propagation : 0.00 0 0 0 0.0 0 0.0 -
3.79/3.89 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.79/3.89 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.79/3.89 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.79/3.89 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.79/3.89 c applied globally : - - - 0 0.0 - - -
3.79/3.89 c applied locally : - - - 0 0.0 - - -
3.79/3.89 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.79/3.89 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
3.79/3.89 c redcost : 0.00 9 0 0 0 0
3.79/3.89 c impliedbounds : 0.00 8 0 0 0 0
3.79/3.89 c intobj : 0.00 0 0 0 0 0
3.79/3.89 c gomory : 0.05 9 0 0 82 0
3.79/3.89 c strongcg : 0.07 9 0 0 374 0
3.79/3.89 c cmir : 0.00 0 0 0 0 0
3.79/3.89 c flowcover : 0.00 0 0 0 0 0
3.79/3.89 c clique : 0.00 9 0 0 41 0
3.79/3.89 c zerohalf : 0.00 0 0 0 0 0
3.79/3.89 c mcf : 0.00 5 0 0 0 0
3.79/3.89 c Pricers : Time Calls Vars
3.79/3.89 c problem variables: 0.00 0 0
3.79/3.89 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.79/3.89 c relpscost : 3.46 22 0 109 0 0 0
3.79/3.89 c pscost : 0.00 0 0 0 0 0 0
3.79/3.89 c inference : 0.00 0 0 0 0 0 0
3.79/3.89 c mostinf : 0.00 0 0 0 0 0 0
3.79/3.89 c leastinf : 0.00 0 0 0 0 0 0
3.79/3.89 c fullstrong : 0.00 0 0 0 0 0 0
3.79/3.89 c allfullstrong : 0.00 0 0 0 0 0 0
3.79/3.89 c random : 0.00 0 0 0 0 0 0
3.79/3.89 c Primal Heuristics : Time Calls Found
3.79/3.89 c LP solutions : 0.00 - 1
3.79/3.89 c pseudo solutions : 0.00 - 0
3.79/3.89 c simplerounding : 0.00 0 0
3.79/3.89 c rounding : 0.00 0 0
3.79/3.89 c shifting : 0.00 0 0
3.79/3.89 c intshifting : 0.00 0 0
3.79/3.89 c oneopt : 0.00 0 0
3.79/3.89 c fixandinfer : 0.00 0 0
3.79/3.89 c feaspump : 0.00 0 0
3.79/3.89 c coefdiving : 0.00 0 0
3.79/3.89 c pscostdiving : 0.00 0 0
3.79/3.89 c fracdiving : 0.00 0 0
3.79/3.89 c veclendiving : 0.00 0 0
3.79/3.89 c intdiving : 0.00 0 0
3.79/3.89 c actconsdiving : 0.00 0 0
3.79/3.89 c objpscostdiving : 0.00 0 0
3.79/3.89 c rootsoldiving : 0.00 0 0
3.79/3.89 c linesearchdiving : 0.00 0 0
3.79/3.89 c guideddiving : 0.00 0 0
3.79/3.89 c octane : 0.00 0 0
3.79/3.89 c rens : 0.00 0 0
3.79/3.89 c rins : 0.00 0 0
3.79/3.89 c localbranching : 0.00 0 0
3.79/3.89 c mutation : 0.00 0 0
3.79/3.89 c crossover : 0.00 0 0
3.79/3.89 c dins : 0.00 0 0
3.79/3.89 c LP : Time Calls Iterations Iter/call Iter/sec
3.79/3.89 c primal LP : 0.00 0 0 0.00 -
3.79/3.89 c dual LP : 0.12 31 1321 42.61 11008.33
3.79/3.89 c barrier LP : 0.00 0 0 0.00 -
3.79/3.89 c diving/probing LP: 0.00 0 0 0.00 -
3.79/3.89 c strong branching : 3.46 262 34268 130.79 9904.05
3.79/3.89 c (at root node) : - 262 34268 130.79 -
3.79/3.89 c conflict analysis: 0.00 0 0 0.00 -
3.79/3.89 c B&B Tree :
3.79/3.89 c number of runs : 5
3.79/3.89 c nodes : 1
3.79/3.89 c nodes (total) : 5
3.79/3.89 c nodes left : 0
3.79/3.89 c max depth : 0
3.79/3.89 c max depth (total): 0
3.79/3.89 c backtracks : 0 (0.0%)
3.79/3.89 c delayed cutoffs : 0
3.79/3.89 c repropagations : 0 (0 domain reductions, 0 cutoffs)
3.79/3.89 c avg switch length: 2.00
3.79/3.89 c switching time : 0.00
3.79/3.89 c Solution :
3.79/3.89 c Solutions found : 1 (1 improvements)
3.79/3.89 c Primal Bound : +1.30000000000000e+01 (in run 5, after 1 nodes, 3.78 seconds, depth 0, found by <relaxation>)
3.79/3.89 c Dual Bound : +1.30000000000000e+01
3.79/3.89 c Gap : 0.00 %
3.79/3.89 c Root Dual Bound : +1.30000000000000e+01
3.89/3.90 c Time complete: 3.9.