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-1868088-1245115675.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 | 109 | 593k| 0 | 41 | 169 | 73 | 73 | 169 | 73 | 0 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.05 c 0.0s| 1 | 0 | 143 | 818k| 0 | 54 | 169 | 73 | 73 | 169 | 85 | 12 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.07 c 0.1s| 1 | 0 | 165 |1092k| 0 | 53 | 169 | 73 | 73 | 169 | 89 | 16 | 0 | 0 | 1.300000e+01 | -- | Inf
0.08/0.09 c 0.1s| 1 | 0 | 185 |1332k| 0 | 55 | 169 | 73 | 73 | 169 | 93 | 20 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.11 c 0.1s| 1 | 0 | 231 |1518k| 0 | 58 | 169 | 73 | 73 | 169 | 100 | 27 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 243 |1593k| 0 | 59 | 169 | 73 | 73 | 169 | 102 | 29 | 0 | 0 | 1.300000e+01 | -- | Inf
0.69/0.75 c 0.7s| 1 | 0 | 285 |1593k| 0 | 55 | 169 | 73 | 73 | 169 | 102 | 29 | 0 | 33 | 1.300000e+01 | -- | Inf
0.89/0.96 c 0.9s| 1 | 0 | 313 |1593k| 0 | 57 | 169 | 73 | 73 | 169 | 102 | 29 | 0 | 44 | 1.300000e+01 | -- | Inf
1.09/1.16 c 1.1s| 1 | 0 | 344 |1593k| 0 | 57 | 169 | 73 | 73 | 169 | 102 | 29 | 0 | 54 | 1.300000e+01 | -- | Inf
1.19/1.25 c 1.2s| 1 | 0 | 390 |1593k| 0 | 53 | 169 | 73 | 73 | 169 | 102 | 29 | 0 | 59 | 1.300000e+01 | -- | Inf
1.29/1.32 c 1.3s| 1 | 0 | 423 |1593k| 0 | 48 | 169 | 73 | 73 | 169 | 102 | 29 | 0 | 64 | 1.300000e+01 | -- | Inf
1.29/1.40 c 1.4s| 1 | 0 | 455 |1592k| 0 | 49 | 169 | 72 | 72 | 169 | 102 | 29 | 0 | 70 | 1.300000e+01 | -- | Inf
1.39/1.48 c 1.4s| 1 | 0 | 455 |1592k| 0 | - | 169 | 72 | 72 | 169 | 102 | 29 | 0 | 76 | 1.300000e+01 | -- | Inf
1.39/1.48 c (run 1, node 1) restarting after 35 global fixings of integer variables
1.39/1.48 c
1.39/1.48 (restart) converted 29 cuts from the global cut pool into linear constraints
1.39/1.48 c
1.39/1.48 presolving:
1.39/1.48 c (round 1) 35 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 14 impls, 81 clqs
1.39/1.49 c (round 2) 35 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 28 upgd conss, 14 impls, 81 clqs
1.39/1.49 c (round 3) 35 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 28 upgd conss, 14 impls, 81 clqs
1.39/1.49 c presolving (4 rounds):
1.39/1.49 c 35 deleted vars, 4 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.39/1.49 c 14 implications, 81 cliques
1.39/1.49 c presolved problem has 134 variables (134 bin, 0 int, 0 impl, 0 cont) and 97 constraints
1.39/1.49 c 12 constraints of type <knapsack>
1.39/1.49 c 81 constraints of type <setppc>
1.39/1.49 c 4 constraints of type <logicor>
1.39/1.49 c transformed objective value is always integral (scale: 1)
1.39/1.49 c Presolving Time: 0.02
1.39/1.49 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 | 554 | 784k| 0 | 44 | 134 | 97 | 97 | 134 | 97 | 0 | 0 | 76 | 1.300000e+01 | -- | Inf
1.49/1.52 c 1.5s| 1 | 0 | 592 |1038k| 0 | 48 | 134 | 97 | 97 | 134 | 107 | 10 | 0 | 76 | 1.300000e+01 | -- | Inf
1.69/1.72 c 1.7s| 1 | 0 | 631 |1038k| 0 | 48 | 134 | 97 | 97 | 134 | 107 | 10 | 0 | 107 | 1.300000e+01 | -- | Inf
1.79/1.81 c 1.8s| 1 | 0 | 668 |1038k| 0 | 49 | 134 | 97 | 97 | 134 | 107 | 10 | 0 | 115 | 1.300000e+01 | -- | Inf
1.79/1.86 c 1.8s| 1 | 0 | 723 |1038k| 0 | 45 | 134 | 97 | 97 | 134 | 107 | 10 | 0 | 121 | 1.300000e+01 | -- | Inf
1.89/1.91 c 1.9s| 1 | 0 | 760 |1038k| 0 | 44 | 134 | 97 | 97 | 134 | 107 | 10 | 0 | 129 | 1.300000e+01 | -- | Inf
1.89/1.94 c 1.9s| 1 | 0 | 774 |1037k| 0 | 44 | 134 | 97 | 97 | 134 | 107 | 10 | 0 | 137 | 1.300000e+01 | -- | Inf
1.89/1.97 c 1.9s| 1 | 0 | 774 |1037k| 0 | - | 134 | 97 | 97 | 134 | 107 | 10 | 0 | 142 | 1.300000e+01 | -- | Inf
1.89/1.97 c (run 2, node 1) restarting after 30 global fixings of integer variables
1.89/1.97 c
1.89/1.97 (restart) converted 10 cuts from the global cut pool into linear constraints
1.89/1.97 c
1.89/1.97 presolving:
1.89/1.98 c (round 1) 30 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 10 upgd conss, 20 impls, 82 clqs
1.89/1.98 c (round 2) 30 del vars, 6 del conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 10 upgd conss, 20 impls, 82 clqs
1.89/1.98 c presolving (3 rounds):
1.89/1.98 c 30 deleted vars, 6 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 2 changed coefficients
1.89/1.98 c 20 implications, 82 cliques
1.89/1.98 c presolved problem has 104 variables (104 bin, 0 int, 0 impl, 0 cont) and 101 constraints
1.89/1.98 c 17 constraints of type <knapsack>
1.89/1.98 c 82 constraints of type <setppc>
1.89/1.98 c 2 constraints of type <logicor>
1.89/1.98 c transformed objective value is always integral (scale: 1)
1.89/1.98 c Presolving Time: 0.04
1.89/1.98 c
1.89/1.99 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.89/1.99 c 1.9s| 1 | 0 | 856 | 803k| 0 | 43 | 104 | 101 | 101 | 104 | 101 | 0 | 0 | 142 | 1.300000e+01 | -- | Inf
1.99/2.01 c 2.0s| 1 | 0 | 911 |1043k| 0 | 44 | 104 | 101 | 101 | 104 | 112 | 11 | 0 | 142 | 1.300000e+01 | -- | Inf
1.99/2.09 c 2.0s| 1 | 0 | 1094 |1043k| 0 | 36 | 104 | 101 | 101 | 104 | 112 | 11 | 0 | 152 | 1.300000e+01 | -- | Inf
2.09/2.15 c 2.1s| 1 | 0 | 1106 |1036k| 0 | 0 | 104 | 74 | 74 | 104 | 112 | 11 | 0 | 161 | 1.300000e+01 | -- | Inf
2.09/2.15 c (run 3, node 1) restarting after 56 global fixings of integer variables
2.09/2.15 c
2.09/2.15 (restart) converted 11 cuts from the global cut pool into linear constraints
2.09/2.15 c
2.09/2.15 presolving:
2.09/2.15 c (round 1) 56 del vars, 8 del conss, 0 chg bounds, 7 chg sides, 22 chg coeffs, 0 upgd conss, 50 impls, 42 clqs
2.09/2.15 c (round 2) 56 del vars, 8 del conss, 0 chg bounds, 7 chg sides, 40 chg coeffs, 9 upgd conss, 50 impls, 42 clqs
2.09/2.16 c (round 3) 56 del vars, 10 del conss, 0 chg bounds, 9 chg sides, 61 chg coeffs, 9 upgd conss, 50 impls, 42 clqs
2.09/2.16 c (round 4) 56 del vars, 10 del conss, 0 chg bounds, 9 chg sides, 77 chg coeffs, 9 upgd conss, 50 impls, 42 clqs
2.09/2.16 c (round 5) 56 del vars, 10 del conss, 0 chg bounds, 11 chg sides, 92 chg coeffs, 9 upgd conss, 50 impls, 42 clqs
2.09/2.16 c (round 6) 56 del vars, 10 del conss, 0 chg bounds, 11 chg sides, 106 chg coeffs, 9 upgd conss, 50 impls, 42 clqs
2.09/2.16 c (round 7) 56 del vars, 10 del conss, 0 chg bounds, 11 chg sides, 117 chg coeffs, 9 upgd conss, 50 impls, 42 clqs
2.09/2.16 c (round 8) 56 del vars, 10 del conss, 0 chg bounds, 11 chg sides, 125 chg coeffs, 9 upgd conss, 50 impls, 42 clqs
2.09/2.16 c (round 9) 56 del vars, 10 del conss, 0 chg bounds, 11 chg sides, 132 chg coeffs, 9 upgd conss, 50 impls, 42 clqs
2.09/2.16 c (round 10) 56 del vars, 10 del conss, 0 chg bounds, 11 chg sides, 135 chg coeffs, 9 upgd conss, 50 impls, 42 clqs
2.09/2.16 c (round 11) 56 del vars, 10 del conss, 0 chg bounds, 11 chg sides, 137 chg coeffs, 9 upgd conss, 50 impls, 42 clqs
2.09/2.16 c presolving (12 rounds):
2.09/2.16 c 56 deleted vars, 10 deleted constraints, 0 tightened bounds, 0 added holes, 11 changed sides, 137 changed coefficients
2.09/2.16 c 50 implications, 42 cliques
2.09/2.16 c presolved problem has 48 variables (48 bin, 0 int, 0 impl, 0 cont) and 75 constraints
2.09/2.16 c 23 constraints of type <knapsack>
2.09/2.16 c 52 constraints of type <setppc>
2.09/2.16 c transformed objective value is always integral (scale: 1)
2.09/2.16 c Presolving Time: 0.05
2.09/2.16 c
2.09/2.17 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.09/2.17 c 2.1s| 1 | 0 | 1154 | 733k| 0 | 0 | 48 | 75 | 75 | 48 | 75 | 0 | 0 | 161 | 1.300000e+01 | -- | Inf
2.09/2.17 c * 2.1s| 1 | 0 | 1154 | 735k| 0 | - | 48 | 75 | 75 | 48 | 75 | 0 | 0 | 161 | 1.300000e+01 | 1.300000e+01 | 0.00%
2.09/2.17 c
2.09/2.17 c SCIP Status : problem is solved [optimal solution found]
2.09/2.17 c Solving Time (sec) : 2.11
2.09/2.17 c Solving Nodes : 1 (total of 4 nodes in 4 runs)
2.09/2.17 c Primal Bound : +1.30000000000000e+01 (1 solutions)
2.09/2.17 c Dual Bound : +1.30000000000000e+01
2.09/2.17 c Gap : 0.00 %
2.09/2.17 c NODE 1
2.09/2.17 c DUAL BOUND 13
2.09/2.17 c PRIMAL BOUND 13
2.09/2.17 c GAP 0
2.09/2.17 s SATISFIABLE
2.09/2.17 v -x169 -x168 -x167 x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
2.09/2.17 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
2.09/2.17 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 x119 -x118 -x117 -x116 -x115 -x114 -x113 x112 -x111 -x110 -x109 -x108 -x107 -x106
2.09/2.17 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.09/2.17 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.09/2.17 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.09/2.17 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.09/2.17 v -x4 x3 -x2 -x1
2.09/2.17 c SCIP Status : problem is solved [optimal solution found]
2.09/2.17 c Solving Time : 2.11
2.09/2.17 c Original Problem :
2.09/2.17 c Problem name : HOME/instance-1868088-1245115675.opb
2.09/2.17 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
2.09/2.17 c Constraints : 101 initial, 101 maximal
2.09/2.17 c Presolved Problem :
2.09/2.17 c Problem name : t_HOME/instance-1868088-1245115675.opb
2.09/2.17 c Variables : 48 (48 binary, 0 integer, 0 implicit integer, 0 continuous)
2.09/2.17 c Constraints : 75 initial, 75 maximal
2.09/2.17 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.09/2.17 c trivial : 0.00 121 0 0 0 0 0 0 0
2.09/2.17 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.09/2.17 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.09/2.17 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.09/2.17 c implics : 0.00 0 0 0 0 0 0 0 0
2.09/2.17 c probing : 0.00 0 0 0 0 0 0 0 0
2.09/2.17 c knapsack : 0.02 0 0 0 0 0 0 11 139
2.09/2.17 c setppc : 0.00 0 0 0 0 0 12 0 0
2.09/2.17 c linear : 0.01 0 0 0 0 0 31 0 0
2.09/2.17 c logicor : 0.00 0 0 0 0 0 5 0 0
2.09/2.17 c root node : - 121 - - 121 - - - -
2.09/2.17 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.09/2.17 c integral : 0 0 0 17 0 0 75 0 0 0
2.09/2.17 c knapsack : 23 8 18 2 0 0 0 0 0 0
2.09/2.17 c setppc : 52 8 18 2 0 0 46 0 0 0
2.09/2.17 c countsols : 0 0 0 2 0 0 0 0 0 0
2.09/2.17 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.09/2.17 c integral : 1.82 0.00 0.00 1.82 0.00
2.09/2.17 c knapsack : 0.00 0.00 0.00 0.00 0.00
2.09/2.17 c setppc : 0.00 0.00 0.00 0.00 0.00
2.09/2.17 c countsols : 0.00 0.00 0.00 0.00 0.00
2.09/2.17 c Propagators : Time Calls Cutoffs DomReds
2.09/2.17 c rootredcost : 0.00 0 0 0
2.09/2.17 c pseudoobj : 0.00 22 0 0
2.09/2.17 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.09/2.17 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.09/2.17 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.09/2.17 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.09/2.17 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.09/2.17 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.09/2.17 c applied globally : - - - 0 0.0 - - -
2.09/2.17 c applied locally : - - - 0 0.0 - - -
2.09/2.17 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.09/2.17 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
2.09/2.17 c redcost : 0.00 8 0 0 0 0
2.09/2.17 c impliedbounds : 0.00 7 0 0 0 0
2.09/2.17 c intobj : 0.00 0 0 0 0 0
2.09/2.17 c gomory : 0.06 8 0 0 23 0
2.09/2.17 c strongcg : 0.04 8 0 0 396 0
2.09/2.17 c cmir : 0.00 0 0 0 0 0
2.09/2.17 c flowcover : 0.00 0 0 0 0 0
2.09/2.17 c clique : 0.02 8 0 0 28 0
2.09/2.17 c zerohalf : 0.00 0 0 0 0 0
2.09/2.17 c mcf : 0.00 4 0 0 0 0
2.09/2.17 c Pricers : Time Calls Vars
2.09/2.17 c problem variables: 0.00 0 0
2.09/2.17 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.09/2.17 c relpscost : 1.82 15 0 75 0 0 0
2.09/2.17 c pscost : 0.00 0 0 0 0 0 0
2.09/2.17 c inference : 0.00 0 0 0 0 0 0
2.09/2.17 c mostinf : 0.00 0 0 0 0 0 0
2.09/2.17 c leastinf : 0.00 0 0 0 0 0 0
2.09/2.17 c fullstrong : 0.00 0 0 0 0 0 0
2.09/2.17 c allfullstrong : 0.00 0 0 0 0 0 0
2.09/2.17 c random : 0.00 0 0 0 0 0 0
2.09/2.17 c Primal Heuristics : Time Calls Found
2.09/2.17 c LP solutions : 0.00 - 1
2.09/2.17 c pseudo solutions : 0.00 - 0
2.09/2.17 c simplerounding : 0.00 0 0
2.09/2.17 c rounding : 0.00 0 0
2.09/2.17 c shifting : 0.00 0 0
2.09/2.17 c intshifting : 0.00 0 0
2.09/2.17 c oneopt : 0.00 0 0
2.09/2.17 c fixandinfer : 0.00 0 0
2.09/2.17 c feaspump : 0.00 0 0
2.09/2.17 c coefdiving : 0.00 0 0
2.09/2.17 c pscostdiving : 0.00 0 0
2.09/2.17 c fracdiving : 0.00 0 0
2.09/2.17 c veclendiving : 0.00 0 0
2.09/2.17 c intdiving : 0.00 0 0
2.09/2.17 c actconsdiving : 0.00 0 0
2.09/2.17 c objpscostdiving : 0.00 0 0
2.09/2.17 c rootsoldiving : 0.00 0 0
2.09/2.17 c linesearchdiving : 0.00 0 0
2.09/2.17 c guideddiving : 0.00 0 0
2.09/2.17 c octane : 0.00 0 0
2.09/2.17 c rens : 0.00 0 0
2.09/2.17 c rins : 0.00 0 0
2.09/2.17 c localbranching : 0.00 0 0
2.09/2.17 c mutation : 0.00 0 0
2.09/2.17 c crossover : 0.00 0 0
2.09/2.17 c dins : 0.00 0 0
2.09/2.17 c LP : Time Calls Iterations Iter/call Iter/sec
2.09/2.17 c primal LP : 0.00 0 0 0.00 -
2.09/2.17 c dual LP : 0.09 24 1154 48.08 12822.22
2.09/2.17 c barrier LP : 0.00 0 0 0.00 -
2.09/2.17 c diving/probing LP: 0.00 0 0 0.00 -
2.09/2.17 c strong branching : 1.82 161 19204 119.28 10551.65
2.09/2.17 c (at root node) : - 161 19204 119.28 -
2.09/2.17 c conflict analysis: 0.00 0 0 0.00 -
2.09/2.17 c B&B Tree :
2.09/2.17 c number of runs : 4
2.09/2.17 c nodes : 1
2.09/2.17 c nodes (total) : 4
2.09/2.17 c nodes left : 0
2.09/2.17 c max depth : 0
2.09/2.17 c max depth (total): 0
2.09/2.17 c backtracks : 0 (0.0%)
2.09/2.17 c delayed cutoffs : 0
2.09/2.17 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.09/2.17 c avg switch length: 2.00
2.09/2.17 c switching time : 0.00
2.09/2.17 c Solution :
2.09/2.17 c Solutions found : 1 (1 improvements)
2.09/2.17 c Primal Bound : +1.30000000000000e+01 (in run 4, after 1 nodes, 2.11 seconds, depth 0, found by <relaxation>)
2.09/2.17 c Dual Bound : +1.30000000000000e+01
2.09/2.17 c Gap : 0.00 %
2.09/2.17 c Root Dual Bound : +1.30000000000000e+01
2.09/2.17 c Time complete: 2.17.