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-2704145-1278549681.opb>
0.02/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.02/0.05 c problem read
0.02/0.05 c No objective function, only one solution is needed.
0.02/0.05 c presolving settings loaded
0.02/0.06 c presolving:
0.02/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.12 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.13 c heuristics/rens/nodesofs = 2000
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <rootsoldiving> (-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/rootsoldiving/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.01]
0.09/0.13 c heuristics/rootsoldiving/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/rootsoldiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <rounding> (-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/rounding/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <shifting> (-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/shifting/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <simplerounding> (-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/simplerounding/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <trivial> (-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/trivial/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <trysol> (-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/trysol/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <veclendiving> (-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/veclendiving/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/veclendiving/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/veclendiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <zirounding> (-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/zirounding/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.13 c separating/cmir/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.13 c separating/flowcover/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c separating/rapidlearning/freq = 0
0.09/0.13 c
0.09/0.13 c -----------------------------------------------------------------------------------------------
0.09/0.13 c start solving
0.09/0.13 c
0.09/0.15 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.15 c 0.1s| 1 | 0 | 76 | - |3488k| 0 | 36 | 231 |2443 | 231 |2443 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.48 c 0.4s| 1 | 0 | 97 | - |3892k| 0 | 44 | 231 |2595 | 231 |2454 | 11 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.69 c 0.6s| 1 | 0 | 135 | - |4338k| 0 | 50 | 231 |2595 | 231 |2458 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
1.00/1.01 c 1.0s| 1 | 0 | 159 | - |4942k| 0 | 52 | 231 |2595 | 231 |2460 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
1.29/1.37 c 1.3s| 1 | 0 | 187 | - |5552k| 0 | 59 | 231 |2595 | 231 |2462 | 19 | 0 | 0 | 0.000000e+00 | -- | Inf
1.69/1.74 c 1.7s| 1 | 0 | 205 | - |6290k| 0 | 55 | 231 |2595 | 231 |2465 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
2.49/2.54 c 2.5s| 1 | 2 | 205 | - |6291k| 0 | 55 | 231 |2595 | 231 |2465 | 22 | 0 | 10 | 0.000000e+00 | -- | Inf
149.15/149.25 c 149s| 10000 | 62 |310483 | 31.0 |8218k| 40 | 33 | 231 |6522 | 231 |2452 | 22 |6095 |2195 | 0.000000e+00 | -- | Inf
256.82/256.92 c 257s| 20000 | 30 |609145 | 30.4 |8911k| 46 | - | 231 |7946 | 231 |2452 | 22 | 12k|2408 | 0.000000e+00 | -- | Inf
379.50/379.63 c 380s| 30000 | 29 |928559 | 30.9 |9981k| 46 | - | 231 | 10k| 231 |2452 | 22 | 18k|3115 | 0.000000e+00 | -- | Inf
496.98/497.17 c 497s| 40000 | 40 | 1233k| 30.8 | 11M| 46 | - | 231 | 14k| 231 |2452 | 22 | 26k|3732 | 0.000000e+00 | -- | Inf
618.74/618.93 c 619s| 50000 | 76 | 1553k| 31.1 | 12M| 48 | - | 231 | 16k| 231 |2452 | 22 | 32k|4218 | 0.000000e+00 | -- | Inf
732.01/732.28 c
732.01/732.28 c SCIP Status : problem is solved [infeasible]
732.01/732.28 c Solving Time (sec) : 732.23
732.01/732.28 c Solving Nodes : 59453
732.01/732.28 c Primal Bound : +1.00000000000000e+20 (0 solutions)
732.01/732.28 c Dual Bound : +1.00000000000000e+20
732.01/732.28 c Gap : 0.00 %
732.01/732.28 s UNSATISFIABLE
732.01/732.28 c SCIP Status : problem is solved [infeasible]
732.01/732.28 c Solving Time : 732.23
732.01/732.28 c Original Problem :
732.01/732.28 c Problem name : HOME/instance-2704145-1278549681.opb
732.01/732.28 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
732.01/732.28 c Constraints : 2707 initial, 2707 maximal
732.01/732.28 c Presolved Problem :
732.01/732.28 c Problem name : t_HOME/instance-2704145-1278549681.opb
732.01/732.28 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
732.01/732.28 c Constraints : 2443 initial, 16419 maximal
732.01/732.28 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
732.01/732.28 c trivial : 0.00 0 0 0 0 0 0 0 0
732.01/732.28 c dualfix : 0.00 0 0 0 0 0 0 0 0
732.01/732.28 c boundshift : 0.00 0 0 0 0 0 0 0 0
732.01/732.28 c inttobinary : 0.00 0 0 0 0 0 0 0 0
732.01/732.28 c implics : 0.00 0 0 0 0 0 0 0 0
732.01/732.28 c probing : 0.00 0 0 0 0 0 0 0 0
732.01/732.28 c knapsack : 0.00 0 0 0 0 0 0 0 0
732.01/732.28 c setppc : 0.00 0 0 0 0 0 121 0 0
732.01/732.28 c linear : 0.03 0 0 0 0 0 143 0 0
732.01/732.28 c logicor : 0.03 0 0 0 0 0 0 0 0
732.01/732.28 c root node : - 1 - - 1 - - - -
732.01/732.28 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
732.01/732.28 c integral : 0 0 0 31086 0 120 1690 0 0 59902
732.01/732.28 c knapsack : 1 5 227583 0 0 325 114201 2 0 0
732.01/732.28 c setppc : 22 5 227451 0 0 1377 331662 0 0 0
732.01/732.28 c linear : 0+ 5 217965 0 0 6 743 1 0 0
732.01/732.28 c logicor : 2420+ 5 112073 0 0 401 367650 0 0 0
732.01/732.28 c countsols : 0 0 0 0 0 0 0 0 0 0
732.01/732.28 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
732.01/732.28 c integral : 81.26 0.00 0.00 81.26 0.00
732.01/732.28 c knapsack : 1.49 0.00 1.49 0.00 0.00
732.01/732.28 c setppc : 3.70 0.00 3.70 0.00 0.00
732.01/732.28 c linear : 1.13 0.00 1.13 0.00 0.00
732.01/732.28 c logicor : 21.11 0.00 21.11 0.00 0.00
732.01/732.28 c countsols : 0.00 0.00 0.00 0.00 0.00
732.01/732.28 c Propagators : Time Calls Cutoffs DomReds
732.01/732.28 c vbounds : 0.10 1 0 0
732.01/732.28 c rootredcost : 0.11 0 0 0
732.01/732.28 c pseudoobj : 0.08 0 0 0
732.01/732.28 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
732.01/732.28 c propagation : 0.16 2109 2097 11297 20.6 36 17.4 -
732.01/732.28 c infeasible LP : 10.76 27715 27037 167482 32.6 144 16.6 0
732.01/732.28 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
732.01/732.28 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
732.01/732.28 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
732.01/732.28 c applied globally : - - - 38528 18.6 - - -
732.01/732.28 c applied locally : - - - 947 33.6 - - -
732.01/732.28 c Separators : Time Calls Cutoffs DomReds Cuts Conss
732.01/732.28 c cut pool : 0.00 4 - - 64 - (maximal pool size: 698)
732.01/732.28 c redcost : 0.27 30126 0 0 0 0
732.01/732.28 c impliedbounds : 0.00 5 0 0 0 0
732.01/732.28 c intobj : 0.00 0 0 0 0 0
732.01/732.28 c cgmip : 0.00 0 0 0 0 0
732.01/732.28 c gomory : 0.79 5 0 0 1000 0
732.01/732.28 c strongcg : 0.53 5 0 0 2500 0
732.01/732.28 c cmir : 0.00 0 0 0 0 0
732.01/732.28 c flowcover : 0.00 0 0 0 0 0
732.01/732.28 c clique : 0.00 5 0 0 0 0
732.01/732.28 c zerohalf : 0.00 0 0 0 0 0
732.01/732.28 c mcf : 0.00 1 0 0 0 0
732.01/732.28 c rapidlearning : 0.20 1 0 0 0 152
732.01/732.28 c Pricers : Time Calls Vars
732.01/732.28 c problem variables: 0.00 0 0
732.01/732.28 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
732.01/732.28 c relpscost : 81.18 31086 120 1690 0 0 59902
732.01/732.28 c pscost : 0.00 0 0 0 0 0 0
732.01/732.28 c inference : 0.00 0 0 0 0 0 0
732.01/732.28 c mostinf : 0.00 0 0 0 0 0 0
732.01/732.28 c leastinf : 0.00 0 0 0 0 0 0
732.01/732.28 c fullstrong : 0.00 0 0 0 0 0 0
732.01/732.28 c allfullstrong : 0.00 0 0 0 0 0 0
732.01/732.28 c random : 0.00 0 0 0 0 0 0
732.01/732.28 c Primal Heuristics : Time Calls Found
732.01/732.28 c LP solutions : 0.00 - 0
732.01/732.28 c pseudo solutions : 0.00 - 0
732.01/732.28 c trivial : 0.00 1 0
732.01/732.28 c simplerounding : 0.00 0 0
732.01/732.28 c zirounding : 0.00 0 0
732.01/732.28 c rounding : 0.00 0 0
732.01/732.28 c shifting : 0.00 0 0
732.01/732.28 c intshifting : 0.00 0 0
732.01/732.28 c oneopt : 0.00 0 0
732.01/732.28 c twoopt : 0.00 0 0
732.01/732.28 c fixandinfer : 0.00 0 0
732.01/732.28 c feaspump : 0.00 0 0
732.01/732.28 c coefdiving : 0.00 0 0
732.01/732.28 c pscostdiving : 0.00 0 0
732.01/732.28 c fracdiving : 0.00 0 0
732.01/732.28 c veclendiving : 0.00 0 0
732.01/732.28 c intdiving : 0.00 0 0
732.01/732.28 c actconsdiving : 0.00 0 0
732.01/732.28 c objpscostdiving : 0.00 0 0
732.01/732.28 c rootsoldiving : 0.00 0 0
732.01/732.28 c linesearchdiving : 0.00 0 0
732.01/732.28 c guideddiving : 0.00 0 0
732.01/732.28 c octane : 0.00 0 0
732.01/732.28 c rens : 0.00 0 0
732.01/732.28 c rins : 0.00 0 0
732.01/732.28 c localbranching : 0.00 0 0
732.01/732.28 c mutation : 0.00 0 0
732.01/732.28 c crossover : 0.00 0 0
732.01/732.28 c dins : 0.00 0 0
732.01/732.28 c undercover : 0.00 0 0
732.01/732.28 c nlp : 0.00 0 0
732.01/732.28 c trysol : 0.00 0 0
732.01/732.28 c LP : Time Calls Iterations Iter/call Iter/sec
732.01/732.28 c primal LP : 0.00 0 0 0.00 -
732.01/732.28 c dual LP : 559.87 58683 1847589 31.48 3300.05
732.01/732.28 c lex dual LP : 0.00 0 0 0.00 -
732.01/732.28 c barrier LP : 0.00 0 0 0.00 -
732.01/732.28 c diving/probing LP: 0.00 0 0 0.00 -
732.01/732.28 c strong branching : 79.96 4659 258644 55.51 3234.54
732.01/732.28 c (at root node) : - 10 2086 208.60 -
732.01/732.28 c conflict analysis: 0.00 0 0 0.00 -
732.01/732.28 c B&B Tree :
732.01/732.28 c number of runs : 1
732.01/732.28 c nodes : 59453
732.01/732.28 c nodes (total) : 59453
732.01/732.28 c nodes left : 0
732.01/732.28 c max depth : 48
732.01/732.28 c max depth (total): 48
732.01/732.28 c backtracks : 7264 (12.2%)
732.01/732.28 c delayed cutoffs : 450
732.01/732.28 c repropagations : 91100 (131373 domain reductions, 442 cutoffs)
732.01/732.28 c avg switch length: 4.62
732.01/732.28 c switching time : 20.70
732.01/732.28 c Solution :
732.01/732.28 c Solutions found : 0 (0 improvements)
732.01/732.28 c Primal Bound : infeasible
732.01/732.28 c Dual Bound : -
732.01/732.28 c Gap : 0.00 %
732.01/732.28 c Root Dual Bound : +0.00000000000000e+00
732.01/732.28 c Root Iterations : 205
732.11/732.32 c Time complete: 732.13.