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-2702848-1278574872.opb>
0.01/0.02 c original problem has 1564 variables (1564 bin, 0 int, 0 impl, 0 cont) and 1616 constraints
0.01/0.02 c problem read
0.01/0.02 c No objective function, only one solution is needed.
0.01/0.02 c presolving settings loaded
0.01/0.04 c presolving:
0.09/0.11 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 11812 impls, 100 clqs
0.09/0.17 c presolving (2 rounds):
0.09/0.17 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.17 c 11812 implications, 100 cliques
0.09/0.17 c presolved problem has 1564 variables (1564 bin, 0 int, 0 impl, 0 cont) and 1616 constraints
0.09/0.17 c 1 constraints of type <knapsack>
0.09/0.17 c 150 constraints of type <setppc>
0.09/0.17 c 1464 constraints of type <and>
0.09/0.17 c 1 constraints of type <linear>
0.09/0.17 c transformed objective value is always integral (scale: 1)
0.09/0.17 c Presolving Time: 0.13
0.09/0.17 c - non default parameters ----------------------------------------------------------------------
0.09/0.17 c # SCIP version 1.2.1.3
0.09/0.17 c
0.09/0.17 c # frequency for displaying node information lines
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.17 c display/freq = 10000
0.09/0.17 c
0.09/0.17 c # maximal time in seconds to run
0.09/0.17 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.17 c limits/time = 1789.99
0.09/0.17 c
0.09/0.17 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.17 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.17 c limits/memory = 1620
0.09/0.17 c
0.09/0.17 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.17 c limits/solutions = 1
0.09/0.17 c
0.09/0.17 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.17 c separating/maxrounds = 1
0.09/0.17 c
0.09/0.17 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.17 c separating/maxroundsroot = 5
0.09/0.17 c
0.09/0.17 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.17 c # [type: int, range: [1,2], default: 1]
0.09/0.17 c timing/clocktype = 2
0.09/0.17 c
0.09/0.17 c # should presolving try to simplify inequalities
0.09/0.17 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.17 c constraints/linear/simplifyinequalities = TRUE
0.09/0.17 c
0.09/0.17 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.17 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.17 c constraints/indicator/addCouplingCons = TRUE
0.09/0.17 c
0.09/0.17 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.17 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.17 c constraints/knapsack/disaggregation = FALSE
0.09/0.17 c
0.09/0.17 c # should presolving try to simplify knapsacks
0.09/0.17 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.17 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.17 c
0.09/0.17 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.17 c presolving/probing/maxrounds = 0
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.17 c heuristics/coefdiving/freq = -1
0.09/0.17 c
0.09/0.17 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.17 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.17 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.17 c
0.09/0.17 c # additional number of allowed LP iterations
0.09/0.17 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.17 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.17 c heuristics/crossover/freq = -1
0.09/0.17 c
0.09/0.17 c # number of nodes added to the contingent of the total nodes
0.09/0.17 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.17 c heuristics/crossover/nodesofs = 750
0.09/0.17 c
0.09/0.17 c # number of nodes without incumbent change that heuristic should wait
0.09/0.17 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.17 c heuristics/crossover/nwaitingnodes = 100
0.09/0.17 c
0.09/0.17 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.17 c # [type: real, range: [0,1], default: 0.1]
0.09/0.17 c heuristics/crossover/nodesquot = 0.15
0.09/0.17 c
0.09/0.17 c # minimum percentage of integer variables that have to be fixed
0.09/0.17 c # [type: real, range: [0,1], default: 0.666]
0.09/0.17 c heuristics/crossover/minfixingrate = 0.5
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.17 c heuristics/feaspump/freq = -1
0.09/0.17 c
0.09/0.17 c # additional number of allowed LP iterations
0.09/0.17 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.17 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.17 c heuristics/fracdiving/freq = -1
0.09/0.17 c
0.09/0.17 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.17 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.17 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.17 c
0.09/0.17 c # additional number of allowed LP iterations
0.09/0.17 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.17 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.17 c heuristics/guideddiving/freq = -1
0.09/0.17 c
0.09/0.17 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.17 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.17 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.17 c
0.09/0.17 c # additional number of allowed LP iterations
0.09/0.17 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.17 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.17 c
0.09/0.17 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.17 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.17 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.17 c heuristics/intshifting/freq = -1
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.17 c heuristics/linesearchdiving/freq = -1
0.09/0.17 c
0.09/0.17 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.17 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.17 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.17 c
0.09/0.17 c # additional number of allowed LP iterations
0.09/0.17 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.17 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.17 c heuristics/nlp/freq = -1
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.17 c heuristics/objpscostdiving/freq = -1
0.09/0.17 c
0.09/0.17 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.17 c # [type: real, range: [0,1], default: 0.01]
0.09/0.17 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.17 c
0.09/0.17 c # additional number of allowed LP iterations
0.09/0.17 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.17 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.17 c heuristics/oneopt/freq = -1
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.17 c heuristics/pscostdiving/freq = -1
0.09/0.17 c
0.09/0.17 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.17 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.17 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.17 c
0.09/0.17 c # additional number of allowed LP iterations
0.09/0.17 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.17 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.17 c heuristics/rens/freq = -1
0.09/0.17 c
0.09/0.17 c # minimum percentage of integer variables that have to be fixable
0.09/0.17 c # [type: real, range: [0,1], default: 0.5]
0.09/0.17 c heuristics/rens/minfixingrate = 0.3
0.09/0.17 c
0.09/0.17 c # number of nodes added to the contingent of the total nodes
0.09/0.17 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.17 c heuristics/rens/nodesofs = 2000
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.17 c heuristics/rootsoldiving/freq = -1
0.09/0.17 c
0.09/0.17 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.17 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.17 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.17 c
0.09/0.17 c # additional number of allowed LP iterations
0.09/0.17 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.17 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.17 c heuristics/rounding/freq = -1
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.17 c heuristics/shifting/freq = -1
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.17 c heuristics/simplerounding/freq = -1
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.17 c heuristics/trivial/freq = -1
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.17 c heuristics/trysol/freq = -1
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.17 c heuristics/veclendiving/freq = -1
0.09/0.17 c
0.09/0.17 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.17 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.17 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.17 c
0.09/0.17 c # additional number of allowed LP iterations
0.09/0.17 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.17 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.17 c
0.09/0.17 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.17 c heuristics/zirounding/freq = -1
0.09/0.17 c
0.09/0.17 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.17 c separating/cmir/freq = -1
0.09/0.17 c
0.09/0.17 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.17 c separating/flowcover/freq = -1
0.09/0.17 c
0.09/0.17 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.17 c separating/rapidlearning/freq = 0
0.09/0.17 c
0.09/0.17 c -----------------------------------------------------------------------------------------------
0.09/0.17 c start solving
0.09/0.17 c
0.19/0.20 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.20 c 0.2s| 1 | 0 | 55 | - |7125k| 0 | 47 |1564 |1616 |1564 |3080 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.90/0.96 c 0.9s| 1 | 0 | 112 | - |7382k| 0 | 81 |1564 |1673 |1564 |3089 | 9 | 0 | 0 | 0.000000e+00 | -- | Inf
1.39/1.40 c 1.4s| 1 | 0 | 156 | - |7494k| 0 | 75 |1564 |1673 |1564 |3094 | 14 | 0 | 0 | 0.000000e+00 | -- | Inf
1.79/1.86 c 1.8s| 1 | 0 | 195 | - |7624k| 0 | 81 |1564 |1673 |1564 |3097 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
2.29/2.37 c 2.3s| 1 | 0 | 236 | - |7720k| 0 | 87 |1564 |1673 |1564 |3098 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
2.79/2.89 c 2.9s| 1 | 0 | 260 | - |7897k| 0 | 89 |1564 |1673 |1564 |3100 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
4.09/4.18 c 4.2s| 1 | 2 | 260 | - |7897k| 0 | 89 |1564 |1673 |1564 |3100 | 20 | 0 | 9 | 0.000000e+00 | -- | Inf
4.59/4.60 c * 4.6s| 9 | 0 | 651 | 48.9 |8416k| 8 | - |1564 |1673 |1564 | 291 | 112 | 0 | 88 | 0.000000e+00 | 0.000000e+00 | 0.00%
4.59/4.61 c
4.59/4.61 c SCIP Status : problem is solved [optimal solution found]
4.59/4.61 c Solving Time (sec) : 4.58
4.59/4.61 c Solving Nodes : 9
4.59/4.61 c Primal Bound : +0.00000000000000e+00 (1 solutions)
4.59/4.61 c Dual Bound : +0.00000000000000e+00
4.59/4.61 c Gap : 0.00 %
4.59/4.61 s SATISFIABLE
4.59/4.61 v -x57 -x96 -x92 -x81 -x75 -x95 -x69 -x67 -x93 -x90 x89 -x94 -x86 -x64 -x72 -x51 -x98 -x88 -x70 -x63 -x60 -x58 -x55 -x54 -x52 -x91
4.59/4.61 v -x62 -x59 -x85 -x78 x97 -x68 -x53 -x84 -x80 -x56 -x65 -x87 -x79 -x99 x82 -x74 x100 -x71 -x83 -x77 x73 -x61 -x66 -x76 -x50 -x49
4.59/4.61 v -x48 -x47 -x46 -x45 -x44 -x43 -x42 x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24
4.59/4.61 v -x23 x22 -x21 -x20 -x19 -x18 -x17 -x16 x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 x7 -x6 x5 -x4 -x3 -x2 -x1
4.59/4.61 c SCIP Status : problem is solved [optimal solution found]
4.59/4.61 c Solving Time : 4.58
4.59/4.61 c Original Problem :
4.59/4.61 c Problem name : HOME/instance-2702848-1278574872.opb
4.59/4.61 c Variables : 1564 (1564 binary, 0 integer, 0 implicit integer, 0 continuous)
4.59/4.61 c Constraints : 1616 initial, 1616 maximal
4.59/4.61 c Presolved Problem :
4.59/4.61 c Problem name : t_HOME/instance-2702848-1278574872.opb
4.59/4.61 c Variables : 1564 (1564 binary, 0 integer, 0 implicit integer, 0 continuous)
4.59/4.61 c Constraints : 1616 initial, 1673 maximal
4.59/4.61 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.59/4.61 c trivial : 0.00 0 0 0 0 0 0 0 0
4.59/4.61 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.59/4.61 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.59/4.61 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.59/4.61 c implics : 0.00 0 0 0 0 0 0 0 0
4.59/4.61 c probing : 0.00 0 0 0 0 0 0 0 0
4.59/4.61 c knapsack : 0.00 0 0 0 0 0 0 0 0
4.59/4.61 c setppc : 0.00 0 0 0 0 0 0 0 0
4.59/4.61 c and : 0.11 0 0 0 0 0 0 0 0
4.59/4.61 c linear : 0.01 0 0 0 0 0 0 0 0
4.59/4.61 c root node : - 0 - - 0 - - - -
4.59/4.61 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.59/4.61 c integral : 0 0 0 16 0 0 2 0 0 16
4.59/4.61 c knapsack : 1 5 25 6 0 0 0 0 0 0
4.59/4.61 c setppc : 150 5 25 6 0 0 77 0 0 0
4.59/4.61 c and : 1464 13 25 6 0 0 1447 93 0 0
4.59/4.61 c linear : 1+ 6 25 1 0 0 2 0 0 0
4.59/4.61 c countsols : 0 0 0 1 0 0 0 0 0 0
4.59/4.61 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.59/4.61 c integral : 1.63 0.00 0.00 1.63 0.00
4.59/4.61 c knapsack : 0.00 0.00 0.00 0.00 0.00
4.59/4.61 c setppc : 0.00 0.00 0.00 0.00 0.00
4.59/4.61 c and : 0.01 0.01 0.00 0.00 0.00
4.59/4.61 c linear : 0.00 0.00 0.00 0.00 0.00
4.59/4.61 c countsols : 0.00 0.00 0.00 0.00 0.00
4.59/4.61 c Propagators : Time Calls Cutoffs DomReds
4.59/4.61 c vbounds : 0.00 1 0 0
4.59/4.61 c rootredcost : 0.00 0 0 0
4.59/4.61 c pseudoobj : 0.00 0 0 0
4.59/4.61 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.59/4.61 c propagation : 0.00 0 0 0 0.0 0 0.0 -
4.59/4.61 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
4.59/4.61 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.59/4.61 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.59/4.61 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.59/4.61 c applied globally : - - - 0 0.0 - - -
4.59/4.61 c applied locally : - - - 0 0.0 - - -
4.59/4.61 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.59/4.61 c cut pool : 0.00 4 - - 24 - (maximal pool size: 227)
4.59/4.61 c redcost : 0.00 13 0 0 0 0
4.59/4.61 c impliedbounds : 0.00 5 0 0 2 0
4.59/4.61 c intobj : 0.00 0 0 0 0 0
4.59/4.61 c cgmip : 0.00 0 0 0 0 0
4.59/4.61 c gomory : 1.24 5 0 0 123 0
4.59/4.61 c strongcg : 0.84 5 0 0 2500 0
4.59/4.61 c cmir : 0.00 0 0 0 0 0
4.59/4.61 c flowcover : 0.00 0 0 0 0 0
4.59/4.61 c clique : 0.01 5 0 0 12 0
4.59/4.61 c zerohalf : 0.00 0 0 0 0 0
4.59/4.61 c mcf : 0.03 2 0 0 0 0
4.59/4.61 c rapidlearning : 0.48 1 0 0 0 57
4.59/4.61 c Pricers : Time Calls Vars
4.59/4.61 c problem variables: 0.00 0 0
4.59/4.61 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.59/4.61 c relpscost : 1.63 10 0 2 0 0 16
4.59/4.61 c pscost : 0.00 0 0 0 0 0 0
4.59/4.61 c inference : 0.00 0 0 0 0 0 0
4.59/4.61 c mostinf : 0.00 0 0 0 0 0 0
4.59/4.61 c leastinf : 0.00 0 0 0 0 0 0
4.59/4.61 c fullstrong : 0.00 0 0 0 0 0 0
4.59/4.61 c allfullstrong : 0.00 0 0 0 0 0 0
4.59/4.61 c random : 0.00 0 0 0 0 0 0
4.59/4.61 c Primal Heuristics : Time Calls Found
4.59/4.61 c LP solutions : 0.00 - 1
4.59/4.61 c pseudo solutions : 0.00 - 0
4.59/4.61 c trivial : 0.00 1 0
4.59/4.61 c simplerounding : 0.00 0 0
4.59/4.61 c zirounding : 0.00 0 0
4.59/4.61 c rounding : 0.00 0 0
4.59/4.61 c shifting : 0.00 0 0
4.59/4.61 c intshifting : 0.00 0 0
4.59/4.61 c oneopt : 0.00 0 0
4.59/4.61 c twoopt : 0.00 0 0
4.59/4.61 c fixandinfer : 0.00 0 0
4.59/4.61 c feaspump : 0.00 0 0
4.59/4.61 c coefdiving : 0.00 0 0
4.59/4.61 c pscostdiving : 0.00 0 0
4.59/4.61 c fracdiving : 0.00 0 0
4.59/4.61 c veclendiving : 0.00 0 0
4.59/4.61 c intdiving : 0.00 0 0
4.59/4.61 c actconsdiving : 0.00 0 0
4.59/4.61 c objpscostdiving : 0.00 0 0
4.59/4.61 c rootsoldiving : 0.00 0 0
4.59/4.61 c linesearchdiving : 0.00 0 0
4.59/4.61 c guideddiving : 0.00 0 0
4.59/4.61 c octane : 0.00 0 0
4.59/4.61 c rens : 0.00 0 0
4.59/4.61 c rins : 0.00 0 0
4.59/4.61 c localbranching : 0.00 0 0
4.59/4.61 c mutation : 0.00 0 0
4.59/4.61 c crossover : 0.00 0 0
4.59/4.61 c dins : 0.00 0 0
4.59/4.61 c undercover : 0.00 0 0
4.59/4.61 c nlp : 0.00 0 0
4.59/4.61 c trysol : 0.00 0 0
4.59/4.61 c LP : Time Calls Iterations Iter/call Iter/sec
4.59/4.61 c primal LP : 0.00 0 0 0.00 -
4.59/4.61 c dual LP : 0.13 29 651 22.45 4949.29
4.59/4.61 c lex dual LP : 0.00 0 0 0.00 -
4.59/4.61 c barrier LP : 0.00 0 0 0.00 -
4.59/4.61 c diving/probing LP: 0.00 0 0 0.00 -
4.59/4.61 c strong branching : 1.63 88 5756 65.41 3525.24
4.59/4.61 c (at root node) : - 9 2907 323.00 -
4.59/4.61 c conflict analysis: 0.00 0 0 0.00 -
4.59/4.61 c B&B Tree :
4.59/4.61 c number of runs : 1
4.59/4.61 c nodes : 9
4.59/4.61 c nodes (total) : 9
4.59/4.61 c nodes left : 0
4.59/4.61 c max depth : 8
4.59/4.61 c max depth (total): 8
4.59/4.61 c backtracks : 0 (0.0%)
4.59/4.61 c delayed cutoffs : 0
4.59/4.61 c repropagations : 0 (0 domain reductions, 0 cutoffs)
4.59/4.61 c avg switch length: 2.00
4.59/4.61 c switching time : 0.01
4.59/4.61 c Solution :
4.59/4.61 c Solutions found : 1 (1 improvements)
4.59/4.61 c First Solution : +0.00000000000000e+00 (in run 1, after 9 nodes, 4.58 seconds, depth 8, found by <relaxation>)
4.59/4.61 c Primal Bound : +0.00000000000000e+00 (in run 1, after 9 nodes, 4.58 seconds, depth 8, found by <relaxation>)
4.59/4.61 c Dual Bound : +0.00000000000000e+00
4.59/4.61 c Gap : 0.00 %
4.59/4.61 c Root Dual Bound : +0.00000000000000e+00
4.59/4.61 c Root Iterations : 260
4.59/4.63 c Time complete: 4.63.