0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
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-3453070-1307073452.opb>
0.03/0.07 c original problem has 3736 variables (3736 bin, 0 int, 0 impl, 0 cont) and 10457 constraints
0.03/0.07 c problem read
0.03/0.07 c No objective function, only one solution is needed.
0.03/0.07 c presolving settings loaded
0.09/0.10 c presolving:
0.09/0.18 c (round 1) 474 del vars, 472 del conss, 0 add conss, 175 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206361 impls, 0 clqs
0.09/0.18 c (round 2) 484 del vars, 1192 del conss, 0 add conss, 185 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206395 impls, 0 clqs
0.09/0.19 c (round 3) 498 del vars, 1216 del conss, 0 add conss, 191 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206515 impls, 0 clqs
0.09/0.19 c (round 4) 499 del vars, 1238 del conss, 0 add conss, 191 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206589 impls, 0 clqs
0.09/0.19 c (round 5) 499 del vars, 1240 del conss, 0 add conss, 191 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206589 impls, 0 clqs
0.19/0.23 c (round 6) 499 del vars, 1251 del conss, 0 add conss, 191 chg bounds, 184 chg sides, 460 chg coeffs, 9206 upgd conss, 206589 impls, 0 clqs
0.19/0.25 c presolving (7 rounds):
0.19/0.25 c 499 deleted vars, 1251 deleted constraints, 0 added constraints, 191 tightened bounds, 0 added holes, 184 changed sides, 460 changed coefficients
0.19/0.25 c 206589 implications, 0 cliques
0.19/0.25 c presolved problem has 3237 variables (3237 bin, 0 int, 0 impl, 0 cont) and 9206 constraints
0.19/0.25 c 368 constraints of type <knapsack>
0.19/0.25 c 5906 constraints of type <setppc>
0.19/0.25 c 2932 constraints of type <logicor>
0.19/0.25 c transformed objective value is always integral (scale: 1)
0.19/0.25 c Presolving Time: 0.17
0.19/0.25 c - non default parameters ----------------------------------------------------------------------
0.19/0.25 c # SCIP version 2.0.1.4
0.19/0.25 c
0.19/0.25 c # frequency for displaying node information lines
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 100]
0.19/0.25 c display/freq = 10000
0.19/0.25 c
0.19/0.25 c # maximal time in seconds to run
0.19/0.25 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.25 c limits/time = 1800
0.19/0.25 c
0.19/0.25 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.19/0.25 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.25 c limits/memory = 13950
0.19/0.25 c
0.19/0.25 c # solving stops, if the given number of solutions were found (-1: no limit)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.25 c limits/solutions = 1
0.19/0.25 c
0.19/0.25 c # maximal number of separation rounds per node (-1: unlimited)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 5]
0.19/0.25 c separating/maxrounds = 1
0.19/0.25 c
0.19/0.25 c # maximal number of separation rounds in the root node (-1: unlimited)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.25 c separating/maxroundsroot = 5
0.19/0.25 c
0.19/0.25 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.19/0.25 c # [type: int, range: [1,2], default: 1]
0.19/0.25 c timing/clocktype = 2
0.19/0.25 c
0.19/0.25 c # belongs reading time to solving time?
0.19/0.25 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.25 c timing/reading = TRUE
0.19/0.25 c
0.19/0.25 c # should presolving try to simplify inequalities
0.19/0.25 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.25 c constraints/linear/simplifyinequalities = TRUE
0.19/0.25 c
0.19/0.25 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.19/0.25 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.25 c constraints/indicator/addCouplingCons = TRUE
0.19/0.25 c
0.19/0.25 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.19/0.25 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.19/0.25 c constraints/knapsack/disaggregation = FALSE
0.19/0.25 c
0.19/0.25 c # should presolving try to simplify knapsacks
0.19/0.25 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.25 c constraints/knapsack/simplifyinequalities = TRUE
0.19/0.25 c
0.19/0.25 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.25 c presolving/probing/maxrounds = 0
0.19/0.25 c
0.19/0.25 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.25 c heuristics/coefdiving/freq = -1
0.19/0.25 c
0.19/0.25 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.25 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.25 c heuristics/coefdiving/maxlpiterquot = 0.075
0.19/0.25 c
0.19/0.25 c # additional number of allowed LP iterations
0.19/0.25 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.25 c heuristics/coefdiving/maxlpiterofs = 1500
0.19/0.25 c
0.19/0.25 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 30]
0.19/0.25 c heuristics/crossover/freq = -1
0.19/0.25 c
0.19/0.25 c # number of nodes added to the contingent of the total nodes
0.19/0.25 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.19/0.25 c heuristics/crossover/nodesofs = 750
0.19/0.25 c
0.19/0.25 c # number of nodes without incumbent change that heuristic should wait
0.19/0.25 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.19/0.25 c heuristics/crossover/nwaitingnodes = 100
0.19/0.25 c
0.19/0.25 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.19/0.25 c # [type: real, range: [0,1], default: 0.1]
0.19/0.25 c heuristics/crossover/nodesquot = 0.15
0.19/0.25 c
0.19/0.25 c # minimum percentage of integer variables that have to be fixed
0.19/0.25 c # [type: real, range: [0,1], default: 0.666]
0.19/0.25 c heuristics/crossover/minfixingrate = 0.5
0.19/0.25 c
0.19/0.25 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.25 c heuristics/feaspump/freq = -1
0.19/0.25 c
0.19/0.25 c # additional number of allowed LP iterations
0.19/0.25 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.25 c heuristics/feaspump/maxlpiterofs = 2000
0.19/0.25 c
0.19/0.25 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.25 c heuristics/fracdiving/freq = -1
0.19/0.25 c
0.19/0.25 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.25 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.25 c heuristics/fracdiving/maxlpiterquot = 0.075
0.19/0.25 c
0.19/0.25 c # additional number of allowed LP iterations
0.19/0.25 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.25 c heuristics/fracdiving/maxlpiterofs = 1500
0.19/0.25 c
0.19/0.25 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.25 c heuristics/guideddiving/freq = -1
0.19/0.25 c
0.19/0.25 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.25 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.25 c heuristics/guideddiving/maxlpiterquot = 0.075
0.19/0.25 c
0.19/0.25 c # additional number of allowed LP iterations
0.19/0.25 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.25 c heuristics/guideddiving/maxlpiterofs = 1500
0.19/0.25 c
0.19/0.25 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.25 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.25 c heuristics/intdiving/maxlpiterquot = 0.075
0.19/0.25 c
0.19/0.25 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.25 c heuristics/intshifting/freq = -1
0.19/0.25 c
0.19/0.25 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.25 c heuristics/linesearchdiving/freq = -1
0.19/0.25 c
0.19/0.25 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.25 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.25 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.19/0.25 c
0.19/0.25 c # additional number of allowed LP iterations
0.19/0.25 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.25 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.19/0.25 c
0.19/0.25 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.25 c heuristics/objpscostdiving/freq = -1
0.19/0.25 c
0.19/0.25 c # maximal fraction of diving LP iterations compared to total iteration number
0.19/0.25 c # [type: real, range: [0,1], default: 0.01]
0.19/0.25 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.19/0.25 c
0.19/0.25 c # additional number of allowed LP iterations
0.19/0.25 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.25 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.19/0.25 c
0.19/0.25 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.25 c heuristics/oneopt/freq = -1
0.19/0.25 c
0.19/0.25 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.25 c heuristics/pscostdiving/freq = -1
0.19/0.25 c
0.19/0.25 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.25 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.25 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.19/0.25 c
0.19/0.25 c # additional number of allowed LP iterations
0.19/0.25 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.25 c heuristics/pscostdiving/maxlpiterofs = 1500
0.19/0.25 c
0.19/0.25 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.25 c heuristics/rens/freq = -1
0.19/0.25 c
0.19/0.25 c # minimum percentage of integer variables that have to be fixable
0.19/0.25 c # [type: real, range: [0,1], default: 0.5]
0.19/0.25 c heuristics/rens/minfixingrate = 0.3
0.19/0.25 c
0.19/0.25 c # number of nodes added to the contingent of the total nodes
0.19/0.25 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.19/0.25 c heuristics/rens/nodesofs = 2000
0.19/0.25 c
0.19/0.25 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.25 c heuristics/rootsoldiving/freq = -1
0.19/0.25 c
0.19/0.25 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.25 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.19/0.25 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.19/0.25 c
0.19/0.25 c # additional number of allowed LP iterations
0.19/0.25 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.25 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.19/0.25 c
0.19/0.25 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.25 c heuristics/rounding/freq = -1
0.19/0.25 c
0.19/0.25 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.25 c heuristics/shiftandpropagate/freq = -1
0.19/0.25 c
0.19/0.25 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.25 c heuristics/shifting/freq = -1
0.19/0.25 c
0.19/0.25 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.25 c heuristics/simplerounding/freq = -1
0.19/0.25 c
0.19/0.25 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.25 c heuristics/subnlp/freq = -1
0.19/0.25 c
0.19/0.25 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.25 c heuristics/trivial/freq = -1
0.19/0.25 c
0.19/0.25 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.25 c heuristics/trysol/freq = -1
0.19/0.25 c
0.19/0.25 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.25 c heuristics/undercover/freq = -1
0.19/0.25 c
0.19/0.25 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.25 c heuristics/veclendiving/freq = -1
0.19/0.25 c
0.19/0.25 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.25 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.25 c heuristics/veclendiving/maxlpiterquot = 0.075
0.19/0.25 c
0.19/0.25 c # additional number of allowed LP iterations
0.19/0.25 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.25 c heuristics/veclendiving/maxlpiterofs = 1500
0.19/0.25 c
0.19/0.25 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.25 c heuristics/zirounding/freq = -1
0.19/0.25 c
0.19/0.25 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.25 c separating/cmir/freq = -1
0.19/0.25 c
0.19/0.25 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.25 c separating/flowcover/freq = -1
0.19/0.25 c
0.19/0.25 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.25 c separating/rapidlearning/freq = 0
0.19/0.25 c
0.19/0.25 c -----------------------------------------------------------------------------------------------
0.19/0.25 c start solving
0.19/0.25 c
0.29/0.34 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.34 c 0.3s| 1 | 0 | 1254 | - | 24M| 0 | 794 |3237 |9206 |3237 |9206 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/0.90 c 0.9s| 1 | 0 | 2391 | - | 23M| 0 | 991 |3237 |8426 |3237 |8458 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
1.39/1.45 c 1.5s| 1 | 0 | 5887 | - | 23M| 0 |1151 |3237 |8426 |3237 |8537 | 106 | 0 | 0 | 0.000000e+00 | -- | Inf
2.10/2.17 c 2.2s| 1 | 0 | 8303 | - | 24M| 0 |1209 |3237 |8426 |3237 |8654 | 223 | 0 | 0 | 0.000000e+00 | -- | Inf
3.39/3.45 c 3.4s| 1 | 0 | 9714 | - | 24M| 0 |1238 |3237 |8426 |3237 |8778 | 347 | 0 | 0 | 0.000000e+00 | -- | Inf
5.09/5.18 c 5.2s| 1 | 0 | 11863 | - | 24M| 0 |1238 |3237 |8426 |3237 |8874 | 443 | 0 | 0 | 0.000000e+00 | -- | Inf
6.99/7.05 c 7.0s| 1 | 2 | 11863 | - | 24M| 0 |1238 |3237 |8426 |3237 |8874 | 443 | 0 | 10 | 0.000000e+00 | -- | Inf
6.99/7.05 c (run 1, node 1) restarting after 230 global fixings of integer variables
6.99/7.05 c
6.99/7.05 c (restart) converted 83 cuts from the global cut pool into linear constraints
6.99/7.05 c
6.99/7.06 c presolving:
6.99/7.07 c (round 1) 331 del vars, 22 del conss, 0 add conss, 1 chg bounds, 0 chg sides, 7 chg coeffs, 0 upgd conss, 211792 impls, 10 clqs
6.99/7.08 c (round 2) 336 del vars, 132 del conss, 0 add conss, 1 chg bounds, 0 chg sides, 7 chg coeffs, 0 upgd conss, 211796 impls, 10 clqs
6.99/7.09 c (round 3) 336 del vars, 135 del conss, 0 add conss, 1 chg bounds, 1 chg sides, 7 chg coeffs, 0 upgd conss, 211796 impls, 10 clqs
7.09/7.11 c (round 4) 336 del vars, 136 del conss, 0 add conss, 1 chg bounds, 1 chg sides, 7 chg coeffs, 81 upgd conss, 211796 impls, 10 clqs
7.09/7.12 c (round 5) 336 del vars, 136 del conss, 0 add conss, 1 chg bounds, 3 chg sides, 14 chg coeffs, 81 upgd conss, 211796 impls, 10 clqs
7.09/7.13 c presolving (6 rounds):
7.09/7.13 c 336 deleted vars, 136 deleted constraints, 0 added constraints, 1 tightened bounds, 0 added holes, 3 changed sides, 14 changed coefficients
7.09/7.13 c 211796 implications, 10 cliques
7.09/7.13 c presolved problem has 2901 variables (2901 bin, 0 int, 0 impl, 0 cont) and 8373 constraints
7.09/7.13 c 400 constraints of type <knapsack>
7.09/7.13 c 5266 constraints of type <setppc>
7.09/7.13 c 2707 constraints of type <logicor>
7.09/7.13 c transformed objective value is always integral (scale: 1)
7.09/7.13 c Presolving Time: 0.24
7.09/7.14 c
7.19/7.21 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
7.19/7.21 c 7.2s| 1 | 0 | 12997 | - | 22M| 0 | 687 |2901 |8373 |2901 |8270 | 0 | 0 | 10 | 0.000000e+00 | -- | Inf
7.39/7.48 c 7.5s| 1 | 0 | 13957 | - | 23M| 0 | 878 |2901 |8373 |2901 |8330 | 60 | 0 | 10 | 0.000000e+00 | -- | Inf
8.70/8.81 c 8.8s| 1 | 2 | 13957 | - | 23M| 0 | 878 |2901 |8373 |2901 |8330 | 60 | 0 | 28 | 0.000000e+00 | -- | Inf
45.49/45.55 c
45.49/45.55 c SCIP Status : problem is solved [infeasible]
45.49/45.55 c Solving Time (sec) : 45.55
45.49/45.55 c Solving Nodes : 396 (total of 397 nodes in 2 runs)
45.49/45.55 c Primal Bound : +1.00000000000000e+20 (0 solutions)
45.49/45.55 c Dual Bound : +1.00000000000000e+20
45.49/45.55 c Gap : 0.00 %
45.49/45.55 s UNSATISFIABLE
45.49/45.55 c SCIP Status : problem is solved [infeasible]
45.49/45.55 c Total Time : 45.55
45.49/45.55 c solving : 45.55
45.49/45.55 c presolving : 0.24 (included in solving)
45.49/45.55 c reading : 0.07 (included in solving)
45.49/45.55 c Original Problem :
45.49/45.55 c Problem name : HOME/instance-3453070-1307073452.opb
45.49/45.55 c Variables : 3736 (3736 binary, 0 integer, 0 implicit integer, 0 continuous)
45.49/45.55 c Constraints : 10457 initial, 10457 maximal
45.49/45.55 c Presolved Problem :
45.49/45.55 c Problem name : t_HOME/instance-3453070-1307073452.opb
45.49/45.55 c Variables : 2901 (2901 binary, 0 integer, 0 implicit integer, 0 continuous)
45.49/45.55 c Constraints : 8373 initial, 8794 maximal
45.49/45.55 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
45.49/45.55 c trivial : 0.00 231 0 0 0 0 0 0 0 0
45.49/45.55 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
45.49/45.55 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
45.49/45.55 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
45.49/45.55 c implics : 0.02 0 407 0 0 0 0 0 0 0
45.49/45.55 c probing : 0.00 0 0 0 0 0 0 0 0 0
45.49/45.55 c knapsack : 0.01 0 0 0 0 0 0 0 2 7
45.49/45.55 c setppc : 0.03 2 0 0 0 0 112 0 0 0
45.49/45.55 c linear : 0.10 191 4 0 191 0 1253 0 185 467
45.49/45.55 c logicor : 0.06 0 0 0 1 0 22 0 0 0
45.49/45.55 c root node : - 230 - - 230 - - - - -
45.49/45.55 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
45.49/45.55 c integral : 0 0 0 298 0 2 0 5 64 0 0 554
45.49/45.55 c knapsack : 400 6 5148 0 0 0 44 0 314 1202 0 0
45.49/45.55 c setppc : 5266 6 5148 0 0 0 24187 75 57969 0 0 0
45.49/45.55 c logicor : 2707+ 6 4693 0 0 0 11454 130 30441 0 0 0
45.49/45.55 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
45.49/45.55 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
45.49/45.55 c integral : 29.49 0.00 0.00 29.49 0.00 0.00 0.00
45.49/45.55 c knapsack : 0.05 0.01 0.04 0.00 0.00 0.00 0.00
45.49/45.55 c setppc : 0.23 0.00 0.22 0.00 0.00 0.00 0.01
45.49/45.55 c logicor : 0.11 0.00 0.10 0.00 0.00 0.00 0.01
45.49/45.55 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
45.49/45.55 c Propagators : #Propagate #Resprop Cutoffs DomReds
45.49/45.55 c vbounds : 0 0 0 0
45.49/45.55 c rootredcost : 0 0 0 0
45.49/45.55 c pseudoobj : 0 0 0 0
45.49/45.55 c Propagator Timings : TotalTime Propagate Resprop
45.49/45.55 c vbounds : 0.00 0.00 0.00
45.49/45.55 c rootredcost : 0.00 0.00 0.00
45.49/45.55 c pseudoobj : 0.00 0.00 0.00
45.49/45.55 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
45.49/45.55 c propagation : 0.02 205 170 868 24.5 33 13.0 -
45.49/45.55 c infeasible LP : 0.00 6 6 10 7.1 1 5.0 0
45.49/45.55 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
45.49/45.55 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
45.49/45.55 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
45.49/45.55 c applied globally : - - - 469 17.9 - - -
45.49/45.55 c applied locally : - - - 0 0.0 - - -
45.49/45.55 c Separators : Time Calls Cutoffs DomReds Cuts Conss
45.49/45.55 c cut pool : 0.00 0 - - 0 - (maximal pool size: 198)
45.49/45.55 c redcost : 0.01 290 0 0 0 0
45.49/45.55 c impliedbounds : 0.01 6 0 0 0 0
45.49/45.55 c intobj : 0.00 0 0 0 0 0
45.49/45.55 c gomory : 1.49 6 0 0 2472 0
45.49/45.55 c cgmip : 0.00 0 0 0 0 0
45.49/45.55 c closecuts : 0.00 0 0 0 0 0
45.49/45.55 c strongcg : 1.21 6 0 0 2801 0
45.49/45.55 c cmir : 0.00 0 0 0 0 0
45.49/45.55 c flowcover : 0.00 0 0 0 0 0
45.49/45.55 c clique : 0.21 6 0 0 43 0
45.49/45.55 c zerohalf : 0.00 0 0 0 0 0
45.49/45.55 c mcf : 0.03 2 0 0 0 0
45.49/45.55 c oddcycle : 0.00 0 0 0 0 0
45.49/45.55 c rapidlearning : 0.24 1 0 230 0 0
45.49/45.55 c Pricers : Time Calls Vars
45.49/45.55 c problem variables: 0.00 0 0
45.49/45.55 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
45.49/45.55 c relpscost : 29.49 298 5 64 0 0 554
45.49/45.55 c pscost : 0.00 0 0 0 0 0 0
45.49/45.55 c inference : 0.00 0 0 0 0 0 0
45.49/45.55 c mostinf : 0.00 0 0 0 0 0 0
45.49/45.55 c leastinf : 0.00 0 0 0 0 0 0
45.49/45.55 c fullstrong : 0.00 0 0 0 0 0 0
45.49/45.55 c allfullstrong : 0.00 0 0 0 0 0 0
45.49/45.55 c random : 0.00 0 0 0 0 0 0
45.49/45.55 c Primal Heuristics : Time Calls Found
45.49/45.55 c LP solutions : 0.00 - 0
45.49/45.55 c pseudo solutions : 0.00 - 0
45.49/45.55 c trivial : 0.00 1 0
45.49/45.55 c shiftandpropagate: 0.00 0 0
45.49/45.55 c simplerounding : 0.00 0 0
45.49/45.55 c zirounding : 0.00 0 0
45.49/45.55 c rounding : 0.00 0 0
45.49/45.55 c shifting : 0.00 0 0
45.49/45.55 c intshifting : 0.00 0 0
45.49/45.55 c oneopt : 0.00 0 0
45.49/45.55 c twoopt : 0.00 0 0
45.49/45.55 c fixandinfer : 0.00 0 0
45.49/45.55 c feaspump : 0.00 0 0
45.49/45.55 c clique : 0.00 0 0
45.49/45.55 c coefdiving : 0.00 0 0
45.49/45.55 c pscostdiving : 0.00 0 0
45.49/45.55 c fracdiving : 0.00 0 0
45.49/45.55 c veclendiving : 0.00 0 0
45.49/45.55 c intdiving : 0.00 0 0
45.49/45.55 c actconsdiving : 0.00 0 0
45.49/45.55 c objpscostdiving : 0.00 0 0
45.49/45.55 c rootsoldiving : 0.00 0 0
45.49/45.55 c linesearchdiving : 0.00 0 0
45.49/45.55 c guideddiving : 0.00 0 0
45.49/45.55 c octane : 0.00 0 0
45.49/45.55 c rens : 0.00 0 0
45.49/45.55 c rins : 0.00 0 0
45.49/45.55 c localbranching : 0.00 0 0
45.49/45.55 c mutation : 0.00 0 0
45.49/45.55 c crossover : 0.00 0 0
45.49/45.55 c dins : 0.00 0 0
45.49/45.55 c vbounds : 0.00 0 0
45.49/45.55 c undercover : 0.00 0 0
45.49/45.55 c subnlp : 0.00 0 0
45.49/45.55 c trysol : 0.00 0 0
45.49/45.55 c LP : Time Calls Iterations Iter/call Iter/sec
45.49/45.55 c primal LP : 0.01 0 0 0.00 -
45.49/45.55 c dual LP : 11.54 311 70114 225.45 6076.35
45.49/45.55 c lex dual LP : 0.00 0 0 0.00 -
45.49/45.55 c barrier LP : 0.00 0 0 0.00 -
45.49/45.55 c diving/probing LP: 0.00 0 0 0.00 -
45.49/45.55 c strong branching : 29.43 536 152732 284.95 5190.07
45.49/45.55 c (at root node) : - 28 15337 547.75 -
45.49/45.55 c conflict analysis: 0.00 0 0 0.00 -
45.49/45.55 c B&B Tree :
45.49/45.55 c number of runs : 2
45.49/45.55 c nodes : 396
45.49/45.55 c nodes (total) : 397
45.49/45.55 c nodes left : 0
45.49/45.55 c max depth : 35
45.49/45.55 c max depth (total): 35
45.49/45.55 c backtracks : 111 (28.0%)
45.49/45.55 c delayed cutoffs : 157
45.49/45.55 c repropagations : 239 (26023 domain reductions, 96 cutoffs)
45.49/45.55 c avg switch length: 2.90
45.49/45.55 c switching time : 0.16
45.49/45.55 c Solution :
45.49/45.55 c Solutions found : 0 (0 improvements)
45.49/45.55 c Primal Bound : infeasible
45.49/45.55 c Dual Bound : -
45.49/45.55 c Gap : 0.00 %
45.49/45.55 c Root Dual Bound : +0.00000000000000e+00
45.49/45.55 c Root Iterations : 13957
45.49/45.58 c Time complete: 45.57.