0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2667419-1276335539.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.27 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.48 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.49 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.49/0.51 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.52 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.53 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.54 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.55 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.69 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.72 c presolving (10 rounds):
0.69/0.72 c 560 deleted vars, 1439 deleted constraints, 261 tightened bounds, 0 added holes, 336 changed sides, 724 changed coefficients
0.69/0.72 c 171264 implications, 0 cliques
0.69/0.72 c presolved problem has 3379 variables (3379 bin, 0 int, 0 impl, 0 cont) and 8973 constraints
0.69/0.72 c 672 constraints of type <knapsack>
0.69/0.72 c 8301 constraints of type <logicor>
0.69/0.72 c transformed objective value is always integral (scale: 1)
0.69/0.72 c Presolving Time: 0.41
0.69/0.72 c - non default parameters ----------------------------------------------------------------------
0.69/0.72 c # SCIP version 1.2.1.2
0.69/0.72 c
0.69/0.72 c # frequency for displaying node information lines
0.69/0.72 c # [type: int, range: [-1,2147483647], default: 100]
0.69/0.72 c display/freq = 10000
0.69/0.72 c
0.69/0.72 c # maximal time in seconds to run
0.69/0.72 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.72 c limits/time = 1799.8
0.69/0.72 c
0.69/0.72 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.69/0.72 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.72 c limits/memory = 1620
0.69/0.72 c
0.69/0.72 c # solving stops, if the given number of solutions were found (-1: no limit)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.72 c limits/solutions = 1
0.69/0.72 c
0.69/0.72 c # maximal number of separation rounds per node (-1: unlimited)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: 5]
0.69/0.72 c separating/maxrounds = 1
0.69/0.72 c
0.69/0.72 c # maximal number of separation rounds in the root node (-1: unlimited)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.72 c separating/maxroundsroot = 5
0.69/0.72 c
0.69/0.72 c # should presolving try to simplify inequalities
0.69/0.72 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.72 c constraints/linear/simplifyinequalities = TRUE
0.69/0.72 c
0.69/0.72 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.69/0.72 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.69/0.72 c constraints/knapsack/disaggregation = FALSE
0.69/0.72 c
0.69/0.72 c # should presolving try to simplify knapsacks
0.69/0.72 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.72 c constraints/knapsack/simplifyinequalities = TRUE
0.69/0.72 c
0.69/0.72 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.72 c presolving/probing/maxrounds = 0
0.69/0.72 c
0.69/0.72 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.69/0.72 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.72 c heuristics/coefdiving/freq = -1
0.69/0.72 c
0.69/0.72 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.73 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.73 c heuristics/coefdiving/maxlpiterquot = 0.075
0.69/0.73 c
0.69/0.73 c # additional number of allowed LP iterations
0.69/0.73 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.73 c heuristics/coefdiving/maxlpiterofs = 1500
0.69/0.73 c
0.69/0.73 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.69/0.73 c # [type: int, range: [-1,2147483647], default: 30]
0.69/0.73 c heuristics/crossover/freq = -1
0.69/0.73 c
0.69/0.73 c # number of nodes added to the contingent of the total nodes
0.69/0.73 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.69/0.73 c heuristics/crossover/nodesofs = 750
0.69/0.73 c
0.69/0.73 c # number of nodes without incumbent change that heuristic should wait
0.69/0.73 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.69/0.73 c heuristics/crossover/nwaitingnodes = 100
0.69/0.73 c
0.69/0.73 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.69/0.73 c # [type: real, range: [0,1], default: 0.1]
0.69/0.73 c heuristics/crossover/nodesquot = 0.15
0.69/0.73 c
0.69/0.73 c # minimum percentage of integer variables that have to be fixed
0.69/0.73 c # [type: real, range: [0,1], default: 0.666]
0.69/0.73 c heuristics/crossover/minfixingrate = 0.5
0.69/0.73 c
0.69/0.73 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.69/0.73 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.73 c heuristics/feaspump/freq = -1
0.69/0.73 c
0.69/0.73 c # additional number of allowed LP iterations
0.69/0.73 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.73 c heuristics/feaspump/maxlpiterofs = 2000
0.69/0.73 c
0.69/0.73 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.69/0.73 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.73 c heuristics/fracdiving/freq = -1
0.69/0.73 c
0.69/0.73 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.73 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.73 c heuristics/fracdiving/maxlpiterquot = 0.075
0.69/0.73 c
0.69/0.73 c # additional number of allowed LP iterations
0.69/0.73 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.73 c heuristics/fracdiving/maxlpiterofs = 1500
0.69/0.73 c
0.69/0.73 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.69/0.73 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.73 c heuristics/guideddiving/freq = -1
0.69/0.73 c
0.69/0.73 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.73 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.73 c heuristics/guideddiving/maxlpiterquot = 0.075
0.69/0.73 c
0.69/0.73 c # additional number of allowed LP iterations
0.69/0.73 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.73 c heuristics/guideddiving/maxlpiterofs = 1500
0.69/0.73 c
0.69/0.73 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.73 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.73 c heuristics/intdiving/maxlpiterquot = 0.075
0.69/0.73 c
0.69/0.73 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.69/0.73 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.73 c heuristics/intshifting/freq = -1
0.69/0.73 c
0.69/0.73 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.69/0.73 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.73 c heuristics/linesearchdiving/freq = -1
0.69/0.73 c
0.69/0.73 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.73 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.73 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.69/0.73 c
0.69/0.73 c # additional number of allowed LP iterations
0.69/0.73 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.73 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.69/0.73 c
0.69/0.73 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.69/0.73 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.73 c heuristics/nlp/freq = -1
0.69/0.73 c
0.69/0.73 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.73 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.73 c heuristics/objpscostdiving/freq = -1
0.69/0.73 c
0.69/0.73 c # maximal fraction of diving LP iterations compared to total iteration number
0.69/0.73 c # [type: real, range: [0,1], default: 0.01]
0.69/0.73 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.69/0.73 c
0.69/0.73 c # additional number of allowed LP iterations
0.69/0.73 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.73 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.69/0.73 c
0.69/0.73 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.69/0.73 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.73 c heuristics/oneopt/freq = -1
0.69/0.73 c
0.69/0.73 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.73 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.73 c heuristics/pscostdiving/freq = -1
0.69/0.73 c
0.69/0.73 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.73 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.73 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.69/0.73 c
0.69/0.73 c # additional number of allowed LP iterations
0.69/0.73 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.73 c heuristics/pscostdiving/maxlpiterofs = 1500
0.69/0.73 c
0.69/0.73 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.69/0.73 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.73 c heuristics/rens/freq = -1
0.69/0.73 c
0.69/0.73 c # minimum percentage of integer variables that have to be fixable
0.69/0.73 c # [type: real, range: [0,1], default: 0.5]
0.69/0.73 c heuristics/rens/minfixingrate = 0.3
0.69/0.73 c
0.69/0.73 c # number of nodes added to the contingent of the total nodes
0.69/0.73 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.69/0.73 c heuristics/rens/nodesofs = 2000
0.69/0.73 c
0.69/0.73 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.69/0.73 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.73 c heuristics/rootsoldiving/freq = -1
0.69/0.73 c
0.69/0.73 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.73 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.69/0.73 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.69/0.73 c
0.69/0.73 c # additional number of allowed LP iterations
0.69/0.73 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.73 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.69/0.73 c
0.69/0.73 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.69/0.73 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.73 c heuristics/rounding/freq = -1
0.69/0.73 c
0.69/0.73 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.69/0.73 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.73 c heuristics/shifting/freq = -1
0.69/0.73 c
0.69/0.73 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.69/0.73 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.73 c heuristics/simplerounding/freq = -1
0.69/0.73 c
0.69/0.73 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.69/0.73 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.73 c heuristics/trivial/freq = -1
0.69/0.73 c
0.69/0.73 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.69/0.73 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.73 c heuristics/trysol/freq = -1
0.69/0.73 c
0.69/0.73 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.69/0.73 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.73 c heuristics/veclendiving/freq = -1
0.69/0.73 c
0.69/0.73 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.73 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.73 c heuristics/veclendiving/maxlpiterquot = 0.075
0.69/0.73 c
0.69/0.73 c # additional number of allowed LP iterations
0.69/0.73 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.73 c heuristics/veclendiving/maxlpiterofs = 1500
0.69/0.73 c
0.69/0.73 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.69/0.73 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.73 c heuristics/zirounding/freq = -1
0.69/0.73 c
0.69/0.73 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.69/0.73 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.73 c separating/cmir/freq = -1
0.69/0.73 c
0.69/0.73 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.69/0.73 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.73 c separating/flowcover/freq = -1
0.69/0.73 c
0.69/0.73 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.69/0.73 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.73 c separating/rapidlearning/freq = 0
0.69/0.73 c
0.69/0.73 c -----------------------------------------------------------------------------------------------
0.69/0.73 c start solving
0.69/0.73 c
1.00/1.05 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.00/1.05 c 0.7s| 1 | 0 | 1452 | - | 24M| 0 | 991 |3379 |8973 |3379 |8973 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
4.99/5.00 c 4.4s| 1 | 0 | 2581 | - | 27M| 0 |1300 |3379 |9624 |3379 |9059 | 101 | 0 | 0 | 0.000000e+00 | -- | Inf
9.09/9.12 c 8.5s| 1 | 0 | 4560 | - | 28M| 0 |1398 |3379 |9624 |3379 |9174 | 216 | 0 | 0 | 0.000000e+00 | -- | Inf
12.39/12.48 c 11.8s| 1 | 0 | 6412 | - | 28M| 0 |1605 |3379 |9624 |3379 |9268 | 310 | 0 | 0 | 0.000000e+00 | -- | Inf
17.28/17.31 c 16.6s| 1 | 0 | 8558 | - | 28M| 0 |1462 |3379 |9624 |3379 |9381 | 423 | 0 | 0 | 0.000000e+00 | -- | Inf
20.89/20.99 c 20.3s| 1 | 0 | 10250 | - | 28M| 0 |1556 |3379 |9624 |3379 |9480 | 522 | 0 | 0 | 0.000000e+00 | -- | Inf
36.67/36.73 c 36.0s| 1 | 2 | 10250 | - | 28M| 0 |1556 |3379 |9624 |3379 |9480 | 522 | 0 | 12 | 0.000000e+00 | -- | Inf
319.47/319.67 c
319.47/319.67 c SCIP Status : problem is solved [infeasible]
319.47/319.67 c Solving Time (sec) : 317.56
319.47/319.67 c Solving Nodes : 549
319.47/319.67 c Primal Bound : +1.00000000000000e+20 (0 solutions)
319.47/319.67 c Dual Bound : +1.00000000000000e+20
319.47/319.67 c Gap : 0.00 %
319.47/319.67 s UNSATISFIABLE
319.47/319.67 c SCIP Status : problem is solved [infeasible]
319.47/319.67 c Solving Time : 317.56
319.47/319.67 c Original Problem :
319.47/319.67 c Problem name : HOME/instance-2667419-1276335539.opb
319.47/319.67 c Variables : 3939 (3939 binary, 0 integer, 0 implicit integer, 0 continuous)
319.47/319.67 c Constraints : 10412 initial, 10412 maximal
319.47/319.67 c Presolved Problem :
319.47/319.67 c Problem name : t_HOME/instance-2667419-1276335539.opb
319.47/319.67 c Variables : 3379 (3379 binary, 0 integer, 0 implicit integer, 0 continuous)
319.47/319.67 c Constraints : 8973 initial, 10063 maximal
319.47/319.67 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
319.47/319.67 c trivial : 0.01 0 0 0 0 0 0 0 0
319.47/319.67 c dualfix : 0.00 0 0 0 0 0 0 0 0
319.47/319.67 c boundshift : 0.00 0 0 0 0 0 0 0 0
319.47/319.67 c inttobinary : 0.00 0 0 0 0 0 0 0 0
319.47/319.67 c implics : 0.04 0 294 0 0 0 0 0 0
319.47/319.67 c probing : 0.00 0 0 0 0 0 0 0 0
319.47/319.67 c knapsack : 0.01 0 0 0 0 0 0 0 0
319.47/319.67 c linear : 0.27 261 5 0 261 0 1439 336 724
319.47/319.67 c logicor : 0.04 0 0 0 0 0 0 0 0
319.47/319.67 c root node : - 1273 - - 1273 - - - -
319.47/319.67 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
319.47/319.67 c integral : 0 0 0 375 0 0 24 0 0 732
319.47/319.67 c knapsack : 672 6 9936 0 0 0 0 1203 0 0
319.47/319.67 c linear : 0+ 5 9935 0 0 37 1289 52 0 0
319.47/319.67 c logicor : 8301+ 6 9571 0 0 253 73774 0 0 0
319.47/319.67 c countsols : 0 0 0 0 0 0 0 0 0 0
319.47/319.67 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
319.47/319.67 c integral : 198.95 0.00 0.00 198.95 0.00
319.47/319.67 c knapsack : 0.23 0.04 0.19 0.00 0.00
319.47/319.67 c linear : 1.24 0.01 1.23 0.00 0.00
319.47/319.67 c logicor : 1.05 0.00 1.05 0.00 0.00
319.47/319.67 c countsols : 0.00 0.00 0.00 0.00 0.00
319.47/319.67 c Propagators : Time Calls Cutoffs DomReds
319.47/319.67 c vbounds : 0.00 1 0 0
319.47/319.67 c rootredcost : 0.00 0 0 0
319.47/319.67 c pseudoobj : 0.00 0 0 0
319.47/319.67 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
319.47/319.67 c propagation : 0.19 290 250 1202 64.8 49 42.1 -
319.47/319.67 c infeasible LP : 0.01 5 5 6 3.0 3 4.3 0
319.47/319.67 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
319.47/319.67 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
319.47/319.67 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
319.47/319.67 c applied globally : - - - 718 44.6 - - -
319.47/319.67 c applied locally : - - - 0 0.0 - - -
319.47/319.67 c Separators : Time Calls Cutoffs DomReds Cuts Conss
319.47/319.67 c cut pool : 0.01 4 - - 61 - (maximal pool size: 1292)
319.47/319.67 c redcost : 0.15 371 0 0 0 0
319.47/319.67 c impliedbounds : 0.00 5 0 0 0 0
319.47/319.67 c intobj : 0.00 0 0 0 0 0
319.47/319.67 c cgmip : 0.00 0 0 0 0 0
319.47/319.67 c gomory : 3.98 5 0 0 2125 0
319.47/319.67 c strongcg : 3.50 5 0 0 2260 0
319.47/319.67 c cmir : 0.00 0 0 0 0 0
319.47/319.67 c flowcover : 0.00 0 0 0 0 0
319.47/319.67 c clique : 0.29 5 0 0 34 0
319.47/319.67 c zerohalf : 0.00 0 0 0 0 0
319.47/319.67 c mcf : 0.04 1 0 0 0 0
319.47/319.67 c rapidlearning : 2.13 1 0 6 0 657
319.47/319.67 c Pricers : Time Calls Vars
319.47/319.67 c problem variables: 0.00 0 0
319.47/319.67 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
319.47/319.67 c relpscost : 198.95 375 0 24 0 0 732
319.47/319.67 c pscost : 0.00 0 0 0 0 0 0
319.47/319.67 c inference : 0.00 0 0 0 0 0 0
319.47/319.67 c mostinf : 0.00 0 0 0 0 0 0
319.47/319.67 c leastinf : 0.00 0 0 0 0 0 0
319.47/319.67 c fullstrong : 0.00 0 0 0 0 0 0
319.47/319.67 c allfullstrong : 0.00 0 0 0 0 0 0
319.47/319.67 c random : 0.00 0 0 0 0 0 0
319.47/319.67 c Primal Heuristics : Time Calls Found
319.47/319.67 c LP solutions : 0.00 - 0
319.47/319.67 c pseudo solutions : 0.00 - 0
319.47/319.67 c trivial : 0.00 1 0
319.47/319.67 c simplerounding : 0.00 0 0
319.47/319.67 c zirounding : 0.00 0 0
319.47/319.67 c rounding : 0.00 0 0
319.47/319.67 c shifting : 0.00 0 0
319.47/319.67 c intshifting : 0.00 0 0
319.47/319.67 c oneopt : 0.00 0 0
319.47/319.67 c twoopt : 0.00 0 0
319.47/319.67 c fixandinfer : 0.00 0 0
319.47/319.67 c feaspump : 0.00 0 0
319.47/319.67 c coefdiving : 0.00 0 0
319.47/319.67 c pscostdiving : 0.00 0 0
319.47/319.67 c fracdiving : 0.00 0 0
319.47/319.67 c veclendiving : 0.00 0 0
319.47/319.67 c intdiving : 0.00 0 0
319.47/319.67 c actconsdiving : 0.00 0 0
319.47/319.67 c objpscostdiving : 0.00 0 0
319.47/319.67 c rootsoldiving : 0.00 0 0
319.47/319.67 c linesearchdiving : 0.00 0 0
319.47/319.67 c guideddiving : 0.00 0 0
319.47/319.67 c octane : 0.00 0 0
319.47/319.67 c rens : 0.00 0 0
319.47/319.67 c rins : 0.00 0 0
319.47/319.67 c localbranching : 0.00 0 0
319.47/319.67 c mutation : 0.00 0 0
319.47/319.67 c crossover : 0.00 0 0
319.47/319.67 c dins : 0.00 0 0
319.47/319.67 c undercover : 0.00 0 0
319.47/319.67 c nlp : 0.00 0 0
319.47/319.67 c trysol : 0.00 0 0
319.47/319.67 c LP : Time Calls Iterations Iter/call Iter/sec
319.47/319.67 c primal LP : 0.01 0 0 0.00 0.00
319.47/319.67 c dual LP : 102.31 386 95514 247.45 933.57
319.47/319.67 c lex dual LP : 0.00 0 0 0.00 -
319.47/319.67 c barrier LP : 0.00 0 0 0.00 -
319.47/319.67 c diving/probing LP: 0.00 0 0 0.00 -
319.47/319.67 c strong branching : 198.79 335 158100 471.94 795.31
319.47/319.67 c (at root node) : - 12 9557 796.42 -
319.47/319.67 c conflict analysis: 0.00 0 0 0.00 -
319.47/319.67 c B&B Tree :
319.47/319.67 c number of runs : 1
319.47/319.67 c nodes : 549
319.47/319.67 c nodes (total) : 549
319.47/319.67 c nodes left : 0
319.47/319.67 c max depth : 26
319.47/319.67 c max depth (total): 26
319.47/319.67 c backtracks : 133 (24.2%)
319.47/319.67 c delayed cutoffs : 184
319.47/319.67 c repropagations : 574 (24377 domain reductions, 112 cutoffs)
319.47/319.67 c avg switch length: 3.58
319.47/319.67 c switching time : 0.87
319.47/319.67 c Solution :
319.47/319.67 c Solutions found : 0 (0 improvements)
319.47/319.67 c Primal Bound : infeasible
319.47/319.67 c Dual Bound : -
319.47/319.67 c Gap : 0.00 %
319.47/319.67 c Root Dual Bound : +0.00000000000000e+00
319.47/319.67 c Root Iterations : 10250
319.57/319.75 c Time complete: 319.62.