0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2665731-1276273334.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 problem read
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c presolving settings loaded
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.03 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.03 c presolving (3 rounds):
0.00/0.03 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 8 implications, 68 cliques
0.00/0.03 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.03 c 1 constraints of type <knapsack>
0.00/0.03 c 68 constraints of type <setppc>
0.00/0.03 c 4 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
0.00/0.03 c
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 = 10000
0.00/0.03 c
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 = 1799.99
0.00/0.03 c
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 = 1620
0.00/0.03 c
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 = 1
0.00/0.03 c
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 = 1
0.00/0.03 c
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 = 5
0.00/0.03 c
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 = TRUE
0.00/0.03 c
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 = FALSE
0.00/0.03 c
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 = TRUE
0.00/0.03 c
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 = 0
0.00/0.03 c
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 = -1
0.00/0.03 c
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 = 0.075
0.00/0.03 c
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 = 1500
0.00/0.03 c
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 = -1
0.00/0.03 c
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 = 750
0.00/0.03 c
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 = 100
0.00/0.03 c
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 = 0.15
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixed
0.00/0.03 c # [type: real, range: [0,1], default: 0.666]
0.00/0.03 c heuristics/crossover/minfixingrate = 0.5
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/feaspump/freq = -1
0.00/0.03 c
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/feaspump/maxlpiterofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <fracdiving> (-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/fracdiving/freq = -1
0.00/0.03 c
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/fracdiving/maxlpiterquot = 0.075
0.00/0.03 c
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/fracdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <guideddiving> (-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/guideddiving/freq = -1
0.00/0.03 c
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/guideddiving/maxlpiterquot = 0.075
0.00/0.03 c
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/guideddiving/maxlpiterofs = 1500
0.00/0.03 c
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/intdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <intshifting> (-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/intshifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-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/linesearchdiving/freq = -1
0.00/0.03 c
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/linesearchdiving/maxlpiterquot = 0.075
0.00/0.03 c
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/linesearchdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/nlp/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/objpscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03 c # [type: real, range: [0,1], default: 0.01]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.03 c
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/objpscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/oneopt/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <pscostdiving> (-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/pscostdiving/freq = -1
0.00/0.03 c
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/pscostdiving/maxlpiterquot = 0.075
0.00/0.03 c
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/pscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/rens/freq = -1
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixable
0.00/0.03 c # [type: real, range: [0,1], default: 0.5]
0.00/0.03 c heuristics/rens/minfixingrate = 0.3
0.00/0.03 c
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/rens/nodesofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/rootsoldiving/freq = -1
0.00/0.03 c
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.01]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.03 c
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/rootsoldiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/rounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <shifting> (-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/shifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/simplerounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/trivial/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/trysol/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <veclendiving> (-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/veclendiving/freq = -1
0.00/0.03 c
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/veclendiving/maxlpiterquot = 0.075
0.00/0.03 c
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/veclendiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/zirounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/cmir/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/flowcover/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.00/0.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.04 c 0.0s| 1 | 0 | 49 | - | 743k| 0 | 42 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 69 | - |1157k| 0 | 56 | 169 | 206 | 169 | 104 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 0 | 115 | - |1290k| 0 | 70 | 169 | 206 | 169 | 113 | 40 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 190 | - |1423k| 0 | 71 | 169 | 206 | 169 | 119 | 46 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.35 c 0.3s| 1 | 0 | 227 | - |1428k| 0 | 76 | 169 | 206 | 169 | 125 | 52 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.40 c 0.4s| 1 | 0 | 422 | - |1534k| 0 | 76 | 169 | 206 | 169 | 128 | 55 | 0 | 0 | 0.000000e+00 | -- | Inf
0.79/0.87 c 0.8s| 1 | 0 | 474 | - |1530k| 0 | 76 | 169 | 203 | 169 | 128 | 55 | 0 | 10 | 0.000000e+00 | -- | Inf
1.29/1.31 c 1.2s| 1 | 0 | 488 | - |1525k| 0 | 77 | 169 | 199 | 169 | 128 | 55 | 0 | 21 | 0.000000e+00 | -- | Inf
1.69/1.73 c 1.7s| 1 | 0 | 495 | - |1524k| 0 | 77 | 169 | 198 | 169 | 128 | 55 | 0 | 31 | 0.000000e+00 | -- | Inf
2.20/2.23 c 2.1s| 1 | 0 | 655 | - |1516k| 0 | 72 | 169 | 191 | 169 | 128 | 55 | 0 | 43 | 0.000000e+00 | -- | Inf
2.69/2.76 c 2.7s| 1 | 0 | 684 | - |1482k| 0 | 73 | 169 | 159 | 169 | 128 | 55 | 0 | 56 | 0.000000e+00 | -- | Inf
3.09/3.17 c 3.1s| 1 | 0 | 707 | - |1463k| 0 | 69 | 169 | 142 | 169 | 116 | 55 | 0 | 67 | 0.000000e+00 | -- | Inf
3.59/3.62 c 3.5s| 1 | 0 | 809 | - |1459k| 0 | 67 | 169 | 139 | 169 | 116 | 55 | 0 | 80 | 0.000000e+00 | -- | Inf
3.89/3.93 c 3.8s| 1 | 0 | 896 | - |1458k| 0 | 65 | 169 | 138 | 169 | 116 | 55 | 0 | 91 | 0.000000e+00 | -- | Inf
4.09/4.20 c 4.1s| 1 | 0 | 936 | - |1458k| 0 | 65 | 169 | 138 | 169 | 116 | 55 | 0 | 101 | 0.000000e+00 | -- | Inf
4.30/4.35 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.30/4.35 c 4.2s| 1 | 0 | 936 | - |1458k| 0 | - | 169 | 138 | 169 | 116 | 55 | 0 | 107 | 0.000000e+00 | -- | Inf
4.30/4.35 c (run 1, node 1) restarting after 38 global fixings of integer variables
4.30/4.35 c
4.30/4.35 c (restart) converted 43 cuts from the global cut pool into linear constraints
4.30/4.35 c
4.30/4.35 c presolving:
4.30/4.36 c (round 1) 38 del vars, 9 del conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 0 upgd conss, 16 impls, 80 clqs
4.30/4.37 c (round 2) 38 del vars, 9 del conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 103 upgd conss, 16 impls, 80 clqs
4.30/4.39 c (round 3) 38 del vars, 11 del conss, 0 chg bounds, 4 chg sides, 1 chg coeffs, 103 upgd conss, 16 impls, 80 clqs
4.30/4.39 c (round 4) 38 del vars, 11 del conss, 0 chg bounds, 4 chg sides, 2 chg coeffs, 103 upgd conss, 16 impls, 80 clqs
4.30/4.39 c presolving (5 rounds):
4.30/4.39 c 38 deleted vars, 11 deleted constraints, 0 tightened bounds, 0 added holes, 4 changed sides, 2 changed coefficients
4.30/4.39 c 16 implications, 80 cliques
4.30/4.39 c presolved problem has 131 variables (131 bin, 0 int, 0 impl, 0 cont) and 170 constraints
4.30/4.39 c 25 constraints of type <knapsack>
4.30/4.39 c 79 constraints of type <setppc>
4.30/4.39 c 66 constraints of type <logicor>
4.30/4.39 c transformed objective value is always integral (scale: 1)
4.30/4.39 c Presolving Time: 0.04
4.30/4.39 c
4.30/4.40 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.30/4.40 c 4.2s| 1 | 0 | 992 | - |1105k| 0 | 44 | 131 | 170 | 131 | 108 | 0 | 0 | 107 | 0.000000e+00 | -- | Inf
4.40/4.43 c 4.3s| 1 | 0 | 1037 | - |1373k| 0 | 53 | 131 | 170 | 131 | 119 | 11 | 0 | 107 | 0.000000e+00 | -- | Inf
4.59/4.64 c 4.5s| 1 | 0 | 1071 | - |1371k| 0 | 55 | 131 | 168 | 131 | 119 | 11 | 0 | 117 | 0.000000e+00 | -- | Inf
4.79/4.87 c 4.7s| 1 | 0 | 1149 | - |1370k| 0 | 48 | 131 | 166 | 131 | 119 | 11 | 0 | 130 | 0.000000e+00 | -- | Inf
4.89/4.99 c 4.8s| 1 | 0 | 1184 | - |1370k| 0 | 49 | 131 | 164 | 131 | 119 | 11 | 0 | 138 | 0.000000e+00 | -- | Inf
4.99/5.07 c 4.9s| 1 | 0 | 1258 | - |1370k| 0 | 47 | 131 | 164 | 131 | 119 | 11 | 0 | 144 | 0.000000e+00 | -- | Inf
5.09/5.13 c 5.0s| 1 | 0 | 1289 | - |1368k| 0 | 45 | 131 | 161 | 131 | 119 | 11 | 0 | 149 | 0.000000e+00 | -- | Inf
5.09/5.17 c 5.0s| 1 | 0 | 1289 | - |1368k| 0 | - | 131 | 161 | 131 | 119 | 11 | 0 | 154 | 0.000000e+00 | -- | Inf
5.09/5.17 c (run 2, node 1) restarting after 30 global fixings of integer variables
5.09/5.17 c
5.09/5.17 c (restart) converted 11 cuts from the global cut pool into linear constraints
5.09/5.17 c
5.09/5.17 c presolving:
5.09/5.19 c (round 1) 30 del vars, 50 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 11 upgd conss, 26 impls, 80 clqs
5.19/5.20 c (round 2) 30 del vars, 51 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 11 upgd conss, 26 impls, 80 clqs
5.19/5.20 c presolving (3 rounds):
5.19/5.20 c 30 deleted vars, 51 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
5.19/5.20 c 26 implications, 80 cliques
5.19/5.20 c presolved problem has 101 variables (101 bin, 0 int, 0 impl, 0 cont) and 121 constraints
5.19/5.20 c 31 constraints of type <knapsack>
5.19/5.20 c 79 constraints of type <setppc>
5.19/5.20 c 11 constraints of type <logicor>
5.19/5.20 c transformed objective value is always integral (scale: 1)
5.19/5.20 c Presolving Time: 0.06
5.19/5.20 c
5.19/5.21 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
5.19/5.21 c 5.0s| 1 | 0 | 1347 | - |1078k| 0 | 40 | 101 | 121 | 101 | 110 | 0 | 0 | 154 | 0.000000e+00 | -- | Inf
5.19/5.24 c 5.0s| 1 | 0 | 1410 | - |1417k| 0 | 55 | 101 | 121 | 101 | 124 | 14 | 0 | 154 | 0.000000e+00 | -- | Inf
5.19/5.29 c 5.1s| 1 | 0 | 1446 | - |1417k| 0 | 53 | 101 | 121 | 101 | 124 | 14 | 0 | 159 | 0.000000e+00 | -- | Inf
5.29/5.39 c 5.2s| 1 | 0 | 1564 | - |1416k| 0 | - | 101 | 119 | 101 | 124 | 14 | 0 | 164 | -- | -- | 0.00%
5.29/5.39 c 5.2s| 1 | 0 | 1564 | - |1416k| 0 | - | 101 | 119 | 101 | 124 | 14 | 0 | 164 | -- | -- | 0.00%
5.29/5.39 c
5.29/5.39 c SCIP Status : problem is solved [infeasible]
5.29/5.39 c Solving Time (sec) : 5.19
5.29/5.39 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
5.29/5.39 c Primal Bound : +1.00000000000000e+20 (0 solutions)
5.29/5.39 c Dual Bound : +1.00000000000000e+20
5.29/5.39 c Gap : 0.00 %
5.29/5.39 s UNSATISFIABLE
5.29/5.39 c SCIP Status : problem is solved [infeasible]
5.29/5.39 c Solving Time : 5.19
5.29/5.39 c Original Problem :
5.29/5.39 c Problem name : HOME/instance-2665731-1276273334.opb
5.29/5.39 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
5.29/5.39 c Constraints : 101 initial, 101 maximal
5.29/5.39 c Presolved Problem :
5.29/5.39 c Problem name : t_HOME/instance-2665731-1276273334.opb
5.29/5.39 c Variables : 101 (101 binary, 0 integer, 0 implicit integer, 0 continuous)
5.29/5.39 c Constraints : 121 initial, 121 maximal
5.29/5.39 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
5.29/5.39 c trivial : 0.00 68 0 0 0 0 0 0 0
5.29/5.39 c dualfix : 0.00 0 0 0 0 0 0 0 0
5.29/5.39 c boundshift : 0.00 0 0 0 0 0 0 0 0
5.29/5.39 c inttobinary : 0.00 0 0 0 0 0 0 0 0
5.29/5.39 c implics : 0.00 0 0 0 0 0 0 0 0
5.29/5.39 c probing : 0.00 0 0 0 0 0 0 0 0
5.29/5.39 c knapsack : 0.04 0 0 0 0 0 0 0 3
5.29/5.39 c setppc : 0.01 0 0 0 0 0 9 0 0
5.29/5.39 c linear : 0.01 0 0 0 0 0 33 4 0
5.29/5.39 c logicor : 0.00 0 0 0 0 0 48 0 0
5.29/5.39 c root node : - 78 - - 78 - - - -
5.29/5.39 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
5.29/5.39 c integral : 0 0 0 18 0 0 78 0 0 0
5.29/5.39 c knapsack : 31 7 19 0 0 0 0 0 0 0
5.29/5.39 c setppc : 79 7 19 0 0 0 0 0 0 0
5.29/5.39 c logicor : 11 7 9 0 0 0 0 0 0 0
5.29/5.39 c countsols : 0 0 0 0 0 0 0 0 0 0
5.29/5.39 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
5.29/5.39 c integral : 4.60 0.00 0.00 4.60 0.00
5.29/5.39 c knapsack : 0.02 0.02 0.00 0.00 0.00
5.29/5.39 c setppc : 0.00 0.00 0.00 0.00 0.00
5.29/5.39 c logicor : 0.00 0.00 0.00 0.00 0.00
5.29/5.39 c countsols : 0.00 0.00 0.00 0.00 0.00
5.29/5.39 c Propagators : Time Calls Cutoffs DomReds
5.29/5.39 c vbounds : 0.00 3 0 0
5.29/5.39 c rootredcost : 0.00 0 0 0
5.29/5.39 c pseudoobj : 0.00 0 0 0
5.29/5.39 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
5.29/5.39 c propagation : 0.00 0 0 0 0.0 0 0.0 -
5.29/5.39 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
5.29/5.39 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
5.29/5.39 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
5.29/5.39 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
5.29/5.39 c applied globally : - - - 0 0.0 - - -
5.29/5.39 c applied locally : - - - 0 0.0 - - -
5.29/5.39 c Separators : Time Calls Cutoffs DomReds Cuts Conss
5.29/5.39 c cut pool : 0.00 0 - - 0 - (maximal pool size: 129)
5.29/5.39 c redcost : 0.00 7 0 0 0 0
5.29/5.39 c impliedbounds : 0.00 7 0 0 0 0
5.29/5.39 c intobj : 0.00 0 0 0 0 0
5.29/5.39 c cgmip : 0.00 0 0 0 0 0
5.29/5.39 c gomory : 0.06 7 0 0 65 0
5.29/5.39 c strongcg : 0.06 7 0 0 312 0
5.29/5.39 c cmir : 0.00 0 0 0 0 0
5.29/5.39 c flowcover : 0.00 0 0 0 0 0
5.29/5.39 c clique : 0.00 7 0 0 31 0
5.29/5.39 c zerohalf : 0.00 0 0 0 0 0
5.29/5.39 c mcf : 0.00 3 0 0 0 0
5.29/5.39 c rapidlearning : 0.19 1 0 0 0 133
5.29/5.39 c Pricers : Time Calls Vars
5.29/5.39 c problem variables: 0.00 0 0
5.29/5.39 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
5.29/5.39 c relpscost : 4.60 18 0 78 0 0 0
5.29/5.39 c pscost : 0.00 0 0 0 0 0 0
5.29/5.39 c inference : 0.00 0 0 0 0 0 0
5.29/5.39 c mostinf : 0.00 0 0 0 0 0 0
5.29/5.39 c leastinf : 0.00 0 0 0 0 0 0
5.29/5.39 c fullstrong : 0.00 0 0 0 0 0 0
5.29/5.39 c allfullstrong : 0.00 0 0 0 0 0 0
5.29/5.39 c random : 0.00 0 0 0 0 0 0
5.29/5.39 c Primal Heuristics : Time Calls Found
5.29/5.39 c LP solutions : 0.00 - 0
5.29/5.39 c pseudo solutions : 0.00 - 0
5.29/5.39 c trivial : 0.00 1 0
5.29/5.39 c simplerounding : 0.00 0 0
5.29/5.39 c zirounding : 0.00 0 0
5.29/5.39 c rounding : 0.00 0 0
5.29/5.39 c shifting : 0.00 0 0
5.29/5.39 c intshifting : 0.00 0 0
5.29/5.39 c oneopt : 0.00 0 0
5.29/5.39 c twoopt : 0.00 0 0
5.29/5.39 c fixandinfer : 0.00 0 0
5.29/5.39 c feaspump : 0.00 0 0
5.29/5.39 c coefdiving : 0.00 0 0
5.29/5.39 c pscostdiving : 0.00 0 0
5.29/5.39 c fracdiving : 0.00 0 0
5.29/5.39 c veclendiving : 0.00 0 0
5.29/5.39 c intdiving : 0.00 0 0
5.29/5.39 c actconsdiving : 0.00 0 0
5.29/5.39 c objpscostdiving : 0.00 0 0
5.29/5.39 c rootsoldiving : 0.00 0 0
5.29/5.39 c linesearchdiving : 0.00 0 0
5.29/5.39 c guideddiving : 0.00 0 0
5.29/5.39 c octane : 0.00 0 0
5.29/5.39 c rens : 0.00 0 0
5.29/5.39 c rins : 0.00 0 0
5.29/5.39 c localbranching : 0.00 0 0
5.29/5.39 c mutation : 0.00 0 0
5.29/5.39 c crossover : 0.00 0 0
5.29/5.39 c dins : 0.00 0 0
5.29/5.39 c undercover : 0.00 0 0
5.29/5.39 c nlp : 0.00 0 0
5.29/5.39 c trysol : 0.00 0 0
5.29/5.39 c LP : Time Calls Iterations Iter/call Iter/sec
5.29/5.39 c primal LP : 0.01 0 0 0.00 0.00
5.29/5.39 c dual LP : 0.16 26 1564 60.15 9775.00
5.29/5.39 c lex dual LP : 0.00 0 0 0.00 -
5.29/5.39 c barrier LP : 0.00 0 0 0.00 -
5.29/5.39 c diving/probing LP: 0.00 0 0 0.00 -
5.29/5.39 c strong branching : 4.60 164 60995 371.92 13259.78
5.29/5.39 c (at root node) : - 164 60995 371.92 -
5.29/5.39 c conflict analysis: 0.00 0 0 0.00 -
5.29/5.39 c B&B Tree :
5.29/5.39 c number of runs : 3
5.29/5.39 c nodes : 1
5.29/5.39 c nodes (total) : 3
5.29/5.39 c nodes left : 0
5.29/5.39 c max depth : 0
5.29/5.39 c max depth (total): 0
5.29/5.39 c backtracks : 0 (0.0%)
5.29/5.39 c delayed cutoffs : 0
5.29/5.39 c repropagations : 0 (0 domain reductions, 0 cutoffs)
5.29/5.39 c avg switch length: 2.00
5.29/5.39 c switching time : 0.00
5.29/5.39 c Solution :
5.29/5.39 c Solutions found : 0 (0 improvements)
5.29/5.39 c Primal Bound : infeasible
5.29/5.39 c Dual Bound : -
5.29/5.39 c Gap : 0.00 %
5.29/5.39 c Root Dual Bound : -
5.29/5.39 c Root Iterations : 1564
5.29/5.39 c Time complete: 5.39.