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-2665721-1276272562.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.02
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.03 c
0.03/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.03/0.04 c 0.0s| 1 | 0 | 49 | - | 743k| 0 | 41 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 125 | - |1261k| 0 | 60 | 169 | 211 | 169 | 104 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.3s| 1 | 0 | 310 | - |1274k| 0 | 67 | 169 | 211 | 169 | 115 | 42 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 415 | - |1286k| 0 | 67 | 169 | 211 | 169 | 123 | 50 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.36 c 0.3s| 1 | 0 | 513 | - |1291k| 0 | 67 | 169 | 211 | 169 | 127 | 54 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.39 c 0.3s| 1 | 0 | 527 | - |1292k| 0 | 71 | 169 | 211 | 169 | 129 | 56 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/0.93 c 0.9s| 1 | 0 | 612 | - |1282k| 0 | 67 | 169 | 203 | 169 | 129 | 56 | 0 | 10 | 0.000000e+00 | -- | Inf
1.49/1.52 c 1.4s| 1 | 0 | 740 | - |1276k| 0 | 66 | 169 | 197 | 169 | 129 | 56 | 0 | 21 | 0.000000e+00 | -- | Inf
1.89/1.98 c 1.9s| 1 | 0 | 871 | - |1273k| 0 | 63 | 169 | 195 | 169 | 129 | 56 | 0 | 31 | 0.000000e+00 | -- | Inf
2.39/2.47 c 2.4s| 1 | 0 | 1008 | - |1273k| 0 | 56 | 169 | 195 | 169 | 129 | 56 | 0 | 43 | 0.000000e+00 | -- | Inf
2.89/2.92 c 2.8s| 1 | 0 | 1087 | - |1267k| 0 | 60 | 169 | 189 | 169 | 129 | 56 | 0 | 55 | 0.000000e+00 | -- | Inf
3.09/3.15 c 3.0s| 1 | 0 | 1304 | - |1264k| 0 | 51 | 169 | 187 | 169 | 104 | 56 | 0 | 61 | 0.000000e+00 | -- | Inf
3.30/3.32 c 3.2s| 1 | 0 | 1443 | - |1256k| 0 | 46 | 169 | 179 | 169 | 104 | 56 | 0 | 67 | 0.000000e+00 | -- | Inf
3.49/3.50 c 3.4s| 1 | 0 | 1520 | - |1256k| 0 | 48 | 169 | 179 | 169 | 104 | 56 | 0 | 78 | 0.000000e+00 | -- | Inf
3.59/3.61 c 3.5s| 1 | 0 | 1561 | - |1251k| 0 | 49 | 169 | 174 | 169 | 104 | 56 | 0 | 84 | 0.000000e+00 | -- | Inf
3.59/3.67 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.59/3.67 c 3.5s| 1 | 0 | 1561 | - |1251k| 0 | - | 169 | 174 | 169 | 104 | 56 | 0 | 89 | 0.000000e+00 | -- | Inf
3.59/3.67 c (run 1, node 1) restarting after 35 global fixings of integer variables
3.59/3.67 c
3.59/3.67 c (restart) converted 31 cuts from the global cut pool into linear constraints
3.59/3.67 c
3.59/3.68 c presolving:
3.59/3.68 c (round 1) 35 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 12 impls, 84 clqs
3.59/3.69 c (round 2) 35 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 129 upgd conss, 12 impls, 84 clqs
3.69/3.70 c (round 3) 35 del vars, 7 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 129 upgd conss, 12 impls, 84 clqs
3.69/3.70 c presolving (4 rounds):
3.69/3.70 c 35 deleted vars, 7 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
3.69/3.70 c 12 implications, 84 cliques
3.69/3.70 c presolved problem has 134 variables (134 bin, 0 int, 0 impl, 0 cont) and 198 constraints
3.69/3.70 c 14 constraints of type <knapsack>
3.69/3.70 c 82 constraints of type <setppc>
3.69/3.70 c 102 constraints of type <logicor>
3.69/3.70 c transformed objective value is always integral (scale: 1)
3.69/3.70 c Presolving Time: 0.05
3.69/3.71 c
3.69/3.71 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.69/3.71 c 3.6s| 1 | 0 | 1641 | - | 984k| 0 | 46 | 134 | 198 | 134 | 100 | 0 | 0 | 89 | 0.000000e+00 | -- | Inf
3.69/3.75 c 3.6s| 1 | 0 | 1738 | - |1297k| 0 | 58 | 134 | 198 | 134 | 109 | 9 | 0 | 89 | 0.000000e+00 | -- | Inf
3.89/3.90 c 3.8s| 1 | 0 | 1904 | - |1297k| 0 | 51 | 134 | 197 | 134 | 109 | 9 | 0 | 96 | 0.000000e+00 | -- | Inf
3.89/3.97 c 3.8s| 1 | 0 | 1967 | - |1297k| 0 | 46 | 134 | 197 | 134 | 109 | 9 | 0 | 101 | 0.000000e+00 | -- | Inf
3.99/4.02 c 3.9s| 1 | 0 | 2014 | - |1291k| 0 | 45 | 134 | 178 | 134 | 109 | 9 | 0 | 107 | 0.000000e+00 | -- | Inf
3.99/4.07 c 3.9s| 1 | 0 | 2051 | - |1290k| 0 | 45 | 134 | 172 | 134 | 109 | 9 | 0 | 112 | 0.000000e+00 | -- | Inf
4.09/4.12 c 4.0s| 1 | 0 | 2142 | - |1287k| 0 | - | 134 | 162 | 134 | 109 | 9 | 0 | 117 | -- | -- | 0.00%
4.09/4.12 c 4.0s| 1 | 0 | 2142 | - |1287k| 0 | - | 134 | 162 | 134 | 109 | 9 | 0 | 117 | -- | -- | 0.00%
4.09/4.12 c
4.09/4.12 c SCIP Status : problem is solved [infeasible]
4.09/4.12 c Solving Time (sec) : 3.97
4.09/4.12 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
4.09/4.12 c Primal Bound : +1.00000000000000e+20 (0 solutions)
4.09/4.12 c Dual Bound : +1.00000000000000e+20
4.09/4.12 c Gap : 0.00 %
4.09/4.12 s UNSATISFIABLE
4.09/4.12 c SCIP Status : problem is solved [infeasible]
4.09/4.12 c Solving Time : 3.97
4.09/4.12 c Original Problem :
4.09/4.12 c Problem name : HOME/instance-2665721-1276272562.opb
4.09/4.12 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
4.09/4.12 c Constraints : 101 initial, 101 maximal
4.09/4.12 c Presolved Problem :
4.09/4.12 c Problem name : t_HOME/instance-2665721-1276272562.opb
4.09/4.12 c Variables : 134 (134 binary, 0 integer, 0 implicit integer, 0 continuous)
4.09/4.12 c Constraints : 198 initial, 198 maximal
4.09/4.12 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.09/4.12 c trivial : 0.01 35 0 0 0 0 0 0 0
4.09/4.12 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.09/4.12 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.09/4.12 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.09/4.12 c implics : 0.00 0 0 0 0 0 0 0 0
4.09/4.12 c probing : 0.00 0 0 0 0 0 0 0 0
4.09/4.12 c knapsack : 0.00 0 0 0 0 0 0 0 0
4.09/4.12 c setppc : 0.02 0 0 0 0 0 3 0 0
4.09/4.12 c linear : 0.02 0 0 0 0 0 31 0 0
4.09/4.12 c logicor : 0.00 0 0 0 0 0 1 0 0
4.09/4.12 c root node : - 60 - - 60 - - - -
4.09/4.12 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.09/4.12 c integral : 0 0 0 15 0 0 60 0 0 0
4.09/4.12 c knapsack : 14 6 16 0 0 0 0 0 0 0
4.09/4.12 c setppc : 82 6 16 0 0 0 0 0 0 0
4.09/4.12 c logicor : 102 6 7 0 0 0 0 0 0 0
4.09/4.12 c countsols : 0 0 0 0 0 0 0 0 0 0
4.09/4.12 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.09/4.12 c integral : 3.46 0.00 0.00 3.46 0.00
4.09/4.12 c knapsack : 0.01 0.01 0.00 0.00 0.00
4.09/4.12 c setppc : 0.00 0.00 0.00 0.00 0.00
4.09/4.12 c logicor : 0.00 0.00 0.00 0.00 0.00
4.09/4.12 c countsols : 0.00 0.00 0.00 0.00 0.00
4.09/4.12 c Propagators : Time Calls Cutoffs DomReds
4.09/4.12 c vbounds : 0.00 2 0 0
4.09/4.12 c rootredcost : 0.00 0 0 0
4.09/4.12 c pseudoobj : 0.00 0 0 0
4.09/4.12 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.09/4.12 c propagation : 0.00 0 0 0 0.0 0 0.0 -
4.09/4.12 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
4.09/4.12 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.09/4.12 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.09/4.12 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.09/4.12 c applied globally : - - - 0 0.0 - - -
4.09/4.12 c applied locally : - - - 0 0.0 - - -
4.09/4.12 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.09/4.12 c cut pool : 0.00 0 - - 0 - (maximal pool size: 92)
4.09/4.12 c redcost : 0.00 6 0 0 0 0
4.09/4.12 c impliedbounds : 0.00 6 0 0 0 0
4.09/4.12 c intobj : 0.00 0 0 0 0 0
4.09/4.12 c cgmip : 0.00 0 0 0 0 0
4.09/4.12 c gomory : 0.07 6 0 0 49 0
4.09/4.12 c strongcg : 0.05 6 0 0 137 0
4.09/4.12 c cmir : 0.00 0 0 0 0 0
4.09/4.12 c flowcover : 0.00 0 0 0 0 0
4.09/4.12 c clique : 0.01 6 0 0 29 0
4.09/4.12 c zerohalf : 0.00 0 0 0 0 0
4.09/4.12 c mcf : 0.00 2 0 0 0 0
4.09/4.12 c rapidlearning : 0.17 1 0 0 0 138
4.09/4.12 c Pricers : Time Calls Vars
4.09/4.12 c problem variables: 0.00 0 0
4.09/4.12 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.09/4.12 c relpscost : 3.46 15 0 60 0 0 0
4.09/4.12 c pscost : 0.00 0 0 0 0 0 0
4.09/4.12 c inference : 0.00 0 0 0 0 0 0
4.09/4.12 c mostinf : 0.00 0 0 0 0 0 0
4.09/4.12 c leastinf : 0.00 0 0 0 0 0 0
4.09/4.12 c fullstrong : 0.00 0 0 0 0 0 0
4.09/4.12 c allfullstrong : 0.00 0 0 0 0 0 0
4.09/4.12 c random : 0.00 0 0 0 0 0 0
4.09/4.12 c Primal Heuristics : Time Calls Found
4.09/4.12 c LP solutions : 0.00 - 0
4.09/4.12 c pseudo solutions : 0.00 - 0
4.09/4.12 c trivial : 0.00 1 0
4.09/4.12 c simplerounding : 0.00 0 0
4.09/4.12 c zirounding : 0.00 0 0
4.09/4.12 c rounding : 0.00 0 0
4.09/4.12 c shifting : 0.00 0 0
4.09/4.12 c intshifting : 0.00 0 0
4.09/4.12 c oneopt : 0.00 0 0
4.09/4.12 c twoopt : 0.00 0 0
4.09/4.12 c fixandinfer : 0.00 0 0
4.09/4.12 c feaspump : 0.00 0 0
4.09/4.12 c coefdiving : 0.00 0 0
4.09/4.12 c pscostdiving : 0.00 0 0
4.09/4.12 c fracdiving : 0.00 0 0
4.09/4.12 c veclendiving : 0.00 0 0
4.09/4.12 c intdiving : 0.00 0 0
4.09/4.12 c actconsdiving : 0.00 0 0
4.09/4.12 c objpscostdiving : 0.00 0 0
4.09/4.12 c rootsoldiving : 0.00 0 0
4.09/4.12 c linesearchdiving : 0.00 0 0
4.09/4.12 c guideddiving : 0.00 0 0
4.09/4.12 c octane : 0.00 0 0
4.09/4.12 c rens : 0.00 0 0
4.09/4.12 c rins : 0.00 0 0
4.09/4.12 c localbranching : 0.00 0 0
4.09/4.12 c mutation : 0.00 0 0
4.09/4.12 c crossover : 0.00 0 0
4.09/4.12 c dins : 0.00 0 0
4.09/4.12 c undercover : 0.00 0 0
4.09/4.12 c nlp : 0.00 0 0
4.09/4.12 c trysol : 0.00 0 0
4.09/4.12 c LP : Time Calls Iterations Iter/call Iter/sec
4.09/4.12 c primal LP : 0.01 0 0 0.00 0.00
4.09/4.12 c dual LP : 0.14 22 2142 97.36 15300.00
4.09/4.12 c lex dual LP : 0.00 0 0 0.00 -
4.09/4.12 c barrier LP : 0.00 0 0 0.00 -
4.09/4.12 c diving/probing LP: 0.00 0 0 0.00 -
4.09/4.12 c strong branching : 3.46 117 49112 419.76 14194.22
4.09/4.12 c (at root node) : - 117 49112 419.76 -
4.09/4.12 c conflict analysis: 0.00 0 0 0.00 -
4.09/4.12 c B&B Tree :
4.09/4.12 c number of runs : 2
4.09/4.12 c nodes : 1
4.09/4.12 c nodes (total) : 2
4.09/4.12 c nodes left : 0
4.09/4.12 c max depth : 0
4.09/4.12 c max depth (total): 0
4.09/4.12 c backtracks : 0 (0.0%)
4.09/4.12 c delayed cutoffs : 0
4.09/4.12 c repropagations : 0 (0 domain reductions, 0 cutoffs)
4.09/4.12 c avg switch length: 2.00
4.09/4.12 c switching time : 0.00
4.09/4.12 c Solution :
4.09/4.12 c Solutions found : 0 (0 improvements)
4.09/4.12 c Primal Bound : infeasible
4.09/4.12 c Dual Bound : -
4.09/4.12 c Gap : 0.00 %
4.09/4.12 c Root Dual Bound : -
4.09/4.12 c Root Iterations : 2142
4.09/4.13 c Time complete: 4.12.