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-2667282-1276300061.opb>
0.00/0.06 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 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.06/0.07 c presolving:
0.09/0.12 c (round 1) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.09/0.13 c (round 2) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.09/0.15 c presolving (3 rounds):
0.09/0.15 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.15 c 242 implications, 22 cliques
0.09/0.15 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.09/0.15 c 1 constraints of type <knapsack>
0.09/0.15 c 22 constraints of type <setppc>
0.09/0.15 c 2541 constraints of type <logicor>
0.09/0.15 c transformed objective value is always integral (scale: 1)
0.09/0.15 c Presolving Time: 0.05
0.09/0.15 c - non default parameters ----------------------------------------------------------------------
0.09/0.15 c # SCIP version 1.2.1.2
0.09/0.15 c
0.09/0.15 c # frequency for displaying node information lines
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.15 c display/freq = 10000
0.09/0.15 c
0.09/0.15 c # maximal time in seconds to run
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/time = 1799.95
0.09/0.15 c
0.09/0.15 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/memory = 1620
0.09/0.15 c
0.09/0.15 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c limits/solutions = 1
0.09/0.15 c
0.09/0.15 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.15 c separating/maxrounds = 1
0.09/0.15 c
0.09/0.15 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/maxroundsroot = 5
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify inequalities
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/linear/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.15 c constraints/knapsack/disaggregation = FALSE
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify knapsacks
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c presolving/probing/maxrounds = 0
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/coefdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.15 c heuristics/crossover/freq = -1
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/crossover/nodesofs = 750
0.09/0.15 c
0.09/0.15 c # number of nodes without incumbent change that heuristic should wait
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.15 c heuristics/crossover/nwaitingnodes = 100
0.09/0.15 c
0.09/0.15 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.15 c # [type: real, range: [0,1], default: 0.1]
0.09/0.15 c heuristics/crossover/nodesquot = 0.15
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixed
0.09/0.15 c # [type: real, range: [0,1], default: 0.666]
0.09/0.15 c heuristics/crossover/minfixingrate = 0.5
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/feaspump/freq = -1
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/fracdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/guideddiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/intshifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/linesearchdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/nlp/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/objpscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.15 c # [type: real, range: [0,1], default: 0.01]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/oneopt/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/pscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/rens/freq = -1
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixable
0.09/0.15 c # [type: real, range: [0,1], default: 0.5]
0.09/0.15 c heuristics/rens/minfixingrate = 0.3
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/rens/nodesofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/rootsoldiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/rounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/shifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/simplerounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/trivial/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/trysol/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/veclendiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/zirounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/cmir/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/flowcover/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/rapidlearning/freq = 0
0.09/0.15 c
0.09/0.15 c -----------------------------------------------------------------------------------------------
0.09/0.15 c start solving
0.09/0.15 c
0.09/0.18 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.18 c 0.1s| 1 | 0 | 86 | - |3551k| 0 | 37 | 231 |2564 | 231 |2564 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.54 c 0.4s| 1 | 0 | 113 | - |3976k| 0 | 39 | 231 |2754 | 231 |2577 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.70 c 0.6s| 1 | 0 | 151 | - |4556k| 0 | 46 | 231 |2754 | 231 |2583 | 19 | 0 | 0 | 0.000000e+00 | -- | Inf
0.99/1.04 c 0.9s| 1 | 0 | 183 | - |4582k| 0 | 53 | 231 |2754 | 231 |2585 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
1.39/1.42 c 1.3s| 1 | 0 | 191 | - |4631k| 0 | 55 | 231 |2754 | 231 |2586 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
1.79/1.81 c 1.6s| 1 | 0 | 198 | - |4765k| 0 | 54 | 231 |2754 | 231 |2587 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
2.39/2.44 c 2.3s| 1 | 2 | 198 | - |4765k| 0 | 54 | 231 |2754 | 231 |2587 | 23 | 0 | 10 | 0.000000e+00 | -- | Inf
178.73/178.84 c 175s| 10000 | 99 |306875 | 30.7 |7048k| 40 | 32 | 231 |6848 | 231 |2573 | 23 |7272 |2284 | 0.000000e+00 | -- | Inf
310.88/311.07 c 304s| 20000 | 121 |620814 | 31.0 |8027k| 45 | 36 | 231 |8790 | 231 |2573 | 23 | 15k|2613 | 0.000000e+00 | -- | Inf
450.94/451.13 c 441s| 30000 | 42 |936111 | 31.2 |8020k| 48 | 28 | 231 |8958 | 231 |2573 | 23 | 23k|3312 | 0.000000e+00 | -- | Inf
481.32/481.50 c
481.32/481.50 c SCIP Status : problem is solved [infeasible]
481.32/481.50 c Solving Time (sec) : 471.25
481.32/481.50 c Solving Nodes : 32175
481.32/481.50 c Primal Bound : +1.00000000000000e+20 (0 solutions)
481.32/481.50 c Dual Bound : +1.00000000000000e+20
481.32/481.50 c Gap : 0.00 %
481.32/481.50 s UNSATISFIABLE
481.32/481.50 c SCIP Status : problem is solved [infeasible]
481.32/481.50 c Solving Time : 471.25
481.32/481.50 c Original Problem :
481.32/481.50 c Problem name : HOME/instance-2667282-1276300061.opb
481.32/481.50 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
481.32/481.50 c Constraints : 2707 initial, 2707 maximal
481.32/481.50 c Presolved Problem :
481.32/481.50 c Problem name : t_HOME/instance-2667282-1276300061.opb
481.32/481.50 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
481.32/481.50 c Constraints : 2564 initial, 9785 maximal
481.32/481.50 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
481.32/481.50 c trivial : 0.00 0 0 0 0 0 0 0 0
481.32/481.50 c dualfix : 0.00 0 0 0 0 0 0 0 0
481.32/481.50 c boundshift : 0.00 0 0 0 0 0 0 0 0
481.32/481.50 c inttobinary : 0.00 0 0 0 0 0 0 0 0
481.32/481.50 c implics : 0.00 0 0 0 0 0 0 0 0
481.32/481.50 c probing : 0.00 0 0 0 0 0 0 0 0
481.32/481.50 c knapsack : 0.00 0 0 0 0 0 0 0 0
481.32/481.50 c setppc : 0.00 0 0 0 0 0 0 0 0
481.32/481.50 c linear : 0.02 0 0 0 0 0 143 0 0
481.32/481.50 c logicor : 0.02 0 0 0 0 0 0 0 0
481.32/481.50 c root node : - 1 - - 1 - - - -
481.32/481.50 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
481.32/481.50 c integral : 0 0 0 16965 0 80 1474 0 0 32410
481.32/481.50 c knapsack : 1 5 130539 0 0 133 65053 0 0 0
481.32/481.50 c setppc : 22 5 130525 0 0 753 188127 0 0 0
481.32/481.50 c linear : 0+ 5 127811 0 0 2 1865 1 0 0
481.32/481.50 c logicor : 2541+ 5 61504 0 0 238 193072 0 0 0
481.32/481.50 c countsols : 0 0 0 0 0 0 0 0 0 0
481.32/481.50 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
481.32/481.50 c integral : 74.86 0.00 0.00 74.86 0.00
481.32/481.50 c knapsack : 0.89 0.00 0.89 0.00 0.00
481.32/481.50 c setppc : 2.26 0.00 2.26 0.00 0.00
481.32/481.50 c linear : 1.03 0.00 1.03 0.00 0.00
481.32/481.50 c logicor : 9.44 0.00 9.44 0.00 0.00
481.32/481.50 c countsols : 0.00 0.00 0.00 0.00 0.00
481.32/481.50 c Propagators : Time Calls Cutoffs DomReds
481.32/481.50 c vbounds : 0.03 1 0 0
481.32/481.50 c rootredcost : 0.10 0 0 0
481.32/481.50 c pseudoobj : 0.06 0 0 0
481.32/481.50 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
481.32/481.50 c propagation : 0.14 1126 1120 5240 19.3 20 22.5 -
481.32/481.50 c infeasible LP : 6.02 14997 14880 84982 29.0 140 17.0 0
481.32/481.50 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
481.32/481.50 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
481.32/481.50 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
481.32/481.50 c applied globally : - - - 24562 18.6 - - -
481.32/481.50 c applied locally : - - - 532 33.7 - - -
481.32/481.50 c Separators : Time Calls Cutoffs DomReds Cuts Conss
481.32/481.50 c cut pool : 0.00 4 - - 33 - (maximal pool size: 366)
481.32/481.50 c redcost : 0.22 16332 0 0 0 0
481.32/481.50 c impliedbounds : 0.00 5 0 0 0 0
481.32/481.50 c intobj : 0.00 0 0 0 0 0
481.32/481.50 c cgmip : 0.00 0 0 0 0 0
481.32/481.50 c gomory : 0.69 5 0 0 1000 0
481.32/481.50 c strongcg : 0.60 5 0 0 1289 0
481.32/481.50 c cmir : 0.00 0 0 0 0 0
481.32/481.50 c flowcover : 0.00 0 0 0 0 0
481.32/481.50 c clique : 0.00 5 0 0 0 0
481.32/481.50 c zerohalf : 0.00 0 0 0 0 0
481.32/481.50 c mcf : 0.00 1 0 0 0 0
481.32/481.50 c rapidlearning : 0.22 1 0 0 0 190
481.32/481.50 c Pricers : Time Calls Vars
481.32/481.50 c problem variables: 0.00 0 0
481.32/481.50 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
481.32/481.50 c relpscost : 74.82 16965 80 1474 0 0 32410
481.32/481.50 c pscost : 0.00 0 0 0 0 0 0
481.32/481.50 c inference : 0.00 0 0 0 0 0 0
481.32/481.50 c mostinf : 0.00 0 0 0 0 0 0
481.32/481.50 c leastinf : 0.00 0 0 0 0 0 0
481.32/481.50 c fullstrong : 0.00 0 0 0 0 0 0
481.32/481.50 c allfullstrong : 0.00 0 0 0 0 0 0
481.32/481.50 c random : 0.00 0 0 0 0 0 0
481.32/481.50 c Primal Heuristics : Time Calls Found
481.32/481.50 c LP solutions : 0.00 - 0
481.32/481.50 c pseudo solutions : 0.00 - 0
481.32/481.50 c trivial : 0.00 1 0
481.32/481.50 c simplerounding : 0.00 0 0
481.32/481.50 c zirounding : 0.00 0 0
481.32/481.50 c rounding : 0.00 0 0
481.32/481.50 c shifting : 0.00 0 0
481.32/481.50 c intshifting : 0.00 0 0
481.32/481.50 c oneopt : 0.00 0 0
481.32/481.50 c twoopt : 0.00 0 0
481.32/481.50 c fixandinfer : 0.00 0 0
481.32/481.50 c feaspump : 0.00 0 0
481.32/481.50 c coefdiving : 0.00 0 0
481.32/481.50 c pscostdiving : 0.00 0 0
481.32/481.50 c fracdiving : 0.00 0 0
481.32/481.50 c veclendiving : 0.00 0 0
481.32/481.50 c intdiving : 0.00 0 0
481.32/481.50 c actconsdiving : 0.00 0 0
481.32/481.50 c objpscostdiving : 0.00 0 0
481.32/481.50 c rootsoldiving : 0.00 0 0
481.32/481.50 c linesearchdiving : 0.00 0 0
481.32/481.50 c guideddiving : 0.00 0 0
481.32/481.50 c octane : 0.00 0 0
481.32/481.50 c rens : 0.00 0 0
481.32/481.50 c rins : 0.00 0 0
481.32/481.50 c localbranching : 0.00 0 0
481.32/481.50 c mutation : 0.00 0 0
481.32/481.50 c crossover : 0.00 0 0
481.32/481.50 c dins : 0.00 0 0
481.32/481.50 c undercover : 0.00 0 0
481.32/481.50 c nlp : 0.00 0 0
481.32/481.50 c trysol : 0.00 0 0
481.32/481.50 c LP : Time Calls Iterations Iter/call Iter/sec
481.32/481.50 c primal LP : 0.01 0 0 0.00 0.00
481.32/481.50 c dual LP : 347.36 31901 1008218 31.60 2902.52
481.32/481.50 c lex dual LP : 0.00 0 0 0.00 -
481.32/481.50 c barrier LP : 0.00 0 0 0.00 -
481.32/481.50 c diving/probing LP: 0.00 0 0 0.00 -
481.32/481.50 c strong branching : 74.20 3397 207820 61.18 2800.81
481.32/481.50 c (at root node) : - 10 1552 155.20 -
481.32/481.50 c conflict analysis: 0.00 0 0 0.00 -
481.32/481.50 c B&B Tree :
481.32/481.50 c number of runs : 1
481.32/481.50 c nodes : 32175
481.32/481.50 c nodes (total) : 32175
481.32/481.50 c nodes left : 0
481.32/481.50 c max depth : 50
481.32/481.50 c max depth (total): 50
481.32/481.50 c backtracks : 3516 (10.9%)
481.32/481.50 c delayed cutoffs : 236
481.32/481.50 c repropagations : 56084 (69508 domain reductions, 233 cutoffs)
481.32/481.50 c avg switch length: 5.31
481.32/481.50 c switching time : 10.12
481.32/481.50 c Solution :
481.32/481.50 c Solutions found : 0 (0 improvements)
481.32/481.50 c Primal Bound : infeasible
481.32/481.50 c Dual Bound : -
481.32/481.50 c Gap : 0.00 %
481.32/481.50 c Root Dual Bound : +0.00000000000000e+00
481.32/481.50 c Root Iterations : 198
481.32/481.53 c Time complete: 481.36.