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-2702835-1278574713.opb>
0.00/0.02 c original problem has 1580 variables (1580 bin, 0 int, 0 impl, 0 cont) and 1632 constraints
0.00/0.02 c problem read
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c presolving settings loaded
0.03/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, 11940 impls, 100 clqs
0.09/0.18 c presolving (2 rounds):
0.09/0.18 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.18 c 11940 implications, 100 cliques
0.09/0.18 c presolved problem has 1580 variables (1580 bin, 0 int, 0 impl, 0 cont) and 1632 constraints
0.09/0.18 c 1 constraints of type <knapsack>
0.09/0.18 c 150 constraints of type <setppc>
0.09/0.18 c 1480 constraints of type <and>
0.09/0.18 c 1 constraints of type <linear>
0.09/0.18 c transformed objective value is always integral (scale: 1)
0.09/0.18 c Presolving Time: 0.14
0.09/0.18 c - non default parameters ----------------------------------------------------------------------
0.09/0.18 c # SCIP version 1.2.1.3
0.09/0.18 c
0.09/0.18 c # frequency for displaying node information lines
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.18 c display/freq = 10000
0.09/0.18 c
0.09/0.18 c # maximal time in seconds to run
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.18 c limits/time = 1789.98
0.09/0.18 c
0.09/0.18 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.18 c limits/memory = 1620
0.09/0.18 c
0.09/0.18 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c limits/solutions = 1
0.09/0.18 c
0.09/0.18 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.18 c separating/maxrounds = 1
0.09/0.18 c
0.09/0.18 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c separating/maxroundsroot = 5
0.09/0.18 c
0.09/0.18 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.18 c # [type: int, range: [1,2], default: 1]
0.09/0.18 c timing/clocktype = 2
0.09/0.18 c
0.09/0.18 c # should presolving try to simplify inequalities
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.18 c constraints/linear/simplifyinequalities = TRUE
0.09/0.18 c
0.09/0.18 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.18 c constraints/indicator/addCouplingCons = TRUE
0.09/0.18 c
0.09/0.18 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.18 c constraints/knapsack/disaggregation = FALSE
0.09/0.18 c
0.09/0.18 c # should presolving try to simplify knapsacks
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.18 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.18 c
0.09/0.18 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c presolving/probing/maxrounds = 0
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/coefdiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.18 c heuristics/crossover/freq = -1
0.09/0.18 c
0.09/0.18 c # number of nodes added to the contingent of the total nodes
0.09/0.18 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.18 c heuristics/crossover/nodesofs = 750
0.09/0.18 c
0.09/0.18 c # number of nodes without incumbent change that heuristic should wait
0.09/0.18 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.18 c heuristics/crossover/nwaitingnodes = 100
0.09/0.18 c
0.09/0.18 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.18 c # [type: real, range: [0,1], default: 0.1]
0.09/0.18 c heuristics/crossover/nodesquot = 0.15
0.09/0.18 c
0.09/0.18 c # minimum percentage of integer variables that have to be fixed
0.09/0.18 c # [type: real, range: [0,1], default: 0.666]
0.09/0.18 c heuristics/crossover/minfixingrate = 0.5
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.18 c heuristics/feaspump/freq = -1
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/fracdiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/guideddiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/intshifting/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/linesearchdiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/nlp/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.18 c heuristics/objpscostdiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.18 c # [type: real, range: [0,1], default: 0.01]
0.09/0.18 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/oneopt/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/pscostdiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.18 c heuristics/rens/freq = -1
0.09/0.18 c
0.09/0.18 c # minimum percentage of integer variables that have to be fixable
0.09/0.18 c # [type: real, range: [0,1], default: 0.5]
0.09/0.18 c heuristics/rens/minfixingrate = 0.3
0.09/0.18 c
0.09/0.18 c # number of nodes added to the contingent of the total nodes
0.09/0.18 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.18 c heuristics/rens/nodesofs = 2000
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.18 c heuristics/rootsoldiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.18 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/rounding/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/shifting/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/simplerounding/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.18 c heuristics/trivial/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/trysol/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/veclendiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/zirounding/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.18 c separating/cmir/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.18 c separating/flowcover/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c separating/rapidlearning/freq = 0
0.09/0.18 c
0.09/0.18 c -----------------------------------------------------------------------------------------------
0.09/0.18 c start solving
0.09/0.18 c
0.19/0.21 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.21 c 0.2s| 1 | 0 | 39 | - |7199k| 0 | 34 |1580 |1632 |1580 |3112 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/0.91 c 0.9s| 1 | 0 | 99 | - |7430k| 0 | 54 |1580 |1689 |1580 |3116 | 4 | 0 | 0 | 0.000000e+00 | -- | Inf
1.19/1.26 c 1.2s| 1 | 0 | 115 | - |7614k| 0 | 56 |1580 |1689 |1580 |3125 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
1.59/1.62 c 1.6s| 1 | 0 | 147 | - |7762k| 0 | 60 |1580 |1689 |1580 |3127 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
1.99/2.05 c 2.0s| 1 | 0 | 180 | - |7943k| 0 | 60 |1580 |1689 |1580 |3132 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
2.59/2.60 c 2.6s| 1 | 0 | 183 | - |8055k| 0 | 60 |1580 |1689 |1580 |3134 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
3.39/3.49 c 3.5s| 1 | 2 | 183 | - |8056k| 0 | 60 |1580 |1689 |1580 |3134 | 22 | 0 | 9 | 0.000000e+00 | -- | Inf
3.99/4.08 c * 4.1s| 19 | 0 | 600 | 23.2 |8591k| 16 | - |1580 |1692 |1580 | 279 | 126 | 3 | 160 | 0.000000e+00 | 0.000000e+00 | 0.00%
3.99/4.08 c
3.99/4.08 c SCIP Status : problem is solved [optimal solution found]
3.99/4.08 c Solving Time (sec) : 4.06
3.99/4.08 c Solving Nodes : 19
3.99/4.08 c Primal Bound : +0.00000000000000e+00 (1 solutions)
3.99/4.08 c Dual Bound : +0.00000000000000e+00
3.99/4.08 c Gap : 0.00 %
3.99/4.08 s SATISFIABLE
3.99/4.08 v -x84 -x71 -x52 -x90 -x85 -x82 -x77 -x75 -x54 -x56 -x95 -x98 -x83 -x87 x51 -x86 -x79 x72 -x69 -x67 -x63 -x60 -x59 -x58 -x57 -x64
3.99/4.08 v -x97 -x61 -x92 -x66 -x73 -x53 -x81 -x68 -x74 -x55 -x88 x94 x100 -x80 x93 -x96 -x78 -x65 -x99 -x62 -x76 -x89 -x70 -x91 -x50 -x49
3.99/4.08 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
3.99/4.08 v -x23 -x22 x21 -x20 -x19 -x18 -x17 x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 -x1
3.99/4.08 c SCIP Status : problem is solved [optimal solution found]
3.99/4.08 c Solving Time : 4.06
3.99/4.08 c Original Problem :
3.99/4.08 c Problem name : HOME/instance-2702835-1278574713.opb
3.99/4.08 c Variables : 1580 (1580 binary, 0 integer, 0 implicit integer, 0 continuous)
3.99/4.08 c Constraints : 1632 initial, 1632 maximal
3.99/4.08 c Presolved Problem :
3.99/4.08 c Problem name : t_HOME/instance-2702835-1278574713.opb
3.99/4.08 c Variables : 1580 (1580 binary, 0 integer, 0 implicit integer, 0 continuous)
3.99/4.08 c Constraints : 1632 initial, 1692 maximal
3.99/4.08 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.99/4.08 c trivial : 0.00 0 0 0 0 0 0 0 0
3.99/4.08 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.99/4.08 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.99/4.08 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.99/4.08 c implics : 0.00 0 0 0 0 0 0 0 0
3.99/4.08 c probing : 0.00 0 0 0 0 0 0 0 0
3.99/4.08 c knapsack : 0.00 0 0 0 0 0 0 0 0
3.99/4.08 c setppc : 0.00 0 0 0 0 0 0 0 0
3.99/4.08 c and : 0.12 0 0 0 0 0 0 0 0
3.99/4.08 c linear : 0.01 0 0 0 0 0 0 0 0
3.99/4.08 c logicor : 0.00 0 0 0 0 0 0 0 0
3.99/4.08 c root node : - 0 - - 0 - - - -
3.99/4.08 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.99/4.08 c integral : 0 0 0 21 0 1 2 0 0 32
3.99/4.08 c knapsack : 1 5 49 2 0 0 0 0 0 0
3.99/4.08 c setppc : 150 5 49 2 0 0 92 0 0 0
3.99/4.08 c and : 1480 22 49 2 0 0 1561 105 0 0
3.99/4.09 c linear : 1+ 6 49 1 0 0 3 0 0 0
3.99/4.09 c logicor : 0+ 0 2 0 0 0 1 0 0 0
3.99/4.09 c countsols : 0 0 0 1 0 0 0 0 0 0
3.99/4.09 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.99/4.09 c integral : 1.36 0.00 0.00 1.36 0.00
3.99/4.09 c knapsack : 0.00 0.00 0.00 0.00 0.00
3.99/4.09 c setppc : 0.00 0.00 0.00 0.00 0.00
3.99/4.09 c and : 0.02 0.01 0.01 0.00 0.00
3.99/4.09 c linear : 0.00 0.00 0.00 0.00 0.00
3.99/4.09 c logicor : 0.00 0.00 0.00 0.00 0.00
3.99/4.09 c countsols : 0.00 0.00 0.00 0.00 0.00
3.99/4.09 c Propagators : Time Calls Cutoffs DomReds
3.99/4.09 c vbounds : 0.00 1 0 0
3.99/4.09 c rootredcost : 0.00 0 0 0
3.99/4.09 c pseudoobj : 0.00 0 0 0
3.99/4.09 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.99/4.09 c propagation : 0.00 0 0 0 0.0 0 0.0 -
3.99/4.09 c infeasible LP : 0.00 1 1 4 34.8 0 0.0 0
3.99/4.09 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.99/4.09 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.99/4.09 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.99/4.09 c applied globally : - - - 3 32.0 - - -
3.99/4.09 c applied locally : - - - 0 0.0 - - -
3.99/4.09 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.99/4.09 c cut pool : 0.00 4 - - 17 - (maximal pool size: 208)
3.99/4.09 c redcost : 0.00 22 0 0 0 0
3.99/4.09 c impliedbounds : 0.00 5 0 0 2 0
3.99/4.09 c intobj : 0.00 0 0 0 0 0
3.99/4.09 c cgmip : 0.00 0 0 0 0 0
3.99/4.09 c gomory : 1.08 5 0 0 500 0
3.99/4.09 c strongcg : 0.69 5 0 0 2500 0
3.99/4.09 c cmir : 0.00 0 0 0 0 0
3.99/4.09 c flowcover : 0.00 0 0 0 0 0
3.99/4.09 c clique : 0.01 5 0 0 13 0
3.99/4.09 c zerohalf : 0.00 0 0 0 0 0
3.99/4.09 c mcf : 0.03 2 0 0 0 0
3.99/4.09 c rapidlearning : 0.51 1 0 0 0 57
3.99/4.09 c Pricers : Time Calls Vars
3.99/4.09 c problem variables: 0.00 0 0
3.99/4.09 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.99/4.09 c relpscost : 1.36 19 1 2 0 0 32
3.99/4.09 c pscost : 0.00 0 0 0 0 0 0
3.99/4.09 c inference : 0.00 0 0 0 0 0 0
3.99/4.09 c mostinf : 0.00 0 0 0 0 0 0
3.99/4.09 c leastinf : 0.00 0 0 0 0 0 0
3.99/4.09 c fullstrong : 0.00 0 0 0 0 0 0
3.99/4.09 c allfullstrong : 0.00 0 0 0 0 0 0
3.99/4.09 c random : 0.00 0 0 0 0 0 0
3.99/4.09 c Primal Heuristics : Time Calls Found
3.99/4.09 c LP solutions : 0.00 - 1
3.99/4.09 c pseudo solutions : 0.00 - 0
3.99/4.09 c trivial : 0.00 1 0
3.99/4.09 c simplerounding : 0.00 0 0
3.99/4.09 c zirounding : 0.00 0 0
3.99/4.09 c rounding : 0.00 0 0
3.99/4.09 c shifting : 0.00 0 0
3.99/4.09 c intshifting : 0.00 0 0
3.99/4.09 c oneopt : 0.00 0 0
3.99/4.09 c twoopt : 0.00 0 0
3.99/4.09 c fixandinfer : 0.00 0 0
3.99/4.09 c feaspump : 0.00 0 0
3.99/4.09 c coefdiving : 0.00 0 0
3.99/4.09 c pscostdiving : 0.00 0 0
3.99/4.09 c fracdiving : 0.00 0 0
3.99/4.09 c veclendiving : 0.00 0 0
3.99/4.09 c intdiving : 0.00 0 0
3.99/4.09 c actconsdiving : 0.00 0 0
3.99/4.09 c objpscostdiving : 0.00 0 0
3.99/4.09 c rootsoldiving : 0.00 0 0
3.99/4.09 c linesearchdiving : 0.00 0 0
3.99/4.09 c guideddiving : 0.00 0 0
3.99/4.09 c octane : 0.00 0 0
3.99/4.09 c rens : 0.00 0 0
3.99/4.09 c rins : 0.00 0 0
3.99/4.09 c localbranching : 0.00 0 0
3.99/4.09 c mutation : 0.00 0 0
3.99/4.09 c crossover : 0.00 0 0
3.99/4.09 c dins : 0.00 0 0
3.99/4.09 c undercover : 0.00 0 0
3.99/4.09 c nlp : 0.00 0 0
3.99/4.09 c trysol : 0.00 0 0
3.99/4.09 c LP : Time Calls Iterations Iter/call Iter/sec
3.99/4.09 c primal LP : 0.00 0 0 0.00 -
3.99/4.09 c dual LP : 0.12 42 600 14.29 4838.59
3.99/4.09 c lex dual LP : 0.00 0 0 0.00 -
3.99/4.09 c barrier LP : 0.00 0 0 0.00 -
3.99/4.09 c diving/probing LP: 0.00 0 0 0.00 -
3.99/4.09 c strong branching : 1.36 160 5604 35.02 4111.46
3.99/4.09 c (at root node) : - 9 2076 230.67 -
3.99/4.09 c conflict analysis: 0.00 0 0 0.00 -
3.99/4.09 c B&B Tree :
3.99/4.09 c number of runs : 1
3.99/4.09 c nodes : 19
3.99/4.09 c nodes (total) : 19
3.99/4.09 c nodes left : 0
3.99/4.09 c max depth : 16
3.99/4.09 c max depth (total): 16
3.99/4.09 c backtracks : 0 (0.0%)
3.99/4.09 c delayed cutoffs : 0
3.99/4.09 c repropagations : 1 (6 domain reductions, 0 cutoffs)
3.99/4.09 c avg switch length: 2.00
3.99/4.09 c switching time : 0.01
3.99/4.09 c Solution :
3.99/4.09 c Solutions found : 1 (1 improvements)
3.99/4.09 c First Solution : +0.00000000000000e+00 (in run 1, after 19 nodes, 4.05 seconds, depth 16, found by <relaxation>)
3.99/4.09 c Primal Bound : +0.00000000000000e+00 (in run 1, after 19 nodes, 4.05 seconds, depth 16, found by <relaxation>)
3.99/4.09 c Dual Bound : +0.00000000000000e+00
3.99/4.09 c Gap : 0.00 %
3.99/4.09 c Root Dual Bound : +0.00000000000000e+00
3.99/4.09 c Root Iterations : 183
4.08/4.11 c Time complete: 4.1.