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-2665757-1276275834.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.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/zirounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c separating/cmir/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c separating/flowcover/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 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 | 45 | - | 743k| 0 | 41 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 132 | - |1246k| 0 | 58 | 169 | 235 | 169 | 89 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 266 | - |1260k| 0 | 64 | 169 | 235 | 169 | 101 | 28 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.30 c 0.2s| 1 | 0 | 357 | - |1267k| 0 | 67 | 169 | 235 | 169 | 107 | 34 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 387 | - |1268k| 0 | 69 | 169 | 235 | 169 | 109 | 36 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.36 c 0.3s| 1 | 0 | 556 | - |1277k| 0 | 61 | 169 | 235 | 169 | 112 | 39 | 0 | 0 | 0.000000e+00 | -- | Inf
0.79/0.81 c 0.7s| 1 | 0 | 662 | - |1273k| 0 | 60 | 169 | 232 | 169 | 112 | 39 | 0 | 10 | 0.000000e+00 | -- | Inf
1.19/1.25 c 1.2s| 1 | 0 | 676 | - |1246k| 0 | 61 | 169 | 204 | 169 | 112 | 39 | 0 | 22 | 0.000000e+00 | -- | Inf
1.69/1.76 c 1.7s| 1 | 0 | 787 | - |1241k| 0 | 57 | 169 | 200 | 169 | 112 | 39 | 0 | 35 | 0.000000e+00 | -- | Inf
2.10/2.18 c 2.1s| 1 | 0 | 995 | - |1235k| 0 | 44 | 169 | 196 | 169 | 112 | 39 | 0 | 48 | 0.000000e+00 | -- | Inf
2.29/2.37 c 2.3s| 1 | 0 | 1024 | - |1232k| 0 | 47 | 169 | 193 | 169 | 112 | 39 | 0 | 60 | 0.000000e+00 | -- | Inf
2.49/2.52 c 2.4s| 1 | 0 | 1045 | - |1216k| 0 | 46 | 169 | 177 | 169 | 97 | 39 | 0 | 67 | 0.000000e+00 | -- | Inf
2.69/2.70 c 2.6s| 1 | 0 | 1059 | - |1216k| 0 | 46 | 169 | 177 | 169 | 97 | 39 | 0 | 75 | 0.000000e+00 | -- | Inf
2.79/2.84 c 2.7s| 1 | 0 | 1091 | - |1211k| 0 | 39 | 169 | 173 | 169 | 97 | 39 | 0 | 81 | 0.000000e+00 | -- | Inf
2.89/2.97 c 2.9s| 1 | 0 | 1091 | - |1211k| 0 | - | 169 | 173 | 169 | 97 | 39 | 0 | 87 | 0.000000e+00 | -- | Inf
2.89/2.97 c (run 1, node 1) restarting after 37 global fixings of integer variables
2.89/2.97 c
2.89/2.97 c (restart) converted 24 cuts from the global cut pool into linear constraints
2.89/2.97 c
2.89/2.97 c presolving:
2.89/2.98 c (round 1) 37 del vars, 5 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 20 impls, 79 clqs
2.89/2.98 c (round 2) 37 del vars, 7 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 20 impls, 79 clqs
2.89/2.99 c (round 3) 37 del vars, 7 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 118 upgd conss, 20 impls, 79 clqs
2.99/3.00 c presolving (4 rounds):
2.99/3.00 c 37 deleted vars, 7 deleted constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 0 changed coefficients
2.99/3.00 c 20 implications, 79 cliques
2.99/3.00 c presolved problem has 132 variables (132 bin, 0 int, 0 impl, 0 cont) and 190 constraints
2.99/3.00 c 8 constraints of type <knapsack>
2.99/3.00 c 80 constraints of type <setppc>
2.99/3.00 c 102 constraints of type <logicor>
2.99/3.00 c transformed objective value is always integral (scale: 1)
2.99/3.00 c Presolving Time: 0.03
2.99/3.00 c
2.99/3.00 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.99/3.00 c 2.9s| 1 | 0 | 1162 | - | 914k| 0 | 46 | 132 | 190 | 132 | 95 | 0 | 0 | 87 | 0.000000e+00 | -- | Inf
2.99/3.04 c 2.9s| 1 | 0 | 1334 | - |1176k| 0 | 47 | 132 | 190 | 132 | 104 | 9 | 0 | 87 | 0.000000e+00 | -- | Inf
3.39/3.41 c 3.3s| 1 | 0 | 1402 | - |1175k| 0 | 48 | 132 | 186 | 132 | 104 | 9 | 0 | 105 | 0.000000e+00 | -- | Inf
3.49/3.50 c 3.4s| 1 | 0 | 1415 | - |1172k| 0 | 48 | 132 | 178 | 132 | 104 | 9 | 0 | 110 | 0.000000e+00 | -- | Inf
3.59/3.64 c 3.5s| 1 | 0 | 1541 | - |1169k| 0 | 48 | 132 | 165 | 132 | 104 | 9 | 0 | 120 | 0.000000e+00 | -- | Inf
3.69/3.73 c 3.6s| 1 | 0 | 1566 | - |1168k| 0 | 47 | 132 | 163 | 132 | 104 | 9 | 0 | 125 | 0.000000e+00 | -- | Inf
3.79/3.81 c 3.7s| 1 | 0 | 1646 | - |1167k| 0 | 45 | 132 | 162 | 132 | 104 | 9 | 0 | 131 | 0.000000e+00 | -- | Inf
3.79/3.84 c 3.7s| 1 | 0 | 1646 | - |1167k| 0 | - | 132 | 162 | 132 | 104 | 9 | 0 | 136 | 0.000000e+00 | -- | Inf
3.79/3.84 c (run 2, node 1) restarting after 30 global fixings of integer variables
3.79/3.84 c
3.79/3.84 c (restart) converted 9 cuts from the global cut pool into linear constraints
3.79/3.84 c
3.79/3.85 c presolving:
3.79/3.86 c (round 1) 30 del vars, 61 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 32 impls, 77 clqs
3.79/3.87 c (round 2) 30 del vars, 62 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 32 impls, 77 clqs
3.79/3.87 c presolving (3 rounds):
3.79/3.87 c 30 deleted vars, 62 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
3.79/3.87 c 32 implications, 77 cliques
3.79/3.87 c presolved problem has 102 variables (102 bin, 0 int, 0 impl, 0 cont) and 109 constraints
3.79/3.87 c 13 constraints of type <knapsack>
3.79/3.87 c 79 constraints of type <setppc>
3.79/3.87 c 17 constraints of type <logicor>
3.79/3.87 c transformed objective value is always integral (scale: 1)
3.79/3.87 c Presolving Time: 0.05
3.79/3.87 c
3.79/3.87 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.79/3.87 c 3.7s| 1 | 0 | 1713 | - | 893k| 0 | 40 | 102 | 109 | 102 | 99 | 0 | 0 | 136 | 0.000000e+00 | -- | Inf
3.89/3.90 c 3.7s| 1 | 0 | 1846 | - |1122k| 0 | 44 | 102 | 109 | 102 | 110 | 11 | 0 | 136 | 0.000000e+00 | -- | Inf
3.89/3.99 c 3.8s| 1 | 0 | 1929 | - |1119k| 0 | - | 102 | 101 | 102 | 110 | 11 | 0 | 142 | -- | -- | 0.00%
3.89/3.99 c 3.8s| 1 | 0 | 1929 | - |1119k| 0 | - | 102 | 101 | 102 | 110 | 11 | 0 | 142 | -- | -- | 0.00%
3.89/3.99 c
3.89/3.99 c SCIP Status : problem is solved [infeasible]
3.89/3.99 c Solving Time (sec) : 3.82
3.89/3.99 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
3.89/3.99 c Primal Bound : +1.00000000000000e+20 (0 solutions)
3.89/3.99 c Dual Bound : +1.00000000000000e+20
3.89/3.99 c Gap : 0.00 %
3.89/3.99 s UNSATISFIABLE
3.89/3.99 c SCIP Status : problem is solved [infeasible]
3.89/3.99 c Solving Time : 3.82
3.89/3.99 c Original Problem :
3.89/3.99 c Problem name : HOME/instance-2665757-1276275834.opb
3.89/3.99 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
3.89/3.99 c Constraints : 101 initial, 101 maximal
3.89/3.99 c Presolved Problem :
3.89/3.99 c Problem name : t_HOME/instance-2665757-1276275834.opb
3.89/3.99 c Variables : 102 (102 binary, 0 integer, 0 implicit integer, 0 continuous)
3.89/3.99 c Constraints : 109 initial, 109 maximal
3.89/3.99 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.89/3.99 c trivial : 0.00 67 0 0 0 0 0 0 0
3.89/3.99 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.89/3.99 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.89/3.99 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.89/3.99 c implics : 0.00 0 0 0 0 0 0 0 0
3.89/3.99 c probing : 0.00 0 0 0 0 0 0 0 0
3.89/3.99 c knapsack : 0.02 0 0 0 0 0 0 0 0
3.89/3.99 c setppc : 0.01 0 0 0 0 0 4 0 0
3.89/3.99 c linear : 0.02 0 0 0 0 0 34 2 0
3.89/3.99 c logicor : 0.00 0 0 0 0 0 59 0 0
3.89/3.99 c root node : - 95 - - 95 - - - -
3.89/3.99 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.89/3.99 c integral : 0 0 0 16 0 0 72 0 0 0
3.89/3.99 c knapsack : 13 7 18 0 0 0 0 0 0 0
3.89/3.99 c setppc : 79 7 18 0 0 0 23 0 0 0
3.89/3.99 c logicor : 17 7 9 0 0 0 0 0 0 0
3.89/3.99 c countsols : 0 0 0 0 0 0 0 0 0 0
3.89/3.99 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.89/3.99 c integral : 3.39 0.00 0.00 3.39 0.00
3.89/3.99 c knapsack : 0.02 0.02 0.00 0.00 0.00
3.89/3.99 c setppc : 0.00 0.00 0.00 0.00 0.00
3.89/3.99 c logicor : 0.00 0.00 0.00 0.00 0.00
3.89/3.99 c countsols : 0.00 0.00 0.00 0.00 0.00
3.89/3.99 c Propagators : Time Calls Cutoffs DomReds
3.89/3.99 c vbounds : 0.00 3 0 0
3.89/3.99 c rootredcost : 0.00 0 0 0
3.89/3.99 c pseudoobj : 0.00 0 0 0
3.89/3.99 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.89/3.99 c propagation : 0.00 0 0 0 0.0 0 0.0 -
3.89/3.99 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.89/3.99 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.89/3.99 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.89/3.99 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.89/3.99 c applied globally : - - - 0 0.0 - - -
3.89/3.99 c applied locally : - - - 0 0.0 - - -
3.89/3.99 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.89/3.99 c cut pool : 0.00 0 - - 0 - (maximal pool size: 88)
3.89/3.99 c redcost : 0.00 7 0 0 0 0
3.89/3.99 c impliedbounds : 0.00 7 0 0 0 0
3.89/3.99 c intobj : 0.00 0 0 0 0 0
3.89/3.99 c cgmip : 0.00 0 0 0 0 0
3.89/3.99 c gomory : 0.05 7 0 0 53 0
3.89/3.99 c strongcg : 0.05 7 0 0 208 0
3.89/3.99 c cmir : 0.00 0 0 0 0 0
3.89/3.99 c flowcover : 0.00 0 0 0 0 0
3.89/3.99 c clique : 0.00 7 0 0 29 0
3.89/3.99 c zerohalf : 0.00 0 0 0 0 0
3.89/3.99 c mcf : 0.00 3 0 0 0 0
3.89/3.99 c rapidlearning : 0.17 1 0 0 0 162
3.89/3.99 c Pricers : Time Calls Vars
3.89/3.99 c problem variables: 0.00 0 0
3.89/3.99 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.89/3.99 c relpscost : 3.39 16 0 72 0 0 0
3.89/3.99 c pscost : 0.00 0 0 0 0 0 0
3.89/3.99 c inference : 0.00 0 0 0 0 0 0
3.89/3.99 c mostinf : 0.00 0 0 0 0 0 0
3.89/3.99 c leastinf : 0.00 0 0 0 0 0 0
3.89/3.99 c fullstrong : 0.00 0 0 0 0 0 0
3.89/3.99 c allfullstrong : 0.00 0 0 0 0 0 0
3.89/3.99 c random : 0.00 0 0 0 0 0 0
3.89/3.99 c Primal Heuristics : Time Calls Found
3.89/3.99 c LP solutions : 0.00 - 0
3.89/3.99 c pseudo solutions : 0.00 - 0
3.89/3.99 c trivial : 0.00 1 0
3.89/3.99 c simplerounding : 0.00 0 0
3.89/3.99 c zirounding : 0.00 0 0
3.89/3.99 c rounding : 0.00 0 0
3.89/3.99 c shifting : 0.00 0 0
3.89/3.99 c intshifting : 0.00 0 0
3.89/3.99 c oneopt : 0.00 0 0
3.89/3.99 c twoopt : 0.00 0 0
3.89/3.99 c fixandinfer : 0.00 0 0
3.89/3.99 c feaspump : 0.00 0 0
3.89/3.99 c coefdiving : 0.00 0 0
3.89/3.99 c pscostdiving : 0.00 0 0
3.89/3.99 c fracdiving : 0.00 0 0
3.89/3.99 c veclendiving : 0.00 0 0
3.89/3.99 c intdiving : 0.00 0 0
3.89/3.99 c actconsdiving : 0.00 0 0
3.89/3.99 c objpscostdiving : 0.00 0 0
3.89/3.99 c rootsoldiving : 0.00 0 0
3.89/3.99 c linesearchdiving : 0.00 0 0
3.89/3.99 c guideddiving : 0.00 0 0
3.89/3.99 c octane : 0.00 0 0
3.89/3.99 c rens : 0.00 0 0
3.89/3.99 c rins : 0.00 0 0
3.89/3.99 c localbranching : 0.00 0 0
3.89/3.99 c mutation : 0.00 0 0
3.89/3.99 c crossover : 0.00 0 0
3.89/3.99 c dins : 0.00 0 0
3.89/3.99 c undercover : 0.00 0 0
3.89/3.99 c nlp : 0.00 0 0
3.89/3.99 c trysol : 0.00 0 0
3.89/3.99 c LP : Time Calls Iterations Iter/call Iter/sec
3.89/3.99 c primal LP : 0.00 0 0 0.00 -
3.89/3.99 c dual LP : 0.09 24 1929 80.38 21433.33
3.89/3.99 c lex dual LP : 0.00 0 0 0.00 -
3.89/3.99 c barrier LP : 0.00 0 0 0.00 -
3.89/3.99 c diving/probing LP: 0.00 0 0 0.00 -
3.89/3.99 c strong branching : 3.39 142 56666 399.06 16715.63
3.89/3.99 c (at root node) : - 142 56666 399.06 -
3.89/3.99 c conflict analysis: 0.00 0 0 0.00 -
3.89/3.99 c B&B Tree :
3.89/3.99 c number of runs : 3
3.89/3.99 c nodes : 1
3.89/3.99 c nodes (total) : 3
3.89/3.99 c nodes left : 0
3.89/3.99 c max depth : 0
3.89/3.99 c max depth (total): 0
3.89/3.99 c backtracks : 0 (0.0%)
3.89/3.99 c delayed cutoffs : 0
3.89/3.99 c repropagations : 0 (0 domain reductions, 0 cutoffs)
3.89/3.99 c avg switch length: 2.00
3.89/3.99 c switching time : 0.00
3.89/3.99 c Solution :
3.89/3.99 c Solutions found : 0 (0 improvements)
3.89/3.99 c Primal Bound : infeasible
3.89/3.99 c Dual Bound : -
3.89/3.99 c Gap : 0.00 %
3.89/3.99 c Root Dual Bound : -
3.89/3.99 c Root Iterations : 1929
3.99/4.00 c Time complete: 3.99.