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-2667260-1276290283.opb>
0.04/0.06 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.04/0.06 c problem read
0.04/0.06 c No objective function, only one solution is needed.
0.04/0.06 c presolving settings loaded
0.04/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.07
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.55 c 0.4s| 1 | 0 | 110 | - |4012k| 0 | 40 | 231 |2763 | 231 |2579 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.70 c 0.6s| 1 | 0 | 162 | - |4479k| 0 | 48 | 231 |2763 | 231 |2584 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.99/1.02 c 0.9s| 1 | 0 | 187 | - |4887k| 0 | 46 | 231 |2763 | 231 |2587 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
1.29/1.39 c 1.2s| 1 | 0 | 225 | - |5341k| 0 | 47 | 231 |2763 | 231 |2588 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
1.69/1.75 c 1.6s| 1 | 0 | 257 | - |5460k| 0 | 52 | 231 |2763 | 231 |2593 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
2.39/2.46 c 2.3s| 1 | 2 | 257 | - |5460k| 0 | 52 | 231 |2763 | 231 |2593 | 29 | 0 | 9 | 0.000000e+00 | -- | Inf
172.64/172.74 c 169s| 10000 | 49 |308469 | 30.8 |7943k| 42 | 37 | 231 |8260 | 231 |2578 | 29 |7219 |2286 | 0.000000e+00 | -- | Inf
301.99/302.10 c 296s| 20000 | 53 |614429 | 30.7 |9352k| 43 | 45 | 231 | 11k| 231 |2578 | 29 | 14k|2578 | 0.000000e+00 | -- | Inf
450.45/450.63 c 442s| 30000 | 102 |952240 | 31.7 | 10M| 47 | - | 231 | 14k| 231 |2578 | 29 | 22k|3282 | 0.000000e+00 | -- | Inf
588.71/588.92 c 577s| 40000 | 21 | 1263k| 31.6 |9954k| 51 | - | 231 | 11k| 231 |2578 | 29 | 29k|3879 | 0.000000e+00 | -- | Inf
611.80/612.08 c
611.80/612.08 c SCIP Status : problem is solved [infeasible]
611.80/612.08 c Solving Time (sec) : 599.80
611.80/612.08 c Solving Nodes : 41700
611.80/612.08 c Primal Bound : +1.00000000000000e+20 (0 solutions)
611.80/612.08 c Dual Bound : +1.00000000000000e+20
611.80/612.08 c Gap : 0.00 %
611.80/612.08 s UNSATISFIABLE
611.80/612.08 c SCIP Status : problem is solved [infeasible]
611.80/612.08 c Solving Time : 599.80
611.80/612.08 c Original Problem :
611.80/612.08 c Problem name : HOME/instance-2667260-1276290283.opb
611.80/612.08 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
611.80/612.08 c Constraints : 2707 initial, 2707 maximal
611.80/612.08 c Presolved Problem :
611.80/612.08 c Problem name : t_HOME/instance-2667260-1276290283.opb
611.80/612.08 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
611.80/612.08 c Constraints : 2564 initial, 14356 maximal
611.80/612.08 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
611.80/612.08 c trivial : 0.00 0 0 0 0 0 0 0 0
611.80/612.08 c dualfix : 0.00 0 0 0 0 0 0 0 0
611.80/612.08 c boundshift : 0.00 0 0 0 0 0 0 0 0
611.80/612.08 c inttobinary : 0.00 0 0 0 0 0 0 0 0
611.80/612.08 c implics : 0.00 0 0 0 0 0 0 0 0
611.80/612.08 c probing : 0.00 0 0 0 0 0 0 0 0
611.80/612.08 c knapsack : 0.00 0 0 0 0 0 0 0 0
611.80/612.08 c setppc : 0.00 0 0 0 0 0 0 0 0
611.80/612.08 c linear : 0.02 0 0 0 0 0 143 0 0
611.80/612.08 c logicor : 0.02 0 0 0 0 0 0 0 0
611.80/612.08 c root node : - 21 - - 21 - - - -
611.80/612.08 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
611.80/612.08 c integral : 0 0 0 21844 0 85 1512 0 0 41976
611.80/612.08 c knapsack : 1 5 168400 0 0 198 83752 0 0 0
611.80/612.08 c setppc : 22 5 168360 0 0 901 247252 0 0 0
611.80/612.08 c linear : 0+ 5 165721 0 0 16 3498 2 0 0
611.80/612.08 c logicor : 2541+ 5 80996 0 0 300 262967 0 0 0
611.80/612.08 c countsols : 0 0 0 0 0 0 0 0 0 0
611.80/612.08 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
611.80/612.08 c integral : 78.14 0.00 0.00 78.14 0.00
611.80/612.08 c knapsack : 1.35 0.00 1.35 0.00 0.00
611.80/612.08 c setppc : 3.29 0.00 3.29 0.00 0.00
611.80/612.08 c linear : 1.45 0.00 1.45 0.00 0.00
611.80/612.08 c logicor : 15.64 0.00 15.64 0.00 0.00
611.80/612.08 c countsols : 0.00 0.00 0.00 0.00 0.00
611.80/612.08 c Propagators : Time Calls Cutoffs DomReds
611.80/612.08 c vbounds : 0.16 1 0 0
611.80/612.08 c rootredcost : 0.14 0 0 0
611.80/612.08 c pseudoobj : 0.07 0 0 0
611.80/612.08 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
611.80/612.08 c propagation : 0.09 1415 1404 7128 19.4 35 19.1 -
611.80/612.08 c infeasible LP : 8.02 19486 19304 115292 29.7 111 17.6 0
611.80/612.08 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
611.80/612.08 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
611.80/612.08 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
611.80/612.08 c applied globally : - - - 30575 18.7 - - -
611.80/612.08 c applied locally : - - - 628 33.9 - - -
611.80/612.08 c Separators : Time Calls Cutoffs DomReds Cuts Conss
611.80/612.08 c cut pool : 0.00 4 - - 13 - (maximal pool size: 549)
611.80/612.08 c redcost : 0.17 21123 0 0 0 0
611.80/612.08 c impliedbounds : 0.00 5 0 0 0 0
611.80/612.08 c intobj : 0.00 0 0 0 0 0
611.80/612.08 c cgmip : 0.00 0 0 0 0 0
611.80/612.08 c gomory : 0.68 5 0 0 1695 0
611.80/612.08 c strongcg : 0.53 5 0 0 2328 0
611.80/612.08 c cmir : 0.00 0 0 0 0 0
611.80/612.08 c flowcover : 0.00 0 0 0 0 0
611.80/612.08 c clique : 0.00 5 0 0 0 0
611.80/612.08 c zerohalf : 0.00 0 0 0 0 0
611.80/612.08 c mcf : 0.00 1 0 0 0 0
611.80/612.08 c rapidlearning : 0.23 1 0 0 0 199
611.80/612.08 c Pricers : Time Calls Vars
611.80/612.08 c problem variables: 0.00 0 0
611.80/612.08 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
611.80/612.08 c relpscost : 78.13 21844 85 1512 0 0 41976
611.80/612.08 c pscost : 0.00 0 0 0 0 0 0
611.80/612.08 c inference : 0.00 0 0 0 0 0 0
611.80/612.08 c mostinf : 0.00 0 0 0 0 0 0
611.80/612.08 c leastinf : 0.00 0 0 0 0 0 0
611.80/612.08 c fullstrong : 0.00 0 0 0 0 0 0
611.80/612.08 c allfullstrong : 0.00 0 0 0 0 0 0
611.80/612.08 c random : 0.00 0 0 0 0 0 0
611.80/612.08 c Primal Heuristics : Time Calls Found
611.80/612.08 c LP solutions : 0.00 - 0
611.80/612.08 c pseudo solutions : 0.00 - 0
611.80/612.08 c trivial : 0.00 1 0
611.80/612.08 c simplerounding : 0.00 0 0
611.80/612.08 c zirounding : 0.00 0 0
611.80/612.08 c rounding : 0.00 0 0
611.80/612.08 c shifting : 0.00 0 0
611.80/612.08 c intshifting : 0.00 0 0
611.80/612.08 c oneopt : 0.00 0 0
611.80/612.08 c twoopt : 0.00 0 0
611.80/612.08 c fixandinfer : 0.00 0 0
611.80/612.08 c feaspump : 0.00 0 0
611.80/612.08 c coefdiving : 0.00 0 0
611.80/612.08 c pscostdiving : 0.00 0 0
611.80/612.08 c fracdiving : 0.00 0 0
611.80/612.08 c veclendiving : 0.00 0 0
611.80/612.08 c intdiving : 0.00 0 0
611.80/612.08 c actconsdiving : 0.00 0 0
611.80/612.08 c objpscostdiving : 0.00 0 0
611.80/612.08 c rootsoldiving : 0.00 0 0
611.80/612.08 c linesearchdiving : 0.00 0 0
611.80/612.08 c guideddiving : 0.00 0 0
611.80/612.08 c octane : 0.00 0 0
611.80/612.08 c rens : 0.00 0 0
611.80/612.08 c rins : 0.00 0 0
611.80/612.08 c localbranching : 0.00 0 0
611.80/612.08 c mutation : 0.00 0 0
611.80/612.08 c crossover : 0.00 0 0
611.80/612.08 c dins : 0.00 0 0
611.80/612.08 c undercover : 0.00 0 0
611.80/612.08 c nlp : 0.00 0 0
611.80/612.08 c trysol : 0.00 0 0
611.80/612.08 c LP : Time Calls Iterations Iter/call Iter/sec
611.80/612.08 c primal LP : 0.00 0 0 0.00 -
611.80/612.08 c dual LP : 451.83 41238 1318030 31.96 2917.09
611.80/612.08 c lex dual LP : 0.00 0 0 0.00 -
611.80/612.08 c barrier LP : 0.00 0 0 0.00 -
611.80/612.08 c diving/probing LP: 0.00 0 0 0.00 -
611.80/612.08 c strong branching : 77.26 3944 219657 55.69 2843.09
611.80/612.08 c (at root node) : - 9 1793 199.22 -
611.80/612.08 c conflict analysis: 0.00 0 0 0.00 -
611.80/612.08 c B&B Tree :
611.80/612.08 c number of runs : 1
611.80/612.08 c nodes : 41700
611.80/612.08 c nodes (total) : 41700
611.80/612.08 c nodes left : 0
611.80/612.08 c max depth : 51
611.80/612.08 c max depth (total): 51
611.80/612.08 c backtracks : 4802 (11.5%)
611.80/612.08 c delayed cutoffs : 277
611.80/612.08 c repropagations : 69959 (95953 domain reductions, 274 cutoffs)
611.80/612.08 c avg switch length: 4.90
611.80/612.08 c switching time : 14.70
611.80/612.08 c Solution :
611.80/612.08 c Solutions found : 0 (0 improvements)
611.80/612.08 c Primal Bound : infeasible
611.80/612.08 c Dual Bound : -
611.80/612.08 c Gap : 0.00 %
611.80/612.08 c Root Dual Bound : +0.00000000000000e+00
611.80/612.08 c Root Iterations : 257
611.90/612.11 c Time complete: 611.92.