0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [Expressions interpreter: NONE]
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-2665989-1276335521.opb>
0.19/0.20 c original problem has 3939 variables (3939 bin, 0 int, 0 impl, 0 cont) and 10412 constraints
0.19/0.20 c problem read
0.19/0.20 c No objective function, only one solution is needed.
0.19/0.20 c presolving settings loaded
0.19/0.26 c presolving:
0.39/0.45 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.47 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.48 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.50 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.49/0.51 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.49/0.52 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.49/0.53 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.49/0.54 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.59/0.66 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.69/0.70 c presolving (10 rounds):
0.69/0.70 c 560 deleted vars, 1439 deleted constraints, 261 tightened bounds, 0 added holes, 336 changed sides, 724 changed coefficients
0.69/0.70 c 171264 implications, 0 cliques
0.69/0.70 c presolved problem has 3379 variables (3379 bin, 0 int, 0 impl, 0 cont) and 8973 constraints
0.69/0.70 c 672 constraints of type <knapsack>
0.69/0.70 c 8301 constraints of type <logicor>
0.69/0.70 c transformed objective value is always integral (scale: 1)
0.69/0.70 c Presolving Time: 0.36
0.69/0.70 c - non default parameters ----------------------------------------------------------------------
0.69/0.70 c # SCIP version 1.2.1.2
0.69/0.70 c
0.69/0.70 c # frequency for displaying node information lines
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 100]
0.69/0.70 c display/freq = 10000
0.69/0.70 c
0.69/0.70 c # maximal time in seconds to run
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.70 c limits/time = 1799.8
0.69/0.70 c
0.69/0.70 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.70 c limits/memory = 1620
0.69/0.70 c
0.69/0.70 c # solving stops, if the given number of solutions were found (-1: no limit)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.70 c limits/solutions = 1
0.69/0.70 c
0.69/0.70 c # maximal number of separation rounds per node (-1: unlimited)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 5]
0.69/0.70 c separating/maxrounds = 1
0.69/0.70 c
0.69/0.70 c # maximal number of separation rounds in the root node (-1: unlimited)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.70 c separating/maxroundsroot = 5
0.69/0.70 c
0.69/0.70 c # should presolving try to simplify inequalities
0.69/0.70 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.70 c constraints/linear/simplifyinequalities = TRUE
0.69/0.70 c
0.69/0.70 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.69/0.70 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.69/0.70 c constraints/knapsack/disaggregation = FALSE
0.69/0.70 c
0.69/0.70 c # should presolving try to simplify knapsacks
0.69/0.70 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.70 c constraints/knapsack/simplifyinequalities = TRUE
0.69/0.70 c
0.69/0.70 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.70 c presolving/probing/maxrounds = 0
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/coefdiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/coefdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/coefdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 30]
0.69/0.70 c heuristics/crossover/freq = -1
0.69/0.70 c
0.69/0.70 c # number of nodes added to the contingent of the total nodes
0.69/0.70 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.69/0.70 c heuristics/crossover/nodesofs = 750
0.69/0.70 c
0.69/0.70 c # number of nodes without incumbent change that heuristic should wait
0.69/0.70 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.69/0.70 c heuristics/crossover/nwaitingnodes = 100
0.69/0.70 c
0.69/0.70 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.69/0.70 c # [type: real, range: [0,1], default: 0.1]
0.69/0.70 c heuristics/crossover/nodesquot = 0.15
0.69/0.70 c
0.69/0.70 c # minimum percentage of integer variables that have to be fixed
0.69/0.70 c # [type: real, range: [0,1], default: 0.666]
0.69/0.70 c heuristics/crossover/minfixingrate = 0.5
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.70 c heuristics/feaspump/freq = -1
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/feaspump/maxlpiterofs = 2000
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/fracdiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/fracdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/fracdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/guideddiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/guideddiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/guideddiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/intdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/intshifting/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/linesearchdiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/nlp/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.70 c heuristics/objpscostdiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to total iteration number
0.69/0.70 c # [type: real, range: [0,1], default: 0.01]
0.69/0.70 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/oneopt/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/pscostdiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/pscostdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.70 c heuristics/rens/freq = -1
0.69/0.70 c
0.69/0.70 c # minimum percentage of integer variables that have to be fixable
0.69/0.70 c # [type: real, range: [0,1], default: 0.5]
0.69/0.70 c heuristics/rens/minfixingrate = 0.3
0.69/0.70 c
0.69/0.70 c # number of nodes added to the contingent of the total nodes
0.69/0.70 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.69/0.70 c heuristics/rens/nodesofs = 2000
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.70 c heuristics/rootsoldiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.69/0.70 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/rounding/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/shifting/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/simplerounding/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.70 c heuristics/trivial/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/trysol/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/veclendiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/veclendiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/veclendiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/zirounding/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.70 c separating/cmir/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.70 c separating/flowcover/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.70 c separating/rapidlearning/freq = 0
0.69/0.70 c
0.69/0.70 c -----------------------------------------------------------------------------------------------
0.69/0.70 c start solving
0.69/0.71 c
0.79/0.86 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.79/0.86 c 0.5s| 1 | 0 | 880 | - | 24M| 0 | 714 |3379 |8973 |3379 |8973 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.69/2.78 c 2.3s| 1 | 0 | 1342 | - | 25M| 0 | 910 |3379 |9361 |3379 |9058 | 103 | 0 | 0 | 0.000000e+00 | -- | Inf
3.59/3.65 c 3.1s| 1 | 0 | 2289 | - | 26M| 0 |1325 |3379 |9361 |3379 |9140 | 185 | 0 | 0 | 0.000000e+00 | -- | Inf
8.19/8.21 c 7.7s| 1 | 0 | 3400 | - | 26M| 0 |1703 |3379 |9361 |3379 |9202 | 247 | 0 | 0 | 0.000000e+00 | -- | Inf
14.59/14.60 c 14.0s| 1 | 0 | 5047 | - | 26M| 0 |2060 |3379 |9361 |3379 |9317 | 362 | 0 | 0 | 0.000000e+00 | -- | Inf
21.78/21.86 c 21.2s| 1 | 0 | 6472 | - | 26M| 0 |1942 |3379 |9361 |3379 |9430 | 475 | 0 | 0 | 0.000000e+00 | -- | Inf
35.97/36.08 c 35.4s| 1 | 2 | 6472 | - | 26M| 0 |1942 |3379 |9361 |3379 |9430 | 475 | 0 | 12 | 0.000000e+00 | -- | Inf
316.38/316.54 c
316.38/316.54 c SCIP Status : problem is solved [infeasible]
316.38/316.54 c Solving Time (sec) : 314.49
316.38/316.54 c Solving Nodes : 654
316.38/316.54 c Primal Bound : +1.00000000000000e+20 (0 solutions)
316.38/316.54 c Dual Bound : +1.00000000000000e+20
316.38/316.54 c Gap : 0.00 %
316.38/316.54 s UNSATISFIABLE
316.38/316.54 c SCIP Status : problem is solved [infeasible]
316.38/316.54 c Solving Time : 314.49
316.38/316.54 c Original Problem :
316.38/316.54 c Problem name : HOME/instance-2665989-1276335521.opb
316.38/316.54 c Variables : 3939 (3939 binary, 0 integer, 0 implicit integer, 0 continuous)
316.38/316.54 c Constraints : 10412 initial, 10412 maximal
316.38/316.54 c Presolved Problem :
316.38/316.54 c Problem name : t_HOME/instance-2665989-1276335521.opb
316.38/316.54 c Variables : 3379 (3379 binary, 0 integer, 0 implicit integer, 0 continuous)
316.38/316.54 c Constraints : 8973 initial, 9855 maximal
316.38/316.54 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
316.38/316.54 c trivial : 0.01 0 0 0 0 0 0 0 0
316.38/316.54 c dualfix : 0.00 0 0 0 0 0 0 0 0
316.38/316.54 c boundshift : 0.00 0 0 0 0 0 0 0 0
316.38/316.54 c inttobinary : 0.00 0 0 0 0 0 0 0 0
316.38/316.54 c implics : 0.02 0 294 0 0 0 0 0 0
316.38/316.54 c probing : 0.00 0 0 0 0 0 0 0 0
316.38/316.54 c knapsack : 0.01 0 0 0 0 0 0 0 0
316.38/316.54 c linear : 0.23 261 5 0 261 0 1439 336 724
316.38/316.54 c logicor : 0.05 0 0 0 0 0 0 0 0
316.38/316.54 c root node : - 109 - - 109 - - - -
316.38/316.54 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
316.38/316.55 c integral : 0 0 0 447 0 1 35 0 0 872
316.38/316.55 c knapsack : 672 6 11564 0 0 0 0 1202 0 0
316.38/316.55 c linear : 0+ 5 11563 0 0 12 958 16 0 0
316.38/316.55 c logicor : 8301+ 6 11239 0 0 347 84730 0 0 0
316.38/316.55 c countsols : 0 0 0 0 0 0 0 0 0 0
316.38/316.55 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
316.38/316.55 c integral : 190.47 0.00 0.00 190.47 0.00
316.38/316.55 c knapsack : 0.29 0.06 0.23 0.00 0.00
316.38/316.55 c linear : 0.34 0.00 0.34 0.00 0.00
316.38/316.55 c logicor : 0.91 0.00 0.91 0.00 0.00
316.38/316.55 c countsols : 0.00 0.00 0.00 0.00 0.00
316.38/316.55 c Propagators : Time Calls Cutoffs DomReds
316.38/316.55 c vbounds : 0.00 1 0 0
316.38/316.55 c rootredcost : 0.02 0 0 0
316.38/316.55 c pseudoobj : 0.00 0 0 0
316.38/316.55 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
316.38/316.55 c propagation : 0.22 359 319 1650 58.5 72 25.3 -
316.38/316.55 c infeasible LP : 0.02 6 6 14 5.6 1 5.0 0
316.38/316.55 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
316.38/316.55 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
316.38/316.55 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
316.38/316.55 c applied globally : - - - 848 38.9 - - -
316.38/316.55 c applied locally : - - - 0 0.0 - - -
316.38/316.55 c Separators : Time Calls Cutoffs DomReds Cuts Conss
316.38/316.55 c cut pool : 0.00 4 - - 78 - (maximal pool size: 855)
316.38/316.55 c redcost : 0.07 443 0 0 0 0
316.38/316.55 c impliedbounds : 0.00 5 0 0 0 0
316.38/316.55 c intobj : 0.00 0 0 0 0 0
316.38/316.55 c cgmip : 0.00 0 0 0 0 0
316.38/316.55 c gomory : 7.05 5 0 0 1468 0
316.38/316.55 c strongcg : 5.70 5 0 0 1652 0
316.38/316.55 c cmir : 0.00 0 0 0 0 0
316.38/316.55 c flowcover : 0.00 0 0 0 0 0
316.38/316.55 c clique : 0.29 5 0 0 40 0
316.38/316.55 c zerohalf : 0.00 0 0 0 0 0
316.38/316.55 c mcf : 0.05 1 0 0 0 0
316.38/316.55 c rapidlearning : 1.26 1 0 6 0 394
316.38/316.55 c Pricers : Time Calls Vars
316.38/316.55 c problem variables: 0.00 0 0
316.38/316.55 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
316.38/316.55 c relpscost : 190.47 447 1 35 0 0 872
316.38/316.55 c pscost : 0.00 0 0 0 0 0 0
316.38/316.55 c inference : 0.00 0 0 0 0 0 0
316.38/316.55 c mostinf : 0.00 0 0 0 0 0 0
316.38/316.55 c leastinf : 0.00 0 0 0 0 0 0
316.38/316.55 c fullstrong : 0.00 0 0 0 0 0 0
316.38/316.55 c allfullstrong : 0.00 0 0 0 0 0 0
316.38/316.55 c random : 0.00 0 0 0 0 0 0
316.38/316.55 c Primal Heuristics : Time Calls Found
316.38/316.55 c LP solutions : 0.00 - 0
316.38/316.55 c pseudo solutions : 0.00 - 0
316.38/316.55 c trivial : 0.01 1 0
316.38/316.55 c simplerounding : 0.00 0 0
316.38/316.55 c zirounding : 0.00 0 0
316.38/316.55 c rounding : 0.00 0 0
316.38/316.55 c shifting : 0.00 0 0
316.38/316.55 c intshifting : 0.00 0 0
316.38/316.55 c oneopt : 0.00 0 0
316.38/316.55 c twoopt : 0.00 0 0
316.38/316.55 c fixandinfer : 0.00 0 0
316.38/316.55 c feaspump : 0.00 0 0
316.38/316.55 c coefdiving : 0.00 0 0
316.38/316.55 c pscostdiving : 0.00 0 0
316.38/316.55 c fracdiving : 0.00 0 0
316.38/316.55 c veclendiving : 0.00 0 0
316.38/316.55 c intdiving : 0.00 0 0
316.38/316.55 c actconsdiving : 0.00 0 0
316.38/316.55 c objpscostdiving : 0.00 0 0
316.38/316.55 c rootsoldiving : 0.00 0 0
316.38/316.55 c linesearchdiving : 0.00 0 0
316.38/316.55 c guideddiving : 0.00 0 0
316.38/316.55 c octane : 0.00 0 0
316.38/316.55 c rens : 0.00 0 0
316.38/316.55 c rins : 0.00 0 0
316.38/316.55 c localbranching : 0.00 0 0
316.38/316.55 c mutation : 0.00 0 0
316.38/316.55 c crossover : 0.00 0 0
316.38/316.55 c dins : 0.00 0 0
316.38/316.55 c undercover : 0.00 0 0
316.38/316.55 c nlp : 0.00 0 0
316.38/316.55 c trysol : 0.00 0 0
316.38/316.55 c LP : Time Calls Iterations Iter/call Iter/sec
316.38/316.55 c primal LP : 0.01 0 0 0.00 0.00
316.38/316.55 c dual LP : 104.51 459 123995 270.14 1186.44
316.38/316.55 c lex dual LP : 0.00 0 0 0.00 -
316.38/316.55 c barrier LP : 0.00 0 0 0.00 -
316.38/316.55 c diving/probing LP: 0.00 0 0 0.00 -
316.38/316.55 c strong branching : 190.19 341 176724 518.25 929.20
316.38/316.55 c (at root node) : - 12 9277 773.08 -
316.38/316.55 c conflict analysis: 0.00 0 0 0.00 -
316.38/316.55 c B&B Tree :
316.38/316.55 c number of runs : 1
316.38/316.55 c nodes : 654
316.38/316.55 c nodes (total) : 654
316.38/316.55 c nodes left : 0
316.38/316.55 c max depth : 30
316.38/316.55 c max depth (total): 30
316.38/316.55 c backtracks : 164 (25.1%)
316.38/316.55 c delayed cutoffs : 219
316.38/316.55 c repropagations : 569 (26120 domain reductions, 148 cutoffs)
316.38/316.55 c avg switch length: 3.31
316.38/316.55 c switching time : 0.47
316.38/316.55 c Solution :
316.38/316.55 c Solutions found : 0 (0 improvements)
316.38/316.55 c Primal Bound : infeasible
316.38/316.55 c Dual Bound : -
316.38/316.55 c Gap : 0.00 %
316.38/316.55 c Root Dual Bound : +0.00000000000000e+00
316.38/316.55 c Root Iterations : 6472
316.48/316.62 c Time complete: 316.51.