0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2704258-1278550305.opb>
0.10/0.19 c original problem has 3939 variables (3939 bin, 0 int, 0 impl, 0 cont) and 10412 constraints
0.10/0.19 c problem read
0.10/0.19 c No objective function, only one solution is needed.
0.10/0.19 c presolving settings loaded
0.19/0.25 c presolving:
0.39/0.43 c (round 1) 520 del vars, 652 del conss, 221 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170882 impls, 0 clqs
0.39/0.45 c (round 2) 522 del vars, 1334 del conss, 223 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170882 impls, 0 clqs
0.39/0.46 c (round 3) 542 del vars, 1384 del conss, 243 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170954 impls, 0 clqs
0.39/0.46 c (round 4) 546 del vars, 1390 del conss, 247 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170954 impls, 0 clqs
0.39/0.47 c (round 5) 552 del vars, 1401 del conss, 253 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170968 impls, 0 clqs
0.39/0.48 c (round 6) 556 del vars, 1415 del conss, 257 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 171196 impls, 0 clqs
0.39/0.48 c (round 7) 560 del vars, 1425 del conss, 261 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 171224 impls, 0 clqs
0.39/0.49 c (round 8) 560 del vars, 1433 del conss, 261 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 171264 impls, 0 clqs
0.49/0.58 c (round 9) 560 del vars, 1439 del conss, 261 chg bounds, 336 chg sides, 724 chg coeffs, 8973 upgd conss, 171264 impls, 0 clqs
0.59/0.62 c presolving (10 rounds):
0.59/0.62 c 560 deleted vars, 1439 deleted constraints, 261 tightened bounds, 0 added holes, 336 changed sides, 724 changed coefficients
0.59/0.62 c 171264 implications, 0 cliques
0.59/0.62 c presolved problem has 3379 variables (3379 bin, 0 int, 0 impl, 0 cont) and 8973 constraints
0.59/0.62 c 672 constraints of type <knapsack>
0.59/0.62 c 5549 constraints of type <setppc>
0.59/0.62 c 2752 constraints of type <logicor>
0.59/0.62 c transformed objective value is always integral (scale: 1)
0.59/0.62 c Presolving Time: 0.40
0.59/0.62 c - non default parameters ----------------------------------------------------------------------
0.59/0.62 c # SCIP version 1.2.1.3
0.59/0.62 c
0.59/0.62 c # frequency for displaying node information lines
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 100]
0.59/0.62 c display/freq = 10000
0.59/0.62 c
0.59/0.62 c # maximal time in seconds to run
0.59/0.62 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.62 c limits/time = 1789.82
0.59/0.62 c
0.59/0.62 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.59/0.62 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.62 c limits/memory = 1620
0.59/0.62 c
0.59/0.62 c # solving stops, if the given number of solutions were found (-1: no limit)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.62 c limits/solutions = 1
0.59/0.62 c
0.59/0.62 c # maximal number of separation rounds per node (-1: unlimited)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 5]
0.59/0.62 c separating/maxrounds = 1
0.59/0.62 c
0.59/0.62 c # maximal number of separation rounds in the root node (-1: unlimited)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.62 c separating/maxroundsroot = 5
0.59/0.62 c
0.59/0.62 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.59/0.62 c # [type: int, range: [1,2], default: 1]
0.59/0.62 c timing/clocktype = 2
0.59/0.62 c
0.59/0.62 c # should presolving try to simplify inequalities
0.59/0.62 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.62 c constraints/linear/simplifyinequalities = TRUE
0.59/0.62 c
0.59/0.62 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.59/0.62 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.62 c constraints/indicator/addCouplingCons = TRUE
0.59/0.62 c
0.59/0.62 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.59/0.62 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.59/0.62 c constraints/knapsack/disaggregation = FALSE
0.59/0.62 c
0.59/0.62 c # should presolving try to simplify knapsacks
0.59/0.62 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.62 c constraints/knapsack/simplifyinequalities = TRUE
0.59/0.62 c
0.59/0.62 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.62 c presolving/probing/maxrounds = 0
0.59/0.62 c
0.59/0.62 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.62 c heuristics/coefdiving/freq = -1
0.59/0.62 c
0.59/0.62 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.62 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.62 c heuristics/coefdiving/maxlpiterquot = 0.075
0.59/0.62 c
0.59/0.62 c # additional number of allowed LP iterations
0.59/0.62 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.62 c heuristics/coefdiving/maxlpiterofs = 1500
0.59/0.62 c
0.59/0.62 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 30]
0.59/0.62 c heuristics/crossover/freq = -1
0.59/0.62 c
0.59/0.62 c # number of nodes added to the contingent of the total nodes
0.59/0.62 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.59/0.62 c heuristics/crossover/nodesofs = 750
0.59/0.62 c
0.59/0.62 c # number of nodes without incumbent change that heuristic should wait
0.59/0.62 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.59/0.62 c heuristics/crossover/nwaitingnodes = 100
0.59/0.62 c
0.59/0.62 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.59/0.62 c # [type: real, range: [0,1], default: 0.1]
0.59/0.62 c heuristics/crossover/nodesquot = 0.15
0.59/0.62 c
0.59/0.62 c # minimum percentage of integer variables that have to be fixed
0.59/0.62 c # [type: real, range: [0,1], default: 0.666]
0.59/0.62 c heuristics/crossover/minfixingrate = 0.5
0.59/0.62 c
0.59/0.62 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.62 c heuristics/feaspump/freq = -1
0.59/0.62 c
0.59/0.62 c # additional number of allowed LP iterations
0.59/0.62 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.62 c heuristics/feaspump/maxlpiterofs = 2000
0.59/0.62 c
0.59/0.62 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.62 c heuristics/fracdiving/freq = -1
0.59/0.62 c
0.59/0.62 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.62 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.62 c heuristics/fracdiving/maxlpiterquot = 0.075
0.59/0.62 c
0.59/0.62 c # additional number of allowed LP iterations
0.59/0.62 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.62 c heuristics/fracdiving/maxlpiterofs = 1500
0.59/0.62 c
0.59/0.62 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.62 c heuristics/guideddiving/freq = -1
0.59/0.62 c
0.59/0.62 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.62 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.62 c heuristics/guideddiving/maxlpiterquot = 0.075
0.59/0.62 c
0.59/0.62 c # additional number of allowed LP iterations
0.59/0.62 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.62 c heuristics/guideddiving/maxlpiterofs = 1500
0.59/0.62 c
0.59/0.62 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.62 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.62 c heuristics/intdiving/maxlpiterquot = 0.075
0.59/0.62 c
0.59/0.62 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.62 c heuristics/intshifting/freq = -1
0.59/0.62 c
0.59/0.62 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.63 c heuristics/linesearchdiving/freq = -1
0.59/0.63 c
0.59/0.63 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.63 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.59/0.63 c
0.59/0.63 c # additional number of allowed LP iterations
0.59/0.63 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.63 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.59/0.63 c
0.59/0.63 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.63 c heuristics/nlp/freq = -1
0.59/0.63 c
0.59/0.63 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.63 c heuristics/objpscostdiving/freq = -1
0.59/0.63 c
0.59/0.63 c # maximal fraction of diving LP iterations compared to total iteration number
0.59/0.63 c # [type: real, range: [0,1], default: 0.01]
0.59/0.63 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.59/0.63 c
0.59/0.63 c # additional number of allowed LP iterations
0.59/0.63 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.63 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.59/0.63 c
0.59/0.63 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.63 c heuristics/oneopt/freq = -1
0.59/0.63 c
0.59/0.63 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.63 c heuristics/pscostdiving/freq = -1
0.59/0.63 c
0.59/0.63 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.63 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.59/0.63 c
0.59/0.63 c # additional number of allowed LP iterations
0.59/0.63 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.63 c heuristics/pscostdiving/maxlpiterofs = 1500
0.59/0.63 c
0.59/0.63 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.63 c heuristics/rens/freq = -1
0.59/0.63 c
0.59/0.63 c # minimum percentage of integer variables that have to be fixable
0.59/0.63 c # [type: real, range: [0,1], default: 0.5]
0.59/0.63 c heuristics/rens/minfixingrate = 0.3
0.59/0.63 c
0.59/0.63 c # number of nodes added to the contingent of the total nodes
0.59/0.63 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.59/0.63 c heuristics/rens/nodesofs = 2000
0.59/0.63 c
0.59/0.63 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.63 c heuristics/rootsoldiving/freq = -1
0.59/0.63 c
0.59/0.63 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.59/0.63 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.59/0.63 c
0.59/0.63 c # additional number of allowed LP iterations
0.59/0.63 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.63 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.59/0.63 c
0.59/0.63 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.63 c heuristics/rounding/freq = -1
0.59/0.63 c
0.59/0.63 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.63 c heuristics/shifting/freq = -1
0.59/0.63 c
0.59/0.63 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.63 c heuristics/simplerounding/freq = -1
0.59/0.63 c
0.59/0.63 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.63 c heuristics/trivial/freq = -1
0.59/0.63 c
0.59/0.63 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.63 c heuristics/trysol/freq = -1
0.59/0.63 c
0.59/0.63 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.63 c heuristics/veclendiving/freq = -1
0.59/0.63 c
0.59/0.63 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.63 c heuristics/veclendiving/maxlpiterquot = 0.075
0.59/0.63 c
0.59/0.63 c # additional number of allowed LP iterations
0.59/0.63 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.63 c heuristics/veclendiving/maxlpiterofs = 1500
0.59/0.63 c
0.59/0.63 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.63 c heuristics/zirounding/freq = -1
0.59/0.63 c
0.59/0.63 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.63 c separating/cmir/freq = -1
0.59/0.63 c
0.59/0.63 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.63 c separating/flowcover/freq = -1
0.59/0.63 c
0.59/0.63 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.63 c separating/rapidlearning/freq = 0
0.59/0.63 c
0.59/0.63 c -----------------------------------------------------------------------------------------------
0.59/0.63 c start solving
0.59/0.63 c
0.80/0.89 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.80/0.89 c 0.7s| 1 | 0 | 1155 | - | 24M| 0 | 876 |3379 |8973 |3379 |8973 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
4.79/4.87 c 4.7s| 1 | 0 | 2205 | - | 25M| 0 |1052 |3379 |9439 |3379 |9093 | 138 | 0 | 0 | 0.000000e+00 | -- | Inf
6.40/6.44 c 6.2s| 1 | 0 | 2951 | - | 26M| 0 |1189 |3379 |9439 |3379 |9200 | 245 | 0 | 0 | 0.000000e+00 | -- | Inf
9.39/9.42 c 9.2s| 1 | 0 | 4273 | - | 26M| 0 |1225 |3379 |9439 |3379 |9319 | 364 | 0 | 0 | 0.000000e+00 | -- | Inf
13.59/13.62 c 13.4s| 1 | 0 | 5528 | - | 26M| 0 |1367 |3379 |9439 |3379 |9412 | 457 | 0 | 0 | 0.000000e+00 | -- | Inf
19.58/19.69 c 19.5s| 1 | 0 | 7524 | - | 26M| 0 |1361 |3379 |9439 |3379 |9514 | 559 | 0 | 0 | 0.000000e+00 | -- | Inf
47.67/47.71 c 47.5s| 1 | 2 | 7524 | - | 26M| 0 |1361 |3379 |9439 |3379 |9514 | 559 | 0 | 29 | 0.000000e+00 | -- | Inf
306.11/306.21 c
306.11/306.21 c SCIP Status : problem is solved [infeasible]
306.11/306.21 c Solving Time (sec) : 306.02
306.11/306.21 c Solving Nodes : 498
306.11/306.21 c Primal Bound : +1.00000000000000e+20 (0 solutions)
306.11/306.21 c Dual Bound : +1.00000000000000e+20
306.11/306.21 c Gap : 0.00 %
306.11/306.21 s UNSATISFIABLE
306.11/306.21 c SCIP Status : problem is solved [infeasible]
306.11/306.21 c Solving Time : 306.02
306.11/306.21 c Original Problem :
306.11/306.21 c Problem name : HOME/instance-2704258-1278550305.opb
306.11/306.21 c Variables : 3939 (3939 binary, 0 integer, 0 implicit integer, 0 continuous)
306.11/306.21 c Constraints : 10412 initial, 10412 maximal
306.11/306.21 c Presolved Problem :
306.11/306.21 c Problem name : t_HOME/instance-2704258-1278550305.opb
306.11/306.21 c Variables : 3379 (3379 binary, 0 integer, 0 implicit integer, 0 continuous)
306.11/306.21 c Constraints : 8973 initial, 9692 maximal
306.11/306.21 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
306.11/306.21 c trivial : 0.00 0 0 0 0 0 0 0 0
306.11/306.21 c dualfix : 0.00 0 0 0 0 0 0 0 0
306.11/306.21 c boundshift : 0.00 0 0 0 0 0 0 0 0
306.11/306.21 c inttobinary : 0.00 0 0 0 0 0 0 0 0
306.11/306.21 c implics : 0.04 0 294 0 0 0 0 0 0
306.11/306.21 c probing : 0.00 0 0 0 0 0 0 0 0
306.11/306.21 c knapsack : 0.01 0 0 0 0 0 0 0 0
306.11/306.21 c setppc : 0.02 0 0 0 0 0 0 0 0
306.11/306.21 c linear : 0.25 261 5 0 261 0 1439 336 724
306.11/306.21 c logicor : 0.03 0 0 0 0 0 0 0 0
306.11/306.21 c root node : - 1271 - - 1271 - - - -
306.11/306.21 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
306.11/306.21 c integral : 0 0 0 358 0 0 20 0 0 696
306.11/306.21 c knapsack : 672 6 6065 0 0 0 0 1202 0 0
306.11/306.21 c setppc : 5549 6 6065 0 0 75 40880 0 0 0
306.11/306.21 c linear : 0+ 5 5989 0 0 44 1257 16 0 0
306.11/306.21 c logicor : 2752+ 6 5382 0 0 132 20860 0 0 0
306.11/306.21 c countsols : 0 0 0 0 0 0 0 0 0 0
306.11/306.21 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
306.11/306.21 c integral : 189.62 0.00 0.00 189.62 0.00
306.11/306.21 c knapsack : 0.19 0.04 0.15 0.00 0.00
306.11/306.21 c setppc : 0.91 0.01 0.91 0.00 0.00
306.11/306.21 c linear : 0.49 0.01 0.48 0.00 0.00
306.11/306.21 c logicor : 0.31 0.00 0.30 0.00 0.00
306.11/306.21 c countsols : 0.00 0.00 0.00 0.00 0.00
306.11/306.21 c Propagators : Time Calls Cutoffs DomReds
306.11/306.21 c vbounds : 0.00 1 0 0
306.11/306.21 c rootredcost : 0.00 0 0 0
306.11/306.21 c pseudoobj : 0.00 0 0 0
306.11/306.21 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
306.11/306.21 c propagation : 0.11 251 230 1152 39.1 25 19.3 -
306.11/306.21 c infeasible LP : 0.02 11 11 20 5.8 7 16.0 0
306.11/306.21 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
306.11/306.21 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
306.11/306.21 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
306.11/306.21 c applied globally : - - - 615 31.3 - - -
306.11/306.21 c applied locally : - - - 0 0.0 - - -
306.11/306.21 c Separators : Time Calls Cutoffs DomReds Cuts Conss
306.11/306.21 c cut pool : 0.00 4 - - 124 - (maximal pool size: 1280)
306.11/306.21 c redcost : 0.10 352 0 0 0 0
306.11/306.21 c impliedbounds : 0.02 5 0 0 0 0
306.11/306.21 c intobj : 0.00 0 0 0 0 0
306.11/306.21 c cgmip : 0.00 0 0 0 0 0
306.11/306.21 c gomory : 5.44 5 0 0 1550 0
306.11/306.21 c strongcg : 4.03 5 0 0 1771 0
306.11/306.21 c cmir : 0.00 0 0 0 0 0
306.11/306.21 c flowcover : 0.00 0 0 0 0 0
306.11/306.21 c clique : 0.24 5 0 0 38 0
306.11/306.21 c zerohalf : 0.00 0 0 0 0 0
306.11/306.21 c mcf : 0.02 1 0 0 0 0
306.11/306.21 c rapidlearning : 2.48 1 0 6 0 484
306.11/306.21 c Pricers : Time Calls Vars
306.11/306.21 c problem variables: 0.00 0 0
306.11/306.21 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
306.11/306.21 c relpscost : 189.62 358 0 20 0 0 696
306.11/306.21 c pscost : 0.00 0 0 0 0 0 0
306.11/306.21 c inference : 0.00 0 0 0 0 0 0
306.11/306.21 c mostinf : 0.00 0 0 0 0 0 0
306.11/306.21 c leastinf : 0.00 0 0 0 0 0 0
306.11/306.21 c fullstrong : 0.00 0 0 0 0 0 0
306.11/306.21 c allfullstrong : 0.00 0 0 0 0 0 0
306.11/306.21 c random : 0.00 0 0 0 0 0 0
306.11/306.21 c Primal Heuristics : Time Calls Found
306.11/306.21 c LP solutions : 0.00 - 0
306.11/306.21 c pseudo solutions : 0.00 - 0
306.11/306.21 c trivial : 0.01 1 0
306.11/306.21 c simplerounding : 0.00 0 0
306.11/306.21 c zirounding : 0.00 0 0
306.11/306.21 c rounding : 0.00 0 0
306.11/306.21 c shifting : 0.00 0 0
306.11/306.21 c intshifting : 0.00 0 0
306.11/306.21 c oneopt : 0.00 0 0
306.11/306.21 c twoopt : 0.00 0 0
306.11/306.21 c fixandinfer : 0.00 0 0
306.11/306.21 c feaspump : 0.00 0 0
306.11/306.21 c coefdiving : 0.00 0 0
306.11/306.21 c pscostdiving : 0.00 0 0
306.11/306.21 c fracdiving : 0.00 0 0
306.11/306.21 c veclendiving : 0.00 0 0
306.11/306.21 c intdiving : 0.00 0 0
306.11/306.21 c actconsdiving : 0.00 0 0
306.11/306.21 c objpscostdiving : 0.00 0 0
306.11/306.21 c rootsoldiving : 0.00 0 0
306.11/306.21 c linesearchdiving : 0.00 0 0
306.11/306.21 c guideddiving : 0.00 0 0
306.11/306.21 c octane : 0.00 0 0
306.11/306.21 c rens : 0.00 0 0
306.11/306.21 c rins : 0.00 0 0
306.11/306.21 c localbranching : 0.00 0 0
306.11/306.21 c mutation : 0.00 0 0
306.11/306.21 c crossover : 0.00 0 0
306.11/306.21 c dins : 0.00 0 0
306.11/306.21 c undercover : 0.00 0 0
306.11/306.21 c nlp : 0.00 0 0
306.11/306.21 c trysol : 0.00 0 0
306.11/306.21 c LP : Time Calls Iterations Iter/call Iter/sec
306.11/306.21 c primal LP : 0.01 0 0 0.00 -
306.11/306.21 c dual LP : 98.94 374 97915 261.80 989.64
306.11/306.21 c lex dual LP : 0.00 0 0 0.00 -
306.11/306.21 c barrier LP : 0.00 0 0 0.00 -
306.11/306.21 c diving/probing LP: 0.00 0 0 0.00 -
306.11/306.21 c strong branching : 189.43 334 169132 506.38 892.86
306.11/306.21 c (at root node) : - 29 19807 683.00 -
306.11/306.21 c conflict analysis: 0.00 0 0 0.00 -
306.11/306.21 c B&B Tree :
306.11/306.21 c number of runs : 1
306.11/306.21 c nodes : 498
306.11/306.21 c nodes (total) : 498
306.11/306.21 c nodes left : 0
306.11/306.21 c max depth : 28
306.11/306.21 c max depth (total): 28
306.11/306.21 c backtracks : 120 (24.1%)
306.11/306.21 c delayed cutoffs : 199
306.11/306.21 c repropagations : 486 (21441 domain reductions, 112 cutoffs)
306.11/306.21 c avg switch length: 3.35
306.11/306.21 c switching time : 0.64
306.11/306.21 c Solution :
306.11/306.21 c Solutions found : 0 (0 improvements)
306.11/306.21 c Primal Bound : infeasible
306.11/306.21 c Dual Bound : -
306.11/306.21 c Gap : 0.00 %
306.11/306.21 c Root Dual Bound : +0.00000000000000e+00
306.11/306.21 c Root Iterations : 7524
306.11/306.28 c Time complete: 306.19.