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-2667256-1276289558.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.14 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.56 c 0.4s| 1 | 0 | 103 | - |3901k| 0 | 41 | 231 |2681 | 231 |2576 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.70/0.77 c 0.6s| 1 | 0 | 127 | - |4508k| 0 | 47 | 231 |2681 | 231 |2580 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
0.99/1.10 c 0.9s| 1 | 0 | 171 | - |4560k| 0 | 52 | 231 |2681 | 231 |2585 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
1.39/1.48 c 1.3s| 1 | 0 | 179 | - |4561k| 0 | 54 | 231 |2681 | 231 |2586 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
1.79/1.85 c 1.7s| 1 | 0 | 183 | - |4562k| 0 | 54 | 231 |2681 | 231 |2587 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
2.59/2.61 c 2.4s| 1 | 2 | 183 | - |4562k| 0 | 54 | 231 |2681 | 231 |2587 | 23 | 0 | 9 | 0.000000e+00 | -- | Inf
167.93/168.03 c 165s| 10000 | 32 |290895 | 29.1 |6783k| 40 | 36 | 231 |7452 | 231 |2578 | 23 |6363 |2271 | 0.000000e+00 | -- | Inf
296.10/296.25 c 290s| 20000 | 11 |590981 | 29.5 |8066k| 40 | - | 231 | 10k| 231 |2578 | 23 | 13k|2565 | 0.000000e+00 | -- | Inf
433.55/433.79 c 425s| 30000 | 95 |898767 | 30.0 | 10M| 40 | 48 | 231 | 14k| 231 |2578 | 23 | 20k|3192 | 0.000000e+00 | -- | Inf
569.69/569.98 c 559s| 40000 | 125 | 1203k| 30.1 | 10M| 47 | - | 231 | 15k| 231 |2578 | 23 | 26k|3781 | 0.000000e+00 | -- | Inf
716.35/716.67 c 703s| 50000 | 8 | 1535k| 30.7 | 11M| 47 | 35 | 231 | 17k| 231 |2578 | 23 | 33k|4272 | 0.000000e+00 | -- | Inf
723.65/723.92 c
723.65/723.92 c SCIP Status : problem is solved [infeasible]
723.65/723.92 c Solving Time (sec) : 709.82
723.65/723.92 c Solving Nodes : 50427
723.65/723.92 c Primal Bound : +1.00000000000000e+20 (0 solutions)
723.65/723.92 c Dual Bound : +1.00000000000000e+20
723.65/723.92 c Gap : 0.00 %
723.65/723.92 s UNSATISFIABLE
723.65/723.92 c SCIP Status : problem is solved [infeasible]
723.65/723.92 c Solving Time : 709.82
723.65/723.92 c Original Problem :
723.65/723.92 c Problem name : HOME/instance-2667256-1276289558.opb
723.65/723.92 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
723.65/723.92 c Constraints : 2707 initial, 2707 maximal
723.65/723.92 c Presolved Problem :
723.65/723.92 c Problem name : t_HOME/instance-2667256-1276289558.opb
723.65/723.92 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
723.65/723.92 c Constraints : 2564 initial, 17073 maximal
723.65/723.92 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
723.65/723.92 c trivial : 0.00 0 0 0 0 0 0 0 0
723.65/723.92 c dualfix : 0.00 0 0 0 0 0 0 0 0
723.65/723.92 c boundshift : 0.00 0 0 0 0 0 0 0 0
723.65/723.92 c inttobinary : 0.00 0 0 0 0 0 0 0 0
723.65/723.92 c implics : 0.00 0 0 0 0 0 0 0 0
723.65/723.92 c probing : 0.00 0 0 0 0 0 0 0 0
723.65/723.92 c knapsack : 0.02 0 0 0 0 0 0 0 0
723.65/723.92 c setppc : 0.00 0 0 0 0 0 0 0 0
723.65/723.92 c linear : 0.03 0 0 0 0 0 143 0 0
723.65/723.92 c logicor : 0.01 0 0 0 0 0 0 0 0
723.65/723.92 c root node : - 42 - - 42 - - - -
723.65/723.92 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
723.65/723.92 c integral : 0 0 0 26352 0 110 1492 0 0 50870
723.65/723.92 c knapsack : 1 5 194513 0 0 524 125496 0 0 0
723.65/723.92 c setppc : 22 5 194183 0 0 1278 284138 0 0 0
723.65/723.92 c linear : 0+ 5 170073 0 0 3 2126 0 0 0
723.65/723.92 c logicor : 2541+ 5 96425 0 0 385 336448 0 0 0
723.65/723.92 c countsols : 0 0 0 0 0 0 0 0 0 0
723.65/723.92 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
723.65/723.92 c integral : 85.77 0.00 0.00 85.77 0.00
723.65/723.92 c knapsack : 1.38 0.01 1.37 0.00 0.00
723.65/723.92 c setppc : 2.78 0.00 2.78 0.00 0.00
723.65/723.92 c linear : 1.18 0.00 1.18 0.00 0.00
723.65/723.92 c logicor : 22.08 0.00 22.08 0.00 0.00
723.65/723.92 c countsols : 0.00 0.00 0.00 0.00 0.00
723.65/723.92 c Propagators : Time Calls Cutoffs DomReds
723.65/723.92 c vbounds : 0.17 1 0 0
723.65/723.92 c rootredcost : 0.14 0 0 0
723.65/723.92 c pseudoobj : 0.11 0 0 0
723.65/723.92 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
723.65/723.92 c propagation : 0.16 2190 2171 10498 20.0 35 18.7 -
723.65/723.92 c infeasible LP : 10.83 23119 22724 134423 31.2 135 19.4 0
723.65/723.92 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
723.65/723.92 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
723.65/723.92 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
723.65/723.92 c applied globally : - - - 33550 18.7 - - -
723.65/723.92 c applied locally : - - - 818 32.9 - - -
723.65/723.92 c Separators : Time Calls Cutoffs DomReds Cuts Conss
723.65/723.92 c cut pool : 0.00 4 - - 71 - (maximal pool size: 343)
723.65/723.92 c redcost : 0.17 25591 0 0 0 0
723.65/723.92 c impliedbounds : 0.00 5 0 0 0 0
723.65/723.92 c intobj : 0.00 0 0 0 0 0
723.65/723.92 c cgmip : 0.00 0 0 0 0 0
723.65/723.92 c gomory : 0.73 5 0 0 1275 0
723.65/723.92 c strongcg : 0.59 5 0 0 1306 0
723.65/723.92 c cmir : 0.00 0 0 0 0 0
723.65/723.92 c flowcover : 0.00 0 0 0 0 0
723.65/723.92 c clique : 0.00 5 0 0 0 0
723.65/723.92 c zerohalf : 0.00 0 0 0 0 0
723.65/723.92 c mcf : 0.00 1 0 0 0 0
723.65/723.92 c rapidlearning : 0.22 1 0 0 0 117
723.65/723.92 c Pricers : Time Calls Vars
723.65/723.92 c problem variables: 0.00 0 0
723.65/723.92 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
723.65/723.92 c relpscost : 85.70 26352 110 1492 0 0 50870
723.65/723.92 c pscost : 0.00 0 0 0 0 0 0
723.65/723.92 c inference : 0.00 0 0 0 0 0 0
723.65/723.92 c mostinf : 0.00 0 0 0 0 0 0
723.65/723.92 c leastinf : 0.00 0 0 0 0 0 0
723.65/723.92 c fullstrong : 0.00 0 0 0 0 0 0
723.65/723.92 c allfullstrong : 0.00 0 0 0 0 0 0
723.65/723.92 c random : 0.00 0 0 0 0 0 0
723.65/723.92 c Primal Heuristics : Time Calls Found
723.65/723.92 c LP solutions : 0.00 - 0
723.65/723.92 c pseudo solutions : 0.00 - 0
723.65/723.92 c trivial : 0.00 1 0
723.65/723.92 c simplerounding : 0.00 0 0
723.65/723.92 c zirounding : 0.00 0 0
723.65/723.92 c rounding : 0.00 0 0
723.65/723.92 c shifting : 0.00 0 0
723.65/723.92 c intshifting : 0.00 0 0
723.65/723.92 c oneopt : 0.00 0 0
723.65/723.92 c twoopt : 0.00 0 0
723.65/723.92 c fixandinfer : 0.00 0 0
723.65/723.92 c feaspump : 0.00 0 0
723.65/723.92 c coefdiving : 0.00 0 0
723.65/723.92 c pscostdiving : 0.00 0 0
723.65/723.92 c fracdiving : 0.00 0 0
723.65/723.92 c veclendiving : 0.00 0 0
723.65/723.92 c intdiving : 0.00 0 0
723.65/723.92 c actconsdiving : 0.00 0 0
723.65/723.92 c objpscostdiving : 0.00 0 0
723.65/723.92 c rootsoldiving : 0.00 0 0
723.65/723.92 c linesearchdiving : 0.00 0 0
723.65/723.92 c guideddiving : 0.00 0 0
723.65/723.92 c octane : 0.00 0 0
723.65/723.92 c rens : 0.00 0 0
723.65/723.92 c rins : 0.00 0 0
723.65/723.92 c localbranching : 0.00 0 0
723.65/723.92 c mutation : 0.00 0 0
723.65/723.92 c crossover : 0.00 0 0
723.65/723.92 c dins : 0.00 0 0
723.65/723.92 c undercover : 0.00 0 0
723.65/723.92 c nlp : 0.00 0 0
723.65/723.92 c trysol : 0.00 0 0
723.65/723.92 c LP : Time Calls Iterations Iter/call Iter/sec
723.65/723.92 c primal LP : 0.00 0 0 0.00 -
723.65/723.92 c dual LP : 534.64 49382 1550915 31.41 2900.86
723.65/723.92 c lex dual LP : 0.00 0 0 0.00 -
723.65/723.92 c barrier LP : 0.00 0 0 0.00 -
723.65/723.92 c diving/probing LP: 0.00 0 0 0.00 -
723.65/723.92 c strong branching : 84.55 4311 236179 54.79 2793.36
723.65/723.92 c (at root node) : - 9 1788 198.67 -
723.65/723.92 c conflict analysis: 0.00 0 0 0.00 -
723.65/723.92 c B&B Tree :
723.65/723.92 c number of runs : 1
723.65/723.92 c nodes : 50427
723.65/723.92 c nodes (total) : 50427
723.65/723.92 c nodes left : 0
723.65/723.92 c max depth : 47
723.65/723.92 c max depth (total): 47
723.65/723.92 c backtracks : 6467 (12.8%)
723.65/723.92 c delayed cutoffs : 444
723.65/723.92 c repropagations : 77318 (119809 domain reductions, 427 cutoffs)
723.65/723.92 c avg switch length: 4.72
723.65/723.92 c switching time : 19.94
723.65/723.92 c Solution :
723.65/723.92 c Solutions found : 0 (0 improvements)
723.65/723.92 c Primal Bound : infeasible
723.65/723.92 c Dual Bound : -
723.65/723.92 c Gap : 0.00 %
723.65/723.92 c Root Dual Bound : +0.00000000000000e+00
723.65/723.92 c Root Iterations : 183
723.65/723.95 c Time complete: 723.7.