0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: a3bf3a4-dirty]
0.00/0.00 c Copyright (c) 2002-2012 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-3690716-1338022347.opb>
0.00/0.00 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 302 constraints
0.00/0.00 c problem read in 0.00
0.00/0.00 c No objective function, only one solution is needed.
0.00/0.00 c presolving settings loaded
0.00/0.01 c presolving:
0.08/0.17 c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 10264 impls, 200 clqs
0.29/0.32 c presolving (2 rounds):
0.29/0.32 c 0 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.32 c 10264 implications, 200 cliques
0.29/0.32 c presolved problem has 1458 variables (1458 bin, 0 int, 0 impl, 0 cont) and 1560 constraints
0.29/0.32 c 1 constraints of type <knapsack>
0.29/0.32 c 300 constraints of type <setppc>
0.29/0.32 c 1258 constraints of type <and>
0.29/0.32 c 1 constraints of type <linear>
0.29/0.32 c transformed objective value is always integral (scale: 1)
0.29/0.32 c Presolving Time: 0.32
0.29/0.32 c - non default parameters ----------------------------------------------------------------------
0.29/0.32 c # SCIP version 2.1.1.4
0.29/0.32 c
0.29/0.32 c # maximal time in seconds to run
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.32 c limits/time = 1797
0.29/0.32 c
0.29/0.32 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.32 c limits/memory = 13950
0.29/0.32 c
0.29/0.32 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.32 c limits/solutions = 1
0.29/0.32 c
0.29/0.32 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.32 c separating/maxrounds = 1
0.29/0.32 c
0.29/0.32 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.32 c separating/maxroundsroot = 5
0.29/0.32 c
0.29/0.32 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.29/0.32 c # [type: int, range: [1,2], default: 1]
0.29/0.32 c timing/clocktype = 2
0.29/0.32 c
0.29/0.32 c # belongs reading time to solving time?
0.29/0.32 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.32 c timing/reading = TRUE
0.29/0.32 c
0.29/0.32 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.32 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.32 c constraints/knapsack/disaggregation = FALSE
0.29/0.32 c
0.29/0.32 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.32 c heuristics/coefdiving/freq = -1
0.29/0.32 c
0.29/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.32 c heuristics/coefdiving/maxlpiterquot = 0.075
0.29/0.32 c
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/coefdiving/maxlpiterofs = 1500
0.29/0.32 c
0.29/0.32 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.32 c heuristics/crossover/freq = -1
0.29/0.32 c
0.29/0.32 c # number of nodes added to the contingent of the total nodes
0.29/0.32 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.32 c heuristics/crossover/nodesofs = 750
0.29/0.32 c
0.29/0.32 c # number of nodes without incumbent change that heuristic should wait
0.29/0.32 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.32 c heuristics/crossover/nwaitingnodes = 100
0.29/0.32 c
0.29/0.32 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.32 c # [type: real, range: [0,1], default: 0.1]
0.29/0.32 c heuristics/crossover/nodesquot = 0.15
0.29/0.32 c
0.29/0.32 c # minimum percentage of integer variables that have to be fixed
0.29/0.32 c # [type: real, range: [0,1], default: 0.666]
0.29/0.32 c heuristics/crossover/minfixingrate = 0.5
0.29/0.32 c
0.29/0.32 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.32 c heuristics/feaspump/freq = -1
0.29/0.32 c
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/feaspump/maxlpiterofs = 2000
0.29/0.32 c
0.29/0.32 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.32 c heuristics/fracdiving/freq = -1
0.29/0.32 c
0.29/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.32 c heuristics/fracdiving/maxlpiterquot = 0.075
0.29/0.32 c
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/fracdiving/maxlpiterofs = 1500
0.29/0.32 c
0.29/0.32 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.32 c heuristics/guideddiving/freq = -1
0.29/0.32 c
0.29/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.32 c heuristics/guideddiving/maxlpiterquot = 0.075
0.29/0.32 c
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/guideddiving/maxlpiterofs = 1500
0.29/0.32 c
0.29/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.32 c heuristics/intdiving/maxlpiterquot = 0.075
0.29/0.32 c
0.29/0.32 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.32 c heuristics/intshifting/freq = -1
0.29/0.32 c
0.29/0.32 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.32 c heuristics/linesearchdiving/freq = -1
0.29/0.32 c
0.29/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.32 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.29/0.32 c
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.29/0.32 c
0.29/0.32 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.32 c heuristics/objpscostdiving/freq = -1
0.29/0.32 c
0.29/0.32 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.32 c # [type: real, range: [0,1], default: 0.01]
0.29/0.32 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.29/0.32 c
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.29/0.32 c
0.29/0.32 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.32 c heuristics/oneopt/freq = -1
0.29/0.32 c
0.29/0.32 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.32 c heuristics/pscostdiving/freq = -1
0.29/0.32 c
0.29/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.32 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.29/0.32 c
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/pscostdiving/maxlpiterofs = 1500
0.29/0.32 c
0.29/0.32 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.32 c heuristics/rens/freq = -1
0.29/0.32 c
0.29/0.32 c # minimum percentage of integer variables that have to be fixable
0.29/0.32 c # [type: real, range: [0,1], default: 0.5]
0.29/0.32 c heuristics/rens/minfixingrate = 0.3
0.29/0.32 c
0.29/0.32 c # number of nodes added to the contingent of the total nodes
0.29/0.32 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.32 c heuristics/rens/nodesofs = 2000
0.29/0.32 c
0.29/0.32 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.32 c heuristics/rootsoldiving/freq = -1
0.29/0.32 c
0.29/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.32 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.29/0.32 c
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.29/0.32 c
0.29/0.32 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.32 c heuristics/rounding/freq = -1
0.29/0.32 c
0.29/0.32 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.32 c heuristics/shiftandpropagate/freq = -1
0.29/0.32 c
0.29/0.32 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.32 c heuristics/shifting/freq = -1
0.29/0.32 c
0.29/0.32 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.32 c heuristics/simplerounding/freq = -1
0.29/0.32 c
0.29/0.32 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.32 c heuristics/subnlp/freq = -1
0.29/0.32 c
0.29/0.32 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.32 c heuristics/trivial/freq = -1
0.29/0.32 c
0.29/0.32 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.32 c heuristics/trysol/freq = -1
0.29/0.32 c
0.29/0.32 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.32 c heuristics/undercover/freq = -1
0.29/0.32 c
0.29/0.32 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.32 c heuristics/veclendiving/freq = -1
0.29/0.32 c
0.29/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.32 c heuristics/veclendiving/maxlpiterquot = 0.075
0.29/0.32 c
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/veclendiving/maxlpiterofs = 1500
0.29/0.32 c
0.29/0.32 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.32 c heuristics/zirounding/freq = -1
0.29/0.32 c
0.29/0.32 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.32 c propagating/probing/maxprerounds = 0
0.29/0.32 c
0.29/0.32 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.32 c separating/cmir/freq = -1
0.29/0.32 c
0.29/0.32 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.32 c separating/flowcover/freq = -1
0.29/0.32 c
0.29/0.32 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.32 c separating/rapidlearning/freq = 0
0.29/0.32 c
0.29/0.32 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.32 c heuristics/indoneopt/freq = -1
0.29/0.32 c
0.29/0.32 c -----------------------------------------------------------------------------------------------
0.29/0.32 c start solving
0.29/0.32 c
0.29/0.35 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.35 c 0.4s| 1 | 0 | 218 | - |6381k| 0 | 100 |1458 |1560 |1458 |2818 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.76 c 0.8s| 1 | 0 | 277 | - |6814k| 0 | 97 |1458 |1593 |1458 |2830 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/0.94 c 0.9s| 1 | 0 | 334 | - |7220k| 0 | 112 |1458 |1593 |1458 |2844 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
1.09/1.16 c 1.2s| 1 | 0 | 390 | - |7698k| 0 | 102 |1458 |1593 |1458 |2853 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
1.39/1.41 c 1.4s| 1 | 0 | 468 | - |8170k| 0 | 98 |1458 |1593 |1458 |2860 | 42 | 0 | 0 | 0.000000e+00 | -- | Inf
1.58/1.63 c 1.6s| 1 | 0 | 522 | - |8540k| 0 | 109 |1458 |1593 |1458 |2865 | 47 | 0 | 0 | 0.000000e+00 | -- | Inf
1.79/1.80 c 1.8s| 1 | 2 | 522 | - |8540k| 0 | 109 |1458 |1593 |1458 |2865 | 47 | 0 | 9 | 0.000000e+00 | -- | Inf
2.29/2.38 c * 2.4s| 30 | 0 | 1037 | 17.8 |8344k| 28 | - |1458 |1594 |1458 | 488 | 145 | 1 | 253 | 0.000000e+00 | 0.000000e+00 | 0.00%
2.29/2.38 c
2.29/2.38 c SCIP Status : problem is solved [optimal solution found]
2.29/2.38 c Solving Time (sec) : 2.38
2.29/2.38 c Solving Nodes : 30
2.29/2.38 c Primal Bound : +0.00000000000000e+00 (1 solutions)
2.29/2.38 c Dual Bound : +0.00000000000000e+00
2.29/2.38 c Gap : 0.00 %
2.29/2.38 s SATISFIABLE
2.29/2.38 v -x128 -x141 -x182 -x146 -x136 -x166 -x181 -x185 -x156 -x153 -x179 -x178 -x149 -x152 -x124 -x133 -x188 -x189 -x147 -x139 -x197 -x191
2.29/2.38 v -x163 -x130 -x192 -x194 x106 -x170 -x140 -x109 x117 -x107 -x196 -x187 -x168 -x190 -x148 -x171 -x161 -x160 -x158 -x154 -x151
2.29/2.38 v -x114 -x173 -x199 -x176 -x177 -x193 -x172 -x143 -x135 -x162 -x125 -x195 -x120 -x200 -x157 -x167 -x134 -x113 -x111 -x131 -x121
2.29/2.38 v -x183 -x123 -x174 -x180 -x169 x198 -x159 -x137 -x132 -x122 -x119 x112 x105 -x118 -x150 -x142 -x103 -x104 x165 -x115 x155
2.29/2.38 v -x101 x144 -x116 x110 x108 x145 x186 -x129 -x126 x138 x164 -x127 -x175 -x184 x102 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92
2.29/2.38 v -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67
2.29/2.38 v -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 x46 -x45 -x44 -x43 -x42
2.29/2.38 v x41 -x40 -x39 -x38 -x37 x36 x35 -x34 -x33 -x32 x31 x30 x29 x28 -x27 x26 x25 -x24 -x23 -x22 -x21 x20 -x19 -x18 -x17 -x16 -x15
2.29/2.38 v -x14 x13 -x12 x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
2.29/2.38 c SCIP Status : problem is solved [optimal solution found]
2.29/2.38 c Total Time : 2.38
2.29/2.38 c solving : 2.38
2.29/2.38 c presolving : 0.32 (included in solving)
2.29/2.38 c reading : 0.00 (included in solving)
2.29/2.38 c copying : 0.01 (1 #copies) (minimal 0.01, maximal 0.01, average 0.01)
2.29/2.38 c Original Problem :
2.29/2.38 c Problem name : HOME/instance-3690716-1338022347.opb
2.29/2.38 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
2.29/2.38 c Constraints : 302 initial, 302 maximal
2.29/2.38 c Objective sense : minimize
2.29/2.38 c Presolved Problem :
2.29/2.38 c Problem name : t_HOME/instance-3690716-1338022347.opb
2.29/2.38 c Variables : 1458 (1458 binary, 0 integer, 0 implicit integer, 0 continuous)
2.29/2.38 c Constraints : 1560 initial, 1594 maximal
2.29/2.38 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
2.29/2.38 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.29/2.38 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.29/2.38 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.29/2.38 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.29/2.38 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.29/2.38 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.29/2.38 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.29/2.38 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.29/2.38 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.29/2.38 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.29/2.38 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.29/2.38 c knapsack : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.29/2.38 c setppc : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.29/2.38 c and : 0.30 0.00 0 0 0 0 0 0 0 0 0
2.29/2.38 c linear : 0.01 0.00 0 0 0 0 0 0 0 0 0
2.29/2.38 c logicor : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.29/2.38 c root node : - - 0 - - 0 - - - - -
2.29/2.38 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
2.29/2.38 c integral : 0 0 0 0 36 0 3 0 0 3 0 0 56
2.29/2.38 c knapsack : 1 1 5 75 5 0 0 0 0 0 0 0 0
2.29/2.38 c setppc : 300 300 5 75 5 0 0 0 1 110 0 0 0
2.29/2.38 c and : 1258 1258 33 74 5 0 0 2 0 1045 109 0 0
2.29/2.38 c linear : 1+ 34 6 74 1 0 0 0 0 1 0 0 0
2.29/2.38 c logicor : 0+ 1 0 1 0 0 0 0 0 1 0 0 0
2.29/2.38 c countsols : 0 0 0 0 1 0 2 0 0 0 0 0 0
2.29/2.38 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
2.29/2.38 c integral : 0.69 0.00 0.00 0.00 0.69 0.00 0.00 0.00
2.29/2.38 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.29/2.38 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.29/2.38 c and : 0.01 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.29/2.38 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.29/2.38 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.29/2.38 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.29/2.38 c Propagators : #Propagate #ResProp Cutoffs DomReds
2.29/2.38 c rootredcost : 0 0 0 0
2.29/2.38 c pseudoobj : 0 0 0 0
2.29/2.38 c vbounds : 0 0 0 0
2.29/2.38 c redcost : 60 0 0 0
2.29/2.38 c probing : 0 0 0 0
2.29/2.38 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
2.29/2.38 c rootredcost : 0.00 0.00 0.00 0.00 0.00
2.29/2.38 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
2.29/2.38 c vbounds : 0.00 0.00 0.00 0.00 0.00
2.29/2.38 c redcost : 0.00 0.00 0.00 0.00 0.00
2.29/2.38 c probing : 0.00 0.00 0.00 0.00 0.00
2.29/2.38 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.29/2.38 c propagation : 0.00 1 1 1 3.0 0 0.0 -
2.29/2.38 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.29/2.38 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.29/2.38 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.29/2.38 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.29/2.38 c applied globally : - - - 1 3.0 - - -
2.29/2.38 c applied locally : - - - 0 0.0 - - -
2.29/2.38 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
2.29/2.38 c cut pool : 0.00 4 - - 11 - (maximal pool size: 388)
2.29/2.38 c closecuts : 0.00 0.00 0 0 0 0 0
2.29/2.38 c impliedbounds : 0.00 0.00 5 0 0 27 0
2.29/2.38 c intobj : 0.00 0.00 0 0 0 0 0
2.29/2.38 c gomory : 0.67 0.00 5 0 0 73 0
2.29/2.38 c cgmip : 0.00 0.00 0 0 0 0 0
2.29/2.38 c strongcg : 0.31 0.00 5 0 0 2500 0
2.29/2.38 c cmir : 0.00 0.00 0 0 0 0 0
2.29/2.38 c flowcover : 0.00 0.00 0 0 0 0 0
2.29/2.38 c clique : 0.01 0.00 5 0 0 26 0
2.29/2.38 c zerohalf : 0.00 0.00 0 0 0 0 0
2.29/2.38 c mcf : 0.00 0.00 1 0 0 0 0
2.29/2.38 c oddcycle : 0.00 0.00 0 0 0 0 0
2.29/2.38 c rapidlearning : 0.23 0.00 1 0 0 0 33
2.29/2.38 c Pricers : ExecTime SetupTime Calls Vars
2.29/2.38 c problem variables: 0.00 - 0 0
2.29/2.38 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
2.29/2.38 c relpscost : 0.68 0.00 31 0 3 0 0 56
2.29/2.38 c pscost : 0.00 0.00 0 0 0 0 0 0
2.29/2.38 c inference : 0.00 0.00 0 0 0 0 0 0
2.29/2.38 c mostinf : 0.00 0.00 0 0 0 0 0 0
2.29/2.38 c leastinf : 0.00 0.00 0 0 0 0 0 0
2.29/2.38 c fullstrong : 0.00 0.00 0 0 0 0 0 0
2.29/2.38 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
2.29/2.38 c random : 0.00 0.00 0 0 0 0 0 0
2.29/2.38 c Primal Heuristics : ExecTime SetupTime Calls Found
2.29/2.38 c LP solutions : 0.00 - - 1
2.29/2.38 c pseudo solutions : 0.00 - - 0
2.29/2.38 c smallcard : 0.00 0.00 0 0
2.29/2.38 c trivial : 0.00 0.00 1 0
2.29/2.38 c shiftandpropagate: 0.00 0.00 0 0
2.29/2.38 c simplerounding : 0.00 0.00 0 0
2.29/2.38 c zirounding : 0.00 0.00 0 0
2.29/2.38 c rounding : 0.00 0.00 0 0
2.29/2.38 c shifting : 0.00 0.00 0 0
2.29/2.38 c intshifting : 0.00 0.00 0 0
2.29/2.38 c oneopt : 0.00 0.00 0 0
2.29/2.38 c twoopt : 0.00 0.00 0 0
2.29/2.38 c indtwoopt : 0.00 0.00 0 0
2.29/2.38 c indoneopt : 0.00 0.00 0 0
2.29/2.38 c fixandinfer : 0.00 0.00 0 0
2.29/2.38 c feaspump : 0.00 0.00 0 0
2.29/2.38 c clique : 0.00 0.00 0 0
2.29/2.38 c indrounding : 0.00 0.00 0 0
2.29/2.38 c indcoefdiving : 0.00 0.00 0 0
2.29/2.38 c coefdiving : 0.00 0.00 0 0
2.29/2.38 c pscostdiving : 0.00 0.00 0 0
2.29/2.38 c nlpdiving : 0.00 0.00 0 0
2.29/2.38 c fracdiving : 0.00 0.00 0 0
2.29/2.38 c veclendiving : 0.00 0.00 0 0
2.29/2.38 c intdiving : 0.00 0.00 0 0
2.29/2.38 c actconsdiving : 0.00 0.00 0 0
2.29/2.38 c objpscostdiving : 0.00 0.00 0 0
2.29/2.38 c rootsoldiving : 0.00 0.00 0 0
2.29/2.38 c linesearchdiving : 0.00 0.00 0 0
2.29/2.38 c guideddiving : 0.00 0.00 0 0
2.29/2.38 c octane : 0.00 0.00 0 0
2.29/2.38 c rens : 0.00 0.00 0 0
2.29/2.38 c rins : 0.00 0.00 0 0
2.29/2.38 c localbranching : 0.00 0.00 0 0
2.29/2.38 c mutation : 0.00 0.00 0 0
2.29/2.38 c crossover : 0.00 0.00 0 0
2.29/2.38 c dins : 0.00 0.00 0 0
2.29/2.38 c vbounds : 0.00 0.00 0 0
2.29/2.38 c undercover : 0.00 0.00 0 0
2.29/2.38 c subnlp : 0.00 0.00 0 0
2.29/2.38 c trysol : 0.00 0.00 0 0
2.29/2.38 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
2.29/2.38 c primal LP : 0.00 8 0 0.00 - 0.00 8
2.29/2.38 c dual LP : 0.11 60 1037 17.28 9863.51 0.00 0
2.29/2.38 c lex dual LP : 0.00 0 0 0.00 -
2.29/2.38 c barrier LP : 0.00 0 0 0.00 - 0.00 0
2.29/2.38 c diving/probing LP: 0.00 0 0 0.00 -
2.29/2.38 c strong branching : 0.68 253 7815 30.89 11455.01
2.29/2.38 c (at root node) : - 9 1149 127.67 -
2.29/2.38 c conflict analysis: 0.00 0 0 0.00 -
2.29/2.38 c B&B Tree :
2.29/2.38 c number of runs : 1
2.29/2.38 c nodes : 30
2.29/2.38 c nodes (total) : 30
2.29/2.38 c nodes left : 0
2.29/2.38 c max depth : 28
2.29/2.38 c max depth (total): 28
2.29/2.38 c backtracks : 0 (0.0%)
2.29/2.38 c delayed cutoffs : 0
2.29/2.38 c repropagations : 1 (15 domain reductions, 0 cutoffs)
2.29/2.38 c avg switch length: 2.00
2.29/2.38 c switching time : 0.00
2.29/2.38 c Solution :
2.29/2.38 c Solutions found : 1 (1 improvements)
2.29/2.38 c First Solution : +0.00000000000000e+00 (in run 1, after 30 nodes, 2.38 seconds, depth 28, found by <relaxation>)
2.29/2.38 c Primal Bound : +0.00000000000000e+00 (in run 1, after 30 nodes, 2.38 seconds, depth 28, found by <relaxation>)
2.29/2.38 c Dual Bound : +0.00000000000000e+00
2.29/2.38 c Gap : 0.00 %
2.29/2.38 c Root Dual Bound : +0.00000000000000e+00
2.29/2.38 c Root Iterations : 522
2.29/2.39 c Time complete: 2.38.