0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2704146-1278549732.opb>
0.04/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.04/0.05 c problem read
0.04/0.05 c No objective function, only one solution is needed.
0.04/0.05 c presolving settings loaded
0.04/0.06 c presolving:
0.09/0.10 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.11 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.13 c (round 3) 0 del vars, 264 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.09/0.13 c presolving (4 rounds):
0.09/0.13 c 0 deleted vars, 264 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.13 c 242 implications, 22 cliques
0.09/0.13 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2443 constraints
0.09/0.13 c 1 constraints of type <knapsack>
0.09/0.13 c 22 constraints of type <setppc>
0.09/0.13 c 2420 constraints of type <logicor>
0.09/0.13 c transformed objective value is always integral (scale: 1)
0.09/0.13 c Presolving Time: 0.07
0.09/0.13 c - non default parameters ----------------------------------------------------------------------
0.09/0.13 c # SCIP version 1.2.1.3
0.09/0.13 c
0.09/0.13 c # frequency for displaying node information lines
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.13 c display/freq = 10000
0.09/0.13 c
0.09/0.13 c # maximal time in seconds to run
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.13 c limits/time = 1789.96
0.09/0.13 c
0.09/0.13 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.13 c limits/memory = 1620
0.09/0.13 c
0.09/0.13 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c limits/solutions = 1
0.09/0.13 c
0.09/0.13 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.13 c separating/maxrounds = 1
0.09/0.13 c
0.09/0.13 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c separating/maxroundsroot = 5
0.09/0.13 c
0.09/0.13 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.13 c # [type: int, range: [1,2], default: 1]
0.09/0.13 c timing/clocktype = 2
0.09/0.13 c
0.09/0.13 c # should presolving try to simplify inequalities
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/linear/simplifyinequalities = TRUE
0.09/0.13 c
0.09/0.13 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/indicator/addCouplingCons = TRUE
0.09/0.13 c
0.09/0.13 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.13 c constraints/knapsack/disaggregation = FALSE
0.09/0.13 c
0.09/0.13 c # should presolving try to simplify knapsacks
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.13 c
0.09/0.13 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c presolving/probing/maxrounds = 0
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/coefdiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.13 c heuristics/crossover/freq = -1
0.09/0.13 c
0.09/0.13 c # number of nodes added to the contingent of the total nodes
0.09/0.13 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.13 c heuristics/crossover/nodesofs = 750
0.09/0.13 c
0.09/0.13 c # number of nodes without incumbent change that heuristic should wait
0.09/0.13 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.13 c heuristics/crossover/nwaitingnodes = 100
0.09/0.13 c
0.09/0.13 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.13 c # [type: real, range: [0,1], default: 0.1]
0.09/0.13 c heuristics/crossover/nodesquot = 0.15
0.09/0.13 c
0.09/0.13 c # minimum percentage of integer variables that have to be fixed
0.09/0.13 c # [type: real, range: [0,1], default: 0.666]
0.09/0.13 c heuristics/crossover/minfixingrate = 0.5
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.13 c heuristics/feaspump/freq = -1
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/fracdiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/guideddiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/intshifting/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/linesearchdiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.13 c heuristics/nlp/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.13 c heuristics/objpscostdiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.13 c # [type: real, range: [0,1], default: 0.01]
0.09/0.13 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.13 c heuristics/oneopt/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/pscostdiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.13 c heuristics/rens/freq = -1
0.09/0.13 c
0.09/0.13 c # minimum percentage of integer variables that have to be fixable
0.09/0.13 c # [type: real, range: [0,1], default: 0.5]
0.09/0.13 c heuristics/rens/minfixingrate = 0.3
0.09/0.13 c
0.09/0.13 c # number of nodes added to the contingent of the total nodes
0.09/0.13 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.14 c heuristics/rens/nodesofs = 2000
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.14 c heuristics/rootsoldiving/freq = -1
0.09/0.14 c
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.14 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.14 c
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/rounding/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/shifting/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/simplerounding/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c heuristics/trivial/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/trysol/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/veclendiving/freq = -1
0.09/0.14 c
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.14 c
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/zirounding/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c separating/cmir/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c separating/flowcover/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14 c separating/rapidlearning/freq = 0
0.09/0.14 c
0.09/0.14 c -----------------------------------------------------------------------------------------------
0.09/0.14 c start solving
0.09/0.14 c
0.09/0.16 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.16 c 0.1s| 1 | 0 | 76 | - |3488k| 0 | 36 | 231 |2443 | 231 |2443 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.52 c 0.5s| 1 | 0 | 103 | - |3938k| 0 | 45 | 231 |2637 | 231 |2455 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.68 c 0.6s| 1 | 0 | 150 | - |4386k| 0 | 55 | 231 |2637 | 231 |2463 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
1.00/1.07 c 1.0s| 1 | 0 | 193 | - |4700k| 0 | 53 | 231 |2637 | 231 |2465 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
1.39/1.45 c 1.4s| 1 | 0 | 213 | - |5101k| 0 | 49 | 231 |2637 | 231 |2466 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
1.79/1.84 c 1.8s| 1 | 0 | 239 | - |5296k| 0 | 53 | 231 |2637 | 231 |2467 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
2.39/2.49 c 2.4s| 1 | 2 | 239 | - |5297k| 0 | 53 | 231 |2637 | 231 |2467 | 24 | 0 | 10 | 0.000000e+00 | -- | Inf
167.84/167.96 c 168s| 10000 | 75 |306264 | 30.6 |7378k| 40 | 42 | 231 |6356 | 231 |2452 | 24 |7593 |1944 | 0.000000e+00 | -- | Inf
291.90/292.09 c 292s| 20000 | 68 |625076 | 31.2 |8229k| 46 | 19 | 231 |8198 | 231 |2452 | 24 | 15k|2218 | 0.000000e+00 | -- | Inf
422.18/422.34 c 422s| 30000 | 25 |942068 | 31.4 |8743k| 46 | - | 231 |9685 | 231 |2452 | 24 | 23k|2854 | 0.000000e+00 | -- | Inf
570.75/570.93 c 571s| 40000 | 19 | 1307k| 32.7 | 10M| 49 | 26 | 231 | 12k| 231 |2452 | 24 | 31k|3492 | 0.000000e+00 | -- | Inf
581.23/581.46 c
581.23/581.46 c SCIP Status : problem is solved [infeasible]
581.23/581.46 c Solving Time (sec) : 581.41
581.23/581.46 c Solving Nodes : 40644
581.23/581.46 c Primal Bound : +1.00000000000000e+20 (0 solutions)
581.23/581.46 c Dual Bound : +1.00000000000000e+20
581.23/581.46 c Gap : 0.00 %
581.23/581.46 s UNSATISFIABLE
581.23/581.46 c SCIP Status : problem is solved [infeasible]
581.23/581.46 c Solving Time : 581.41
581.23/581.46 c Original Problem :
581.23/581.46 c Problem name : HOME/instance-2704146-1278549732.opb
581.23/581.46 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
581.23/581.46 c Constraints : 2707 initial, 2707 maximal
581.23/581.46 c Presolved Problem :
581.23/581.46 c Problem name : t_HOME/instance-2704146-1278549732.opb
581.23/581.46 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
581.23/581.46 c Constraints : 2443 initial, 12987 maximal
581.23/581.46 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
581.23/581.46 c trivial : 0.00 0 0 0 0 0 0 0 0
581.23/581.46 c dualfix : 0.00 0 0 0 0 0 0 0 0
581.23/581.46 c boundshift : 0.00 0 0 0 0 0 0 0 0
581.23/581.46 c inttobinary : 0.00 0 0 0 0 0 0 0 0
581.23/581.46 c implics : 0.00 0 0 0 0 0 0 0 0
581.23/581.46 c probing : 0.00 0 0 0 0 0 0 0 0
581.23/581.46 c knapsack : 0.00 0 0 0 0 0 0 0 0
581.23/581.46 c setppc : 0.00 0 0 0 0 0 121 0 0
581.23/581.46 c linear : 0.03 0 0 0 0 0 143 0 0
581.23/581.46 c logicor : 0.03 0 0 0 0 0 0 0 0
581.23/581.46 c root node : - 2 - - 2 - - - -
581.23/581.46 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
581.23/581.46 c integral : 0 0 0 21294 0 62 1308 0 0 40952
581.23/581.46 c knapsack : 1 5 168920 0 0 236 95254 0 0 0
581.23/581.46 c setppc : 22 5 168867 0 0 1045 244696 0 0 0
581.23/581.46 c linear : 0+ 5 161931 0 0 10 1811 2 0 0
581.23/581.46 c logicor : 2420+ 5 79318 0 0 400 263283 0 0 0
581.23/581.46 c countsols : 0 0 0 0 0 0 0 0 0 0
581.23/581.46 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
581.23/581.46 c integral : 81.04 0.00 0.00 81.04 0.00
581.23/581.46 c knapsack : 1.19 0.00 1.19 0.00 0.00
581.23/581.46 c setppc : 2.83 0.00 2.82 0.00 0.00
581.23/581.46 c linear : 1.38 0.00 1.38 0.00 0.00
581.23/581.46 c logicor : 13.68 0.00 13.68 0.00 0.00
581.23/581.46 c countsols : 0.00 0.00 0.00 0.00 0.00
581.23/581.46 c Propagators : Time Calls Cutoffs DomReds
581.23/581.46 c vbounds : 0.08 1 0 0
581.23/581.46 c rootredcost : 0.09 0 0 0
581.23/581.46 c pseudoobj : 0.06 0 0 0
581.23/581.46 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
581.23/581.46 c propagation : 0.11 1691 1679 8055 18.2 27 16.4 -
581.23/581.46 c infeasible LP : 7.60 18721 18585 109968 28.6 101 15.2 0
581.23/581.46 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
581.23/581.46 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
581.23/581.46 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
581.23/581.46 c applied globally : - - - 32350 18.0 - - -
581.23/581.46 c applied locally : - - - 82 32.2 - - -
581.23/581.46 c Separators : Time Calls Cutoffs DomReds Cuts Conss
581.23/581.46 c cut pool : 0.00 4 - - 35 - (maximal pool size: 509)
581.23/581.46 c redcost : 0.19 20568 0 0 0 0
581.23/581.46 c impliedbounds : 0.00 5 0 0 0 0
581.23/581.46 c intobj : 0.00 0 0 0 0 0
581.23/581.46 c cgmip : 0.00 0 0 0 0 0
581.23/581.46 c gomory : 0.75 5 0 0 1000 0
581.23/581.46 c strongcg : 0.63 5 0 0 2216 0
581.23/581.46 c cmir : 0.00 0 0 0 0 0
581.23/581.46 c flowcover : 0.00 0 0 0 0 0
581.23/581.46 c clique : 0.00 5 0 0 0 0
581.23/581.46 c zerohalf : 0.00 0 0 0 0 0
581.23/581.46 c mcf : 0.00 1 0 0 0 0
581.23/581.46 c rapidlearning : 0.23 1 0 0 0 194
581.23/581.46 c Pricers : Time Calls Vars
581.23/581.46 c problem variables: 0.00 0 0
581.23/581.46 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
581.23/581.46 c relpscost : 80.99 21294 62 1308 0 0 40952
581.23/581.46 c pscost : 0.00 0 0 0 0 0 0
581.23/581.46 c inference : 0.00 0 0 0 0 0 0
581.23/581.46 c mostinf : 0.00 0 0 0 0 0 0
581.23/581.46 c leastinf : 0.00 0 0 0 0 0 0
581.23/581.46 c fullstrong : 0.00 0 0 0 0 0 0
581.23/581.46 c allfullstrong : 0.00 0 0 0 0 0 0
581.23/581.46 c random : 0.00 0 0 0 0 0 0
581.23/581.46 c Primal Heuristics : Time Calls Found
581.23/581.46 c LP solutions : 0.00 - 0
581.23/581.46 c pseudo solutions : 0.00 - 0
581.23/581.46 c trivial : 0.00 1 0
581.23/581.46 c simplerounding : 0.00 0 0
581.23/581.46 c zirounding : 0.00 0 0
581.23/581.46 c rounding : 0.00 0 0
581.23/581.46 c shifting : 0.00 0 0
581.23/581.46 c intshifting : 0.00 0 0
581.23/581.46 c oneopt : 0.00 0 0
581.23/581.46 c twoopt : 0.00 0 0
581.23/581.46 c fixandinfer : 0.00 0 0
581.23/581.46 c feaspump : 0.00 0 0
581.23/581.46 c coefdiving : 0.00 0 0
581.23/581.46 c pscostdiving : 0.00 0 0
581.23/581.46 c fracdiving : 0.00 0 0
581.23/581.46 c veclendiving : 0.00 0 0
581.23/581.46 c intdiving : 0.00 0 0
581.23/581.46 c actconsdiving : 0.00 0 0
581.23/581.46 c objpscostdiving : 0.00 0 0
581.23/581.46 c rootsoldiving : 0.00 0 0
581.23/581.46 c linesearchdiving : 0.00 0 0
581.23/581.46 c guideddiving : 0.00 0 0
581.23/581.46 c octane : 0.00 0 0
581.23/581.46 c rens : 0.00 0 0
581.23/581.46 c rins : 0.00 0 0
581.23/581.46 c localbranching : 0.00 0 0
581.23/581.46 c mutation : 0.00 0 0
581.23/581.46 c crossover : 0.00 0 0
581.23/581.46 c dins : 0.00 0 0
581.23/581.46 c undercover : 0.00 0 0
581.23/581.46 c nlp : 0.00 0 0
581.23/581.46 c trysol : 0.00 0 0
581.23/581.46 c LP : Time Calls Iterations Iter/call Iter/sec
581.23/581.46 c primal LP : 0.00 0 0 0.00 -
581.23/581.46 c dual LP : 436.42 39960 1335918 33.43 3061.07
581.23/581.46 c lex dual LP : 0.00 0 0 0.00 -
581.23/581.46 c barrier LP : 0.00 0 0 0.00 -
581.23/581.46 c diving/probing LP: 0.00 0 0 0.00 -
581.23/581.46 c strong branching : 80.12 3493 234426 67.11 2925.94
581.23/581.46 c (at root node) : - 10 1776 177.60 -
581.23/581.46 c conflict analysis: 0.00 0 0 0.00 -
581.23/581.46 c B&B Tree :
581.23/581.46 c number of runs : 1
581.23/581.46 c nodes : 40644
581.23/581.46 c nodes (total) : 40644
581.23/581.46 c nodes left : 0
581.23/581.46 c max depth : 49
581.23/581.46 c max depth (total): 49
581.23/581.46 c backtracks : 4464 (11.0%)
581.23/581.46 c delayed cutoffs : 309
581.23/581.46 c repropagations : 72655 (94803 domain reductions, 306 cutoffs)
581.23/581.46 c avg switch length: 5.17
581.23/581.46 c switching time : 14.04
581.23/581.46 c Solution :
581.23/581.46 c Solutions found : 0 (0 improvements)
581.23/581.46 c Primal Bound : infeasible
581.23/581.46 c Dual Bound : -
581.23/581.46 c Gap : 0.00 %
581.23/581.46 c Root Dual Bound : +0.00000000000000e+00
581.23/581.46 c Root Iterations : 239
581.23/581.49 c Time complete: 581.33.