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-2667262-1276291751.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.00/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.54 c 0.4s| 1 | 0 | 109 | - |3958k| 0 | 44 | 231 |2738 | 231 |2579 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
0.79/0.80 c 0.7s| 1 | 0 | 132 | - |4898k| 0 | 45 | 231 |2738 | 231 |2583 | 19 | 0 | 0 | 0.000000e+00 | -- | Inf
1.10/1.14 c 1.0s| 1 | 0 | 142 | - |4906k| 0 | 49 | 231 |2738 | 231 |2584 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
1.49/1.52 c 1.4s| 1 | 0 | 157 | - |4979k| 0 | 47 | 231 |2738 | 231 |2585 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
1.79/1.88 c 1.7s| 1 | 0 | 173 | - |4997k| 0 | 48 | 231 |2738 | 231 |2586 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
2.29/2.31 c 2.1s| 1 | 2 | 173 | - |4998k| 0 | 48 | 231 |2738 | 231 |2586 | 22 | 0 | 9 | 0.000000e+00 | -- | Inf
197.82/197.93 c 194s| 10000 | 59 |360271 | 36.0 |7958k| 40 | - | 231 |9300 | 231 |2577 | 22 |8011 |2312 | 0.000000e+00 | -- | Inf
270.70/270.86 c
270.70/270.86 c SCIP Status : problem is solved [infeasible]
270.70/270.86 c Solving Time (sec) : 265.30
270.70/270.86 c Solving Nodes : 14762
270.70/270.86 c Primal Bound : +1.00000000000000e+20 (0 solutions)
270.70/270.86 c Dual Bound : +1.00000000000000e+20
270.70/270.86 c Gap : 0.00 %
270.70/270.86 s UNSATISFIABLE
270.70/270.86 c SCIP Status : problem is solved [infeasible]
270.70/270.86 c Solving Time : 265.30
270.70/270.86 c Original Problem :
270.70/270.86 c Problem name : HOME/instance-2667262-1276291751.opb
270.70/270.86 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
270.70/270.86 c Constraints : 2707 initial, 2707 maximal
270.70/270.86 c Presolved Problem :
270.70/270.86 c Problem name : t_HOME/instance-2667262-1276291751.opb
270.70/270.86 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
270.70/270.86 c Constraints : 2564 initial, 9551 maximal
270.70/270.86 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
270.70/270.86 c trivial : 0.00 0 0 0 0 0 0 0 0
270.70/270.86 c dualfix : 0.00 0 0 0 0 0 0 0 0
270.70/270.86 c boundshift : 0.00 0 0 0 0 0 0 0 0
270.70/270.86 c inttobinary : 0.00 0 0 0 0 0 0 0 0
270.70/270.86 c implics : 0.00 0 0 0 0 0 0 0 0
270.70/270.86 c probing : 0.00 0 0 0 0 0 0 0 0
270.70/270.86 c knapsack : 0.00 0 0 0 0 0 0 0 0
270.70/270.86 c setppc : 0.00 0 0 0 0 0 0 0 0
270.70/270.86 c linear : 0.03 0 0 0 0 0 143 0 0
270.70/270.86 c logicor : 0.03 0 0 0 0 0 0 0 0
270.70/270.86 c root node : - 21 - - 21 - - - -
270.70/270.86 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
270.70/270.86 c integral : 0 0 0 7960 0 54 966 0 0 14860
270.70/270.86 c knapsack : 1 5 58753 0 0 54 31319 0 0 0
270.70/270.86 c setppc : 22 5 58759 0 0 317 89626 0 0 0
270.70/270.86 c linear : 0+ 5 58309 0 0 0 1391 4 0 0
270.70/270.86 c logicor : 2541+ 5 28342 0 0 168 84324 0 0 0
270.70/270.86 c countsols : 0 0 0 0 0 0 0 0 0 0
270.70/270.86 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
270.70/270.86 c integral : 57.44 0.00 0.00 57.44 0.00
270.70/270.86 c knapsack : 0.38 0.00 0.38 0.00 0.00
270.70/270.86 c setppc : 0.90 0.00 0.90 0.00 0.00
270.70/270.86 c linear : 0.70 0.00 0.70 0.00 0.00
270.70/270.86 c logicor : 4.15 0.01 4.14 0.00 0.00
270.70/270.86 c countsols : 0.00 0.00 0.00 0.00 0.00
270.70/270.86 c Propagators : Time Calls Cutoffs DomReds
270.70/270.86 c vbounds : 0.03 1 0 0
270.70/270.86 c rootredcost : 0.01 0 0 0
270.70/270.86 c pseudoobj : 0.05 0 0 0
270.70/270.86 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
270.70/270.86 c propagation : 0.03 539 536 2308 15.8 9 17.2 -
270.70/270.86 c infeasible LP : 3.05 6830 6805 37118 26.8 58 16.7 0
270.70/270.86 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
270.70/270.86 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
270.70/270.86 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
270.70/270.86 c applied globally : - - - 12262 17.2 - - -
270.70/270.86 c applied locally : - - - 13 32.4 - - -
270.70/270.86 c Separators : Time Calls Cutoffs DomReds Cuts Conss
270.70/270.86 c cut pool : 0.00 4 - - 28 - (maximal pool size: 406)
270.70/270.86 c redcost : 0.08 7511 0 0 0 0
270.70/270.86 c impliedbounds : 0.00 5 0 0 0 0
270.70/270.86 c intobj : 0.00 0 0 0 0 0
270.70/270.86 c cgmip : 0.00 0 0 0 0 0
270.70/270.86 c gomory : 0.77 5 0 0 1000 0
270.70/270.86 c strongcg : 0.61 5 0 0 1037 0
270.70/270.86 c cmir : 0.00 0 0 0 0 0
270.70/270.86 c flowcover : 0.00 0 0 0 0 0
270.70/270.86 c clique : 0.01 5 0 0 0 0
270.70/270.86 c zerohalf : 0.00 0 0 0 0 0
270.70/270.86 c mcf : 0.01 1 0 0 0 0
270.70/270.86 c rapidlearning : 0.20 1 0 0 0 174
270.70/270.86 c Pricers : Time Calls Vars
270.70/270.86 c problem variables: 0.00 0 0
270.70/270.86 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
270.70/270.86 c relpscost : 57.39 7960 54 966 0 0 14860
270.70/270.86 c pscost : 0.00 0 0 0 0 0 0
270.70/270.86 c inference : 0.00 0 0 0 0 0 0
270.70/270.86 c mostinf : 0.00 0 0 0 0 0 0
270.70/270.86 c leastinf : 0.00 0 0 0 0 0 0
270.70/270.86 c fullstrong : 0.00 0 0 0 0 0 0
270.70/270.86 c allfullstrong : 0.00 0 0 0 0 0 0
270.70/270.86 c random : 0.00 0 0 0 0 0 0
270.70/270.86 c Primal Heuristics : Time Calls Found
270.70/270.86 c LP solutions : 0.00 - 0
270.70/270.86 c pseudo solutions : 0.00 - 0
270.70/270.86 c trivial : 0.00 1 0
270.70/270.86 c simplerounding : 0.00 0 0
270.70/270.86 c zirounding : 0.00 0 0
270.70/270.86 c rounding : 0.00 0 0
270.70/270.86 c shifting : 0.00 0 0
270.70/270.86 c intshifting : 0.00 0 0
270.70/270.86 c oneopt : 0.00 0 0
270.70/270.86 c twoopt : 0.00 0 0
270.70/270.86 c fixandinfer : 0.00 0 0
270.70/270.86 c feaspump : 0.00 0 0
270.70/270.86 c coefdiving : 0.00 0 0
270.70/270.86 c pscostdiving : 0.00 0 0
270.70/270.86 c fracdiving : 0.00 0 0
270.70/270.86 c veclendiving : 0.00 0 0
270.70/270.86 c intdiving : 0.00 0 0
270.70/270.86 c actconsdiving : 0.00 0 0
270.70/270.86 c objpscostdiving : 0.00 0 0
270.70/270.86 c rootsoldiving : 0.00 0 0
270.70/270.86 c linesearchdiving : 0.00 0 0
270.70/270.86 c guideddiving : 0.00 0 0
270.70/270.86 c octane : 0.00 0 0
270.70/270.86 c rens : 0.00 0 0
270.70/270.86 c rins : 0.00 0 0
270.70/270.86 c localbranching : 0.00 0 0
270.70/270.86 c mutation : 0.00 0 0
270.70/270.86 c crossover : 0.00 0 0
270.70/270.86 c dins : 0.00 0 0
270.70/270.86 c undercover : 0.00 0 0
270.70/270.86 c nlp : 0.00 0 0
270.70/270.86 c trysol : 0.00 0 0
270.70/270.86 c LP : Time Calls Iterations Iter/call Iter/sec
270.70/270.86 c primal LP : 0.01 0 0 0.00 0.00
270.70/270.86 c dual LP : 184.53 14770 533859 36.14 2893.07
270.70/270.86 c lex dual LP : 0.00 0 0 0.00 -
270.70/270.86 c barrier LP : 0.00 0 0 0.00 -
270.70/270.86 c diving/probing LP: 0.00 0 0 0.00 -
270.70/270.86 c strong branching : 57.05 2477 160863 64.94 2819.68
270.70/270.86 c (at root node) : - 9 1134 126.00 -
270.70/270.86 c conflict analysis: 0.00 0 0 0.00 -
270.70/270.86 c B&B Tree :
270.70/270.86 c number of runs : 1
270.70/270.86 c nodes : 14762
270.70/270.86 c nodes (total) : 14762
270.70/270.86 c nodes left : 0
270.70/270.86 c max depth : 40
270.70/270.86 c max depth (total): 40
270.70/270.86 c backtracks : 1716 (11.6%)
270.70/270.86 c delayed cutoffs : 99
270.70/270.86 c repropagations : 24323 (32158 domain reductions, 91 cutoffs)
270.70/270.86 c avg switch length: 4.81
270.70/270.86 c switching time : 4.35
270.70/270.86 c Solution :
270.70/270.86 c Solutions found : 0 (0 improvements)
270.70/270.86 c Primal Bound : infeasible
270.70/270.86 c Dual Bound : -
270.70/270.86 c Gap : 0.00 %
270.70/270.86 c Root Dual Bound : +0.00000000000000e+00
270.70/270.86 c Root Iterations : 173
270.70/270.88 c Time complete: 270.78.