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-1868034-1245115432.opb>
0.00/0.01 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c start presolving problem
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.02 c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.02 c presolving (3 rounds):
0.00/0.02 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 8 implications, 68 cliques
0.00/0.02 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.02 c 1 constraints of type <knapsack>
0.00/0.02 c 68 constraints of type <setppc>
0.00/0.02 c 4 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c SATUNSAT-LIN
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/flowcover/freq = c -1
0.00/0.02 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/cmir/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/veclendiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/simplerounding/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/shifting/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/rounding/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.02 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/rootsoldiving/freq = c -1
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/rens/nodesofs = c 2000
0.00/0.02 c # minimum percentage of integer variables that have to be fixable
0.00/0.02 c # [type: real, range: [0,1], default: 0.5]
0.00/0.02 c heuristics/rens/minfixingrate = c 0.3
0.00/0.02 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/rens/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/pscostdiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/oneopt/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.02 c # [type: real, range: [0,1], default: 0.01]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.02 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/objpscostdiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/linesearchdiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/intshifting/freq = c -1
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/guideddiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/fracdiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.02 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/feaspump/freq = c -1
0.00/0.02 c # minimum percentage of integer variables that have to be fixed
0.00/0.02 c # [type: real, range: [0,1], default: 0.666]
0.00/0.02 c heuristics/crossover/minfixingrate = c 0.5
0.00/0.02 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.02 c # [type: real, range: [0,1], default: 0.1]
0.00/0.02 c heuristics/crossover/nodesquot = c 0.15
0.00/0.02 c # number of nodes without incumbent change that heuristic should wait
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.02 c heuristics/crossover/nwaitingnodes = c 100
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/crossover/nodesofs = c 750
0.00/0.02 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.02 c heuristics/crossover/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/coefdiving/freq = c -1
0.00/0.02 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c presolving/probing/maxrounds = c 0
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.02 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.02 c constraints/knapsack/disaggregation = c FALSE
0.00/0.02 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c constraints/knapsack/maxnumcardlift = c 0
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = c TRUE
0.00/0.02 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/maxroundsroot = c 5
0.00/0.02 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.02 c separating/maxrounds = c 1
0.00/0.02 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c limits/solutions = c 1
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = c 1620
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = c 1791
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = c 10000
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving problem
0.00/0.03 c
0.02/0.03 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.02/0.03 c 0.0s| 1 | 0 | 121 | 593k| 0 | 44 | 169 | 73 | 73 | 169 | 73 | 0 | 0 | 0 | 1.300000e+01 | -- | Inf
0.02/0.05 c 0.0s| 1 | 0 | 155 | 830k| 0 | 59 | 169 | 73 | 73 | 169 | 93 | 20 | 0 | 0 | 1.300000e+01 | -- | Inf
0.02/0.08 c 0.1s| 1 | 0 | 204 |1064k| 0 | 60 | 169 | 73 | 73 | 169 | 99 | 26 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 267 |1134k| 0 | 61 | 169 | 73 | 73 | 169 | 105 | 32 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.12 c 0.1s| 1 | 0 | 308 |1162k| 0 | 71 | 169 | 73 | 73 | 169 | 110 | 37 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 358 |1171k| 0 | 69 | 169 | 73 | 73 | 169 | 114 | 41 | 0 | 0 | 1.300000e+01 | -- | Inf
1.09/1.13 c 1.1s| 1 | 0 | 388 |1171k| 0 | 67 | 169 | 73 | 73 | 169 | 114 | 41 | 0 | 34 | 1.300000e+01 | -- | Inf
1.69/1.72 c 1.7s| 1 | 0 | 416 |1171k| 0 | 69 | 169 | 73 | 73 | 169 | 114 | 41 | 0 | 55 | 1.300000e+01 | -- | Inf
2.09/2.18 c 2.1s| 1 | 0 | 441 |1171k| 0 | 63 | 169 | 73 | 73 | 169 | 114 | 41 | 0 | 70 | 1.300000e+01 | -- | Inf
2.39/2.42 c 2.4s| 1 | 0 | 449 |1171k| 0 | 64 | 169 | 73 | 73 | 169 | 114 | 41 | 0 | 79 | 1.300000e+01 | -- | Inf
2.49/2.56 c 2.5s| 1 | 0 | 456 |1171k| 0 | 64 | 169 | 73 | 73 | 169 | 114 | 41 | 0 | 84 | 1.300000e+01 | -- | Inf
2.68/2.72 c 2.6s| 1 | 0 | 460 |1170k| 0 | 64 | 169 | 73 | 73 | 169 | 113 | 41 | 0 | 90 | 1.300000e+01 | -- | Inf
2.79/2.82 c 2.8s| 1 | 0 | 463 |1170k| 0 | 63 | 169 | 73 | 73 | 169 | 113 | 41 | 0 | 94 | 1.300000e+01 | -- | Inf
2.89/2.90 c [src/scip/lpi_spx.cpp:265] Warning: SoPlex threw an exception: XSOLVE21 Basis is singular (numerical troubles, delta = 1e-06)
2.89/2.90 c [src/scip/lpi_spx.cpp:1854] ERROR: SCIPlpiStrongbranch() returned SoPlex status -4
2.89/2.90 c (node 1) error in strong branching call for variable <t_x128> with solution 0.00429917
2.89/2.90 c 2.8s| 1 | 2 | 463 |1170k| 0 | 63 | 169 | 73 | 73 | 169 | 113 | 41 | 0 | 95 | 1.300000e+01 | -- | Inf
2.89/2.90 c (run 1, node 1) restarting after 25 global fixings of integer variables
2.89/2.90 c
2.89/2.90 (restart) converted 23 cuts from the global cut pool into linear constraints
2.89/2.90 c
2.89/2.90 presolving:
2.89/2.91 c (round 1) 25 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 23 upgd conss, 14 impls, 77 clqs
2.89/2.91 c presolving (2 rounds):
2.89/2.91 c 25 deleted vars, 3 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.89/2.91 c 14 implications, 77 cliques
2.89/2.91 c presolved problem has 144 variables (144 bin, 0 int, 0 impl, 0 cont) and 93 constraints
2.89/2.91 c 12 constraints of type <knapsack>
2.89/2.91 c 80 constraints of type <setppc>
2.89/2.91 c 1 constraints of type <logicor>
2.89/2.91 c transformed objective value is always integral (scale: 1)
2.89/2.91 c Presolving Time: 0.03
2.89/2.91 c
2.89/2.92 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.89/2.92 c 2.9s| 1 | 0 | 540 | 812k| 0 | 41 | 144 | 93 | 93 | 144 | 93 | 0 | 0 | 95 | 1.300000e+01 | -- | Inf
2.89/2.94 c 2.9s| 1 | 0 | 574 |1132k| 0 | 56 | 144 | 93 | 93 | 144 | 107 | 14 | 0 | 95 | 1.300000e+01 | -- | Inf
3.68/3.71 c 3.6s| 1 | 0 | 579 |1132k| 0 | 56 | 144 | 93 | 93 | 144 | 107 | 14 | 0 | 151 | 1.300000e+01 | -- | Inf
3.79/3.80 c 3.7s| 1 | 0 | 584 |1131k| 0 | 55 | 144 | 93 | 93 | 144 | 107 | 14 | 0 | 156 | 1.300000e+01 | -- | Inf
3.79/3.88 c 3.8s| 1 | 0 | 588 |1131k| 0 | 55 | 144 | 93 | 93 | 144 | 107 | 14 | 0 | 161 | 1.300000e+01 | -- | Inf
3.89/3.92 c 3.8s| 1 | 0 | 595 |1131k| 0 | 58 | 144 | 93 | 93 | 144 | 107 | 14 | 0 | 164 | 1.300000e+01 | -- | Inf
3.99/4.02 c 3.9s| 1 | 0 | 600 |1131k| 0 | 55 | 144 | 93 | 93 | 144 | 107 | 14 | 0 | 170 | 1.300000e+01 | -- | Inf
3.99/4.06 c 4.0s| 1 | 2 | 600 |1132k| 0 | 55 | 144 | 93 | 93 | 144 | 107 | 14 | 0 | 173 | 1.300000e+01 | -- | Inf
3.99/4.06 c (run 2, node 1) restarting after 19 global fixings of integer variables
3.99/4.06 c
3.99/4.06 (restart) converted 11 cuts from the global cut pool into linear constraints
3.99/4.06 c
3.99/4.06 presolving:
3.99/4.07 c (round 1) 19 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 11 upgd conss, 16 impls, 81 clqs
3.99/4.08 c presolving (2 rounds):
3.99/4.08 c 19 deleted vars, 1 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
3.99/4.08 c 16 implications, 81 cliques
3.99/4.08 c presolved problem has 125 variables (125 bin, 0 int, 0 impl, 0 cont) and 103 constraints
3.99/4.08 c 18 constraints of type <knapsack>
3.99/4.08 c 85 constraints of type <setppc>
3.99/4.08 c transformed objective value is always integral (scale: 1)
3.99/4.08 c Presolving Time: 0.04
3.99/4.08 c
3.99/4.08 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.99/4.08 c 4.0s| 1 | 0 | 685 | 864k| 0 | 47 | 125 | 103 | 103 | 125 | 103 | 0 | 0 | 173 | 1.300000e+01 | -- | Inf
4.09/4.11 c 4.0s| 1 | 0 | 714 |1126k| 0 | 51 | 125 | 103 | 103 | 125 | 113 | 10 | 0 | 173 | 1.300000e+01 | -- | Inf
4.49/4.53 c 4.4s| 1 | 0 | 735 |1126k| 0 | 51 | 125 | 103 | 103 | 125 | 113 | 10 | 0 | 223 | 1.300000e+01 | -- | Inf
4.59/4.64 c 4.5s| 1 | 0 | 740 |1126k| 0 | 51 | 125 | 103 | 103 | 125 | 113 | 10 | 0 | 235 | 1.300000e+01 | -- | Inf
4.59/4.67 c 4.6s| 1 | 0 | 743 |1126k| 0 | 51 | 125 | 103 | 103 | 125 | 113 | 10 | 0 | 238 | 1.300000e+01 | -- | Inf
4.68/4.70 c 4.6s| 1 | 0 | 745 |1126k| 0 | 50 | 125 | 103 | 103 | 125 | 113 | 10 | 0 | 241 | 1.300000e+01 | -- | Inf
4.68/4.71 c 4.6s| 1 | 0 | 747 |1126k| 0 | 51 | 125 | 103 | 103 | 125 | 113 | 10 | 0 | 242 | 1.300000e+01 | -- | Inf
4.68/4.73 c 4.6s| 1 | 0 | 748 |1126k| 0 | 50 | 125 | 103 | 103 | 125 | 113 | 10 | 0 | 244 | 1.300000e+01 | -- | Inf
4.68/4.74 c 4.6s| 1 | 0 | 749 |1126k| 0 | 50 | 125 | 103 | 103 | 125 | 113 | 10 | 0 | 245 | 1.300000e+01 | -- | Inf
4.68/4.76 c 4.7s| 1 | 0 | 751 |1126k| 0 | 50 | 125 | 103 | 103 | 125 | 113 | 10 | 0 | 246 | 1.300000e+01 | -- | Inf
4.68/4.78 c 4.7s| 1 | 0 | 753 |1126k| 0 | 50 | 125 | 103 | 103 | 125 | 113 | 10 | 0 | 247 | 1.300000e+01 | -- | Inf
4.68/4.79 c 4.7s| 1 | 2 | 753 |1127k| 0 | 50 | 125 | 103 | 103 | 125 | 113 | 10 | 0 | 248 | 1.300000e+01 | -- | Inf
4.68/4.79 c (run 3, node 1) restarting after 17 global fixings of integer variables
4.68/4.79 c
4.68/4.79 (restart) converted 6 cuts from the global cut pool into linear constraints
4.68/4.79 c
4.68/4.79 presolving:
4.79/4.80 c (round 1) 17 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 6 upgd conss, 22 impls, 82 clqs
4.79/4.80 c presolving (2 rounds):
4.79/4.80 c 17 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
4.79/4.80 c 22 implications, 82 cliques
4.79/4.80 c presolved problem has 108 variables (108 bin, 0 int, 0 impl, 0 cont) and 109 constraints
4.79/4.80 c 20 constraints of type <knapsack>
4.79/4.80 c 88 constraints of type <setppc>
4.79/4.80 c 1 constraints of type <logicor>
4.79/4.80 c transformed objective value is always integral (scale: 1)
4.79/4.80 c Presolving Time: 0.05
4.79/4.80 c
4.79/4.81 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.79/4.81 c 4.7s| 1 | 0 | 828 | 863k| 0 | 46 | 108 | 109 | 109 | 108 | 109 | 0 | 0 | 248 | 1.300000e+01 | -- | Inf
4.79/4.83 c 4.7s| 1 | 0 | 843 |1101k| 0 | 51 | 108 | 109 | 109 | 108 | 119 | 10 | 0 | 248 | 1.300000e+01 | -- | Inf
5.09/5.17 c 5.0s| 1 | 0 | 872 |1101k| 0 | 50 | 108 | 109 | 109 | 108 | 119 | 10 | 0 | 295 | 1.300000e+01 | -- | Inf
5.19/5.30 c 5.2s| 1 | 0 | 884 |1101k| 0 | 48 | 108 | 109 | 109 | 108 | 119 | 10 | 0 | 309 | 1.300000e+01 | -- | Inf
5.28/5.34 c 5.2s| 1 | 0 | 885 |1101k| 0 | 47 | 108 | 109 | 109 | 108 | 119 | 10 | 0 | 313 | 1.300000e+01 | -- | Inf
5.28/5.34 c 5.2s| 1 | 2 | 885 |1102k| 0 | 47 | 108 | 109 | 109 | 108 | 119 | 10 | 0 | 313 | 1.300000e+01 | -- | Inf
5.28/5.34 c (run 4, node 1) restarting after 8 global fixings of integer variables
5.28/5.34 c
5.28/5.34 (restart) converted 3 cuts from the global cut pool into linear constraints
5.28/5.34 c
5.28/5.34 presolving:
5.28/5.35 c (round 1) 8 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 3 upgd conss, 24 impls, 81 clqs
5.28/5.35 c presolving (2 rounds):
5.28/5.35 c 8 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
5.28/5.35 c 24 implications, 81 cliques
5.28/5.35 c presolved problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 112 constraints
5.28/5.35 c 23 constraints of type <knapsack>
5.28/5.35 c 88 constraints of type <setppc>
5.28/5.35 c 1 constraints of type <logicor>
5.28/5.35 c transformed objective value is always integral (scale: 1)
5.28/5.35 c Presolving Time: 0.06
5.28/5.35 c
5.28/5.35 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
5.28/5.35 c 5.2s| 1 | 0 | 945 | 875k| 0 | 48 | 100 | 112 | 112 | 100 | 112 | 0 | 0 | 313 | 1.300000e+01 | -- | Inf
5.28/5.38 c 5.2s| 1 | 0 | 963 |1154k| 0 | 54 | 100 | 112 | 112 | 100 | 119 | 7 | 0 | 313 | 1.300000e+01 | -- | Inf
5.98/6.00 c 5.8s| 1 | 0 | 969 |1154k| 0 | 53 | 100 | 112 | 112 | 100 | 119 | 7 | 0 | 362 | 1.300000e+01 | -- | Inf
6.08/6.13 c 6.0s| 1 | 0 | 972 |1154k| 0 | 53 | 100 | 112 | 112 | 100 | 119 | 7 | 0 | 371 | 1.300000e+01 | -- | Inf
6.08/6.17 c 6.0s| 1 | 0 | 974 |1154k| 0 | 53 | 100 | 112 | 112 | 100 | 119 | 7 | 0 | 374 | 1.300000e+01 | -- | Inf
6.08/6.18 c 6.0s| 1 | 2 | 974 |1154k| 0 | 53 | 100 | 112 | 112 | 100 | 119 | 7 | 0 | 375 | 1.300000e+01 | -- | Inf
6.19/6.21 c * 6.1s| 2 | 0 | 1079 |1177k| 1 | - | 100 | 112 | 71 | 100 | 79 | 7 | 0 | 388 | 1.300000e+01 | 1.300000e+01 | 0.00%
6.19/6.21 c
6.19/6.21 c SCIP Status : problem is solved [optimal solution found]
6.19/6.21 c Solving Time (sec) : 6.06
6.19/6.21 c Solving Nodes : 2 (total of 6 nodes in 5 runs)
6.19/6.21 c Primal Bound : +1.30000000000000e+01 (1 solutions)
6.19/6.21 c Dual Bound : +1.30000000000000e+01
6.19/6.21 c Gap : 0.00 %
6.19/6.21 c NODE 2
6.19/6.21 c DUAL BOUND 13
6.19/6.21 c PRIMAL BOUND 13
6.19/6.21 c GAP 0
6.19/6.21 s SATISFIABLE
6.19/6.21 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 x160 -x159 -x158 -x157 x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
6.19/6.21 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
6.19/6.21 v -x126 x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
6.19/6.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
6.19/6.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
6.19/6.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
6.19/6.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
6.19/6.21 v -x4 -x3 -x2 -x1
6.19/6.21 c SCIP Status : problem is solved [optimal solution found]
6.19/6.21 c Solving Time : 6.06
6.19/6.21 c Original Problem :
6.19/6.21 c Problem name : HOME/instance-1868034-1245115432.opb
6.19/6.21 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
6.19/6.21 c Constraints : 101 initial, 101 maximal
6.19/6.21 c Presolved Problem :
6.19/6.21 c Problem name : t_HOME/instance-1868034-1245115432.opb
6.19/6.21 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
6.19/6.21 c Constraints : 112 initial, 112 maximal
6.19/6.21 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
6.19/6.21 c trivial : 0.00 69 0 0 0 0 0 0 0
6.19/6.21 c dualfix : 0.00 0 0 0 0 0 0 0 0
6.19/6.21 c boundshift : 0.00 0 0 0 0 0 0 0 0
6.19/6.21 c inttobinary : 0.00 0 0 0 0 0 0 0 0
6.19/6.21 c implics : 0.00 0 0 0 0 0 0 0 0
6.19/6.21 c probing : 0.00 0 0 0 0 0 0 0 0
6.19/6.21 c knapsack : 0.02 0 0 0 0 0 0 0 0
6.19/6.21 c setppc : 0.02 0 0 0 0 0 0 0 0
6.19/6.21 c linear : 0.00 0 0 0 0 0 28 0 0
6.19/6.21 c logicor : 0.00 0 0 0 0 0 4 0 0
6.19/6.21 c root node : - 74 - - 74 - - - -
6.19/6.21 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
6.19/6.21 c integral : 0 0 0 35 0 0 84 0 0 10
6.19/6.21 c knapsack : 23 9 37 1 0 0 0 0 0 0
6.19/6.21 c setppc : 88 9 37 1 0 0 50 0 0 0
6.19/6.21 c logicor : 1 8 4 0 0 0 0 0 0 0
6.19/6.21 c countsols : 0 0 0 1 0 0 0 0 0 0
6.19/6.21 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
6.19/6.21 c integral : 5.71 0.00 0.00 5.71 0.00
6.19/6.21 c knapsack : 0.02 0.02 0.00 0.00 0.00
6.19/6.21 c setppc : 0.00 0.00 0.00 0.00 0.00
6.19/6.21 c logicor : 0.00 0.00 0.00 0.00 0.00
6.19/6.21 c countsols : 0.00 0.00 0.00 0.00 0.00
6.19/6.21 c Propagators : Time Calls Cutoffs DomReds
6.19/6.21 c rootredcost : 0.00 0 0 0
6.19/6.21 c pseudoobj : 0.00 42 0 0
6.19/6.21 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
6.19/6.21 c propagation : 0.00 0 0 0 0.0 0 0.0 -
6.19/6.21 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
6.19/6.21 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
6.19/6.21 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
6.19/6.21 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
6.19/6.21 c applied globally : - - - 0 0.0 - - -
6.19/6.21 c applied locally : - - - 0 0.0 - - -
6.19/6.21 c Separators : Time Calls Cutoffs DomReds Cuts Conss
6.19/6.21 c cut pool : 0.00 0 - - 0 - (maximal pool size: 104)
6.19/6.21 c redcost : 0.00 10 0 0 0 0
6.19/6.21 c impliedbounds : 0.00 9 0 0 0 0
6.19/6.21 c intobj : 0.00 0 0 0 0 0
6.19/6.21 c gomory : 0.07 9 0 0 22 0
6.19/6.21 c strongcg : 0.07 9 0 0 481 0
6.19/6.21 c cmir : 0.00 0 0 0 0 0
6.19/6.21 c flowcover : 0.00 0 0 0 0 0
6.19/6.21 c clique : 0.00 9 0 0 45 0
6.19/6.21 c zerohalf : 0.00 0 0 0 0 0
6.19/6.21 c mcf : 0.00 5 0 0 0 0
6.19/6.21 c Pricers : Time Calls Vars
6.19/6.21 c problem variables: 0.00 0 0
6.19/6.21 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
6.19/6.21 c relpscost : 5.71 34 0 84 0 0 10
6.19/6.21 c pscost : 0.00 0 0 0 0 0 0
6.19/6.21 c inference : 0.00 0 0 0 0 0 0
6.19/6.21 c mostinf : 0.00 0 0 0 0 0 0
6.19/6.21 c leastinf : 0.00 0 0 0 0 0 0
6.19/6.21 c fullstrong : 0.00 0 0 0 0 0 0
6.19/6.21 c allfullstrong : 0.00 0 0 0 0 0 0
6.19/6.21 c random : 0.00 0 0 0 0 0 0
6.19/6.21 c Primal Heuristics : Time Calls Found
6.19/6.21 c LP solutions : 0.00 - 1
6.19/6.21 c pseudo solutions : 0.00 - 0
6.19/6.21 c simplerounding : 0.00 0 0
6.19/6.21 c rounding : 0.00 0 0
6.19/6.21 c shifting : 0.00 0 0
6.19/6.21 c intshifting : 0.00 0 0
6.19/6.21 c oneopt : 0.00 0 0
6.19/6.21 c fixandinfer : 0.00 0 0
6.19/6.21 c feaspump : 0.00 0 0
6.19/6.21 c coefdiving : 0.00 0 0
6.19/6.21 c pscostdiving : 0.00 0 0
6.19/6.21 c fracdiving : 0.00 0 0
6.19/6.21 c veclendiving : 0.00 0 0
6.19/6.21 c intdiving : 0.00 0 0
6.19/6.21 c actconsdiving : 0.00 0 0
6.19/6.21 c objpscostdiving : 0.00 0 0
6.19/6.21 c rootsoldiving : 0.00 0 0
6.19/6.21 c linesearchdiving : 0.00 0 0
6.19/6.21 c guideddiving : 0.00 0 0
6.19/6.21 c octane : 0.00 0 0
6.19/6.21 c rens : 0.00 0 0
6.19/6.21 c rins : 0.00 0 0
6.19/6.21 c localbranching : 0.00 0 0
6.19/6.21 c mutation : 0.00 0 0
6.19/6.21 c crossover : 0.00 0 0
6.19/6.21 c dins : 0.00 0 0
6.19/6.21 c LP : Time Calls Iterations Iter/call Iter/sec
6.19/6.21 c primal LP : 0.00 0 0 0.00 -
6.19/6.21 c dual LP : 0.09 44 1079 24.52 11988.89
6.19/6.21 c barrier LP : 0.00 0 0 0.00 -
6.19/6.21 c diving/probing LP: 0.00 0 0 0.00 -
6.19/6.21 c strong branching : 5.71 388 49532 127.66 8674.61
6.19/6.21 c (at root node) : - 375 49103 130.94 -
6.19/6.21 c conflict analysis: 0.00 0 0 0.00 -
6.19/6.21 c B&B Tree :
6.19/6.21 c number of runs : 5
6.19/6.21 c nodes : 2
6.19/6.21 c nodes (total) : 6
6.19/6.21 c nodes left : 0
6.19/6.21 c max depth : 1
6.19/6.21 c max depth (total): 1
6.19/6.21 c backtracks : 0 (0.0%)
6.19/6.21 c delayed cutoffs : 0
6.19/6.21 c repropagations : 0 (0 domain reductions, 0 cutoffs)
6.19/6.21 c avg switch length: 2.00
6.19/6.21 c switching time : 0.00
6.19/6.21 c Solution :
6.19/6.21 c Solutions found : 1 (1 improvements)
6.19/6.21 c Primal Bound : +1.30000000000000e+01 (in run 5, after 2 nodes, 6.06 seconds, depth 1, found by <relaxation>)
6.19/6.21 c Dual Bound : +1.30000000000000e+01
6.19/6.21 c Gap : 0.00 %
6.19/6.21 c Root Dual Bound : +1.30000000000000e+01
6.19/6.22 c Time complete: 6.21.