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-2665710-1276271594.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 = 1800
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.04 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 | 47 | - | 743k| 0 | 39 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 105 | - |1182k| 0 | 58 | 169 | 200 | 169 | 99 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 0 | 215 | - |1266k| 0 | 54 | 169 | 200 | 169 | 105 | 32 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 370 | - |1580k| 0 | 53 | 169 | 200 | 169 | 112 | 39 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.35 c 0.3s| 1 | 0 | 501 | - |1626k| 0 | 61 | 169 | 200 | 169 | 115 | 42 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.38 c 0.3s| 1 | 0 | 588 | - |1689k| 0 | 63 | 169 | 200 | 169 | 119 | 46 | 0 | 0 | 0.000000e+00 | -- | Inf
0.79/0.83 c 0.8s| 1 | 0 | 628 | - |1686k| 0 | 63 | 169 | 197 | 169 | 119 | 46 | 0 | 11 | 0.000000e+00 | -- | Inf
1.19/1.23 c 1.2s| 1 | 0 | 723 | - |1677k| 0 | 62 | 169 | 189 | 169 | 119 | 46 | 0 | 22 | 0.000000e+00 | -- | Inf
1.49/1.52 c 1.4s| 1 | 0 | 730 | - |1642k| 0 | 62 | 169 | 156 | 169 | 119 | 46 | 0 | 33 | 0.000000e+00 | -- | Inf
1.89/1.90 c 1.8s| 1 | 0 | 770 | - |1642k| 0 | 61 | 169 | 156 | 169 | 119 | 46 | 0 | 45 | 0.000000e+00 | -- | Inf
2.20/2.25 c 2.2s| 1 | 0 | 816 | - |1635k| 0 | 60 | 169 | 150 | 169 | 119 | 46 | 0 | 57 | 0.000000e+00 | -- | Inf
2.49/2.60 c 2.5s| 1 | 0 | 855 | - |1634k| 0 | 59 | 169 | 149 | 169 | 100 | 46 | 0 | 70 | 0.000000e+00 | -- | Inf
2.69/2.70 c 2.6s| 1 | 0 | 890 | - |1626k| 0 | 58 | 169 | 142 | 169 | 100 | 46 | 0 | 76 | 0.000000e+00 | -- | Inf
2.79/2.80 c 2.7s| 1 | 0 | 902 | - |1615k| 0 | 58 | 169 | 131 | 169 | 100 | 46 | 0 | 81 | 0.000000e+00 | -- | Inf
2.99/3.00 c 2.9s| 1 | 0 | 908 | - |1610k| 0 | 57 | 169 | 126 | 169 | 100 | 46 | 0 | 91 | 0.000000e+00 | -- | Inf
3.09/3.16 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.09/3.16 c 3.0s| 1 | 0 | 908 | - |1610k| 0 | - | 169 | 126 | 169 | 100 | 46 | 0 | 101 | 0.000000e+00 | -- | Inf
3.09/3.16 c (run 1, node 1) restarting after 38 global fixings of integer variables
3.09/3.16 c
3.09/3.16 c (restart) converted 27 cuts from the global cut pool into linear constraints
3.09/3.16 c
3.09/3.16 c presolving:
3.09/3.17 c (round 1) 38 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 81 upgd conss, 12 impls, 82 clqs
3.09/3.19 c (round 2) 38 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 81 upgd conss, 12 impls, 82 clqs
3.09/3.19 c presolving (3 rounds):
3.09/3.19 c 38 deleted vars, 2 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
3.09/3.19 c 12 implications, 82 cliques
3.09/3.19 c presolved problem has 131 variables (131 bin, 0 int, 0 impl, 0 cont) and 151 constraints
3.09/3.19 c 11 constraints of type <knapsack>
3.09/3.19 c 83 constraints of type <setppc>
3.09/3.19 c 57 constraints of type <logicor>
3.09/3.19 c transformed objective value is always integral (scale: 1)
3.09/3.19 c Presolving Time: 0.03
3.09/3.19 c
3.09/3.19 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.09/3.19 c 3.1s| 1 | 0 | 968 | - | 926k| 0 | 42 | 131 | 151 | 131 | 98 | 0 | 0 | 101 | 0.000000e+00 | -- | Inf
3.19/3.22 c 3.1s| 1 | 0 | 1045 | - |1188k| 0 | 57 | 131 | 151 | 131 | 109 | 11 | 0 | 101 | 0.000000e+00 | -- | Inf
3.49/3.51 c 3.4s| 1 | 0 | 1067 | - |1188k| 0 | 55 | 131 | 151 | 131 | 109 | 11 | 0 | 120 | 0.000000e+00 | -- | Inf
3.59/3.67 c 3.5s| 1 | 0 | 1108 | - |1188k| 0 | 55 | 131 | 151 | 131 | 109 | 11 | 0 | 128 | 0.000000e+00 | -- | Inf
3.79/3.86 c 3.7s| 1 | 0 | 1132 | - |1188k| 0 | 55 | 131 | 151 | 131 | 109 | 11 | 0 | 140 | 0.000000e+00 | -- | Inf
4.08/4.10 c 4.0s| 1 | 0 | 1208 | - |1187k| 0 | 53 | 131 | 149 | 131 | 109 | 11 | 0 | 156 | 0.000000e+00 | -- | Inf
4.29/4.31 c 4.2s| 1 | 0 | 1266 | - |1185k| 0 | 52 | 131 | 141 | 131 | 109 | 11 | 0 | 172 | 0.000000e+00 | -- | Inf
4.40/4.46 c 4.3s| 1 | 0 | 1266 | - |1185k| 0 | - | 131 | 141 | 131 | 109 | 11 | 0 | 184 | 0.000000e+00 | -- | Inf
4.40/4.46 c (run 2, node 1) restarting after 27 global fixings of integer variables
4.40/4.46 c
4.40/4.46 c (restart) converted 11 cuts from the global cut pool into linear constraints
4.40/4.46 c
4.40/4.46 c presolving:
4.40/4.47 c (round 1) 27 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 11 upgd conss, 18 impls, 81 clqs
4.40/4.48 c (round 2) 27 del vars, 20 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 11 upgd conss, 18 impls, 81 clqs
4.40/4.48 c presolving (3 rounds):
4.40/4.48 c 27 deleted vars, 20 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
4.40/4.48 c 18 implications, 81 cliques
4.40/4.48 c presolved problem has 104 variables (104 bin, 0 int, 0 impl, 0 cont) and 132 constraints
4.40/4.48 c 18 constraints of type <knapsack>
4.40/4.48 c 83 constraints of type <setppc>
4.40/4.48 c 31 constraints of type <logicor>
4.40/4.48 c transformed objective value is always integral (scale: 1)
4.40/4.48 c Presolving Time: 0.05
4.40/4.49 c
4.40/4.49 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.40/4.49 c 4.3s| 1 | 0 | 1342 | - | 938k| 0 | 49 | 104 | 132 | 104 | 105 | 0 | 0 | 184 | 0.000000e+00 | -- | Inf
4.49/4.52 c 4.3s| 1 | 0 | 1402 | - |1381k| 0 | 47 | 104 | 132 | 104 | 113 | 8 | 0 | 184 | 0.000000e+00 | -- | Inf
4.69/4.74 c 4.6s| 1 | 2 | 1402 | - |1382k| 0 | 47 | 104 | 132 | 104 | 113 | 8 | 0 | 201 | 0.000000e+00 | -- | Inf
5.29/5.34 c
5.29/5.34 c SCIP Status : problem is solved [infeasible]
5.29/5.34 c Solving Time (sec) : 5.11
5.29/5.34 c Solving Nodes : 5 (total of 7 nodes in 3 runs)
5.29/5.34 c Primal Bound : +1.00000000000000e+20 (0 solutions)
5.29/5.34 c Dual Bound : +1.00000000000000e+20
5.29/5.34 c Gap : 0.00 %
5.29/5.34 s UNSATISFIABLE
5.29/5.34 c SCIP Status : problem is solved [infeasible]
5.29/5.34 c Solving Time : 5.11
5.29/5.34 c Original Problem :
5.29/5.34 c Problem name : HOME/instance-2665710-1276271594.opb
5.29/5.34 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
5.29/5.34 c Constraints : 101 initial, 101 maximal
5.29/5.34 c Presolved Problem :
5.29/5.34 c Problem name : t_HOME/instance-2665710-1276271594.opb
5.29/5.34 c Variables : 104 (104 binary, 0 integer, 0 implicit integer, 0 continuous)
5.29/5.34 c Constraints : 132 initial, 132 maximal
5.29/5.34 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
5.29/5.34 c trivial : 0.00 65 0 0 0 0 0 0 0
5.29/5.34 c dualfix : 0.00 0 0 0 0 0 0 0 0
5.29/5.34 c boundshift : 0.00 0 0 0 0 0 0 0 0
5.29/5.34 c inttobinary : 0.00 0 0 0 0 0 0 0 0
5.29/5.34 c implics : 0.00 0 0 0 0 0 0 0 0
5.29/5.34 c probing : 0.00 0 0 0 0 0 0 0 0
5.29/5.34 c knapsack : 0.03 0 0 0 0 0 0 0 0
5.29/5.34 c setppc : 0.00 0 0 0 0 0 4 0 0
5.29/5.34 c linear : 0.01 0 0 0 0 0 28 0 0
5.29/5.34 c logicor : 0.00 0 0 0 0 0 18 0 0
5.29/5.34 c root node : - 128 - - 128 - - - -
5.29/5.34 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
5.29/5.34 c integral : 0 0 0 39 0 1 135 0 0 4
5.29/5.34 c knapsack : 18 7 45 0 0 0 2 0 0 0
5.29/5.34 c setppc : 83 7 45 0 0 0 39 0 0 0
5.29/5.34 c logicor : 31 7 21 0 0 0 0 0 0 0
5.29/5.34 c countsols : 0 0 0 0 0 0 0 0 0 0
5.29/5.34 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
5.29/5.34 c integral : 4.63 0.00 0.00 4.63 0.00
5.29/5.34 c knapsack : 0.01 0.01 0.00 0.00 0.00
5.29/5.34 c setppc : 0.00 0.00 0.00 0.00 0.00
5.29/5.34 c logicor : 0.00 0.00 0.00 0.00 0.00
5.29/5.34 c countsols : 0.00 0.00 0.00 0.00 0.00
5.29/5.34 c Propagators : Time Calls Cutoffs DomReds
5.29/5.34 c vbounds : 0.00 3 0 0
5.29/5.34 c rootredcost : 0.00 0 0 0
5.29/5.34 c pseudoobj : 0.00 0 0 0
5.29/5.34 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
5.29/5.34 c propagation : 0.00 0 0 0 0.0 0 0.0 -
5.29/5.34 c infeasible LP : 0.00 2 0 0 0.0 0 0.0 0
5.29/5.34 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
5.29/5.34 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
5.29/5.34 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
5.29/5.34 c applied globally : - - - 0 0.0 - - -
5.29/5.34 c applied locally : - - - 0 0.0 - - -
5.29/5.34 c Separators : Time Calls Cutoffs DomReds Cuts Conss
5.29/5.34 c cut pool : 0.00 0 - - 0 - (maximal pool size: 154)
5.29/5.34 c redcost : 0.00 10 0 0 0 0
5.29/5.34 c impliedbounds : 0.00 7 0 0 0 0
5.29/5.34 c intobj : 0.00 0 0 0 0 0
5.29/5.34 c cgmip : 0.00 0 0 0 0 0
5.29/5.34 c gomory : 0.07 7 0 0 106 0
5.29/5.34 c strongcg : 0.05 7 0 0 339 0
5.29/5.34 c cmir : 0.00 0 0 0 0 0
5.29/5.34 c flowcover : 0.00 0 0 0 0 0
5.29/5.34 c clique : 0.02 7 0 0 30 0
5.29/5.34 c zerohalf : 0.00 0 0 0 0 0
5.29/5.34 c mcf : 0.00 3 0 0 0 0
5.29/5.34 c rapidlearning : 0.18 1 0 0 0 127
5.29/5.34 c Pricers : Time Calls Vars
5.29/5.34 c problem variables: 0.00 0 0
5.29/5.34 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
5.29/5.34 c relpscost : 4.63 39 1 135 0 0 4
5.29/5.34 c pscost : 0.00 0 0 0 0 0 0
5.29/5.34 c inference : 0.00 0 0 0 0 0 0
5.29/5.34 c mostinf : 0.00 0 0 0 0 0 0
5.29/5.34 c leastinf : 0.00 0 0 0 0 0 0
5.29/5.34 c fullstrong : 0.00 0 0 0 0 0 0
5.29/5.34 c allfullstrong : 0.00 0 0 0 0 0 0
5.29/5.34 c random : 0.00 0 0 0 0 0 0
5.29/5.34 c Primal Heuristics : Time Calls Found
5.29/5.34 c LP solutions : 0.00 - 0
5.29/5.34 c pseudo solutions : 0.00 - 0
5.29/5.34 c trivial : 0.00 1 0
5.29/5.34 c simplerounding : 0.00 0 0
5.29/5.34 c zirounding : 0.00 0 0
5.29/5.34 c rounding : 0.00 0 0
5.29/5.34 c shifting : 0.00 0 0
5.29/5.34 c intshifting : 0.00 0 0
5.29/5.34 c oneopt : 0.00 0 0
5.29/5.34 c twoopt : 0.00 0 0
5.29/5.34 c fixandinfer : 0.00 0 0
5.29/5.34 c feaspump : 0.00 0 0
5.29/5.34 c coefdiving : 0.00 0 0
5.29/5.34 c pscostdiving : 0.00 0 0
5.29/5.34 c fracdiving : 0.00 0 0
5.29/5.34 c veclendiving : 0.00 0 0
5.29/5.34 c intdiving : 0.00 0 0
5.29/5.34 c actconsdiving : 0.00 0 0
5.29/5.34 c objpscostdiving : 0.00 0 0
5.29/5.34 c rootsoldiving : 0.00 0 0
5.29/5.34 c linesearchdiving : 0.00 0 0
5.29/5.34 c guideddiving : 0.00 0 0
5.29/5.34 c octane : 0.00 0 0
5.29/5.34 c rens : 0.00 0 0
5.29/5.34 c rins : 0.00 0 0
5.29/5.34 c localbranching : 0.00 0 0
5.29/5.34 c mutation : 0.00 0 0
5.29/5.34 c crossover : 0.00 0 0
5.29/5.34 c dins : 0.00 0 0
5.29/5.34 c undercover : 0.00 0 0
5.29/5.34 c nlp : 0.00 0 0
5.29/5.34 c trysol : 0.00 0 0
5.29/5.34 c LP : Time Calls Iterations Iter/call Iter/sec
5.29/5.34 c primal LP : 0.00 0 0 0.00 -
5.29/5.34 c dual LP : 0.08 48 1879 39.15 23487.50
5.29/5.34 c lex dual LP : 0.00 0 0 0.00 -
5.29/5.34 c barrier LP : 0.00 0 0 0.00 -
5.29/5.34 c diving/probing LP: 0.00 0 0 0.00 -
5.29/5.34 c strong branching : 4.63 329 76088 231.27 16433.69
5.29/5.34 c (at root node) : - 201 63792 317.37 -
5.29/5.34 c conflict analysis: 0.00 0 0 0.00 -
5.29/5.34 c B&B Tree :
5.29/5.34 c number of runs : 3
5.29/5.34 c nodes : 5
5.29/5.34 c nodes (total) : 7
5.29/5.34 c nodes left : 0
5.29/5.34 c max depth : 2
5.29/5.34 c max depth (total): 2
5.29/5.34 c backtracks : 0 (0.0%)
5.29/5.34 c delayed cutoffs : 0
5.29/5.34 c repropagations : 1 (0 domain reductions, 0 cutoffs)
5.29/5.34 c avg switch length: 2.40
5.29/5.34 c switching time : 0.00
5.29/5.34 c Solution :
5.29/5.34 c Solutions found : 0 (0 improvements)
5.29/5.34 c Primal Bound : infeasible
5.29/5.34 c Dual Bound : -
5.29/5.34 c Gap : 0.00 %
5.29/5.34 c Root Dual Bound : +0.00000000000000e+00
5.29/5.34 c Root Iterations : 1402
5.29/5.34 c Time complete: 5.33.