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-2667269-1276294542.opb>
0.02/0.06 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.02/0.06 c problem read
0.02/0.06 c No objective function, only one solution is needed.
0.02/0.06 c presolving settings loaded
0.02/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.06
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.53 c 0.4s| 1 | 0 | 105 | - |3982k| 0 | 37 | 231 |2754 | 231 |2577 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.78 c 0.7s| 1 | 0 | 127 | - |4408k| 0 | 48 | 231 |2754 | 231 |2584 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
1.10/1.13 c 1.0s| 1 | 0 | 165 | - |4716k| 0 | 51 | 231 |2754 | 231 |2588 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
1.40/1.48 c 1.3s| 1 | 0 | 175 | - |4906k| 0 | 45 | 231 |2754 | 231 |2591 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
1.79/1.84 c 1.7s| 1 | 0 | 203 | - |5150k| 0 | 52 | 231 |2754 | 231 |2592 | 28 | 0 | 0 | 0.000000e+00 | -- | Inf
2.48/2.58 c 2.4s| 1 | 2 | 203 | - |5150k| 0 | 52 | 231 |2754 | 231 |2592 | 28 | 0 | 10 | 0.000000e+00 | -- | Inf
169.43/169.54 c 166s| 10000 | 89 |298777 | 29.9 |7267k| 41 | - | 231 |6706 | 231 |2577 | 28 |6372 |2140 | 0.000000e+00 | -- | Inf
299.99/300.12 c 294s| 20000 | 69 |613078 | 30.6 |8267k| 42 | - | 231 |8948 | 231 |2577 | 28 | 13k|2415 | 0.000000e+00 | -- | Inf
437.55/437.75 c 429s| 30000 | 41 |915502 | 30.5 |8980k| 46 | 35 | 231 | 10k| 231 |2577 | 28 | 21k|3165 | 0.000000e+00 | -- | Inf
508.42/508.67 c
508.42/508.67 c SCIP Status : problem is solved [infeasible]
508.42/508.67 c Solving Time (sec) : 498.16
508.42/508.67 c Solving Nodes : 35625
508.42/508.67 c Primal Bound : +1.00000000000000e+20 (0 solutions)
508.42/508.67 c Dual Bound : +1.00000000000000e+20
508.42/508.67 c Gap : 0.00 %
508.42/508.67 s UNSATISFIABLE
508.42/508.67 c SCIP Status : problem is solved [infeasible]
508.42/508.67 c Solving Time : 498.16
508.42/508.67 c Original Problem :
508.42/508.67 c Problem name : HOME/instance-2667269-1276294542.opb
508.42/508.67 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
508.42/508.67 c Constraints : 2707 initial, 2707 maximal
508.42/508.67 c Presolved Problem :
508.42/508.67 c Problem name : t_HOME/instance-2667269-1276294542.opb
508.42/508.67 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
508.42/508.67 c Constraints : 2564 initial, 11310 maximal
508.42/508.67 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
508.42/508.67 c trivial : 0.00 0 0 0 0 0 0 0 0
508.42/508.67 c dualfix : 0.00 0 0 0 0 0 0 0 0
508.42/508.67 c boundshift : 0.00 0 0 0 0 0 0 0 0
508.42/508.67 c inttobinary : 0.00 0 0 0 0 0 0 0 0
508.42/508.67 c implics : 0.00 0 0 0 0 0 0 0 0
508.42/508.67 c probing : 0.00 0 0 0 0 0 0 0 0
508.42/508.67 c knapsack : 0.00 0 0 0 0 0 0 0 0
508.42/508.67 c setppc : 0.00 0 0 0 0 0 0 0 0
508.42/508.67 c linear : 0.03 0 0 0 0 0 143 0 0
508.42/508.67 c logicor : 0.03 0 0 0 0 0 0 0 0
508.42/508.67 c root node : - 51 - - 51 - - - -
508.42/508.67 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
508.42/508.67 c integral : 0 0 0 18562 0 87 1333 0 0 35738
508.42/508.67 c knapsack : 1 5 145339 0 0 141 68437 0 0 0
508.42/508.67 c setppc : 22 5 145275 0 0 636 199903 0 0 0
508.42/508.67 c linear : 0+ 5 143694 0 0 7 533 2 0 0
508.42/508.67 c logicor : 2541+ 5 66617 0 0 191 218008 0 0 0
508.42/508.67 c countsols : 0 0 0 0 0 0 0 0 0 0
508.42/508.67 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
508.42/508.67 c integral : 74.50 0.00 0.00 74.50 0.00
508.42/508.67 c knapsack : 1.19 0.00 1.19 0.00 0.00
508.42/508.67 c setppc : 2.10 0.00 2.10 0.00 0.00
508.42/508.67 c linear : 1.26 0.00 1.26 0.00 0.00
508.42/508.67 c logicor : 12.11 0.00 12.11 0.00 0.00
508.42/508.67 c countsols : 0.00 0.00 0.00 0.00 0.00
508.42/508.67 c Propagators : Time Calls Cutoffs DomReds
508.42/508.67 c vbounds : 0.09 1 0 0
508.42/508.67 c rootredcost : 0.10 0 0 0
508.42/508.67 c pseudoobj : 0.07 0 0 0
508.42/508.67 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
508.42/508.67 c propagation : 0.04 975 970 4882 18.7 17 15.8 -
508.42/508.67 c infeasible LP : 6.87 16806 16591 98418 30.1 134 17.7 0
508.42/508.67 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
508.42/508.67 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
508.42/508.67 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
508.42/508.67 c applied globally : - - - 25009 18.2 - - -
508.42/508.67 c applied locally : - - - 298 32.5 - - -
508.42/508.67 c Separators : Time Calls Cutoffs DomReds Cuts Conss
508.42/508.67 c cut pool : 0.00 4 - - 32 - (maximal pool size: 471)
508.42/508.67 c redcost : 0.18 17996 0 0 0 0
508.42/508.67 c impliedbounds : 0.00 5 0 0 0 0
508.42/508.67 c intobj : 0.00 0 0 0 0 0
508.42/508.67 c cgmip : 0.00 0 0 0 0 0
508.42/508.67 c gomory : 0.78 5 0 0 1057 0
508.42/508.67 c strongcg : 0.55 5 0 0 2031 0
508.42/508.67 c cmir : 0.00 0 0 0 0 0
508.42/508.67 c flowcover : 0.00 0 0 0 0 0
508.42/508.67 c clique : 0.00 5 0 0 0 0
508.42/508.67 c zerohalf : 0.00 0 0 0 0 0
508.42/508.67 c mcf : 0.00 1 0 0 0 0
508.42/508.67 c rapidlearning : 0.20 1 0 0 0 190
508.42/508.67 c Pricers : Time Calls Vars
508.42/508.67 c problem variables: 0.00 0 0
508.42/508.67 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
508.42/508.67 c relpscost : 74.41 18562 87 1333 0 0 35738
508.42/508.67 c pscost : 0.00 0 0 0 0 0 0
508.42/508.67 c inference : 0.00 0 0 0 0 0 0
508.42/508.67 c mostinf : 0.00 0 0 0 0 0 0
508.42/508.67 c leastinf : 0.00 0 0 0 0 0 0
508.42/508.67 c fullstrong : 0.00 0 0 0 0 0 0
508.42/508.67 c allfullstrong : 0.00 0 0 0 0 0 0
508.42/508.67 c random : 0.00 0 0 0 0 0 0
508.42/508.67 c Primal Heuristics : Time Calls Found
508.42/508.67 c LP solutions : 0.00 - 0
508.42/508.67 c pseudo solutions : 0.00 - 0
508.42/508.67 c trivial : 0.00 1 0
508.42/508.67 c simplerounding : 0.00 0 0
508.42/508.67 c zirounding : 0.00 0 0
508.42/508.67 c rounding : 0.00 0 0
508.42/508.67 c shifting : 0.00 0 0
508.42/508.67 c intshifting : 0.00 0 0
508.42/508.67 c oneopt : 0.00 0 0
508.42/508.67 c twoopt : 0.00 0 0
508.42/508.67 c fixandinfer : 0.00 0 0
508.42/508.67 c feaspump : 0.00 0 0
508.42/508.67 c coefdiving : 0.00 0 0
508.42/508.67 c pscostdiving : 0.00 0 0
508.42/508.67 c fracdiving : 0.00 0 0
508.42/508.67 c veclendiving : 0.00 0 0
508.42/508.67 c intdiving : 0.00 0 0
508.42/508.67 c actconsdiving : 0.00 0 0
508.42/508.67 c objpscostdiving : 0.00 0 0
508.42/508.67 c rootsoldiving : 0.00 0 0
508.42/508.67 c linesearchdiving : 0.00 0 0
508.42/508.67 c guideddiving : 0.00 0 0
508.42/508.67 c octane : 0.00 0 0
508.42/508.67 c rens : 0.00 0 0
508.42/508.67 c rins : 0.00 0 0
508.42/508.67 c localbranching : 0.00 0 0
508.42/508.67 c mutation : 0.00 0 0
508.42/508.67 c crossover : 0.00 0 0
508.42/508.67 c dins : 0.00 0 0
508.42/508.67 c undercover : 0.00 0 0
508.42/508.67 c nlp : 0.00 0 0
508.42/508.67 c trysol : 0.00 0 0
508.42/508.67 c LP : Time Calls Iterations Iter/call Iter/sec
508.42/508.67 c primal LP : 0.00 0 0 0.00 -
508.42/508.67 c dual LP : 367.07 35301 1076471 30.49 2932.60
508.42/508.67 c lex dual LP : 0.00 0 0 0.00 -
508.42/508.67 c barrier LP : 0.00 0 0 0.00 -
508.42/508.67 c diving/probing LP: 0.00 0 0 0.00 -
508.42/508.67 c strong branching : 73.57 3419 209580 61.30 2848.72
508.42/508.67 c (at root node) : - 10 1821 182.10 -
508.42/508.67 c conflict analysis: 0.00 0 0 0.00 -
508.42/508.67 c B&B Tree :
508.42/508.67 c number of runs : 1
508.42/508.67 c nodes : 35625
508.42/508.67 c nodes (total) : 35625
508.42/508.67 c nodes left : 0
508.42/508.67 c max depth : 46
508.42/508.67 c max depth (total): 46
508.42/508.67 c backtracks : 3752 (10.5%)
508.42/508.67 c delayed cutoffs : 114
508.42/508.67 c repropagations : 64362 (63824 domain reductions, 112 cutoffs)
508.42/508.67 c avg switch length: 5.24
508.42/508.67 c switching time : 11.52
508.42/508.67 c Solution :
508.42/508.67 c Solutions found : 0 (0 improvements)
508.42/508.67 c Primal Bound : infeasible
508.42/508.67 c Dual Bound : -
508.42/508.67 c Gap : 0.00 %
508.42/508.67 c Root Dual Bound : +0.00000000000000e+00
508.42/508.67 c Root Iterations : 203
508.52/508.70 c Time complete: 508.52.