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-1868126-1245115782.opb>
0.00/0.01 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c start presolving problem
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.02 c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.02 c presolving (3 rounds):
0.00/0.02 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 8 implications, 68 cliques
0.00/0.02 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.02 c 1 constraints of type <knapsack>
0.00/0.02 c 68 constraints of type <setppc>
0.00/0.02 c 4 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c SATUNSAT-LIN
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/flowcover/freq = c -1
0.00/0.02 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/cmir/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/veclendiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/simplerounding/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/shifting/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/rounding/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.02 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/rootsoldiving/freq = c -1
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/rens/nodesofs = c 2000
0.00/0.02 c # minimum percentage of integer variables that have to be fixable
0.00/0.02 c # [type: real, range: [0,1], default: 0.5]
0.00/0.02 c heuristics/rens/minfixingrate = c 0.3
0.00/0.02 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/rens/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/pscostdiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/oneopt/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.02 c # [type: real, range: [0,1], default: 0.01]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.02 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/objpscostdiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/linesearchdiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/intshifting/freq = c -1
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/guideddiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/fracdiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.02 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/feaspump/freq = c -1
0.00/0.02 c # minimum percentage of integer variables that have to be fixed
0.00/0.02 c # [type: real, range: [0,1], default: 0.666]
0.00/0.03 c heuristics/crossover/minfixingrate = c 0.5
0.00/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03 c # [type: real, range: [0,1], default: 0.1]
0.00/0.03 c heuristics/crossover/nodesquot = c 0.15
0.00/0.03 c # number of nodes without incumbent change that heuristic should wait
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03 c heuristics/crossover/nwaitingnodes = c 100
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/crossover/nodesofs = c 750
0.00/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03 c heuristics/crossover/freq = c -1
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/coefdiving/freq = c -1
0.00/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c presolving/probing/maxrounds = c 0
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03 c constraints/knapsack/disaggregation = c FALSE
0.00/0.03 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c constraints/knapsack/maxnumcardlift = c 0
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = c TRUE
0.00/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/maxroundsroot = c 5
0.00/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03 c separating/maxrounds = c 1
0.00/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c limits/solutions = c 1
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = c 1620
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = c 1791
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = c 10000
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving problem
0.00/0.03 c
0.00/0.03 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.03 c 0.0s| 1 | 0 | 96 | 593k| 0 | 42 | 169 | 73 | 73 | 169 | 73 | 0 | 0 | 0 | 1.300000e+01 | -- | Inf
0.04/0.05 c 0.0s| 1 | 0 | 123 | 838k| 0 | 51 | 169 | 73 | 73 | 169 | 85 | 12 | 0 | 0 | 1.300000e+01 | -- | Inf
0.04/0.07 c 0.1s| 1 | 0 | 161 |1008k| 0 | 59 | 169 | 73 | 73 | 169 | 95 | 22 | 0 | 0 | 1.300000e+01 | -- | Inf
0.04/0.09 c 0.1s| 1 | 0 | 183 |1081k| 0 | 60 | 169 | 73 | 73 | 169 | 98 | 25 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.11 c 0.1s| 1 | 0 | 195 |1101k| 0 | 61 | 169 | 73 | 73 | 169 | 103 | 30 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 213 |1122k| 0 | 61 | 169 | 73 | 73 | 169 | 104 | 31 | 0 | 0 | 1.300000e+01 | -- | Inf
0.78/0.83 c 0.8s| 1 | 0 | 250 |1121k| 0 | 57 | 169 | 73 | 73 | 169 | 104 | 31 | 0 | 35 | 1.300000e+01 | -- | Inf
0.88/0.98 c 0.9s| 1 | 0 | 340 |1121k| 0 | 57 | 169 | 73 | 73 | 169 | 104 | 31 | 0 | 41 | 1.300000e+01 | -- | Inf
1.10/1.14 c 1.1s| 1 | 0 | 439 |1121k| 0 | 57 | 169 | 73 | 73 | 169 | 104 | 31 | 0 | 48 | 1.300000e+01 | -- | Inf
1.29/1.36 c 1.3s| 1 | 0 | 480 |1121k| 0 | 50 | 169 | 73 | 73 | 169 | 104 | 31 | 0 | 58 | 1.300000e+01 | -- | Inf
1.39/1.44 c 1.4s| 1 | 0 | 509 |1121k| 0 | 50 | 169 | 73 | 73 | 169 | 104 | 31 | 0 | 63 | 1.300000e+01 | -- | Inf
1.49/1.53 c 1.5s| 1 | 0 | 537 |1121k| 0 | 50 | 169 | 73 | 73 | 169 | 103 | 31 | 0 | 69 | 1.300000e+01 | -- | Inf
1.59/1.61 c 1.6s| 1 | 0 | 537 |1120k| 0 | - | 169 | 73 | 73 | 169 | 103 | 31 | 0 | 75 | 1.300000e+01 | -- | Inf
1.59/1.61 c (run 1, node 1) restarting after 35 global fixings of integer variables
1.59/1.61 c
1.59/1.61 (restart) converted 30 cuts from the global cut pool into linear constraints
1.59/1.61 c
1.59/1.61 presolving:
1.59/1.62 c (round 1) 35 del vars, 4 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 12 impls, 82 clqs
1.59/1.62 c (round 2) 35 del vars, 4 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 29 upgd conss, 12 impls, 82 clqs
1.59/1.63 c presolving (3 rounds):
1.59/1.63 c 35 deleted vars, 4 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
1.59/1.63 c 12 implications, 82 cliques
1.59/1.63 c presolved problem has 134 variables (134 bin, 0 int, 0 impl, 0 cont) and 99 constraints
1.59/1.63 c 15 constraints of type <knapsack>
1.59/1.63 c 83 constraints of type <setppc>
1.59/1.63 c 1 constraints of type <logicor>
1.59/1.63 c transformed objective value is always integral (scale: 1)
1.59/1.63 c Presolving Time: 0.02
1.59/1.63 c
1.59/1.63 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.59/1.63 c 1.6s| 1 | 0 | 647 | 836k| 0 | 47 | 134 | 99 | 99 | 134 | 99 | 0 | 0 | 75 | 1.300000e+01 | -- | Inf
1.59/1.66 c 1.6s| 1 | 0 | 702 |1083k| 0 | 47 | 134 | 99 | 99 | 134 | 108 | 9 | 0 | 75 | 1.300000e+01 | -- | Inf
1.89/1.94 c 1.9s| 1 | 0 | 751 |1083k| 0 | 47 | 134 | 99 | 99 | 134 | 108 | 9 | 0 | 100 | 1.300000e+01 | -- | Inf
1.99/2.01 c 2.0s| 1 | 0 | 839 |1083k| 0 | 43 | 134 | 99 | 99 | 134 | 108 | 9 | 0 | 106 | 1.300000e+01 | -- | Inf
1.99/2.05 c 2.0s| 1 | 0 | 867 |1082k| 0 | 36 | 134 | 99 | 99 | 134 | 108 | 9 | 0 | 114 | 1.300000e+01 | -- | Inf
1.99/2.10 c 2.0s| 1 | 0 | 890 |1082k| 0 | 41 | 134 | 99 | 99 | 134 | 108 | 9 | 0 | 120 | 1.300000e+01 | -- | Inf
2.10/2.13 c 2.1s| 1 | 0 | 911 |1082k| 0 | 37 | 134 | 98 | 98 | 134 | 108 | 9 | 0 | 126 | 1.300000e+01 | -- | Inf
2.10/2.17 c 2.1s| 1 | 0 | 911 |1082k| 0 | - | 134 | 98 | 98 | 134 | 108 | 9 | 0 | 133 | 1.300000e+01 | -- | Inf
2.10/2.17 c (run 2, node 1) restarting after 30 global fixings of integer variables
2.10/2.17 c
2.10/2.17 (restart) converted 9 cuts from the global cut pool into linear constraints
2.10/2.17 c
2.10/2.17 presolving:
2.10/2.18 c (round 1) 30 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 9 upgd conss, 22 impls, 80 clqs
2.10/2.18 c presolving (2 rounds):
2.10/2.18 c 30 deleted vars, 3 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
2.10/2.18 c 22 implications, 80 cliques
2.10/2.18 c presolved problem has 104 variables (104 bin, 0 int, 0 impl, 0 cont) and 104 constraints
2.10/2.18 c 19 constraints of type <knapsack>
2.10/2.18 c 85 constraints of type <setppc>
2.10/2.18 c transformed objective value is always integral (scale: 1)
2.10/2.18 c Presolving Time: 0.03
2.10/2.18 c
2.10/2.19 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.10/2.19 c 2.1s| 1 | 0 | 1044 | 833k| 0 | 34 | 104 | 104 | 104 | 104 | 104 | 0 | 0 | 133 | 1.300000e+01 | -- | Inf
2.19/2.21 c 2.1s| 1 | 0 | 1045 |1149k| 0 | 0 | 104 | 104 | 104 | 104 | 106 | 2 | 0 | 133 | 1.300000e+01 | -- | Inf
2.19/2.21 c * 2.1s| 1 | 0 | 1045 |1151k| 0 | - | 104 | 104 | 104 | 104 | 106 | 2 | 0 | 133 | 1.300000e+01 | 1.300000e+01 | 0.00%
2.19/2.21 c
2.19/2.21 c SCIP Status : problem is solved [optimal solution found]
2.19/2.21 c Solving Time (sec) : 2.15
2.19/2.21 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
2.19/2.21 c Primal Bound : +1.30000000000000e+01 (1 solutions)
2.19/2.21 c Dual Bound : +1.30000000000000e+01
2.19/2.21 c Gap : 0.00 %
2.19/2.21 c NODE 1
2.19/2.21 c DUAL BOUND 13
2.19/2.21 c PRIMAL BOUND 13
2.19/2.21 c GAP 0
2.19/2.21 s SATISFIABLE
2.19/2.21 v -x169 -x168 -x167 -x166 x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 x154 -x153 -x152 -x151 -x150 -x149 -x148
2.19/2.21 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 x131 -x130 -x129 -x128 -x127
2.19/2.21 v -x126 -x125 x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 x108 -x107 -x106
2.19/2.21 v -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 x93 -x92 x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82
2.19/2.21 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
2.19/2.21 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
2.19/2.21 v -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 x5
2.19/2.21 v -x4 -x3 -x2 -x1
2.19/2.21 c SCIP Status : problem is solved [optimal solution found]
2.19/2.21 c Solving Time : 2.15
2.19/2.21 c Original Problem :
2.19/2.21 c Problem name : HOME/instance-1868126-1245115782.opb
2.19/2.21 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
2.19/2.21 c Constraints : 101 initial, 101 maximal
2.19/2.21 c Presolved Problem :
2.19/2.21 c Problem name : t_HOME/instance-1868126-1245115782.opb
2.19/2.21 c Variables : 104 (104 binary, 0 integer, 0 implicit integer, 0 continuous)
2.19/2.21 c Constraints : 104 initial, 104 maximal
2.19/2.21 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.19/2.21 c trivial : 0.00 65 0 0 0 0 0 0 0
2.19/2.21 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.19/2.21 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.19/2.21 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.19/2.21 c implics : 0.00 0 0 0 0 0 0 0 0
2.19/2.21 c probing : 0.00 0 0 0 0 0 0 0 0
2.19/2.21 c knapsack : 0.02 0 0 0 0 0 0 0 1
2.19/2.21 c setppc : 0.00 0 0 0 0 0 2 0 0
2.19/2.21 c linear : 0.01 0 0 0 0 0 29 1 0
2.19/2.21 c logicor : 0.00 0 0 0 0 0 4 0 0
2.19/2.21 c root node : - 65 - - 65 - - - -
2.19/2.21 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.19/2.21 c integral : 0 0 0 14 0 0 65 0 0 0
2.19/2.21 c knapsack : 19 7 14 1 0 0 0 0 0 0
2.19/2.21 c setppc : 85 7 14 1 0 0 0 0 0 0
2.19/2.21 c countsols : 0 0 0 1 0 0 0 0 0 0
2.19/2.21 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.19/2.21 c integral : 1.89 0.00 0.00 1.89 0.00
2.19/2.21 c knapsack : 0.00 0.00 0.00 0.00 0.00
2.19/2.21 c setppc : 0.00 0.00 0.00 0.00 0.00
2.19/2.21 c countsols : 0.00 0.00 0.00 0.00 0.00
2.19/2.21 c Propagators : Time Calls Cutoffs DomReds
2.19/2.21 c rootredcost : 0.00 0 0 0
2.19/2.21 c pseudoobj : 0.00 17 0 0
2.19/2.21 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.19/2.21 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.19/2.21 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.19/2.21 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.19/2.21 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.19/2.21 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.19/2.21 c applied globally : - - - 0 0.0 - - -
2.19/2.21 c applied locally : - - - 0 0.0 - - -
2.19/2.21 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.19/2.21 c cut pool : 0.00 0 - - 0 - (maximal pool size: 104)
2.19/2.21 c redcost : 0.00 7 0 0 0 0
2.19/2.21 c impliedbounds : 0.00 7 0 0 0 0
2.19/2.21 c intobj : 0.00 0 0 0 0 0
2.19/2.21 c gomory : 0.05 7 0 0 86 0
2.19/2.21 c strongcg : 0.07 7 0 0 287 0
2.19/2.21 c cmir : 0.00 0 0 0 0 0
2.19/2.21 c flowcover : 0.00 0 0 0 0 0
2.19/2.21 c clique : 0.00 7 0 0 24 0
2.19/2.21 c zerohalf : 0.00 0 0 0 0 0
2.19/2.21 c mcf : 0.00 3 0 0 0 0
2.19/2.21 c Pricers : Time Calls Vars
2.19/2.21 c problem variables: 0.00 0 0
2.19/2.21 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.19/2.21 c relpscost : 1.89 13 0 65 0 0 0
2.19/2.21 c pscost : 0.00 0 0 0 0 0 0
2.19/2.21 c inference : 0.00 0 0 0 0 0 0
2.19/2.21 c mostinf : 0.00 0 0 0 0 0 0
2.19/2.21 c leastinf : 0.00 0 0 0 0 0 0
2.19/2.21 c fullstrong : 0.00 0 0 0 0 0 0
2.19/2.21 c allfullstrong : 0.00 0 0 0 0 0 0
2.19/2.21 c random : 0.00 0 0 0 0 0 0
2.19/2.21 c Primal Heuristics : Time Calls Found
2.19/2.21 c LP solutions : 0.00 - 1
2.19/2.21 c pseudo solutions : 0.00 - 0
2.19/2.21 c simplerounding : 0.00 0 0
2.19/2.21 c rounding : 0.00 0 0
2.19/2.21 c shifting : 0.00 0 0
2.19/2.21 c intshifting : 0.00 0 0
2.19/2.21 c oneopt : 0.00 0 0
2.19/2.21 c fixandinfer : 0.00 0 0
2.19/2.21 c feaspump : 0.00 0 0
2.19/2.21 c coefdiving : 0.00 0 0
2.19/2.21 c pscostdiving : 0.00 0 0
2.19/2.21 c fracdiving : 0.00 0 0
2.19/2.21 c veclendiving : 0.00 0 0
2.19/2.21 c intdiving : 0.00 0 0
2.19/2.21 c actconsdiving : 0.00 0 0
2.19/2.21 c objpscostdiving : 0.00 0 0
2.19/2.21 c rootsoldiving : 0.00 0 0
2.19/2.21 c linesearchdiving : 0.00 0 0
2.19/2.21 c guideddiving : 0.00 0 0
2.19/2.21 c octane : 0.00 0 0
2.19/2.21 c rens : 0.00 0 0
2.19/2.21 c rins : 0.00 0 0
2.19/2.21 c localbranching : 0.00 0 0
2.19/2.21 c mutation : 0.00 0 0
2.19/2.21 c crossover : 0.00 0 0
2.19/2.21 c dins : 0.00 0 0
2.19/2.21 c LP : Time Calls Iterations Iter/call Iter/sec
2.19/2.21 c primal LP : 0.00 0 0 0.00 -
2.19/2.21 c dual LP : 0.08 21 1045 49.76 13062.50
2.19/2.21 c barrier LP : 0.00 0 0 0.00 -
2.19/2.21 c diving/probing LP: 0.00 0 0 0.00 -
2.19/2.21 c strong branching : 1.89 133 18052 135.73 9551.32
2.19/2.21 c (at root node) : - 133 18052 135.73 -
2.19/2.21 c conflict analysis: 0.00 0 0 0.00 -
2.19/2.21 c B&B Tree :
2.19/2.21 c number of runs : 3
2.19/2.21 c nodes : 1
2.19/2.21 c nodes (total) : 3
2.19/2.21 c nodes left : 0
2.19/2.21 c max depth : 0
2.19/2.21 c max depth (total): 0
2.19/2.21 c backtracks : 0 (0.0%)
2.19/2.21 c delayed cutoffs : 0
2.19/2.21 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.19/2.21 c avg switch length: 2.00
2.19/2.21 c switching time : 0.00
2.19/2.21 c Solution :
2.19/2.21 c Solutions found : 1 (1 improvements)
2.19/2.21 c Primal Bound : +1.30000000000000e+01 (in run 3, after 1 nodes, 2.15 seconds, depth 0, found by <relaxation>)
2.19/2.21 c Dual Bound : +1.30000000000000e+01
2.19/2.21 c Gap : 0.00 %
2.19/2.21 c Root Dual Bound : +1.30000000000000e+01
2.19/2.22 c Time complete: 2.21.