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-1868176-1245115899.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 | 153 | 593k| 0 | 44 | 169 | 73 | 73 | 169 | 73 | 0 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.05 c 0.0s| 1 | 0 | 192 | 798k| 0 | 53 | 169 | 73 | 73 | 169 | 88 | 15 | 0 | 0 | 1.300000e+01 | -- | Inf
0.04/0.08 c 0.1s| 1 | 0 | 244 |1104k| 0 | 59 | 169 | 73 | 73 | 169 | 96 | 23 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 325 |1212k| 0 | 58 | 169 | 73 | 73 | 169 | 103 | 30 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.12 c 0.1s| 1 | 0 | 339 |1233k| 0 | 60 | 169 | 73 | 73 | 169 | 104 | 31 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.14 c 0.1s| 1 | 0 | 354 |1240k| 0 | 59 | 169 | 73 | 73 | 169 | 106 | 33 | 0 | 0 | 1.300000e+01 | -- | Inf
0.79/0.85 c 0.8s| 1 | 0 | 381 |1240k| 0 | 60 | 169 | 73 | 73 | 169 | 106 | 33 | 0 | 34 | 1.300000e+01 | -- | Inf
1.29/1.33 c 1.3s| 1 | 0 | 403 |1240k| 0 | 55 | 169 | 73 | 73 | 169 | 106 | 33 | 0 | 56 | 1.300000e+01 | -- | Inf
1.39/1.46 c 1.4s| 1 | 0 | 412 |1240k| 0 | 55 | 169 | 73 | 73 | 169 | 106 | 33 | 0 | 63 | 1.300000e+01 | -- | Inf
1.49/1.54 c 1.5s| 1 | 0 | 415 |1240k| 0 | 55 | 169 | 73 | 73 | 169 | 106 | 33 | 0 | 68 | 1.300000e+01 | -- | Inf
1.49/1.59 c 1.5s| 1 | 0 | 419 |1240k| 0 | 55 | 169 | 73 | 73 | 169 | 106 | 33 | 0 | 71 | 1.300000e+01 | -- | Inf
1.59/1.65 c 1.6s| 1 | 0 | 421 |1240k| 0 | 55 | 169 | 73 | 73 | 169 | 100 | 33 | 0 | 74 | 1.300000e+01 | -- | Inf
1.59/1.68 c 1.6s| 1 | 0 | 423 |1239k| 0 | 55 | 169 | 73 | 73 | 169 | 100 | 33 | 0 | 76 | 1.300000e+01 | -- | Inf
1.69/1.70 c 1.6s| 1 | 0 | 424 |1239k| 0 | 55 | 169 | 73 | 73 | 169 | 100 | 33 | 0 | 78 | 1.300000e+01 | -- | Inf
1.69/1.71 c 1.7s| 1 | 0 | 425 |1239k| 0 | 55 | 169 | 73 | 73 | 169 | 100 | 33 | 0 | 79 | 1.300000e+01 | -- | Inf
1.69/1.73 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.69/1.73 c 1.7s| 1 | 0 | 426 |1239k| 0 | 55 | 169 | 73 | 73 | 169 | 100 | 33 | 0 | 80 | 1.300000e+01 | -- | Inf
1.69/1.74 c 1.7s| 1 | 0 | 428 |1239k| 0 | 55 | 169 | 73 | 73 | 169 | 100 | 33 | 0 | 81 | 1.300000e+01 | -- | Inf
1.69/1.77 c 1.7s| 1 | 0 | 431 |1239k| 0 | 55 | 169 | 73 | 73 | 169 | 91 | 33 | 0 | 83 | 1.300000e+01 | -- | Inf
1.79/1.81 c 1.8s| 1 | 0 | 433 |1239k| 0 | 55 | 169 | 73 | 73 | 169 | 91 | 33 | 0 | 86 | 1.300000e+01 | -- | Inf
1.79/1.84 c 1.8s| 1 | 0 | 436 |1239k| 0 | 54 | 169 | 73 | 73 | 169 | 91 | 33 | 0 | 88 | 1.300000e+01 | -- | Inf
1.79/1.85 c 1.8s| 1 | 0 | 437 |1239k| 0 | 54 | 169 | 73 | 73 | 169 | 91 | 33 | 0 | 89 | 1.300000e+01 | -- | Inf
1.79/1.86 c 1.8s| 1 | 0 | 439 |1239k| 0 | 55 | 169 | 73 | 73 | 169 | 91 | 33 | 0 | 90 | 1.300000e+01 | -- | Inf
1.79/1.89 c 1.8s| 1 | 0 | 441 |1239k| 0 | 55 | 169 | 73 | 73 | 169 | 91 | 33 | 0 | 92 | 1.300000e+01 | -- | Inf
1.89/1.91 c 1.9s| 1 | 2 | 441 |1240k| 0 | 55 | 169 | 73 | 73 | 169 | 91 | 33 | 0 | 94 | 1.300000e+01 | -- | Inf
1.89/1.91 c (run 1, node 1) restarting after 31 global fixings of integer variables
1.89/1.91 c
1.89/1.91 (restart) converted 16 cuts from the global cut pool into linear constraints
1.89/1.91 c
1.89/1.91 presolving:
1.89/1.92 c (round 1) 31 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 16 upgd conss, 12 impls, 74 clqs
1.89/1.92 c presolving (2 rounds):
1.89/1.92 c 31 deleted vars, 3 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.89/1.92 c 12 implications, 74 cliques
1.89/1.92 c presolved problem has 138 variables (138 bin, 0 int, 0 impl, 0 cont) and 86 constraints
1.89/1.92 c 9 constraints of type <knapsack>
1.89/1.92 c 76 constraints of type <setppc>
1.89/1.92 c 1 constraints of type <logicor>
1.89/1.92 c transformed objective value is always integral (scale: 1)
1.89/1.92 c Presolving Time: 0.02
1.89/1.92 c
1.89/1.93 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.89/1.93 c 1.9s| 1 | 0 | 533 | 732k| 0 | 44 | 138 | 86 | 86 | 138 | 86 | 0 | 0 | 94 | 1.300000e+01 | -- | Inf
1.89/1.95 c 1.9s| 1 | 0 | 555 | 984k| 0 | 56 | 138 | 86 | 86 | 138 | 99 | 13 | 0 | 94 | 1.300000e+01 | -- | Inf
2.19/2.29 c 2.2s| 1 | 0 | 566 | 984k| 0 | 56 | 138 | 86 | 86 | 138 | 99 | 13 | 0 | 135 | 1.300000e+01 | -- | Inf
2.39/2.46 c 2.4s| 1 | 0 | 573 | 983k| 0 | 56 | 138 | 85 | 85 | 138 | 99 | 13 | 0 | 152 | 1.300000e+01 | -- | Inf
2.49/2.56 c 2.5s| 1 | 0 | 579 | 983k| 0 | 56 | 138 | 85 | 85 | 138 | 99 | 13 | 0 | 160 | 1.300000e+01 | -- | Inf
2.59/2.62 c 2.5s| 1 | 0 | 585 | 983k| 0 | 54 | 138 | 85 | 85 | 138 | 99 | 13 | 0 | 165 | 1.300000e+01 | -- | Inf
2.59/2.64 c 2.6s| 1 | 0 | 588 | 983k| 0 | 54 | 138 | 85 | 85 | 138 | 99 | 13 | 0 | 168 | 1.300000e+01 | -- | Inf
2.59/2.67 c 2.6s| 1 | 0 | 589 | 983k| 0 | 54 | 138 | 85 | 85 | 138 | 99 | 13 | 0 | 171 | 1.300000e+01 | -- | Inf
2.59/2.69 c 2.6s| 1 | 2 | 589 | 984k| 0 | 54 | 138 | 85 | 85 | 138 | 99 | 13 | 0 | 172 | 1.300000e+01 | -- | Inf
2.59/2.69 c (run 2, node 1) restarting after 17 global fixings of integer variables
2.59/2.69 c
2.59/2.69 (restart) converted 11 cuts from the global cut pool into linear constraints
2.59/2.69 c
2.59/2.69 presolving:
2.69/2.70 c (round 1) 17 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 11 upgd conss, 16 impls, 75 clqs
2.69/2.70 c presolving (2 rounds):
2.69/2.70 c 17 deleted vars, 1 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.69/2.70 c 16 implications, 75 cliques
2.69/2.70 c presolved problem has 121 variables (121 bin, 0 int, 0 impl, 0 cont) and 95 constraints
2.69/2.70 c 16 constraints of type <knapsack>
2.69/2.70 c 79 constraints of type <setppc>
2.69/2.70 c transformed objective value is always integral (scale: 1)
2.69/2.70 c Presolving Time: 0.03
2.69/2.70 c
2.69/2.71 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.69/2.71 c 2.6s| 1 | 0 | 647 | 809k| 0 | 43 | 121 | 95 | 95 | 121 | 95 | 0 | 0 | 172 | 1.300000e+01 | -- | Inf
2.69/2.73 c 2.6s| 1 | 0 | 663 |1065k| 0 | 48 | 121 | 95 | 95 | 121 | 105 | 10 | 0 | 172 | 1.300000e+01 | -- | Inf
3.09/3.11 c 3.0s| 1 | 0 | 667 |1065k| 0 | 49 | 121 | 95 | 95 | 121 | 105 | 10 | 0 | 220 | 1.300000e+01 | -- | Inf
3.09/3.16 c 3.1s| 1 | 0 | 671 |1065k| 0 | 49 | 121 | 95 | 95 | 121 | 105 | 10 | 0 | 224 | 1.300000e+01 | -- | Inf
3.09/3.19 c 3.1s| 1 | 2 | 671 |1066k| 0 | 49 | 121 | 95 | 95 | 121 | 105 | 10 | 0 | 227 | 1.300000e+01 | -- | Inf
3.59/3.60 c * 3.5s| 4 | 0 | 906 |1101k| 2 | - | 121 | 95 | 57 | 121 | 76 | 10 | 0 | 362 | 1.300000e+01 | 1.300000e+01 | 0.00%
3.59/3.60 c
3.59/3.60 c SCIP Status : problem is solved [optimal solution found]
3.59/3.60 c Solving Time (sec) : 3.49
3.59/3.60 c Solving Nodes : 4 (total of 6 nodes in 3 runs)
3.59/3.60 c Primal Bound : +1.30000000000000e+01 (1 solutions)
3.59/3.60 c Dual Bound : +1.30000000000000e+01
3.59/3.60 c Gap : 0.00 %
3.59/3.60 c NODE 4
3.59/3.60 c DUAL BOUND 13
3.59/3.60 c PRIMAL BOUND 13
3.59/3.60 c GAP 0
3.59/3.60 s SATISFIABLE
3.59/3.60 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 x158 -x157 -x156 -x155 -x154 x153 -x152 -x151 -x150 -x149 -x148
3.59/3.60 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
3.59/3.60 v -x126 -x125 x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
3.59/3.60 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.59/3.60 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.59/3.60 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.59/3.60 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.59/3.60 v -x4 -x3 -x2 -x1
3.59/3.60 c SCIP Status : problem is solved [optimal solution found]
3.59/3.60 c Solving Time : 3.49
3.59/3.60 c Original Problem :
3.59/3.60 c Problem name : HOME/instance-1868176-1245115899.opb
3.59/3.60 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
3.59/3.60 c Constraints : 101 initial, 101 maximal
3.59/3.60 c Presolved Problem :
3.59/3.60 c Problem name : t_HOME/instance-1868176-1245115899.opb
3.59/3.60 c Variables : 121 (121 binary, 0 integer, 0 implicit integer, 0 continuous)
3.59/3.60 c Constraints : 95 initial, 95 maximal
3.59/3.60 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.59/3.60 c trivial : 0.00 48 0 0 0 0 0 0 0
3.59/3.60 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.59/3.60 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.59/3.60 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.59/3.60 c implics : 0.00 0 0 0 0 0 0 0 0
3.59/3.60 c probing : 0.00 0 0 0 0 0 0 0 0
3.59/3.60 c knapsack : 0.02 0 0 0 0 0 0 0 0
3.59/3.60 c setppc : 0.00 0 0 0 0 0 0 0 0
3.59/3.60 c linear : 0.01 0 0 0 0 0 28 0 0
3.59/3.60 c logicor : 0.00 0 0 0 0 0 4 0 0
3.59/3.60 c root node : - 51 - - 51 - - - -
3.59/3.60 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.59/3.61 c integral : 0 0 0 48 0 1 102 0 0 8
3.59/3.61 c knapsack : 16 7 56 1 0 0 0 0 0 0
3.59/3.61 c setppc : 79 7 56 1 0 0 70 0 0 0
3.59/3.61 c countsols : 0 0 0 1 0 0 0 0 0 0
3.59/3.61 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.59/3.61 c integral : 3.25 0.00 0.00 3.25 0.00
3.59/3.61 c knapsack : 0.00 0.00 0.00 0.00 0.00
3.59/3.61 c setppc : 0.00 0.00 0.00 0.00 0.00
3.59/3.61 c countsols : 0.00 0.00 0.00 0.00 0.00
3.59/3.61 c Propagators : Time Calls Cutoffs DomReds
3.59/3.61 c rootredcost : 0.00 0 0 0
3.59/3.61 c pseudoobj : 0.00 59 0 0
3.59/3.61 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.59/3.61 c propagation : 0.00 0 0 0 0.0 0 0.0 -
3.59/3.61 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.59/3.61 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.59/3.61 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.59/3.61 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.59/3.61 c applied globally : - - - 0 0.0 - - -
3.59/3.61 c applied locally : - - - 0 0.0 - - -
3.59/3.61 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.59/3.61 c cut pool : 0.00 0 - - 0 - (maximal pool size: 81)
3.59/3.61 c redcost : 0.00 10 0 0 0 0
3.59/3.61 c impliedbounds : 0.00 7 0 0 0 0
3.59/3.61 c intobj : 0.00 0 0 0 0 0
3.59/3.61 c gomory : 0.06 7 0 0 11 0
3.59/3.61 c strongcg : 0.05 7 0 0 299 0
3.59/3.61 c cmir : 0.00 0 0 0 0 0
3.59/3.61 c flowcover : 0.00 0 0 0 0 0
3.59/3.61 c clique : 0.01 7 0 0 34 0
3.59/3.61 c zerohalf : 0.00 0 0 0 0 0
3.59/3.61 c mcf : 0.00 3 0 0 0 0
3.59/3.61 c Pricers : Time Calls Vars
3.59/3.61 c problem variables: 0.00 0 0
3.59/3.61 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.59/3.61 c relpscost : 3.25 47 1 102 0 0 8
3.59/3.61 c pscost : 0.00 0 0 0 0 0 0
3.59/3.61 c inference : 0.00 0 0 0 0 0 0
3.59/3.61 c mostinf : 0.00 0 0 0 0 0 0
3.59/3.61 c leastinf : 0.00 0 0 0 0 0 0
3.59/3.61 c fullstrong : 0.00 0 0 0 0 0 0
3.59/3.61 c allfullstrong : 0.00 0 0 0 0 0 0
3.59/3.61 c random : 0.00 0 0 0 0 0 0
3.59/3.61 c Primal Heuristics : Time Calls Found
3.59/3.61 c LP solutions : 0.00 - 1
3.59/3.61 c pseudo solutions : 0.00 - 0
3.59/3.61 c simplerounding : 0.00 0 0
3.59/3.61 c rounding : 0.00 0 0
3.59/3.61 c shifting : 0.00 0 0
3.59/3.61 c intshifting : 0.00 0 0
3.59/3.61 c oneopt : 0.00 0 0
3.59/3.61 c fixandinfer : 0.00 0 0
3.59/3.61 c feaspump : 0.00 0 0
3.59/3.61 c coefdiving : 0.00 0 0
3.59/3.61 c pscostdiving : 0.00 0 0
3.59/3.61 c fracdiving : 0.00 0 0
3.59/3.61 c veclendiving : 0.00 0 0
3.59/3.61 c intdiving : 0.00 0 0
3.59/3.61 c actconsdiving : 0.00 0 0
3.59/3.61 c objpscostdiving : 0.00 0 0
3.59/3.61 c rootsoldiving : 0.00 0 0
3.59/3.61 c linesearchdiving : 0.00 0 0
3.59/3.61 c guideddiving : 0.00 0 0
3.59/3.61 c octane : 0.00 0 0
3.59/3.61 c rens : 0.00 0 0
3.59/3.61 c rins : 0.00 0 0
3.59/3.61 c localbranching : 0.00 0 0
3.59/3.61 c mutation : 0.00 0 0
3.59/3.61 c crossover : 0.00 0 0
3.59/3.61 c dins : 0.00 0 0
3.59/3.61 c LP : Time Calls Iterations Iter/call Iter/sec
3.59/3.61 c primal LP : 0.00 0 0 0.00 -
3.59/3.61 c dual LP : 0.08 55 906 16.47 11325.00
3.59/3.61 c barrier LP : 0.00 0 0 0.00 -
3.59/3.61 c diving/probing LP: 0.00 0 0 0.00 -
3.59/3.61 c strong branching : 3.25 362 34618 95.63 10651.69
3.59/3.61 c (at root node) : - 227 28235 124.38 -
3.59/3.61 c conflict analysis: 0.00 0 0 0.00 -
3.59/3.61 c B&B Tree :
3.59/3.61 c number of runs : 3
3.59/3.61 c nodes : 4
3.59/3.61 c nodes (total) : 6
3.59/3.61 c nodes left : 0
3.59/3.61 c max depth : 2
3.59/3.61 c max depth (total): 2
3.59/3.61 c backtracks : 0 (0.0%)
3.59/3.61 c delayed cutoffs : 0
3.59/3.61 c repropagations : 0 (0 domain reductions, 0 cutoffs)
3.59/3.61 c avg switch length: 2.00
3.59/3.61 c switching time : 0.00
3.59/3.61 c Solution :
3.59/3.61 c Solutions found : 1 (1 improvements)
3.59/3.61 c Primal Bound : +1.30000000000000e+01 (in run 3, after 4 nodes, 3.49 seconds, depth 2, found by <relaxation>)
3.59/3.61 c Dual Bound : +1.30000000000000e+01
3.59/3.61 c Gap : 0.00 %
3.59/3.61 c Root Dual Bound : +1.30000000000000e+01
3.59/3.61 c Time complete: 3.6.