0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2665869-1276305979.opb>
0.00/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.00/0.05 c problem read
0.00/0.05 c No objective function, only one solution is needed.
0.00/0.05 c presolving settings loaded
0.00/0.07 c presolving:
0.09/0.11 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.14 c presolving (3 rounds):
0.09/0.14 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.14 c 242 implications, 22 cliques
0.09/0.14 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.09/0.14 c 1 constraints of type <knapsack>
0.09/0.14 c 22 constraints of type <setppc>
0.09/0.14 c 2541 constraints of type <logicor>
0.09/0.14 c transformed objective value is always integral (scale: 1)
0.09/0.14 c Presolving Time: 0.07
0.09/0.14 c - non default parameters ----------------------------------------------------------------------
0.09/0.14 c # SCIP version 1.2.1.2
0.09/0.14 c
0.09/0.14 c # frequency for displaying node information lines
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.14 c display/freq = 10000
0.09/0.14 c
0.09/0.14 c # maximal time in seconds to run
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.14 c limits/time = 1799.95
0.09/0.14 c
0.09/0.14 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.14 c limits/memory = 1620
0.09/0.14 c
0.09/0.14 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14 c limits/solutions = 1
0.09/0.14 c
0.09/0.14 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.14 c separating/maxrounds = 1
0.09/0.14 c
0.09/0.14 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14 c separating/maxroundsroot = 5
0.09/0.14 c
0.09/0.14 c # should presolving try to simplify inequalities
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.14 c constraints/linear/simplifyinequalities = TRUE
0.09/0.14 c
0.09/0.14 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.14 c constraints/knapsack/disaggregation = FALSE
0.09/0.14 c
0.09/0.14 c # should presolving try to simplify knapsacks
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.14 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.14 c
0.09/0.14 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14 c presolving/probing/maxrounds = 0
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 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.17 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.17 c 0.1s| 1 | 0 | 56 | - |3551k| 0 | 34 | 231 |2564 | 231 |2564 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.49 c 0.4s| 1 | 0 | 90 | - |3952k| 0 | 34 | 231 |2751 | 231 |2576 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.63 c 0.5s| 1 | 0 | 216 | - |4387k| 0 | 52 | 231 |2751 | 231 |2582 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
1.29/1.39 c 1.3s| 1 | 0 | 1261 | - |4876k| 0 | 48 | 231 |2751 | 231 |2586 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
1.49/1.56 c 1.4s| 1 | 0 | 1423 | - |5262k| 0 | 50 | 231 |2751 | 231 |2596 | 32 | 0 | 0 | 0.000000e+00 | -- | Inf
2.50/2.52 c 2.4s| 1 | 0 | 2930 | - |6824k| 0 | 58 | 231 |2751 | 231 |2599 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
5.10/5.14 c 5.0s| 1 | 2 | 2930 | - |6825k| 0 | 58 | 231 |2751 | 231 |2599 | 35 | 0 | 10 | 0.000000e+00 | -- | Inf
161.34/161.40 c 157s| 10000 | 27 |345077 | 34.2 |8336k| 40 | - | 231 |5709 | 231 |2566 | 35 |4724 |2220 | 0.000000e+00 | -- | Inf
303.20/303.31 c 295s| 20000 | 31 |759498 | 37.8 |9348k| 43 | 40 | 231 |7899 | 231 |2566 | 35 | 10k|2629 | 0.000000e+00 | -- | Inf
446.47/446.62 c 434s| 30000 | 40 | 1156k| 38.5 |9784k| 46 | 35 | 231 |8638 | 231 |2566 | 35 | 15k|3366 | 0.000000e+00 | -- | Inf
559.73/559.91 c
559.73/559.91 c SCIP Status : problem is solved [infeasible]
559.73/559.91 c Solving Time (sec) : 543.13
559.73/559.91 c Solving Nodes : 37973
559.73/559.91 c Primal Bound : +1.00000000000000e+20 (0 solutions)
559.73/559.91 c Dual Bound : +1.00000000000000e+20
559.73/559.91 c Gap : 0.00 %
559.73/559.91 s UNSATISFIABLE
559.73/559.91 c SCIP Status : problem is solved [infeasible]
559.73/559.91 c Solving Time : 543.13
559.73/559.91 c Original Problem :
559.73/559.91 c Problem name : HOME/instance-2665869-1276305979.opb
559.73/559.91 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
559.73/559.91 c Constraints : 2707 initial, 2707 maximal
559.73/559.91 c Presolved Problem :
559.73/559.91 c Problem name : t_HOME/instance-2665869-1276305979.opb
559.73/559.91 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
559.73/559.91 c Constraints : 2564 initial, 9281 maximal
559.73/559.91 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
559.73/559.91 c trivial : 0.00 0 0 0 0 0 0 0 0
559.73/559.91 c dualfix : 0.00 0 0 0 0 0 0 0 0
559.73/559.91 c boundshift : 0.00 0 0 0 0 0 0 0 0
559.73/559.91 c inttobinary : 0.00 0 0 0 0 0 0 0 0
559.73/559.91 c implics : 0.00 0 0 0 0 0 0 0 0
559.73/559.91 c probing : 0.00 0 0 0 0 0 0 0 0
559.73/559.91 c knapsack : 0.00 0 0 0 0 0 0 0 0
559.73/559.91 c setppc : 0.00 0 0 0 0 0 0 0 0
559.73/559.91 c linear : 0.03 0 0 0 0 0 143 0 0
559.73/559.91 c logicor : 0.03 0 0 0 0 0 0 0 0
559.73/559.91 c root node : - 3 - - 3 - - - -
559.73/559.91 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
559.73/559.91 c integral : 0 0 0 20182 0 198 1520 0 0 38068
559.73/559.91 c knapsack : 1 5 123200 0 0 98 38795 2 0 0
559.73/559.91 c setppc : 22 5 123160 0 0 451 223644 0 0 0
559.73/559.91 c linear : 0+ 5 120824 0 0 2 1173 4 0 0
559.73/559.91 c logicor : 2541+ 5 70538 0 0 144 223284 0 0 0
559.73/559.91 c countsols : 0 0 0 0 0 0 0 0 0 0
559.73/559.91 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
559.73/559.91 c integral : 70.27 0.00 0.00 70.27 0.00
559.73/559.91 c knapsack : 0.91 0.00 0.91 0.00 0.00
559.73/559.91 c setppc : 2.12 0.00 2.12 0.00 0.00
559.73/559.91 c linear : 1.38 0.00 1.38 0.00 0.00
559.73/559.91 c logicor : 9.54 0.00 9.54 0.00 0.00
559.73/559.91 c countsols : 0.00 0.00 0.00 0.00 0.00
559.73/559.91 c Propagators : Time Calls Cutoffs DomReds
559.73/559.91 c vbounds : 0.06 1 0 0
559.73/559.91 c rootredcost : 0.05 0 0 0
559.73/559.91 c pseudoobj : 0.11 0 0 0
559.73/559.91 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
559.73/559.91 c propagation : 0.04 695 690 3351 19.3 16 21.9 -
559.73/559.91 c infeasible LP : 7.43 18142 13531 74851 33.4 41 18.8 0
559.73/559.91 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
559.73/559.91 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
559.73/559.91 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
559.73/559.91 c applied globally : - - - 18650 19.5 - - -
559.73/559.91 c applied locally : - - - 662 33.5 - - -
559.73/559.91 c Separators : Time Calls Cutoffs DomReds Cuts Conss
559.73/559.91 c cut pool : 0.01 4 - - 8 - (maximal pool size: 949)
559.73/559.91 c redcost : 0.15 19278 0 0 0 0
559.73/559.91 c impliedbounds : 0.00 5 0 0 0 0
559.73/559.91 c intobj : 0.00 0 0 0 0 0
559.73/559.91 c cgmip : 0.00 0 0 0 0 0
559.73/559.91 c gomory : 0.39 5 0 0 2174 0
559.73/559.91 c strongcg : 0.31 5 0 0 2500 0
559.73/559.91 c cmir : 0.00 0 0 0 0 0
559.73/559.91 c flowcover : 0.00 0 0 0 0 0
559.73/559.91 c clique : 0.00 5 0 0 0 0
559.73/559.91 c zerohalf : 0.00 0 0 0 0 0
559.73/559.91 c mcf : 0.00 1 0 0 0 0
559.73/559.91 c rapidlearning : 0.20 1 0 0 0 187
559.73/559.91 c Pricers : Time Calls Vars
559.73/559.91 c problem variables: 0.00 0 0
559.73/559.91 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
559.73/559.91 c relpscost : 70.22 20182 198 1520 0 0 38068
559.73/559.91 c pscost : 0.00 0 0 0 0 0 0
559.73/559.91 c inference : 0.00 0 0 0 0 0 0
559.73/559.91 c mostinf : 0.00 0 0 0 0 0 0
559.73/559.91 c leastinf : 0.00 0 0 0 0 0 0
559.73/559.91 c fullstrong : 0.00 0 0 0 0 0 0
559.73/559.91 c allfullstrong : 0.00 0 0 0 0 0 0
559.73/559.91 c random : 0.00 0 0 0 0 0 0
559.73/559.91 c Primal Heuristics : Time Calls Found
559.73/559.91 c LP solutions : 0.00 - 0
559.73/559.91 c pseudo solutions : 0.00 - 0
559.73/559.91 c trivial : 0.00 1 0
559.73/559.91 c simplerounding : 0.00 0 0
559.73/559.91 c zirounding : 0.00 0 0
559.73/559.91 c rounding : 0.00 0 0
559.73/559.91 c shifting : 0.00 0 0
559.73/559.91 c intshifting : 0.00 0 0
559.73/559.91 c oneopt : 0.00 0 0
559.73/559.91 c twoopt : 0.00 0 0
559.73/559.91 c fixandinfer : 0.00 0 0
559.73/559.91 c feaspump : 0.00 0 0
559.73/559.91 c coefdiving : 0.00 0 0
559.73/559.91 c pscostdiving : 0.00 0 0
559.73/559.91 c fracdiving : 0.00 0 0
559.73/559.91 c veclendiving : 0.00 0 0
559.73/559.91 c intdiving : 0.00 0 0
559.73/559.91 c actconsdiving : 0.00 0 0
559.73/559.91 c objpscostdiving : 0.00 0 0
559.73/559.91 c rootsoldiving : 0.00 0 0
559.73/559.91 c linesearchdiving : 0.00 0 0
559.73/559.91 c guideddiving : 0.00 0 0
559.73/559.91 c octane : 0.00 0 0
559.73/559.91 c rens : 0.00 0 0
559.73/559.91 c rins : 0.00 0 0
559.73/559.91 c localbranching : 0.00 0 0
559.73/559.91 c mutation : 0.00 0 0
559.73/559.91 c crossover : 0.00 0 0
559.73/559.91 c dins : 0.00 0 0
559.73/559.91 c undercover : 0.00 0 0
559.73/559.91 c nlp : 0.00 0 0
559.73/559.91 c trysol : 0.00 0 0
559.73/559.91 c LP : Time Calls Iterations Iter/call Iter/sec
559.73/559.91 c primal LP : 0.00 0 0 0.00 -
559.73/559.91 c dual LP : 424.21 38295 1468036 38.33 3460.64
559.73/559.91 c lex dual LP : 0.00 0 0 0.00 -
559.73/559.91 c barrier LP : 0.00 0 0 0.00 -
559.73/559.91 c diving/probing LP: 0.00 0 0 0.00 -
559.73/559.91 c strong branching : 69.33 3849 270755 70.34 3905.31
559.73/559.91 c (at root node) : - 10 6626 662.60 -
559.73/559.91 c conflict analysis: 0.00 0 0 0.00 -
559.73/559.91 c B&B Tree :
559.73/559.91 c number of runs : 1
559.73/559.91 c nodes : 37973
559.73/559.91 c nodes (total) : 37973
559.73/559.91 c nodes left : 0
559.73/559.91 c max depth : 51
559.73/559.91 c max depth (total): 51
559.73/559.91 c backtracks : 4114 (10.8%)
559.73/559.91 c delayed cutoffs : 96
559.73/559.91 c repropagations : 39455 (58237 domain reductions, 96 cutoffs)
559.73/559.91 c avg switch length: 3.89
559.73/559.91 c switching time : 10.53
559.73/559.91 c Solution :
559.73/559.91 c Solutions found : 0 (0 improvements)
559.73/559.91 c Primal Bound : infeasible
559.73/559.91 c Dual Bound : -
559.73/559.91 c Gap : 0.00 %
559.73/559.91 c Root Dual Bound : +0.00000000000000e+00
559.73/559.91 c Root Iterations : 2930
559.73/559.93 c Time complete: 559.76.