0.00/0.00 c SCIP version 1.1.0.7
0.00/0.00 c LP-Solver SoPlex 1.4.1
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c read problem <HOME/instance-3729357-1338679273.opb>
0.00/0.00 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.00 c No objective function, only one solution is needed.
0.00/0.00 c start presolving problem
0.00/0.00 c presolving:
0.00/0.01 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.01 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.01 c presolving (3 rounds):
0.00/0.01 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 8 implications, 68 cliques
0.00/0.01 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.01 c 1 constraints of type <knapsack>
0.00/0.01 c 68 constraints of type <setppc>
0.00/0.01 c 4 constraints of type <logicor>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.00
0.00/0.01 c SATUNSAT-LIN
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c separating/flowcover/freq = c -1
0.00/0.01 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c separating/cmir/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.01 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/veclendiving/freq = c -1
0.00/0.01 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/simplerounding/freq = c -1
0.00/0.01 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/shifting/freq = c -1
0.00/0.01 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/rounding/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.01 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.01 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/rootsoldiving/freq = c -1
0.00/0.01 c # number of nodes added to the contingent of the total nodes
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01 c heuristics/rens/nodesofs = c 2000
0.00/0.01 c # minimum percentage of integer variables that have to be fixable
0.00/0.01 c # [type: real, range: [0,1], default: 0.5]
0.00/0.01 c heuristics/rens/minfixingrate = c 0.3
0.00/0.01 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/rens/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.01 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/pscostdiving/freq = c -1
0.00/0.01 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/oneopt/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.01 c # [type: real, range: [0,1], default: 0.01]
0.00/0.01 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.01 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/objpscostdiving/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.01 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/linesearchdiving/freq = c -1
0.00/0.01 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/intshifting/freq = c -1
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.01 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/guideddiving/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.01 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/fracdiving/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.01 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/feaspump/freq = c -1
0.00/0.01 c # minimum percentage of integer variables that have to be fixed
0.00/0.01 c # [type: real, range: [0,1], default: 0.666]
0.00/0.01 c heuristics/crossover/minfixingrate = c 0.5
0.00/0.01 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.01 c # [type: real, range: [0,1], default: 0.1]
0.00/0.01 c heuristics/crossover/nodesquot = c 0.15
0.00/0.01 c # number of nodes without incumbent change that heuristic should wait
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.01 c heuristics/crossover/nwaitingnodes = c 100
0.00/0.01 c # number of nodes added to the contingent of the total nodes
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01 c heuristics/crossover/nodesofs = c 750
0.00/0.01 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.01 c heuristics/crossover/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.01 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/coefdiving/freq = c -1
0.00/0.01 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c presolving/probing/maxrounds = c 0
0.00/0.01 c # should presolving try to simplify knapsacks
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.01 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.01 c constraints/knapsack/disaggregation = c FALSE
0.00/0.01 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c constraints/knapsack/maxnumcardlift = c 0
0.00/0.01 c # should presolving try to simplify inequalities
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/linear/simplifyinequalities = c TRUE
0.00/0.01 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/maxroundsroot = c 5
0.00/0.01 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.01 c separating/maxrounds = c 1
0.00/0.01 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c limits/solutions = c 1
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = c 13950
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = c 1791
0.00/0.01 c # frequency for displaying node information lines
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01 c display/freq = c 10000
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving problem
0.00/0.01 c
0.00/0.01 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.01 c 0.0s| 1 | 0 | 113 | 593k| 0 | 35 | 169 | 73 | 73 | 169 | 73 | 0 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 147 | 801k| 0 | 51 | 169 | 73 | 73 | 169 | 86 | 13 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.03 c 0.0s| 1 | 0 | 174 | 911k| 0 | 57 | 169 | 73 | 73 | 169 | 95 | 22 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.03 c 0.0s| 1 | 0 | 219 |1005k| 0 | 60 | 169 | 73 | 73 | 169 | 102 | 29 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.04 c 0.0s| 1 | 0 | 255 |1074k| 0 | 60 | 169 | 73 | 73 | 169 | 108 | 35 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.05 c 0.1s| 1 | 0 | 301 |1124k| 0 | 61 | 169 | 73 | 73 | 169 | 114 | 41 | 0 | 0 | 1.300000e+01 | -- | Inf
0.39/0.40 c 0.4s| 1 | 0 | 326 |1124k| 0 | 62 | 169 | 73 | 73 | 169 | 114 | 41 | 0 | 35 | 1.300000e+01 | -- | Inf
0.49/0.53 c 0.5s| 1 | 0 | 342 |1124k| 0 | 65 | 169 | 73 | 73 | 169 | 114 | 41 | 0 | 49 | 1.300000e+01 | -- | Inf
0.59/0.60 c 0.6s| 1 | 0 | 363 |1124k| 0 | 61 | 169 | 73 | 73 | 169 | 114 | 41 | 0 | 56 | 1.300000e+01 | -- | Inf
0.59/0.67 c 0.7s| 1 | 0 | 384 |1124k| 0 | 64 | 169 | 73 | 73 | 169 | 114 | 41 | 0 | 63 | 1.300000e+01 | -- | Inf
0.69/0.75 c 0.7s| 1 | 0 | 405 |1124k| 0 | 58 | 169 | 73 | 73 | 169 | 114 | 41 | 0 | 71 | 1.300000e+01 | -- | Inf
0.79/0.80 c 0.8s| 1 | 0 | 430 |1123k| 0 | 60 | 169 | 72 | 72 | 169 | 113 | 41 | 0 | 77 | 1.300000e+01 | -- | Inf
0.79/0.86 c 0.8s| 1 | 0 | 443 |1123k| 0 | 59 | 169 | 72 | 72 | 169 | 113 | 41 | 0 | 84 | 1.300000e+01 | -- | Inf
0.89/0.90 c 0.9s| 1 | 0 | 443 |1123k| 0 | - | 169 | 72 | 72 | 169 | 113 | 41 | 0 | 90 | 1.300000e+01 | -- | Inf
0.89/0.90 c (run 1, node 1) restarting after 37 global fixings of integer variables
0.89/0.90 c
0.89/0.90 (restart) converted 40 cuts from the global cut pool into linear constraints
0.89/0.90 c
0.89/0.90 presolving:
0.89/0.91 c (round 1) 37 del vars, 2 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 12 impls, 93 clqs
0.89/0.91 c (round 2) 37 del vars, 2 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 39 upgd conss, 12 impls, 93 clqs
0.89/0.91 c (round 3) 37 del vars, 6 del conss, 0 chg bounds, 1 chg sides, 1 chg coeffs, 39 upgd conss, 12 impls, 93 clqs
0.89/0.91 c presolving (4 rounds):
0.89/0.91 c 37 deleted vars, 6 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 1 changed coefficients
0.89/0.91 c 12 implications, 93 cliques
0.89/0.91 c presolved problem has 132 variables (132 bin, 0 int, 0 impl, 0 cont) and 106 constraints
0.89/0.91 c 12 constraints of type <knapsack>
0.89/0.91 c 89 constraints of type <setppc>
0.89/0.91 c 5 constraints of type <logicor>
0.89/0.91 c transformed objective value is always integral (scale: 1)
0.89/0.91 c Presolving Time: 0.01
0.89/0.91 c
0.89/0.91 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.89/0.91 c 0.9s| 1 | 0 | 518 | 778k| 0 | 46 | 132 | 106 | 106 | 132 | 106 | 0 | 0 | 90 | 1.300000e+01 | -- | Inf
0.89/0.92 c 0.9s| 1 | 0 | 540 |1032k| 0 | 50 | 132 | 106 | 106 | 132 | 115 | 9 | 0 | 90 | 1.300000e+01 | -- | Inf
1.00/1.04 c 1.0s| 1 | 0 | 552 |1032k| 0 | 51 | 132 | 106 | 106 | 132 | 115 | 9 | 0 | 133 | 1.300000e+01 | -- | Inf
1.00/1.08 c 1.1s| 1 | 0 | 572 |1032k| 0 | 50 | 132 | 106 | 106 | 132 | 115 | 9 | 0 | 144 | 1.300000e+01 | -- | Inf
1.09/1.11 c 1.1s| 1 | 0 | 586 |1032k| 0 | 51 | 132 | 106 | 106 | 132 | 115 | 9 | 0 | 151 | 1.300000e+01 | -- | Inf
1.09/1.14 c 1.1s| 1 | 0 | 596 |1031k| 0 | 46 | 132 | 106 | 106 | 132 | 115 | 9 | 0 | 158 | 1.300000e+01 | -- | Inf
1.09/1.16 c 1.1s| 1 | 0 | 602 |1031k| 0 | 47 | 132 | 105 | 105 | 132 | 115 | 9 | 0 | 166 | 1.300000e+01 | -- | Inf
1.09/1.17 c 1.2s| 1 | 0 | 609 |1031k| 0 | 49 | 132 | 105 | 105 | 132 | 115 | 9 | 0 | 170 | 1.300000e+01 | -- | Inf
1.09/1.19 c 1.2s| 1 | 0 | 609 |1031k| 0 | - | 132 | 105 | 105 | 132 | 115 | 9 | 0 | 174 | 1.300000e+01 | -- | Inf
1.09/1.19 c (run 2, node 1) restarting after 28 global fixings of integer variables
1.09/1.19 c
1.09/1.19 (restart) converted 9 cuts from the global cut pool into linear constraints
1.09/1.19 c
1.09/1.19 presolving:
1.09/1.19 c (round 1) 28 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 22 impls, 91 clqs
1.09/1.19 c (round 2) 28 del vars, 5 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 22 impls, 91 clqs
1.09/1.19 c presolving (3 rounds):
1.09/1.19 c 28 deleted vars, 5 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.09/1.19 c 22 implications, 91 cliques
1.09/1.19 c presolved problem has 104 variables (104 bin, 0 int, 0 impl, 0 cont) and 109 constraints
1.09/1.19 c 16 constraints of type <knapsack>
1.09/1.19 c 89 constraints of type <setppc>
1.09/1.19 c 4 constraints of type <logicor>
1.09/1.19 c transformed objective value is always integral (scale: 1)
1.09/1.19 c Presolving Time: 0.01
1.09/1.19 c
1.09/1.19 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.09/1.19 c 1.2s| 1 | 0 | 691 | 789k| 0 | 42 | 104 | 109 | 109 | 104 | 109 | 0 | 0 | 174 | 1.300000e+01 | -- | Inf
1.19/1.20 c 1.2s| 1 | 0 | 720 |1004k| 0 | 49 | 104 | 109 | 109 | 104 | 121 | 12 | 0 | 174 | 1.300000e+01 | -- | Inf
1.29/1.37 c 1.4s| 1 | 0 | 752 |1004k| 0 | 53 | 104 | 109 | 109 | 104 | 121 | 12 | 0 | 218 | 1.300000e+01 | -- | Inf
1.39/1.46 c 1.4s| 1 | 0 | 761 |1004k| 0 | 51 | 104 | 109 | 109 | 104 | 121 | 12 | 0 | 237 | 1.300000e+01 | -- | Inf
1.39/1.47 c 1.4s| 1 | 0 | 766 |1004k| 0 | 49 | 104 | 109 | 109 | 104 | 121 | 12 | 0 | 239 | 1.300000e+01 | -- | Inf
1.39/1.49 c 1.5s| 1 | 0 | 769 |1004k| 0 | 50 | 104 | 109 | 109 | 104 | 121 | 12 | 0 | 242 | 1.300000e+01 | -- | Inf
1.39/1.49 c 1.5s| 1 | 2 | 769 |1005k| 0 | 50 | 104 | 109 | 109 | 104 | 121 | 12 | 0 | 243 | 1.300000e+01 | -- | Inf
1.39/1.49 c (run 3, node 1) restarting after 9 global fixings of integer variables
1.39/1.49 c
1.39/1.49 (restart) converted 9 cuts from the global cut pool into linear constraints
1.39/1.49 c
1.39/1.49 presolving:
1.39/1.49 c (round 1) 9 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 9 upgd conss, 28 impls, 92 clqs
1.49/1.50 c (round 2) 9 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 9 upgd conss, 28 impls, 92 clqs
1.49/1.50 c presolving (3 rounds):
1.49/1.50 c 9 deleted vars, 3 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 2 changed coefficients
1.49/1.50 c 28 implications, 92 cliques
1.49/1.50 c presolved problem has 95 variables (95 bin, 0 int, 0 impl, 0 cont) and 115 constraints
1.49/1.50 c 21 constraints of type <knapsack>
1.49/1.50 c 90 constraints of type <setppc>
1.49/1.50 c 4 constraints of type <logicor>
1.49/1.50 c transformed objective value is always integral (scale: 1)
1.49/1.50 c Presolving Time: 0.01
1.49/1.50 c
1.49/1.50 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.49/1.50 c 1.5s| 1 | 0 | 841 | 824k| 0 | 45 | 95 | 115 | 115 | 95 | 115 | 0 | 0 | 243 | 1.300000e+01 | -- | Inf
1.49/1.51 c 1.5s| 1 | 0 | 868 |1061k| 0 | 48 | 95 | 115 | 115 | 95 | 126 | 11 | 0 | 243 | 1.300000e+01 | -- | Inf
1.59/1.68 c 1.7s| 1 | 0 | 876 |1061k| 0 | 48 | 95 | 115 | 115 | 95 | 126 | 11 | 0 | 291 | 1.300000e+01 | -- | Inf
1.69/1.71 c 1.7s| 1 | 0 | 878 |1061k| 0 | 48 | 95 | 115 | 115 | 95 | 126 | 11 | 0 | 297 | 1.300000e+01 | -- | Inf
1.69/1.72 c 1.7s| 1 | 0 | 879 |1060k| 0 | 48 | 95 | 114 | 114 | 95 | 126 | 11 | 0 | 299 | 1.300000e+01 | -- | Inf
1.69/1.73 c 1.7s| 1 | 0 | 880 |1060k| 0 | 48 | 95 | 114 | 114 | 95 | 126 | 11 | 0 | 300 | 1.300000e+01 | -- | Inf
1.69/1.73 c 1.7s| 1 | 2 | 880 |1061k| 0 | 48 | 95 | 114 | 114 | 95 | 126 | 11 | 0 | 301 | 1.300000e+01 | -- | Inf
1.89/1.98 c * 1.9s| 7 | 0 | 1229 |1065k| 3 | - | 95 | 78 | 77 | 95 | 79 | 11 | 0 | 463 | 1.300000e+01 | 1.300000e+01 | 0.00%
1.89/1.98 c
1.89/1.98 c SCIP Status : problem is solved [optimal solution found]
1.89/1.98 c Solving Time (sec) : 1.94
1.89/1.98 c Solving Nodes : 7 (total of 10 nodes in 4 runs)
1.89/1.98 c Primal Bound : +1.30000000000000e+01 (1 solutions)
1.89/1.98 c Dual Bound : +1.30000000000000e+01
1.89/1.98 c Gap : 0.00 %
1.89/1.98 c NODE 7
1.89/1.98 c DUAL BOUND 13
1.89/1.98 c PRIMAL BOUND 13
1.89/1.98 c GAP 0
1.89/1.98 s SATISFIABLE
1.89/1.98 v -x169 -x168 x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 x152 -x151 -x150 -x149 -x148
1.89/1.98 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 x133 -x132 -x131 -x130 -x129 -x128 -x127
1.89/1.98 v -x126 -x125 -x124 x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 x112 -x111 -x110 -x109 -x108 -x107 -x106
1.89/1.98 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
1.89/1.98 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
1.89/1.98 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
1.89/1.98 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
1.89/1.98 v -x4 -x3 -x2 -x1
1.89/1.98 c SCIP Status : problem is solved [optimal solution found]
1.89/1.98 c Solving Time : 1.94
1.89/1.98 c Original Problem :
1.89/1.98 c Problem name : HOME/instance-3729357-1338679273.opb
1.89/1.98 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.89/1.98 c Constraints : 101 initial, 101 maximal
1.89/1.98 c Presolved Problem :
1.89/1.98 c Problem name : t_HOME/instance-3729357-1338679273.opb
1.89/1.98 c Variables : 95 (95 binary, 0 integer, 0 implicit integer, 0 continuous)
1.89/1.98 c Constraints : 115 initial, 115 maximal
1.89/1.98 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.89/1.98 c trivial : 0.00 74 0 0 0 0 0 0 0
1.89/1.98 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.89/1.98 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.89/1.98 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.89/1.98 c implics : 0.00 0 0 0 0 0 0 0 0
1.89/1.98 c probing : 0.00 0 0 0 0 0 0 0 0
1.89/1.98 c knapsack : 0.01 0 0 0 0 0 0 0 3
1.89/1.98 c setppc : 0.00 0 0 0 0 0 12 0 0
1.89/1.98 c linear : 0.00 0 0 0 0 0 29 1 0
1.89/1.98 c logicor : 0.00 0 0 0 0 0 1 0 0
1.89/1.98 c root node : - 137 - - 137 - - - -
1.89/1.98 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.89/1.98 c integral : 0 0 0 46 0 2 139 0 0 8
1.89/1.98 c knapsack : 21 8 59 1 0 0 0 0 0 0
1.89/1.98 c setppc : 90 8 59 1 0 0 80 0 0 0
1.89/1.98 c logicor : 4 8 7 1 0 0 0 0 0 0
1.89/1.98 c countsols : 0 0 0 1 0 0 0 0 0 0
1.89/1.98 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.89/1.98 c integral : 1.84 0.00 0.00 1.84 0.00
1.89/1.98 c knapsack : 0.00 0.00 0.00 0.00 0.00
1.89/1.98 c setppc : 0.00 0.00 0.00 0.00 0.00
1.89/1.98 c logicor : 0.00 0.00 0.00 0.00 0.00
1.89/1.98 c countsols : 0.00 0.00 0.00 0.00 0.00
1.89/1.98 c Propagators : Time Calls Cutoffs DomReds
1.89/1.98 c rootredcost : 0.00 0 0 0
1.89/1.98 c pseudoobj : 0.01 63 0 0
1.89/1.98 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.89/1.98 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.89/1.98 c infeasible LP : 0.00 1 0 0 0.0 0 0.0 0
1.89/1.98 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.98 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.98 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.89/1.98 c applied globally : - - - 0 0.0 - - -
1.89/1.98 c applied locally : - - - 0 0.0 - - -
1.89/1.98 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.89/1.98 c cut pool : 0.00 0 - - 0 - (maximal pool size: 94)
1.89/1.98 c redcost : 0.00 14 0 0 0 0
1.89/1.98 c impliedbounds : 0.00 8 0 0 0 0
1.89/1.98 c intobj : 0.00 0 0 0 0 0
1.89/1.98 c gomory : 0.01 8 0 0 6 0
1.89/1.98 c strongcg : 0.02 8 0 0 400 0
1.89/1.98 c cmir : 0.00 0 0 0 0 0
1.89/1.98 c flowcover : 0.00 0 0 0 0 0
1.89/1.98 c clique : 0.01 8 0 0 48 0
1.89/1.98 c zerohalf : 0.00 0 0 0 0 0
1.89/1.98 c mcf : 0.00 4 0 0 0 0
1.89/1.98 c Pricers : Time Calls Vars
1.89/1.98 c problem variables: 0.00 0 0
1.89/1.98 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.89/1.98 c relpscost : 1.84 45 2 139 0 0 8
1.89/1.98 c pscost : 0.00 0 0 0 0 0 0
1.89/1.98 c inference : 0.00 0 0 0 0 0 0
1.89/1.98 c mostinf : 0.00 0 0 0 0 0 0
1.89/1.98 c leastinf : 0.00 0 0 0 0 0 0
1.89/1.98 c fullstrong : 0.00 0 0 0 0 0 0
1.89/1.98 c allfullstrong : 0.00 0 0 0 0 0 0
1.89/1.98 c random : 0.00 0 0 0 0 0 0
1.89/1.98 c Primal Heuristics : Time Calls Found
1.89/1.98 c LP solutions : 0.00 - 1
1.89/1.98 c pseudo solutions : 0.00 - 0
1.89/1.98 c simplerounding : 0.00 0 0
1.89/1.98 c rounding : 0.00 0 0
1.89/1.98 c shifting : 0.00 0 0
1.89/1.98 c intshifting : 0.00 0 0
1.89/1.98 c oneopt : 0.00 0 0
1.89/1.98 c fixandinfer : 0.00 0 0
1.89/1.98 c feaspump : 0.00 0 0
1.89/1.98 c coefdiving : 0.00 0 0
1.89/1.98 c pscostdiving : 0.00 0 0
1.89/1.98 c fracdiving : 0.00 0 0
1.89/1.98 c veclendiving : 0.00 0 0
1.89/1.98 c intdiving : 0.00 0 0
1.89/1.98 c actconsdiving : 0.00 0 0
1.89/1.98 c objpscostdiving : 0.00 0 0
1.89/1.98 c rootsoldiving : 0.00 0 0
1.89/1.98 c linesearchdiving : 0.00 0 0
1.89/1.98 c guideddiving : 0.00 0 0
1.89/1.98 c octane : 0.00 0 0
1.89/1.98 c rens : 0.00 0 0
1.89/1.98 c rins : 0.00 0 0
1.89/1.98 c localbranching : 0.00 0 0
1.89/1.98 c mutation : 0.00 0 0
1.89/1.98 c crossover : 0.00 0 0
1.89/1.98 c dins : 0.00 0 0
1.89/1.98 c LP : Time Calls Iterations Iter/call Iter/sec
1.89/1.98 c primal LP : 0.00 0 0 0.00 -
1.89/1.98 c dual LP : 0.04 55 1229 22.35 30725.00
1.89/1.98 c barrier LP : 0.00 0 0 0.00 -
1.89/1.98 c diving/probing LP: 0.00 0 0 0.00 -
1.89/1.98 c strong branching : 1.84 463 45843 99.01 24914.67
1.89/1.98 c (at root node) : - 301 37190 123.55 -
1.89/1.98 c conflict analysis: 0.00 0 0 0.00 -
1.89/1.98 c B&B Tree :
1.89/1.98 c number of runs : 4
1.89/1.98 c nodes : 7
1.89/1.98 c nodes (total) : 10
1.89/1.98 c nodes left : 0
1.89/1.98 c max depth : 3
1.89/1.98 c max depth (total): 3
1.89/1.98 c backtracks : 0 (0.0%)
1.89/1.98 c delayed cutoffs : 0
1.89/1.98 c repropagations : 2 (0 domain reductions, 0 cutoffs)
1.89/1.98 c avg switch length: 2.86
1.89/1.98 c switching time : 0.00
1.89/1.98 c Solution :
1.89/1.98 c Solutions found : 1 (1 improvements)
1.89/1.98 c Primal Bound : +1.30000000000000e+01 (in run 4, after 7 nodes, 1.94 seconds, depth 3, found by <relaxation>)
1.89/1.98 c Dual Bound : +1.30000000000000e+01
1.89/1.98 c Gap : 0.00 %
1.89/1.98 c Root Dual Bound : +1.30000000000001e+01
1.89/1.98 c Time complete: 1.97.