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-1868066-1245115600.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.02 c start solving problem
0.00/0.02 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 | 122 | 593k| 0 | 44 | 169 | 73 | 73 | 169 | 73 | 0 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.05 c 0.0s| 1 | 0 | 144 | 825k| 0 | 48 | 169 | 73 | 73 | 169 | 88 | 15 | 0 | 0 | 1.300000e+01 | -- | Inf
0.05/0.06 c 0.1s| 1 | 0 | 157 |1094k| 0 | 53 | 169 | 73 | 73 | 169 | 95 | 22 | 0 | 0 | 1.300000e+01 | -- | Inf
0.05/0.09 c 0.1s| 1 | 0 | 187 |1395k| 0 | 58 | 169 | 73 | 73 | 169 | 100 | 27 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.11 c 0.1s| 1 | 0 | 206 |1671k| 0 | 58 | 169 | 73 | 73 | 169 | 103 | 30 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 237 |1870k| 0 | 58 | 169 | 73 | 73 | 169 | 105 | 32 | 0 | 0 | 1.300000e+01 | -- | Inf
0.59/0.65 c 0.6s| 1 | 0 | 271 |1870k| 0 | 58 | 169 | 73 | 73 | 169 | 105 | 32 | 0 | 36 | 1.300000e+01 | -- | Inf
0.88/0.93 c 0.9s| 1 | 0 | 314 |1870k| 0 | 49 | 169 | 73 | 73 | 169 | 105 | 32 | 0 | 52 | 1.300000e+01 | -- | Inf
0.98/1.07 c 1.0s| 1 | 0 | 341 |1870k| 0 | 49 | 169 | 73 | 73 | 169 | 105 | 32 | 0 | 61 | 1.300000e+01 | -- | Inf
1.09/1.17 c 1.1s| 1 | 0 | 354 |1870k| 0 | 49 | 169 | 73 | 73 | 169 | 105 | 32 | 0 | 69 | 1.300000e+01 | -- | Inf
1.18/1.26 c 1.2s| 1 | 0 | 361 |1870k| 0 | 51 | 169 | 73 | 73 | 169 | 105 | 32 | 0 | 78 | 1.300000e+01 | -- | Inf
1.28/1.35 c 1.3s| 1 | 0 | 368 |1870k| 0 | 51 | 169 | 73 | 73 | 169 | 100 | 32 | 0 | 87 | 1.300000e+01 | -- | Inf
1.38/1.41 c 1.4s| 1 | 0 | 371 |1870k| 0 | 50 | 169 | 73 | 73 | 169 | 100 | 32 | 0 | 93 | 1.300000e+01 | -- | Inf
1.38/1.44 c 1.4s| 1 | 0 | 375 |1870k| 0 | 48 | 169 | 73 | 73 | 169 | 100 | 32 | 0 | 96 | 1.300000e+01 | -- | Inf
1.38/1.46 c 1.4s| 1 | 0 | 375 |1870k| 0 | - | 169 | 73 | 73 | 169 | 100 | 32 | 0 | 98 | 1.300000e+01 | -- | Inf
1.38/1.46 c (run 1, node 1) restarting after 34 global fixings of integer variables
1.38/1.46 c
1.38/1.46 (restart) converted 27 cuts from the global cut pool into linear constraints
1.38/1.46 c
1.38/1.46 presolving:
1.38/1.46 c (round 1) 34 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 27 upgd conss, 16 impls, 82 clqs
1.38/1.47 c (round 2) 34 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 27 upgd conss, 16 impls, 82 clqs
1.38/1.47 c presolving (3 rounds):
1.38/1.47 c 34 deleted vars, 2 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.38/1.47 c 16 implications, 82 cliques
1.38/1.47 c presolved problem has 135 variables (135 bin, 0 int, 0 impl, 0 cont) and 98 constraints
1.38/1.47 c 10 constraints of type <knapsack>
1.38/1.47 c 84 constraints of type <setppc>
1.38/1.47 c 4 constraints of type <logicor>
1.38/1.47 c transformed objective value is always integral (scale: 1)
1.38/1.47 c Presolving Time: 0.02
1.38/1.47 c
1.38/1.48 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.38/1.48 c 1.4s| 1 | 0 | 470 | 763k| 0 | 46 | 135 | 98 | 98 | 135 | 98 | 0 | 0 | 98 | 1.300000e+01 | -- | Inf
1.38/1.49 c 1.4s| 1 | 0 | 481 |1013k| 0 | 53 | 135 | 98 | 98 | 135 | 111 | 13 | 0 | 98 | 1.300000e+01 | -- | Inf
1.88/1.93 c 1.9s| 1 | 0 | 492 |1013k| 0 | 56 | 135 | 98 | 98 | 135 | 111 | 13 | 0 | 151 | 1.300000e+01 | -- | Inf
1.98/2.03 c 2.0s| 1 | 0 | 499 |1012k| 0 | 56 | 135 | 98 | 98 | 135 | 111 | 13 | 0 | 159 | 1.300000e+01 | -- | Inf
2.09/2.10 c 2.0s| 1 | 0 | 505 |1012k| 0 | 56 | 135 | 98 | 98 | 135 | 111 | 13 | 0 | 166 | 1.300000e+01 | -- | Inf
2.09/2.16 c 2.1s| 1 | 0 | 512 |1012k| 0 | 58 | 135 | 98 | 98 | 135 | 111 | 13 | 0 | 171 | 1.300000e+01 | -- | Inf
2.19/2.23 c 2.2s| 1 | 0 | 515 |1012k| 0 | 58 | 135 | 98 | 98 | 135 | 111 | 13 | 0 | 177 | 1.300000e+01 | -- | Inf
2.19/2.25 c 2.2s| 1 | 0 | 517 |1012k| 0 | 59 | 135 | 98 | 98 | 135 | 111 | 13 | 0 | 179 | 1.300000e+01 | -- | Inf
2.19/2.28 c 2.2s| 1 | 0 | 518 |1012k| 0 | 59 | 135 | 98 | 98 | 135 | 111 | 13 | 0 | 181 | 1.300000e+01 | -- | Inf
2.19/2.28 c 2.2s| 1 | 2 | 518 |1013k| 0 | 59 | 135 | 98 | 98 | 135 | 111 | 13 | 0 | 181 | 1.300000e+01 | -- | Inf
2.19/2.28 c (run 2, node 1) restarting after 17 global fixings of integer variables
2.19/2.28 c
2.19/2.28 (restart) converted 10 cuts from the global cut pool into linear constraints
2.19/2.28 c
2.19/2.28 presolving:
2.19/2.29 c (round 1) 17 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 10 upgd conss, 22 impls, 85 clqs
2.19/2.29 c presolving (2 rounds):
2.19/2.29 c 17 deleted vars, 3 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.19/2.29 c 22 implications, 85 cliques
2.19/2.29 c presolved problem has 118 variables (118 bin, 0 int, 0 impl, 0 cont) and 105 constraints
2.19/2.29 c 14 constraints of type <knapsack>
2.19/2.29 c 89 constraints of type <setppc>
2.19/2.29 c 2 constraints of type <logicor>
2.19/2.29 c transformed objective value is always integral (scale: 1)
2.19/2.29 c Presolving Time: 0.03
2.19/2.29 c
2.28/2.30 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.28/2.30 c 2.2s| 1 | 0 | 605 | 805k| 0 | 51 | 118 | 105 | 105 | 118 | 105 | 0 | 0 | 181 | 1.300000e+01 | -- | Inf
2.28/2.32 c 2.2s| 1 | 0 | 628 |1043k| 0 | 54 | 118 | 105 | 105 | 118 | 115 | 10 | 0 | 181 | 1.300000e+01 | -- | Inf
2.58/2.65 c 2.6s| 1 | 0 | 636 |1043k| 0 | 55 | 118 | 105 | 105 | 118 | 115 | 10 | 0 | 227 | 1.300000e+01 | -- | Inf
2.69/2.79 c 2.7s| 1 | 0 | 640 |1043k| 0 | 53 | 118 | 105 | 105 | 118 | 115 | 10 | 0 | 241 | 1.300000e+01 | -- | Inf
2.78/2.80 c 2.7s| 1 | 2 | 640 |1044k| 0 | 53 | 118 | 105 | 105 | 118 | 115 | 10 | 0 | 243 | 1.300000e+01 | -- | Inf
3.18/3.26 c * 3.1s| 6 | 0 | 905 |1078k| 3 | - | 118 | 105 | 73 | 118 | 80 | 10 | 0 | 410 | 1.300000e+01 | 1.300000e+01 | 0.00%
3.18/3.26 c
3.18/3.26 c SCIP Status : problem is solved [optimal solution found]
3.18/3.26 c Solving Time (sec) : 3.14
3.18/3.26 c Solving Nodes : 6 (total of 8 nodes in 3 runs)
3.18/3.26 c Primal Bound : +1.30000000000000e+01 (1 solutions)
3.18/3.26 c Dual Bound : +1.30000000000000e+01
3.18/3.26 c Gap : 0.00 %
3.18/3.26 c NODE 6
3.18/3.26 c DUAL BOUND 13
3.18/3.26 c PRIMAL BOUND 13
3.18/3.26 c GAP 0
3.18/3.26 s SATISFIABLE
3.18/3.26 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 x160 -x159 -x158 -x157 -x156 -x155 -x154 x153 -x152 -x151 -x150 -x149 -x148
3.18/3.26 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 x131 -x130 -x129 -x128 -x127
3.18/3.26 v -x126 -x125 -x124 x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
3.18/3.26 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.18/3.26 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.18/3.26 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.18/3.26 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.18/3.26 v -x4 -x3 -x2 -x1
3.18/3.26 c SCIP Status : problem is solved [optimal solution found]
3.18/3.26 c Solving Time : 3.14
3.18/3.26 c Original Problem :
3.18/3.26 c Problem name : HOME/instance-1868066-1245115600.opb
3.18/3.26 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
3.18/3.26 c Constraints : 101 initial, 101 maximal
3.18/3.26 c Presolved Problem :
3.18/3.26 c Problem name : t_HOME/instance-1868066-1245115600.opb
3.18/3.26 c Variables : 118 (118 binary, 0 integer, 0 implicit integer, 0 continuous)
3.18/3.26 c Constraints : 105 initial, 105 maximal
3.18/3.26 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.18/3.26 c trivial : 0.00 51 0 0 0 0 0 0 0
3.18/3.26 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.18/3.26 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.18/3.26 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.18/3.26 c implics : 0.00 0 0 0 0 0 0 0 0
3.18/3.26 c probing : 0.00 0 0 0 0 0 0 0 0
3.18/3.26 c knapsack : 0.01 0 0 0 0 0 0 0 0
3.18/3.26 c setppc : 0.00 0 0 0 0 0 2 0 0
3.18/3.26 c linear : 0.01 0 0 0 0 0 28 0 0
3.18/3.26 c logicor : 0.01 0 0 0 0 0 3 0 0
3.18/3.26 c root node : - 57 - - 57 - - - -
3.18/3.26 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.18/3.26 c integral : 0 0 0 36 0 1 104 0 0 8
3.18/3.26 c knapsack : 14 7 44 1 0 0 0 0 0 0
3.18/3.26 c setppc : 89 7 44 1 0 0 87 0 0 0
3.18/3.26 c logicor : 2 7 4 1 0 0 0 0 0 0
3.18/3.26 c countsols : 0 0 0 1 0 0 0 0 0 0
3.18/3.26 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.18/3.26 c integral : 2.92 0.00 0.00 2.92 0.00
3.18/3.26 c knapsack : 0.00 0.00 0.00 0.00 0.00
3.18/3.26 c setppc : 0.00 0.00 0.00 0.00 0.00
3.18/3.26 c logicor : 0.00 0.00 0.00 0.00 0.00
3.18/3.26 c countsols : 0.00 0.00 0.00 0.00 0.00
3.18/3.26 c Propagators : Time Calls Cutoffs DomReds
3.18/3.26 c rootredcost : 0.00 0 0 0
3.18/3.26 c pseudoobj : 0.00 47 0 0
3.18/3.26 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.18/3.26 c propagation : 0.00 0 0 0 0.0 0 0.0 -
3.18/3.26 c infeasible LP : 0.00 1 0 0 0.0 0 0.0 0
3.18/3.26 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.18/3.26 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.18/3.26 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.18/3.26 c applied globally : - - - 0 0.0 - - -
3.18/3.26 c applied locally : - - - 0 0.0 - - -
3.18/3.26 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.18/3.26 c cut pool : 0.00 0 - - 0 - (maximal pool size: 82)
3.18/3.26 c redcost : 0.00 12 0 0 0 0
3.18/3.26 c impliedbounds : 0.00 7 0 0 0 0
3.18/3.26 c intobj : 0.00 0 0 0 0 0
3.18/3.26 c gomory : 0.07 7 0 0 0 0
3.18/3.26 c strongcg : 0.06 7 0 0 459 0
3.18/3.26 c cmir : 0.00 0 0 0 0 0
3.18/3.26 c flowcover : 0.00 0 0 0 0 0
3.18/3.26 c clique : 0.00 7 0 0 32 0
3.18/3.26 c zerohalf : 0.00 0 0 0 0 0
3.18/3.26 c mcf : 0.00 3 0 0 0 0
3.18/3.26 c Pricers : Time Calls Vars
3.18/3.26 c problem variables: 0.00 0 0
3.18/3.26 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.18/3.26 c relpscost : 2.92 35 1 104 0 0 8
3.18/3.26 c pscost : 0.00 0 0 0 0 0 0
3.18/3.26 c inference : 0.00 0 0 0 0 0 0
3.18/3.26 c mostinf : 0.00 0 0 0 0 0 0
3.18/3.26 c leastinf : 0.00 0 0 0 0 0 0
3.18/3.26 c fullstrong : 0.00 0 0 0 0 0 0
3.18/3.26 c allfullstrong : 0.00 0 0 0 0 0 0
3.18/3.26 c random : 0.00 0 0 0 0 0 0
3.18/3.26 c Primal Heuristics : Time Calls Found
3.18/3.26 c LP solutions : 0.00 - 1
3.18/3.26 c pseudo solutions : 0.00 - 0
3.18/3.26 c simplerounding : 0.00 0 0
3.18/3.26 c rounding : 0.00 0 0
3.18/3.26 c shifting : 0.00 0 0
3.18/3.26 c intshifting : 0.00 0 0
3.18/3.26 c oneopt : 0.00 0 0
3.18/3.26 c fixandinfer : 0.00 0 0
3.18/3.26 c feaspump : 0.00 0 0
3.18/3.26 c coefdiving : 0.00 0 0
3.18/3.26 c pscostdiving : 0.00 0 0
3.18/3.26 c fracdiving : 0.00 0 0
3.18/3.26 c veclendiving : 0.00 0 0
3.18/3.26 c intdiving : 0.00 0 0
3.18/3.26 c actconsdiving : 0.00 0 0
3.18/3.26 c objpscostdiving : 0.00 0 0
3.18/3.26 c rootsoldiving : 0.00 0 0
3.18/3.26 c linesearchdiving : 0.00 0 0
3.18/3.26 c guideddiving : 0.00 0 0
3.18/3.26 c octane : 0.00 0 0
3.18/3.26 c rens : 0.00 0 0
3.18/3.26 c rins : 0.00 0 0
3.18/3.26 c localbranching : 0.00 0 0
3.18/3.26 c mutation : 0.00 0 0
3.18/3.26 c crossover : 0.00 0 0
3.18/3.26 c dins : 0.00 0 0
3.18/3.26 c LP : Time Calls Iterations Iter/call Iter/sec
3.18/3.26 c primal LP : 0.01 0 0 0.00 0.00
3.18/3.26 c dual LP : 0.04 44 905 20.57 22625.00
3.18/3.26 c barrier LP : 0.00 0 0 0.00 -
3.18/3.26 c diving/probing LP: 0.00 0 0 0.00 -
3.18/3.26 c strong branching : 2.92 410 32888 80.21 11263.01
3.18/3.26 c (at root node) : - 243 26071 107.29 -
3.18/3.26 c conflict analysis: 0.00 0 0 0.00 -
3.18/3.26 c B&B Tree :
3.18/3.26 c number of runs : 3
3.18/3.26 c nodes : 6
3.18/3.26 c nodes (total) : 8
3.18/3.26 c nodes left : 0
3.18/3.26 c max depth : 3
3.18/3.26 c max depth (total): 3
3.18/3.26 c backtracks : 0 (0.0%)
3.18/3.26 c delayed cutoffs : 0
3.18/3.26 c repropagations : 0 (0 domain reductions, 0 cutoffs)
3.18/3.26 c avg switch length: 2.00
3.18/3.26 c switching time : 0.00
3.18/3.26 c Solution :
3.18/3.26 c Solutions found : 1 (1 improvements)
3.18/3.26 c Primal Bound : +1.30000000000000e+01 (in run 3, after 6 nodes, 3.14 seconds, depth 3, found by <relaxation>)
3.18/3.26 c Dual Bound : +1.30000000000000e+01
3.18/3.26 c Gap : 0.00 %
3.18/3.26 c Root Dual Bound : +1.30000000000000e+01
3.18/3.26 c Time complete: 3.25.