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-3730704-1338690197.opb>
0.00/0.06 c original problem has 3939 variables (3939 bin, 0 int, 0 impl, 0 cont) and 10412 constraints
0.00/0.06 c problem read
0.00/0.06 c No objective function, only one solution is needed.
0.00/0.06 c presolving settings loaded
0.07/0.08 c presolving:
0.09/0.16 c (round 1) 520 del vars, 652 del conss, 0 add conss, 221 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170882 impls, 0 clqs
0.09/0.17 c (round 2) 522 del vars, 1334 del conss, 0 add conss, 223 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170882 impls, 0 clqs
0.09/0.17 c (round 3) 542 del vars, 1384 del conss, 0 add conss, 243 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170954 impls, 0 clqs
0.09/0.17 c (round 4) 546 del vars, 1390 del conss, 0 add conss, 247 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170954 impls, 0 clqs
0.09/0.17 c (round 5) 552 del vars, 1401 del conss, 0 add conss, 253 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170968 impls, 0 clqs
0.09/0.17 c (round 6) 556 del vars, 1415 del conss, 0 add conss, 257 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 171196 impls, 0 clqs
0.09/0.17 c (round 7) 560 del vars, 1425 del conss, 0 add conss, 261 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 171224 impls, 0 clqs
0.09/0.18 c (round 8) 560 del vars, 1433 del conss, 0 add conss, 261 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 171264 impls, 0 clqs
0.19/0.21 c (round 9) 560 del vars, 1439 del conss, 0 add conss, 261 chg bounds, 336 chg sides, 724 chg coeffs, 8973 upgd conss, 171264 impls, 0 clqs
0.19/0.23 c presolving (10 rounds):
0.19/0.23 c 560 deleted vars, 1439 deleted constraints, 0 added constraints, 261 tightened bounds, 0 added holes, 336 changed sides, 724 changed coefficients
0.19/0.23 c 171264 implications, 0 cliques
0.19/0.23 c presolved problem has 3379 variables (3379 bin, 0 int, 0 impl, 0 cont) and 8973 constraints
0.19/0.23 c 672 constraints of type <knapsack>
0.19/0.23 c 5549 constraints of type <setppc>
0.19/0.23 c 2752 constraints of type <logicor>
0.19/0.23 c transformed objective value is always integral (scale: 1)
0.19/0.23 c Presolving Time: 0.15
0.19/0.23 c - non default parameters ----------------------------------------------------------------------
0.19/0.23 c # SCIP version 2.0.1.5
0.19/0.23 c
0.19/0.23 c # frequency for displaying node information lines
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 100]
0.19/0.23 c display/freq = 10000
0.19/0.23 c
0.19/0.23 c # maximal time in seconds to run
0.19/0.23 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.23 c limits/time = 1797
0.19/0.23 c
0.19/0.23 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.19/0.23 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.23 c limits/memory = 13950
0.19/0.23 c
0.19/0.23 c # solving stops, if the given number of solutions were found (-1: no limit)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.23 c limits/solutions = 1
0.19/0.23 c
0.19/0.23 c # maximal number of separation rounds per node (-1: unlimited)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 5]
0.19/0.23 c separating/maxrounds = 1
0.19/0.23 c
0.19/0.23 c # maximal number of separation rounds in the root node (-1: unlimited)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.23 c separating/maxroundsroot = 5
0.19/0.23 c
0.19/0.23 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.19/0.23 c # [type: int, range: [1,2], default: 1]
0.19/0.23 c timing/clocktype = 2
0.19/0.23 c
0.19/0.23 c # belongs reading time to solving time?
0.19/0.23 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.23 c timing/reading = TRUE
0.19/0.23 c
0.19/0.23 c # should presolving try to simplify inequalities
0.19/0.23 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.23 c constraints/linear/simplifyinequalities = TRUE
0.19/0.23 c
0.19/0.23 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.19/0.23 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.23 c constraints/indicator/addCouplingCons = TRUE
0.19/0.23 c
0.19/0.23 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.19/0.23 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.19/0.23 c constraints/knapsack/disaggregation = FALSE
0.19/0.23 c
0.19/0.23 c # should presolving try to simplify knapsacks
0.19/0.23 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.23 c constraints/knapsack/simplifyinequalities = TRUE
0.19/0.23 c
0.19/0.23 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.23 c presolving/probing/maxrounds = 0
0.19/0.23 c
0.19/0.23 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.23 c heuristics/coefdiving/freq = -1
0.19/0.23 c
0.19/0.23 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.23 c heuristics/coefdiving/maxlpiterquot = 0.075
0.19/0.23 c
0.19/0.23 c # additional number of allowed LP iterations
0.19/0.23 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.23 c heuristics/coefdiving/maxlpiterofs = 1500
0.19/0.23 c
0.19/0.23 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 30]
0.19/0.23 c heuristics/crossover/freq = -1
0.19/0.23 c
0.19/0.23 c # number of nodes added to the contingent of the total nodes
0.19/0.23 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.19/0.23 c heuristics/crossover/nodesofs = 750
0.19/0.23 c
0.19/0.23 c # number of nodes without incumbent change that heuristic should wait
0.19/0.23 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.19/0.23 c heuristics/crossover/nwaitingnodes = 100
0.19/0.23 c
0.19/0.23 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.19/0.23 c # [type: real, range: [0,1], default: 0.1]
0.19/0.23 c heuristics/crossover/nodesquot = 0.15
0.19/0.23 c
0.19/0.23 c # minimum percentage of integer variables that have to be fixed
0.19/0.23 c # [type: real, range: [0,1], default: 0.666]
0.19/0.23 c heuristics/crossover/minfixingrate = 0.5
0.19/0.23 c
0.19/0.23 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.23 c heuristics/feaspump/freq = -1
0.19/0.23 c
0.19/0.23 c # additional number of allowed LP iterations
0.19/0.23 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.23 c heuristics/feaspump/maxlpiterofs = 2000
0.19/0.23 c
0.19/0.23 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.23 c heuristics/fracdiving/freq = -1
0.19/0.23 c
0.19/0.23 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.23 c heuristics/fracdiving/maxlpiterquot = 0.075
0.19/0.23 c
0.19/0.23 c # additional number of allowed LP iterations
0.19/0.23 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.23 c heuristics/fracdiving/maxlpiterofs = 1500
0.19/0.23 c
0.19/0.23 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.23 c heuristics/guideddiving/freq = -1
0.19/0.23 c
0.19/0.23 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.23 c heuristics/guideddiving/maxlpiterquot = 0.075
0.19/0.23 c
0.19/0.23 c # additional number of allowed LP iterations
0.19/0.23 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.23 c heuristics/guideddiving/maxlpiterofs = 1500
0.19/0.23 c
0.19/0.23 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.23 c heuristics/intdiving/maxlpiterquot = 0.075
0.19/0.23 c
0.19/0.23 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.23 c heuristics/intshifting/freq = -1
0.19/0.23 c
0.19/0.23 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.23 c heuristics/linesearchdiving/freq = -1
0.19/0.23 c
0.19/0.23 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.23 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.19/0.23 c
0.19/0.23 c # additional number of allowed LP iterations
0.19/0.23 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.23 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.19/0.23 c
0.19/0.23 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.23 c heuristics/objpscostdiving/freq = -1
0.19/0.23 c
0.19/0.23 c # maximal fraction of diving LP iterations compared to total iteration number
0.19/0.23 c # [type: real, range: [0,1], default: 0.01]
0.19/0.23 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.19/0.23 c
0.19/0.23 c # additional number of allowed LP iterations
0.19/0.23 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.23 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.19/0.23 c
0.19/0.23 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.23 c heuristics/oneopt/freq = -1
0.19/0.23 c
0.19/0.23 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.23 c heuristics/pscostdiving/freq = -1
0.19/0.23 c
0.19/0.23 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.23 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.19/0.23 c
0.19/0.23 c # additional number of allowed LP iterations
0.19/0.23 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.23 c heuristics/pscostdiving/maxlpiterofs = 1500
0.19/0.23 c
0.19/0.23 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.23 c heuristics/rens/freq = -1
0.19/0.23 c
0.19/0.23 c # minimum percentage of integer variables that have to be fixable
0.19/0.23 c # [type: real, range: [0,1], default: 0.5]
0.19/0.23 c heuristics/rens/minfixingrate = 0.3
0.19/0.23 c
0.19/0.23 c # number of nodes added to the contingent of the total nodes
0.19/0.23 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.19/0.23 c heuristics/rens/nodesofs = 2000
0.19/0.23 c
0.19/0.23 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.23 c heuristics/rootsoldiving/freq = -1
0.19/0.23 c
0.19/0.23 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.19/0.23 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.19/0.23 c
0.19/0.23 c # additional number of allowed LP iterations
0.19/0.23 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.23 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.19/0.23 c
0.19/0.23 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.23 c heuristics/rounding/freq = -1
0.19/0.23 c
0.19/0.23 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.23 c heuristics/shiftandpropagate/freq = -1
0.19/0.23 c
0.19/0.23 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.23 c heuristics/shifting/freq = -1
0.19/0.23 c
0.19/0.23 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.23 c heuristics/simplerounding/freq = -1
0.19/0.23 c
0.19/0.23 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.23 c heuristics/subnlp/freq = -1
0.19/0.23 c
0.19/0.23 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.23 c heuristics/trivial/freq = -1
0.19/0.23 c
0.19/0.23 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.23 c heuristics/trysol/freq = -1
0.19/0.23 c
0.19/0.23 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.23 c heuristics/undercover/freq = -1
0.19/0.23 c
0.19/0.23 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.23 c heuristics/veclendiving/freq = -1
0.19/0.23 c
0.19/0.23 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.23 c heuristics/veclendiving/maxlpiterquot = 0.075
0.19/0.23 c
0.19/0.23 c # additional number of allowed LP iterations
0.19/0.23 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.23 c heuristics/veclendiving/maxlpiterofs = 1500
0.19/0.23 c
0.19/0.23 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.23 c heuristics/zirounding/freq = -1
0.19/0.23 c
0.19/0.23 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.23 c separating/cmir/freq = -1
0.19/0.23 c
0.19/0.23 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.23 c separating/flowcover/freq = -1
0.19/0.23 c
0.19/0.23 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.23 c separating/rapidlearning/freq = 0
0.19/0.23 c
0.19/0.23 c -----------------------------------------------------------------------------------------------
0.19/0.23 c start solving
0.19/0.23 c
0.29/0.31 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.31 c 0.3s| 1 | 0 | 1029 | - | 25M| 0 | 752 |3379 |8973 |3379 |8973 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.78/0.88 c 0.9s| 1 | 0 | 2479 | - | 23M| 0 |1156 |3379 |7693 |3379 |7762 | 60 | 0 | 0 | 0.000000e+00 | -- | Inf
1.29/1.36 c 1.4s| 1 | 0 | 3584 | - | 24M| 0 |1150 |3379 |7693 |3379 |7865 | 163 | 0 | 0 | 0.000000e+00 | -- | Inf
2.49/2.53 c 2.5s| 1 | 0 | 4565 | - | 24M| 0 |1267 |3379 |7693 |3379 |7977 | 275 | 0 | 0 | 0.000000e+00 | -- | Inf
3.79/3.88 c 3.9s| 1 | 0 | 5486 | - | 24M| 0 |1242 |3379 |7693 |3379 |8088 | 386 | 0 | 0 | 0.000000e+00 | -- | Inf
4.49/4.51 c 4.5s| 1 | 0 | 6735 | - | 24M| 0 |1315 |3379 |7693 |3379 |8180 | 478 | 0 | 0 | 0.000000e+00 | -- | Inf
7.19/7.20 c 7.2s| 1 | 2 | 6735 | - | 24M| 0 |1315 |3379 |7693 |3379 |8180 | 478 | 0 | 15 | 0.000000e+00 | -- | Inf
7.19/7.20 c (run 1, node 1) restarting after 325 global fixings of integer variables
7.19/7.20 c
7.19/7.21 c (restart) converted 123 cuts from the global cut pool into linear constraints
7.19/7.21 c
7.19/7.21 c presolving:
7.19/7.24 c (round 1) 685 del vars, 92 del conss, 0 add conss, 35 chg bounds, 4 chg sides, 50 chg coeffs, 0 upgd conss, 187917 impls, 12 clqs
7.19/7.25 c (round 2) 850 del vars, 809 del conss, 0 add conss, 35 chg bounds, 4 chg sides, 50 chg coeffs, 0 upgd conss, 190605 impls, 11 clqs
7.19/7.25 c (round 3) 878 del vars, 947 del conss, 0 add conss, 35 chg bounds, 4 chg sides, 50 chg coeffs, 122 upgd conss, 191463 impls, 11 clqs
7.19/7.25 c (round 4) 885 del vars, 986 del conss, 0 add conss, 35 chg bounds, 30 chg sides, 214 chg coeffs, 122 upgd conss, 191533 impls, 11 clqs
7.19/7.26 c (round 5) 891 del vars, 998 del conss, 0 add conss, 35 chg bounds, 30 chg sides, 214 chg coeffs, 122 upgd conss, 191575 impls, 11 clqs
7.19/7.27 c (round 6) 895 del vars, 1004 del conss, 0 add conss, 35 chg bounds, 30 chg sides, 214 chg coeffs, 122 upgd conss, 191847 impls, 11 clqs
7.19/7.28 c (round 7) 895 del vars, 1010 del conss, 0 add conss, 35 chg bounds, 30 chg sides, 214 chg coeffs, 122 upgd conss, 191847 impls, 11 clqs
7.19/7.29 c (round 8) 895 del vars, 1014 del conss, 0 add conss, 35 chg bounds, 30 chg sides, 214 chg coeffs, 122 upgd conss, 191847 impls, 11 clqs
7.29/7.30 c presolving (9 rounds):
7.29/7.30 c 895 deleted vars, 1014 deleted constraints, 0 added constraints, 35 tightened bounds, 0 added holes, 30 changed sides, 214 changed coefficients
7.29/7.30 c 191847 implications, 11 cliques
7.29/7.30 c presolved problem has 2483 variables (2483 bin, 0 int, 0 impl, 0 cont) and 6802 constraints
7.29/7.30 c 732 constraints of type <knapsack>
7.29/7.30 c 3792 constraints of type <setppc>
7.29/7.30 c 2278 constraints of type <logicor>
7.29/7.30 c transformed objective value is always integral (scale: 1)
7.29/7.30 c Presolving Time: 0.24
7.29/7.30 c
7.29/7.35 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
7.29/7.35 c 7.3s| 1 | 0 | 7568 | - | 22M| 0 | 605 |2483 |6802 |2483 |6413 | 0 | 0 | 15 | 0.000000e+00 | -- | Inf
7.39/7.49 c 7.5s| 1 | 0 | 7963 | - | 22M| 0 | 788 |2483 |6802 |2483 |6492 | 79 | 0 | 15 | 0.000000e+00 | -- | Inf
8.19/8.27 c 8.3s| 1 | 2 | 7963 | - | 22M| 0 | 788 |2483 |6802 |2483 |6492 | 79 | 0 | 34 | 0.000000e+00 | -- | Inf
41.79/41.87 c
41.79/41.87 c SCIP Status : problem is solved [infeasible]
41.79/41.87 c Solving Time (sec) : 41.87
41.79/41.87 c Solving Nodes : 868 (total of 869 nodes in 2 runs)
41.79/41.87 c Primal Bound : +1.00000000000000e+20 (0 solutions)
41.79/41.87 c Dual Bound : +1.00000000000000e+20
41.79/41.87 c Gap : 0.00 %
41.79/41.87 s UNSATISFIABLE
41.79/41.87 c SCIP Status : problem is solved [infeasible]
41.79/41.87 c Total Time : 41.87
41.79/41.87 c solving : 41.87
41.79/41.87 c presolving : 0.24 (included in solving)
41.79/41.87 c reading : 0.06 (included in solving)
41.79/41.87 c Original Problem :
41.79/41.87 c Problem name : HOME/instance-3730704-1338690197.opb
41.79/41.87 c Variables : 3939 (3939 binary, 0 integer, 0 implicit integer, 0 continuous)
41.79/41.87 c Constraints : 10412 initial, 10412 maximal
41.79/41.87 c Presolved Problem :
41.79/41.87 c Problem name : t_HOME/instance-3730704-1338690197.opb
41.79/41.87 c Variables : 2483 (2483 binary, 0 integer, 0 implicit integer, 0 continuous)
41.79/41.87 c Constraints : 6802 initial, 6840 maximal
41.79/41.87 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
41.79/41.87 c trivial : 0.00 374 0 0 0 0 0 0 0 0
41.79/41.87 c dualfix : 0.00 3 0 0 0 0 0 0 0 0
41.79/41.87 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
41.79/41.87 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
41.79/41.87 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
41.79/41.87 c implics : 0.02 0 709 0 0 0 0 0 0 0
41.79/41.87 c probing : 0.00 0 0 0 0 0 0 0 0 0
41.79/41.87 c knapsack : 0.01 0 0 0 0 0 1 0 26 164
41.79/41.87 c setppc : 0.03 88 0 0 0 0 798 0 0 0
41.79/41.87 c linear : 0.10 261 5 0 261 0 1440 0 340 774
41.79/41.87 c logicor : 0.06 15 0 0 35 0 214 0 0 0
41.79/41.87 c root node : - 1108 - - 1108 - - - - -
41.79/41.87 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
41.79/41.87 c integral : 0 0 0 683 0 2 0 8 93 0 0 1286
41.79/41.87 c knapsack : 732 6 9158 0 0 0 86 3 379 1201 0 0
41.79/41.87 c setppc : 3792 6 9155 0 0 0 17569 163 39848 0 0 0
41.79/41.87 c logicor : 2278+ 6 7906 0 0 0 14046 255 24071 0 0 0
41.79/41.87 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
41.79/41.87 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
41.79/41.87 c integral : 26.95 0.00 0.00 26.95 0.00 0.00 0.00
41.79/41.87 c knapsack : 0.13 0.01 0.12 0.00 0.00 0.00 0.00
41.79/41.87 c setppc : 0.34 0.00 0.33 0.00 0.00 0.00 0.01
41.79/41.87 c logicor : 0.11 0.00 0.10 0.00 0.00 0.00 0.01
41.79/41.87 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
41.79/41.87 c Propagators : #Propagate #Resprop Cutoffs DomReds
41.79/41.87 c vbounds : 0 0 0 0
41.79/41.87 c rootredcost : 0 0 0 0
41.79/41.87 c pseudoobj : 0 0 0 0
41.79/41.87 c Propagator Timings : TotalTime Propagate Resprop
41.79/41.87 c vbounds : 0.00 0.00 0.00
41.79/41.87 c rootredcost : 0.00 0.00 0.00
41.79/41.87 c pseudoobj : 0.00 0.00 0.00
41.79/41.87 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
41.79/41.87 c propagation : 0.02 421 417 1582 12.3 115 9.5 -
41.79/41.87 c infeasible LP : 0.00 10 10 18 5.0 4 6.2 0
41.79/41.87 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
41.79/41.87 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
41.79/41.87 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
41.79/41.87 c applied globally : - - - 927 9.3 - - -
41.79/41.87 c applied locally : - - - 0 0.0 - - -
41.79/41.87 c Separators : Time Calls Cutoffs DomReds Cuts Conss
41.79/41.87 c cut pool : 0.00 0 - - 0 - (maximal pool size: 209)
41.79/41.87 c redcost : 0.03 656 0 0 0 0
41.79/41.87 c impliedbounds : 0.00 6 0 0 2 0
41.79/41.87 c intobj : 0.00 0 0 0 0 0
41.79/41.87 c gomory : 1.56 6 0 0 2469 0
41.79/41.87 c cgmip : 0.00 0 0 0 0 0
41.79/41.87 c closecuts : 0.00 0 0 0 0 0
41.79/41.87 c strongcg : 1.34 6 0 0 2591 0
41.79/41.87 c cmir : 0.00 0 0 0 0 0
41.79/41.87 c flowcover : 0.00 0 0 0 0 0
41.79/41.87 c clique : 0.16 6 0 0 41 0
41.79/41.87 c zerohalf : 0.00 0 0 0 0 0
41.79/41.87 c mcf : 0.01 2 0 0 0 0
41.79/41.87 c oddcycle : 0.00 0 0 0 0 0
41.79/41.87 c rapidlearning : 0.26 1 0 325 0 0
41.79/41.87 c Pricers : Time Calls Vars
41.79/41.87 c problem variables: 0.00 0 0
41.79/41.87 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
41.79/41.87 c relpscost : 26.95 683 8 93 0 0 1286
41.79/41.87 c pscost : 0.00 0 0 0 0 0 0
41.79/41.87 c inference : 0.00 0 0 0 0 0 0
41.79/41.87 c mostinf : 0.00 0 0 0 0 0 0
41.79/41.87 c leastinf : 0.00 0 0 0 0 0 0
41.79/41.87 c fullstrong : 0.00 0 0 0 0 0 0
41.79/41.87 c allfullstrong : 0.00 0 0 0 0 0 0
41.79/41.87 c random : 0.00 0 0 0 0 0 0
41.79/41.87 c Primal Heuristics : Time Calls Found
41.79/41.87 c LP solutions : 0.00 - 0
41.79/41.87 c pseudo solutions : 0.00 - 0
41.79/41.87 c trivial : 0.00 1 0
41.79/41.87 c shiftandpropagate: 0.00 0 0
41.79/41.87 c simplerounding : 0.00 0 0
41.79/41.87 c zirounding : 0.00 0 0
41.79/41.87 c rounding : 0.00 0 0
41.79/41.87 c shifting : 0.00 0 0
41.79/41.87 c intshifting : 0.00 0 0
41.79/41.87 c oneopt : 0.00 0 0
41.79/41.87 c twoopt : 0.00 0 0
41.79/41.87 c fixandinfer : 0.00 0 0
41.79/41.87 c feaspump : 0.00 0 0
41.79/41.87 c clique : 0.00 0 0
41.79/41.87 c coefdiving : 0.00 0 0
41.79/41.87 c pscostdiving : 0.00 0 0
41.79/41.87 c fracdiving : 0.00 0 0
41.79/41.87 c veclendiving : 0.00 0 0
41.79/41.87 c intdiving : 0.00 0 0
41.79/41.87 c actconsdiving : 0.00 0 0
41.79/41.87 c objpscostdiving : 0.00 0 0
41.79/41.87 c rootsoldiving : 0.00 0 0
41.79/41.87 c linesearchdiving : 0.00 0 0
41.79/41.87 c guideddiving : 0.00 0 0
41.79/41.87 c octane : 0.00 0 0
41.79/41.87 c rens : 0.00 0 0
41.79/41.87 c rins : 0.00 0 0
41.79/41.87 c localbranching : 0.00 0 0
41.79/41.87 c mutation : 0.00 0 0
41.79/41.87 c crossover : 0.00 0 0
41.79/41.87 c dins : 0.00 0 0
41.79/41.87 c vbounds : 0.00 0 0
41.79/41.87 c undercover : 0.00 0 0
41.79/41.87 c subnlp : 0.00 0 0
41.79/41.87 c trysol : 0.00 0 0
41.79/41.87 c LP : Time Calls Iterations Iter/call Iter/sec
41.79/41.87 c primal LP : 0.01 0 0 0.00 -
41.79/41.87 c dual LP : 9.69 699 65648 93.92 6776.24
41.79/41.87 c lex dual LP : 0.00 0 0 0.00 -
41.79/41.87 c barrier LP : 0.00 0 0 0.00 -
41.79/41.87 c diving/probing LP: 0.00 0 0 0.00 -
41.79/41.87 c strong branching : 26.83 1249 150120 120.19 5594.92
41.79/41.87 c (at root node) : - 34 16156 475.18 -
41.79/41.87 c conflict analysis: 0.00 0 0 0.00 -
41.79/41.87 c B&B Tree :
41.79/41.87 c number of runs : 2
41.79/41.87 c nodes : 868
41.79/41.87 c nodes (total) : 869
41.79/41.87 c nodes left : 0
41.79/41.87 c max depth : 67
41.79/41.87 c max depth (total): 67
41.79/41.87 c backtracks : 228 (26.3%)
41.79/41.87 c delayed cutoffs : 417
41.79/41.87 c repropagations : 903 (22854 domain reductions, 213 cutoffs)
41.79/41.87 c avg switch length: 3.41
41.79/41.87 c switching time : 0.21
41.79/41.87 c Solution :
41.79/41.87 c Solutions found : 0 (0 improvements)
41.79/41.87 c Primal Bound : infeasible
41.79/41.87 c Dual Bound : -
41.79/41.87 c Gap : 0.00 %
41.79/41.87 c Root Dual Bound : +0.00000000000000e+00
41.79/41.87 c Root Iterations : 7963
41.88/41.90 c Time complete: 41.89.