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-3489313-1307758991.opb>
0.00/0.03 c original problem has 1804 variables (1804 bin, 0 int, 0 impl, 0 cont) and 4931 constraints
0.00/0.03 c problem read
0.00/0.03 c No objective function, only one solution is needed.
0.00/0.03 c presolving settings loaded
0.00/0.04 c presolving:
0.04/0.09 c (round 1) 282 del vars, 295 del conss, 0 add conss, 112 chg bounds, 112 chg sides, 290 chg coeffs, 0 upgd conss, 99792 impls, 0 clqs
0.04/0.09 c (round 2) 290 del vars, 714 del conss, 0 add conss, 120 chg bounds, 112 chg sides, 290 chg coeffs, 0 upgd conss, 99812 impls, 0 clqs
0.04/0.09 c (round 3) 298 del vars, 727 del conss, 0 add conss, 124 chg bounds, 112 chg sides, 290 chg coeffs, 0 upgd conss, 99866 impls, 0 clqs
0.04/0.09 c (round 4) 300 del vars, 743 del conss, 0 add conss, 124 chg bounds, 112 chg sides, 290 chg coeffs, 0 upgd conss, 99930 impls, 0 clqs
0.04/0.09 c (round 5) 300 del vars, 747 del conss, 0 add conss, 124 chg bounds, 112 chg sides, 290 chg coeffs, 0 upgd conss, 99930 impls, 0 clqs
0.09/0.12 c (round 6) 300 del vars, 756 del conss, 0 add conss, 124 chg bounds, 112 chg sides, 290 chg coeffs, 4175 upgd conss, 99930 impls, 0 clqs
0.09/0.13 c presolving (7 rounds):
0.09/0.13 c 300 deleted vars, 756 deleted constraints, 0 added constraints, 124 tightened bounds, 0 added holes, 112 changed sides, 290 changed coefficients
0.09/0.13 c 99930 implications, 0 cliques
0.09/0.13 c presolved problem has 1504 variables (1504 bin, 0 int, 0 impl, 0 cont) and 4175 constraints
0.09/0.13 c 224 constraints of type <knapsack>
0.09/0.13 c 2644 constraints of type <setppc>
0.09/0.13 c 1307 constraints of type <logicor>
0.09/0.13 c transformed objective value is always integral (scale: 1)
0.09/0.13 c Presolving Time: 0.09
0.09/0.13 c - non default parameters ----------------------------------------------------------------------
0.09/0.13 c # SCIP version 2.0.1.5
0.09/0.13 c
0.09/0.13 c # frequency for displaying node information lines
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.13 c display/freq = 10000
0.09/0.13 c
0.09/0.13 c # maximal time in seconds to run
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.13 c limits/time = 1797
0.09/0.13 c
0.09/0.13 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.13 c limits/memory = 13950
0.09/0.13 c
0.09/0.13 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c limits/solutions = 1
0.09/0.13 c
0.09/0.13 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.13 c separating/maxrounds = 1
0.09/0.13 c
0.09/0.13 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c separating/maxroundsroot = 5
0.09/0.13 c
0.09/0.13 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.13 c # [type: int, range: [1,2], default: 1]
0.09/0.13 c timing/clocktype = 2
0.09/0.13 c
0.09/0.13 c # belongs reading time to solving time?
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c timing/reading = TRUE
0.09/0.13 c
0.09/0.13 c # should presolving try to simplify inequalities
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/linear/simplifyinequalities = TRUE
0.09/0.13 c
0.09/0.13 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/indicator/addCouplingCons = TRUE
0.09/0.13 c
0.09/0.13 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.13 c constraints/knapsack/disaggregation = FALSE
0.09/0.13 c
0.09/0.13 c # should presolving try to simplify knapsacks
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.13 c
0.09/0.13 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c presolving/probing/maxrounds = 0
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/coefdiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.13 c heuristics/crossover/freq = -1
0.09/0.13 c
0.09/0.13 c # number of nodes added to the contingent of the total nodes
0.09/0.13 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.13 c heuristics/crossover/nodesofs = 750
0.09/0.13 c
0.09/0.13 c # number of nodes without incumbent change that heuristic should wait
0.09/0.13 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.13 c heuristics/crossover/nwaitingnodes = 100
0.09/0.13 c
0.09/0.13 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.13 c # [type: real, range: [0,1], default: 0.1]
0.09/0.13 c heuristics/crossover/nodesquot = 0.15
0.09/0.13 c
0.09/0.13 c # minimum percentage of integer variables that have to be fixed
0.09/0.13 c # [type: real, range: [0,1], default: 0.666]
0.09/0.13 c heuristics/crossover/minfixingrate = 0.5
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.13 c heuristics/feaspump/freq = -1
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/fracdiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/guideddiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/intshifting/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/linesearchdiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.13 c heuristics/objpscostdiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.13 c # [type: real, range: [0,1], default: 0.01]
0.09/0.13 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.13 c heuristics/oneopt/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/pscostdiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.13 c heuristics/rens/freq = -1
0.09/0.13 c
0.09/0.13 c # minimum percentage of integer variables that have to be fixable
0.09/0.13 c # [type: real, range: [0,1], default: 0.5]
0.09/0.13 c heuristics/rens/minfixingrate = 0.3
0.09/0.13 c
0.09/0.13 c # number of nodes added to the contingent of the total nodes
0.09/0.13 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.13 c heuristics/rens/nodesofs = 2000
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.13 c heuristics/rootsoldiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.13 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.13 c heuristics/rounding/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.13 c heuristics/shiftandpropagate/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/shifting/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.13 c heuristics/simplerounding/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.13 c heuristics/subnlp/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.13 c heuristics/trivial/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.13 c heuristics/trysol/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.13 c heuristics/undercover/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/veclendiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.13 c heuristics/zirounding/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.13 c separating/cmir/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.13 c separating/flowcover/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c separating/rapidlearning/freq = 0
0.09/0.13 c
0.09/0.13 c -----------------------------------------------------------------------------------------------
0.09/0.13 c start solving
0.09/0.13 c
0.09/0.17 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.17 c 0.2s| 1 | 0 | 757 | - | 11M| 0 | 473 |1504 |4175 |1504 |4175 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.42 c 0.4s| 1 | 0 | 1254 | - | 11M| 0 | 579 |1504 |4014 |1504 |4063 | 91 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.62 c 0.6s| 1 | 0 | 2124 | - | 12M| 0 | 609 |1504 |4014 |1504 |4116 | 144 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/0.93 c 0.9s| 1 | 0 | 2829 | - | 12M| 0 | 598 |1504 |4014 |1504 |4217 | 245 | 0 | 0 | 0.000000e+00 | -- | Inf
1.10/1.15 c 1.2s| 1 | 0 | 3770 | - | 12M| 0 | 624 |1504 |4014 |1504 |4287 | 315 | 0 | 0 | 0.000000e+00 | -- | Inf
1.59/1.62 c 1.6s| 1 | 0 | 4891 | - | 13M| 0 | 718 |1504 |4014 |1504 |4350 | 378 | 0 | 0 | 0.000000e+00 | -- | Inf
2.59/2.62 c 2.6s| 1 | 0 | 5063 | - | 13M| 0 | 707 |1504 |3769 |1504 |4350 | 378 | 0 | 11 | 0.000000e+00 | -- | Inf
2.99/3.07 c 3.1s| 1 | 2 | 5063 | - | 13M| 0 | 707 |1504 |3769 |1504 |4350 | 378 | 0 | 21 | 0.000000e+00 | -- | Inf
2.99/3.07 c (run 1, node 1) restarting after 130 global fixings of integer variables
2.99/3.07 c
2.99/3.07 c (restart) converted 55 cuts from the global cut pool into linear constraints
2.99/3.07 c
2.99/3.07 c presolving:
2.99/3.08 c (round 1) 208 del vars, 23 del conss, 0 add conss, 3 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 104101 impls, 15 clqs
2.99/3.09 c (round 2) 226 del vars, 138 del conss, 0 add conss, 3 chg bounds, 0 chg sides, 4 chg coeffs, 0 upgd conss, 104413 impls, 15 clqs
2.99/3.09 c (round 3) 226 del vars, 152 del conss, 0 add conss, 3 chg bounds, 0 chg sides, 4 chg coeffs, 95 upgd conss, 104413 impls, 15 clqs
3.09/3.11 c (round 4) 226 del vars, 155 del conss, 0 add conss, 3 chg bounds, 0 chg sides, 4 chg coeffs, 95 upgd conss, 104413 impls, 15 clqs
3.09/3.12 c (round 5) 226 del vars, 158 del conss, 0 add conss, 3 chg bounds, 0 chg sides, 4 chg coeffs, 95 upgd conss, 104413 impls, 15 clqs
3.09/3.12 c presolving (6 rounds):
3.09/3.12 c 226 deleted vars, 158 deleted constraints, 0 added constraints, 3 tightened bounds, 0 added holes, 0 changed sides, 4 changed coefficients
3.09/3.12 c 104413 implications, 15 cliques
3.09/3.12 c presolved problem has 1278 variables (1278 bin, 0 int, 0 impl, 0 cont) and 3666 constraints
3.09/3.12 c 234 constraints of type <knapsack>
3.09/3.12 c 2216 constraints of type <setppc>
3.09/3.12 c 1216 constraints of type <logicor>
3.09/3.12 c transformed objective value is always integral (scale: 1)
3.09/3.12 c Presolving Time: 0.14
3.09/3.12 c
3.09/3.15 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.09/3.15 c 3.2s| 1 | 0 | 5805 | - | 10M| 0 | 364 |1278 |3666 |1278 |3544 | 0 | 0 | 21 | 0.000000e+00 | -- | Inf
3.19/3.25 c 3.3s| 1 | 0 | 6284 | - | 10M| 0 | 495 |1278 |3666 |1278 |3598 | 54 | 0 | 21 | 0.000000e+00 | -- | Inf
3.69/3.78 c 3.8s| 1 | 0 | 6325 | - | 10M| 0 | 541 |1278 |3638 |1278 |3598 | 54 | 0 | 39 | 0.000000e+00 | -- | Inf
4.29/4.31 c 4.3s| 1 | 2 | 6325 | - | 10M| 0 | 541 |1278 |3638 |1278 |3598 | 54 | 0 | 56 | 0.000000e+00 | -- | Inf
19.39/19.42 c
19.39/19.42 c SCIP Status : problem is solved [infeasible]
19.39/19.42 c Solving Time (sec) : 19.42
19.39/19.42 c Solving Nodes : 83 (total of 84 nodes in 2 runs)
19.39/19.42 c Primal Bound : +1.00000000000000e+20 (0 solutions)
19.39/19.42 c Dual Bound : +1.00000000000000e+20
19.39/19.42 c Gap : 0.00 %
19.39/19.42 s UNSATISFIABLE
19.39/19.42 c SCIP Status : problem is solved [infeasible]
19.39/19.42 c Total Time : 19.42
19.39/19.42 c solving : 19.42
19.39/19.42 c presolving : 0.14 (included in solving)
19.39/19.42 c reading : 0.03 (included in solving)
19.39/19.42 c Original Problem :
19.39/19.42 c Problem name : HOME/instance-3489313-1307758991.opb
19.39/19.42 c Variables : 1804 (1804 binary, 0 integer, 0 implicit integer, 0 continuous)
19.39/19.42 c Constraints : 4931 initial, 4931 maximal
19.39/19.42 c Presolved Problem :
19.39/19.42 c Problem name : t_HOME/instance-3489313-1307758991.opb
19.39/19.42 c Variables : 1278 (1278 binary, 0 integer, 0 implicit integer, 0 continuous)
19.39/19.42 c Constraints : 3666 initial, 3698 maximal
19.39/19.42 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
19.39/19.42 c trivial : 0.00 139 0 0 0 0 0 0 0 0
19.39/19.42 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
19.39/19.42 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
19.39/19.42 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
19.39/19.42 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
19.39/19.42 c implics : 0.01 0 256 0 0 0 0 0 0 0
19.39/19.42 c probing : 0.00 0 0 0 0 0 0 0 0 0
19.39/19.42 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
19.39/19.42 c setppc : 0.02 1 0 0 0 0 119 0 0 0
19.39/19.42 c linear : 0.06 124 5 0 124 0 762 0 112 294
19.39/19.42 c logicor : 0.04 1 0 0 3 0 33 0 0 0
19.39/19.42 c root node : - 136 - - 136 - - - - -
19.39/19.42 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
19.39/19.42 c integral : 0 0 0 107 0 2 0 5 200 0 0 112
19.39/19.42 c knapsack : 234 7 1011 0 0 0 0 0 43 1234 0 0
19.39/19.42 c setppc : 2216 7 1011 0 0 0 1879 14 6906 0 0 0
19.39/19.42 c logicor : 1216+ 7 847 0 0 0 960 18 3046 0 0 0
19.39/19.42 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
19.39/19.42 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
19.39/19.42 c integral : 16.47 0.00 0.00 16.47 0.00 0.00 0.00
19.39/19.42 c knapsack : 0.01 0.01 0.00 0.00 0.00 0.00 0.00
19.39/19.42 c setppc : 0.03 0.00 0.03 0.00 0.00 0.00 0.00
19.39/19.42 c logicor : 0.01 0.00 0.01 0.00 0.00 0.00 0.00
19.39/19.42 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
19.39/19.42 c Propagators : #Propagate #Resprop Cutoffs DomReds
19.39/19.42 c vbounds : 0 0 0 0
19.39/19.42 c rootredcost : 0 0 0 0
19.39/19.42 c pseudoobj : 0 0 0 0
19.39/19.42 c Propagator Timings : TotalTime Propagate Resprop
19.39/19.42 c vbounds : 0.00 0.00 0.00
19.39/19.42 c rootredcost : 0.00 0.00 0.00
19.39/19.42 c pseudoobj : 0.00 0.00 0.00
19.39/19.42 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
19.39/19.42 c propagation : 0.00 32 26 74 11.9 1 11.0 -
19.39/19.42 c infeasible LP : 0.00 5 5 12 8.5 2 9.0 0
19.39/19.42 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
19.39/19.42 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
19.39/19.42 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
19.39/19.42 c applied globally : - - - 60 9.4 - - -
19.39/19.42 c applied locally : - - - 0 0.0 - - -
19.39/19.42 c Separators : Time Calls Cutoffs DomReds Cuts Conss
19.39/19.42 c cut pool : 0.00 0 - - 0 - (maximal pool size: 124)
19.39/19.42 c redcost : 0.00 72 0 0 0 0
19.39/19.42 c impliedbounds : 0.00 6 0 0 0 0
19.39/19.42 c intobj : 0.00 0 0 0 0 0
19.39/19.42 c gomory : 0.49 6 0 0 2737 0
19.39/19.42 c cgmip : 0.00 0 0 0 0 0
19.39/19.42 c closecuts : 0.00 0 0 0 0 0
19.39/19.42 c strongcg : 0.22 6 0 0 3000 0
19.39/19.42 c cmir : 0.00 0 0 0 0 0
19.39/19.42 c flowcover : 0.00 0 0 0 0 0
19.39/19.42 c clique : 0.08 6 0 0 45 0
19.39/19.42 c zerohalf : 0.00 0 0 0 0 0
19.39/19.42 c mcf : 0.01 2 0 0 0 0
19.39/19.42 c oddcycle : 0.00 0 0 0 0 0
19.39/19.42 c rapidlearning : 0.11 1 0 61 0 52
19.39/19.42 c Pricers : Time Calls Vars
19.39/19.42 c problem variables: 0.00 0 0
19.39/19.42 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
19.39/19.42 c relpscost : 16.47 107 5 200 0 0 112
19.39/19.42 c pscost : 0.00 0 0 0 0 0 0
19.39/19.42 c inference : 0.00 0 0 0 0 0 0
19.39/19.42 c mostinf : 0.00 0 0 0 0 0 0
19.39/19.42 c leastinf : 0.00 0 0 0 0 0 0
19.39/19.42 c fullstrong : 0.00 0 0 0 0 0 0
19.39/19.42 c allfullstrong : 0.00 0 0 0 0 0 0
19.39/19.42 c random : 0.00 0 0 0 0 0 0
19.39/19.42 c Primal Heuristics : Time Calls Found
19.39/19.42 c LP solutions : 0.00 - 0
19.39/19.42 c pseudo solutions : 0.00 - 0
19.39/19.42 c trivial : 0.00 1 0
19.39/19.42 c shiftandpropagate: 0.00 0 0
19.39/19.42 c simplerounding : 0.00 0 0
19.39/19.42 c zirounding : 0.00 0 0
19.39/19.42 c rounding : 0.00 0 0
19.39/19.42 c shifting : 0.00 0 0
19.39/19.42 c intshifting : 0.00 0 0
19.39/19.42 c oneopt : 0.00 0 0
19.39/19.42 c twoopt : 0.00 0 0
19.39/19.42 c fixandinfer : 0.00 0 0
19.39/19.42 c feaspump : 0.00 0 0
19.39/19.42 c clique : 0.00 0 0
19.39/19.42 c coefdiving : 0.00 0 0
19.39/19.42 c pscostdiving : 0.00 0 0
19.39/19.42 c fracdiving : 0.00 0 0
19.39/19.42 c veclendiving : 0.00 0 0
19.39/19.42 c intdiving : 0.00 0 0
19.39/19.42 c actconsdiving : 0.00 0 0
19.39/19.42 c objpscostdiving : 0.00 0 0
19.39/19.42 c rootsoldiving : 0.00 0 0
19.39/19.42 c linesearchdiving : 0.00 0 0
19.39/19.42 c guideddiving : 0.00 0 0
19.39/19.42 c octane : 0.00 0 0
19.39/19.42 c rens : 0.00 0 0
19.39/19.42 c rins : 0.00 0 0
19.39/19.42 c localbranching : 0.00 0 0
19.39/19.42 c mutation : 0.00 0 0
19.39/19.42 c crossover : 0.00 0 0
19.39/19.42 c dins : 0.00 0 0
19.39/19.42 c vbounds : 0.00 0 0
19.39/19.42 c undercover : 0.00 0 0
19.39/19.42 c subnlp : 0.00 0 0
19.39/19.42 c trysol : 0.00 0 0
19.39/19.42 c LP : Time Calls Iterations Iter/call Iter/sec
19.39/19.42 c primal LP : 0.00 0 0 0.00 -
19.39/19.42 c dual LP : 1.67 119 14525 122.06 8687.84
19.39/19.42 c lex dual LP : 0.00 0 0 0.00 -
19.39/19.42 c barrier LP : 0.00 0 0 0.00 -
19.39/19.42 c diving/probing LP: 0.00 0 0 0.00 -
19.39/19.42 c strong branching : 16.44 926 123153 132.99 7491.33
19.39/19.42 c (at root node) : - 56 14424 257.57 -
19.39/19.42 c conflict analysis: 0.00 0 0 0.00 -
19.39/19.42 c B&B Tree :
19.39/19.42 c number of runs : 2
19.39/19.42 c nodes : 83
19.39/19.42 c nodes (total) : 84
19.39/19.42 c nodes left : 0
19.39/19.42 c max depth : 17
19.39/19.42 c max depth (total): 17
19.39/19.42 c backtracks : 22 (26.5%)
19.39/19.42 c delayed cutoffs : 28
19.39/19.42 c repropagations : 82 (2269 domain reductions, 14 cutoffs)
19.39/19.42 c avg switch length: 4.51
19.39/19.42 c switching time : 0.02
19.39/19.42 c Solution :
19.39/19.42 c Solutions found : 0 (0 improvements)
19.39/19.42 c Primal Bound : infeasible
19.39/19.42 c Dual Bound : -
19.39/19.42 c Gap : 0.00 %
19.39/19.42 c Root Dual Bound : +0.00000000000000e+00
19.39/19.42 c Root Iterations : 6325
19.39/19.44 c Time complete: 19.43.