0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
0.00/0.00 c Copyright (c) 2002-2011 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-3730639-1338689998.opb>
0.00/0.02 c original problem has 1190 variables (1190 bin, 0 int, 0 impl, 0 cont) and 3183 constraints
0.00/0.02 c problem read
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c presolving settings loaded
0.00/0.03 c presolving:
0.02/0.05 c (round 1) 124 del vars, 18 del conss, 0 add conss, 5 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60694 impls, 0 clqs
0.02/0.05 c (round 2) 126 del vars, 254 del conss, 0 add conss, 7 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60694 impls, 0 clqs
0.02/0.05 c (round 3) 128 del vars, 259 del conss, 0 add conss, 9 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60718 impls, 0 clqs
0.02/0.05 c (round 4) 132 del vars, 265 del conss, 0 add conss, 13 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60718 impls, 0 clqs
0.02/0.05 c (round 5) 139 del vars, 275 del conss, 0 add conss, 17 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60742 impls, 0 clqs
0.02/0.05 c (round 6) 147 del vars, 293 del conss, 0 add conss, 21 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60808 impls, 0 clqs
0.02/0.06 c (round 7) 154 del vars, 312 del conss, 0 add conss, 25 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60848 impls, 0 clqs
0.02/0.06 c (round 8) 161 del vars, 329 del conss, 0 add conss, 29 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60880 impls, 0 clqs
0.02/0.06 c (round 9) 173 del vars, 355 del conss, 0 add conss, 37 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60994 impls, 0 clqs
0.02/0.06 c (round 10) 182 del vars, 379 del conss, 0 add conss, 43 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61070 impls, 0 clqs
0.02/0.06 c (round 11) 186 del vars, 397 del conss, 0 add conss, 47 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61074 impls, 0 clqs
0.02/0.06 c (round 12) 190 del vars, 405 del conss, 0 add conss, 51 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61074 impls, 0 clqs
0.02/0.06 c (round 13) 196 del vars, 413 del conss, 0 add conss, 54 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61110 impls, 0 clqs
0.02/0.06 c (round 14) 201 del vars, 425 del conss, 0 add conss, 56 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61180 impls, 0 clqs
0.02/0.06 c (round 15) 206 del vars, 437 del conss, 0 add conss, 58 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61338 impls, 0 clqs
0.02/0.06 c (round 16) 208 del vars, 449 del conss, 0 add conss, 60 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61348 impls, 0 clqs
0.02/0.06 c (round 17) 211 del vars, 453 del conss, 0 add conss, 60 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61520 impls, 0 clqs
0.02/0.06 c (round 18) 211 del vars, 460 del conss, 0 add conss, 60 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61520 impls, 0 clqs
0.02/0.08 c (round 19) 211 del vars, 468 del conss, 0 add conss, 60 chg bounds, 64 chg sides, 136 chg coeffs, 2711 upgd conss, 61520 impls, 0 clqs
0.02/0.09 c (round 20) 231 del vars, 472 del conss, 0 add conss, 60 chg bounds, 64 chg sides, 136 chg coeffs, 2711 upgd conss, 61520 impls, 0 clqs
0.02/0.09 c presolving (21 rounds):
0.02/0.09 c 231 deleted vars, 472 deleted constraints, 0 added constraints, 60 tightened bounds, 0 added holes, 64 changed sides, 136 changed coefficients
0.02/0.09 c 61520 implications, 0 cliques
0.02/0.09 c presolved problem has 959 variables (959 bin, 0 int, 0 impl, 0 cont) and 2711 constraints
0.02/0.09 c 112 constraints of type <knapsack>
0.02/0.09 c 1737 constraints of type <setppc>
0.02/0.09 c 862 constraints of type <logicor>
0.02/0.09 c transformed objective value is always integral (scale: 1)
0.02/0.09 c Presolving Time: 0.07
0.02/0.09 c - non default parameters ----------------------------------------------------------------------
0.02/0.09 c # SCIP version 2.0.1.5
0.02/0.09 c
0.02/0.09 c # frequency for displaying node information lines
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.09 c display/freq = 10000
0.02/0.09 c
0.02/0.09 c # maximal time in seconds to run
0.02/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.09 c limits/time = 1797
0.02/0.09 c
0.02/0.09 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.09 c limits/memory = 13950
0.02/0.09 c
0.02/0.09 c # solving stops, if the given number of solutions were found (-1: no limit)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.09 c limits/solutions = 1
0.02/0.09 c
0.02/0.09 c # maximal number of separation rounds per node (-1: unlimited)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 5]
0.02/0.09 c separating/maxrounds = 1
0.02/0.09 c
0.02/0.09 c # maximal number of separation rounds in the root node (-1: unlimited)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.09 c separating/maxroundsroot = 5
0.02/0.09 c
0.02/0.09 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.02/0.09 c # [type: int, range: [1,2], default: 1]
0.02/0.09 c timing/clocktype = 2
0.02/0.09 c
0.02/0.09 c # belongs reading time to solving time?
0.02/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.09 c timing/reading = TRUE
0.02/0.09 c
0.02/0.09 c # should presolving try to simplify inequalities
0.02/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.09 c constraints/linear/simplifyinequalities = TRUE
0.02/0.09 c
0.02/0.09 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.02/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.09 c constraints/indicator/addCouplingCons = TRUE
0.02/0.09 c
0.02/0.09 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.02/0.09 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.02/0.09 c constraints/knapsack/disaggregation = FALSE
0.02/0.09 c
0.02/0.09 c # should presolving try to simplify knapsacks
0.02/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.09 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.09 c
0.02/0.09 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.09 c presolving/probing/maxrounds = 0
0.02/0.09 c
0.02/0.09 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.09 c heuristics/coefdiving/freq = -1
0.02/0.09 c
0.02/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.09 c heuristics/coefdiving/maxlpiterquot = 0.075
0.02/0.09 c
0.02/0.09 c # additional number of allowed LP iterations
0.02/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.09 c heuristics/coefdiving/maxlpiterofs = 1500
0.02/0.09 c
0.02/0.09 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 30]
0.02/0.09 c heuristics/crossover/freq = -1
0.02/0.09 c
0.02/0.09 c # number of nodes added to the contingent of the total nodes
0.02/0.09 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.09 c heuristics/crossover/nodesofs = 750
0.02/0.09 c
0.02/0.09 c # number of nodes without incumbent change that heuristic should wait
0.02/0.09 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.02/0.09 c heuristics/crossover/nwaitingnodes = 100
0.02/0.09 c
0.02/0.09 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.02/0.09 c # [type: real, range: [0,1], default: 0.1]
0.02/0.09 c heuristics/crossover/nodesquot = 0.15
0.02/0.09 c
0.02/0.09 c # minimum percentage of integer variables that have to be fixed
0.02/0.09 c # [type: real, range: [0,1], default: 0.666]
0.02/0.09 c heuristics/crossover/minfixingrate = 0.5
0.02/0.09 c
0.02/0.09 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.09 c heuristics/feaspump/freq = -1
0.02/0.09 c
0.02/0.09 c # additional number of allowed LP iterations
0.02/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.09 c heuristics/feaspump/maxlpiterofs = 2000
0.02/0.09 c
0.02/0.09 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.09 c heuristics/fracdiving/freq = -1
0.02/0.09 c
0.02/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.09 c heuristics/fracdiving/maxlpiterquot = 0.075
0.02/0.09 c
0.02/0.09 c # additional number of allowed LP iterations
0.02/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.09 c heuristics/fracdiving/maxlpiterofs = 1500
0.02/0.09 c
0.02/0.09 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.09 c heuristics/guideddiving/freq = -1
0.02/0.09 c
0.02/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.09 c heuristics/guideddiving/maxlpiterquot = 0.075
0.02/0.09 c
0.02/0.09 c # additional number of allowed LP iterations
0.02/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.09 c heuristics/guideddiving/maxlpiterofs = 1500
0.02/0.09 c
0.02/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.09 c heuristics/intdiving/maxlpiterquot = 0.075
0.02/0.09 c
0.02/0.09 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.09 c heuristics/intshifting/freq = -1
0.02/0.09 c
0.02/0.09 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.09 c heuristics/linesearchdiving/freq = -1
0.02/0.09 c
0.02/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.09 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.02/0.09 c
0.02/0.09 c # additional number of allowed LP iterations
0.02/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.09 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.02/0.09 c
0.02/0.09 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.09 c heuristics/objpscostdiving/freq = -1
0.02/0.09 c
0.02/0.09 c # maximal fraction of diving LP iterations compared to total iteration number
0.02/0.09 c # [type: real, range: [0,1], default: 0.01]
0.02/0.09 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.02/0.09 c
0.02/0.09 c # additional number of allowed LP iterations
0.02/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.09 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.02/0.09 c
0.02/0.09 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.09 c heuristics/oneopt/freq = -1
0.02/0.09 c
0.02/0.09 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.09 c heuristics/pscostdiving/freq = -1
0.02/0.09 c
0.02/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.09 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.02/0.09 c
0.02/0.09 c # additional number of allowed LP iterations
0.02/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.09 c heuristics/pscostdiving/maxlpiterofs = 1500
0.02/0.09 c
0.02/0.09 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.09 c heuristics/rens/freq = -1
0.02/0.09 c
0.02/0.09 c # minimum percentage of integer variables that have to be fixable
0.02/0.09 c # [type: real, range: [0,1], default: 0.5]
0.02/0.09 c heuristics/rens/minfixingrate = 0.3
0.02/0.09 c
0.02/0.09 c # number of nodes added to the contingent of the total nodes
0.02/0.09 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.09 c heuristics/rens/nodesofs = 2000
0.02/0.09 c
0.02/0.09 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.09 c heuristics/rootsoldiving/freq = -1
0.02/0.09 c
0.02/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.02/0.09 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.02/0.09 c
0.02/0.09 c # additional number of allowed LP iterations
0.02/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.09 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.02/0.09 c
0.02/0.09 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.09 c heuristics/rounding/freq = -1
0.02/0.09 c
0.02/0.09 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.09 c heuristics/shiftandpropagate/freq = -1
0.02/0.09 c
0.02/0.09 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.09 c heuristics/shifting/freq = -1
0.02/0.09 c
0.02/0.09 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.09 c heuristics/simplerounding/freq = -1
0.02/0.09 c
0.02/0.09 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.09 c heuristics/subnlp/freq = -1
0.02/0.09 c
0.02/0.09 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.09 c heuristics/trivial/freq = -1
0.02/0.09 c
0.02/0.09 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.09 c heuristics/trysol/freq = -1
0.02/0.09 c
0.02/0.09 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.09 c heuristics/undercover/freq = -1
0.02/0.09 c
0.02/0.09 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.09 c heuristics/veclendiving/freq = -1
0.02/0.09 c
0.02/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.09 c heuristics/veclendiving/maxlpiterquot = 0.075
0.02/0.09 c
0.02/0.09 c # additional number of allowed LP iterations
0.02/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.09 c heuristics/veclendiving/maxlpiterofs = 1500
0.02/0.09 c
0.02/0.09 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.09 c heuristics/zirounding/freq = -1
0.02/0.09 c
0.02/0.09 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.09 c separating/cmir/freq = -1
0.02/0.09 c
0.02/0.09 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.09 c separating/flowcover/freq = -1
0.02/0.09 c
0.02/0.09 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.09 c separating/rapidlearning/freq = 0
0.02/0.09 c
0.02/0.09 c -----------------------------------------------------------------------------------------------
0.02/0.09 c start solving
0.02/0.09 c
0.09/0.11 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.11 c 0.1s| 1 | 0 | 210 | - |7880k| 0 | 185 | 959 |2711 | 959 |2711 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 474 | - |7946k| 0 | 339 | 959 |2726 | 959 |2717 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.3s| 1 | 0 | 559 | - |8020k| 0 | 291 | 959 |2726 | 959 |2749 | 63 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 720 | - |8179k| 0 | 334 | 959 |2726 | 959 |2769 | 83 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.46 c 0.5s| 1 | 0 | 1078 | - |8324k| 0 | 335 | 959 |2726 | 959 |2796 | 110 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.54 c 0.5s| 1 | 0 | 1387 | - |8467k| 0 | 412 | 959 |2726 | 959 |2817 | 131 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.74 c 0.7s| 1 | 2 | 1387 | - |8467k| 0 | 412 | 959 |2726 | 959 |2817 | 131 | 0 | 10 | 0.000000e+00 | -- | Inf
11.79/11.85 c
11.79/11.85 c SCIP Status : problem is solved [infeasible]
11.79/11.85 c Solving Time (sec) : 11.85
11.79/11.85 c Solving Nodes : 239
11.79/11.85 c Primal Bound : +1.00000000000000e+20 (0 solutions)
11.79/11.85 c Dual Bound : +1.00000000000000e+20
11.79/11.85 c Gap : 0.00 %
11.79/11.85 s UNSATISFIABLE
11.79/11.85 c SCIP Status : problem is solved [infeasible]
11.79/11.85 c Total Time : 11.85
11.79/11.85 c solving : 11.85
11.79/11.85 c presolving : 0.07 (included in solving)
11.79/11.85 c reading : 0.02 (included in solving)
11.79/11.85 c Original Problem :
11.79/11.85 c Problem name : HOME/instance-3730639-1338689998.opb
11.79/11.85 c Variables : 1190 (1190 binary, 0 integer, 0 implicit integer, 0 continuous)
11.79/11.85 c Constraints : 3183 initial, 3183 maximal
11.79/11.85 c Presolved Problem :
11.79/11.85 c Problem name : t_HOME/instance-3730639-1338689998.opb
11.79/11.85 c Variables : 959 (959 binary, 0 integer, 0 implicit integer, 0 continuous)
11.79/11.85 c Constraints : 2711 initial, 2756 maximal
11.79/11.85 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
11.79/11.85 c trivial : 0.00 0 0 0 0 0 0 0 0 0
11.79/11.85 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
11.79/11.85 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
11.79/11.85 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
11.79/11.85 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
11.79/11.85 c implics : 0.00 0 146 0 0 0 0 0 0 0
11.79/11.85 c probing : 0.00 0 0 0 0 0 0 0 0 0
11.79/11.85 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
11.79/11.85 c setppc : 0.01 0 0 0 0 0 0 0 0 0
11.79/11.85 c linear : 0.04 60 25 0 60 0 472 0 64 136
11.79/11.85 c logicor : 0.01 0 0 0 0 0 0 0 0 0
11.79/11.85 c root node : - 48 - - 48 - - - - -
11.79/11.85 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
11.79/11.85 c integral : 0 0 0 241 0 1 0 12 192 0 0 328
11.79/11.85 c knapsack : 112 6 3153 0 0 0 324 14 1450 424 0 0
11.79/11.85 c setppc : 1737 6 3139 0 0 0 3490 9 14620 0 0 0
11.79/11.85 c linear : 0+ 5 3129 0 0 0 105 0 90 0 0 0
11.79/11.85 c logicor : 862+ 6 2776 0 0 0 3423 84 4630 0 0 0
11.79/11.85 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
11.79/11.85 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
11.79/11.85 c integral : 10.16 0.00 0.00 10.16 0.00 0.00 0.00
11.79/11.85 c knapsack : 0.01 0.00 0.01 0.00 0.00 0.00 0.00
11.79/11.85 c setppc : 0.04 0.00 0.04 0.00 0.00 0.00 0.00
11.79/11.85 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
11.79/11.85 c logicor : 0.01 0.00 0.01 0.00 0.00 0.00 0.00
11.79/11.85 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
11.79/11.85 c Propagators : #Propagate #Resprop Cutoffs DomReds
11.79/11.85 c vbounds : 0 0 0 0
11.79/11.85 c rootredcost : 0 0 0 0
11.79/11.85 c pseudoobj : 0 0 0 0
11.79/11.85 c Propagator Timings : TotalTime Propagate Resprop
11.79/11.85 c vbounds : 0.00 0.00 0.00
11.79/11.85 c rootredcost : 0.00 0.00 0.00
11.79/11.85 c pseudoobj : 0.00 0.00 0.00
11.79/11.85 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
11.79/11.85 c propagation : 0.00 107 105 312 10.2 40 4.2 -
11.79/11.85 c infeasible LP : 0.00 1 1 1 2.0 0 0.0 0
11.79/11.85 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
11.79/11.85 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
11.79/11.85 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
11.79/11.85 c applied globally : - - - 240 7.9 - - -
11.79/11.85 c applied locally : - - - 0 0.0 - - -
11.79/11.85 c Separators : Time Calls Cutoffs DomReds Cuts Conss
11.79/11.85 c cut pool : 0.00 4 - - 95 - (maximal pool size: 543)
11.79/11.85 c redcost : 0.00 181 0 0 0 0
11.79/11.85 c impliedbounds : 0.00 5 0 0 0 0
11.79/11.85 c intobj : 0.00 0 0 0 0 0
11.79/11.85 c gomory : 0.15 5 0 0 2417 0
11.79/11.85 c cgmip : 0.00 0 0 0 0 0
11.79/11.85 c closecuts : 0.00 0 0 0 0 0
11.79/11.85 c strongcg : 0.10 5 0 0 2500 0
11.79/11.85 c cmir : 0.00 0 0 0 0 0
11.79/11.85 c flowcover : 0.00 0 0 0 0 0
11.79/11.85 c clique : 0.02 5 0 0 31 0
11.79/11.85 c zerohalf : 0.00 0 0 0 0 0
11.79/11.85 c mcf : 0.00 1 0 0 0 0
11.79/11.85 c oddcycle : 0.00 0 0 0 0 0
11.79/11.85 c rapidlearning : 0.06 1 0 9 0 45
11.79/11.85 c Pricers : Time Calls Vars
11.79/11.85 c problem variables: 0.00 0 0
11.79/11.85 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
11.79/11.85 c relpscost : 10.16 241 12 192 0 0 328
11.79/11.85 c pscost : 0.00 0 0 0 0 0 0
11.79/11.85 c inference : 0.00 0 0 0 0 0 0
11.79/11.85 c mostinf : 0.00 0 0 0 0 0 0
11.79/11.85 c leastinf : 0.00 0 0 0 0 0 0
11.79/11.85 c fullstrong : 0.00 0 0 0 0 0 0
11.79/11.85 c allfullstrong : 0.00 0 0 0 0 0 0
11.79/11.85 c random : 0.00 0 0 0 0 0 0
11.79/11.85 c Primal Heuristics : Time Calls Found
11.79/11.85 c LP solutions : 0.00 - 0
11.79/11.85 c pseudo solutions : 0.00 - 0
11.79/11.85 c trivial : 0.00 1 0
11.79/11.85 c shiftandpropagate: 0.00 0 0
11.79/11.85 c simplerounding : 0.00 0 0
11.79/11.85 c zirounding : 0.00 0 0
11.79/11.85 c rounding : 0.00 0 0
11.79/11.85 c shifting : 0.00 0 0
11.79/11.85 c intshifting : 0.00 0 0
11.79/11.85 c oneopt : 0.00 0 0
11.79/11.85 c twoopt : 0.00 0 0
11.79/11.85 c fixandinfer : 0.00 0 0
11.79/11.85 c feaspump : 0.00 0 0
11.79/11.85 c clique : 0.00 0 0
11.79/11.85 c coefdiving : 0.00 0 0
11.79/11.85 c pscostdiving : 0.00 0 0
11.79/11.85 c fracdiving : 0.00 0 0
11.79/11.85 c veclendiving : 0.00 0 0
11.79/11.85 c intdiving : 0.00 0 0
11.79/11.85 c actconsdiving : 0.00 0 0
11.79/11.85 c objpscostdiving : 0.00 0 0
11.79/11.85 c rootsoldiving : 0.00 0 0
11.79/11.85 c linesearchdiving : 0.00 0 0
11.79/11.85 c guideddiving : 0.00 0 0
11.79/11.85 c octane : 0.00 0 0
11.79/11.85 c rens : 0.00 0 0
11.79/11.85 c rins : 0.00 0 0
11.79/11.85 c localbranching : 0.00 0 0
11.79/11.85 c mutation : 0.00 0 0
11.79/11.85 c crossover : 0.00 0 0
11.79/11.85 c dins : 0.00 0 0
11.79/11.85 c vbounds : 0.00 0 0
11.79/11.85 c undercover : 0.00 0 0
11.79/11.85 c subnlp : 0.00 0 0
11.79/11.85 c trysol : 0.00 0 0
11.79/11.85 c LP : Time Calls Iterations Iter/call Iter/sec
11.79/11.85 c primal LP : 0.00 0 0 0.00 -
11.79/11.85 c dual LP : 1.07 248 11814 47.64 11025.51
11.79/11.85 c lex dual LP : 0.00 0 0 0.00 -
11.79/11.85 c barrier LP : 0.00 0 0 0.00 -
11.79/11.85 c diving/probing LP: 0.00 0 0 0.00 -
11.79/11.85 c strong branching : 10.13 989 108703 109.91 10725.98
11.79/11.85 c (at root node) : - 10 2324 232.40 -
11.79/11.85 c conflict analysis: 0.00 0 0 0.00 -
11.79/11.85 c B&B Tree :
11.79/11.85 c number of runs : 1
11.79/11.85 c nodes : 239
11.79/11.85 c nodes (total) : 239
11.79/11.85 c nodes left : 0
11.79/11.85 c max depth : 22
11.79/11.85 c max depth (total): 22
11.79/11.85 c backtracks : 58 (24.3%)
11.79/11.85 c delayed cutoffs : 90
11.79/11.85 c repropagations : 265 (6109 domain reductions, 45 cutoffs)
11.79/11.85 c avg switch length: 3.91
11.79/11.85 c switching time : 0.04
11.79/11.85 c Solution :
11.79/11.85 c Solutions found : 0 (0 improvements)
11.79/11.85 c Primal Bound : infeasible
11.79/11.85 c Dual Bound : -
11.79/11.85 c Gap : 0.00 %
11.79/11.85 c Root Dual Bound : +0.00000000000000e+00
11.79/11.85 c Root Iterations : 1387
11.79/11.86 c Time complete: 11.85.