0.00/0.00 c SCIP version 10.0.0 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 8.0.0] [GitHash: 0408ae5eca]
0.00/0.00 c Copyright (c) 2002-2025 Zuse Institute Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c External libraries:
0.00/0.00 c SoPlex 8.0.0 Linear programming solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: 67f6a391]
0.00/0.00 c CppAD 20180000.0 Algorithmic Differentiation of C++ algorithms developed by B. Bell (github.com/coin-or/CppAD)
0.00/0.00 c AMPL/MP 4.0.0 AMPL .nl file reader library (github.com/ampl/mp)
0.00/0.00 c PaPILO 3.0.0 parallel presolve for integer and linear optimization (github.com/scipopt/papilo)
0.00/0.00 c bliss 0.77 Computing Graph Automorphisms by T. Junttila and P. Kaski (users.aalto.fi/~tjunttil/bliss)
0.00/0.00 c sassy 2.0 Symmetry preprocessor by Markus Anders (github.com/markusa4/sassy)
0.00/0.00 c
0.00/0.00 c reading problem <HOME/instance-4519111-1751547551.opb>
0.00/0.01 c original problem has 416 variables (416 bin, 0 int, 0 cont) and 608 constraints
0.00/0.01 c problem read in 0.004 seconds
0.00/0.01 o 0
0.00/0.01 c feasible solution found by trivial heuristic after 0.0 seconds, objective value 0.000000e+00
0.00/0.01 c presolving:
0.00/0.01 c (round 1, fast) 112 del vars, 112 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 144 clqs
0.00/0.02 c (0.0s) running MILP presolver
0.00/0.02 c (0.0s) MILP presolver (2 rounds): 0 aggregations, 0 fixings, 0 bound changes
0.00/0.02 c (round 2, medium) 112 del vars, 608 del conss, 304 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 144 clqs
0.00/0.02 c (round 3, exhaustive) 112 del vars, 608 del conss, 304 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 194 upgd conss, 0 impls, 144 clqs
0.00/0.02 c (round 4, exhaustive) 112 del vars, 800 del conss, 368 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 194 upgd conss, 0 impls, 144 clqs
0.00/0.04 c (0.0s) probing cycle finished: starting next cycle
0.00/0.04 c (round 5, exhaustive) 113 del vars, 800 del conss, 368 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 194 upgd conss, 0 impls, 338 clqs
0.00/0.05 c (0.0s) probing: 177/303 (58.4%) - 0 fixings, 1 aggregations, 220 implications, 0 bound changes
0.00/0.05 c (0.0s) probing aborted: 50/50 successive totally useless probings
0.00/0.05 c (0.0s) symmetry computation started: requiring (bin +, int +, cont +), (fixed: bin -, int -, cont -)
0.00/0.05 c (0.0s) no symmetry present (symcode time: 0.00)
0.00/0.05 c presolving (6 rounds: 6 fast, 5 medium, 4 exhaustive):
0.00/0.05 c 113 deleted vars, 800 deleted constraints, 368 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.05 c 0 implications, 351 cliques
0.00/0.05 c presolved problem has 303 variables (303 bin, 0 int, 0 cont) and 176 constraints
0.00/0.05 c presolved problem has 0 implied integral variables (0 bin, 0 int, 0 cont)
0.00/0.05 c 64 constraints of type <and>
0.00/0.05 c 2 constraints of type <xor>
0.00/0.05 c 110 constraints of type <linear>
0.00/0.05 c transformed objective value is always integral (scale: 2)
0.00/0.05 c Presolving Time: 0.04
0.00/0.05 c
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c
0.00/0.05 c # SCIP version 10.0.0
0.00/0.05 c
0.00/0.05 c # maximal time in seconds to run
0.00/0.05 c # [type: real, advanced: FALSE, range: [0,1e+20], default: 1e+20]
0.00/0.05 c limits/time = 3596.995047
0.00/0.05 c
0.00/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05 c # [type: real, advanced: FALSE, range: [0,8796093022207], default: 8796093022207]
0.00/0.05 c limits/memory = 27900
0.00/0.05 c
0.00/0.05 c # belongs reading time to solving time?
0.00/0.05 c # [type: bool, advanced: FALSE, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c timing/reading = TRUE
0.00/0.05 c
0.00/0.05 c # maximum allowed 'intsize' (i.e. the number of bits required to represent the sum of absolute values of all integers that appear in a constraint or objective function) or -1 for unlimited
0.00/0.05 c # [type: int, advanced: TRUE, range: [-1,2147483647], default: -1]
0.00/0.05 c reading/opbreader/maxintsize = 47
0.00/0.05 c
0.00/0.05 c # timing when propagator should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP, 15:ALWAYS))
0.00/0.05 c # [type: int, advanced: TRUE, range: [0,15], default: 15]
0.00/0.05 c propagating/genvbounds/timingmask = 0
0.00/0.05 c
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c transformed 1/1 original solutions to the transformed problem space
0.00/0.05 c
0.00/0.07 c time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl.
0.00/0.07 c 0.1s| 1 | 0 | 261 | - | 5969k | 0 | 303 | 272 | 240 | 0 | 0 | 95 | 0 | 0.000000e+00 | 0.000000e+00 | 0.00%| unknown
0.00/0.07 c
0.00/0.07 c SCIP Status : problem is solved [optimal solution found]
0.00/0.07 c Solving Time (sec) : 0.07
0.00/0.07 c Solving Nodes : 1
0.00/0.07 c Primal Bound : +0.00000000000000e+00 (1 solutions)
0.00/0.07 c Dual Bound : +0.00000000000000e+00
0.00/0.07 c Gap : 0.00 %
0.00/0.07 s OPTIMUM FOUND
0.00/0.07 v -x401 -x385 -x402 -x386 -x403 -x387 -x404 -x388 -x405 -x389 -x406 -x390 -x407 -x391 -x408 -x392 -x409 -x393 -x410 -x394 -x411 -x395
0.00/0.07 v -x412 -x396 -x413 -x397 -x414 -x398 -x415 -x399 -x416 -x400 -x17 -x1 -x9 -x257 -x81 -x321 -x25 -x2 -x18 -x10 -x265 -x145 -x258 -x89
0.00/0.07 v -x82 -x329 -x201 -x322 -x33 -x3 -x26 -x19 -x11 -x273 -x152 -x266 -x146 -x259 -x97 -x90 -x83 -x337 -x208 -x330 -x202 -x323 -x41 -x4
0.00/0.07 v -x34 -x27 -x20 -x12 -x281 -x159 -x274 -x153 -x267 -x147 -x260 -x105 -x98 -x91 -x84 -x345 -x215 -x338 -x209 -x331 -x203 -x324 -x49
0.00/0.07 v -x5 -x42 -x35 -x28 -x21 -x13 -x289 -x166 -x282 -x160 -x275 -x154 -x268 -x148 -x261 -x113 -x106 -x99 -x92 -x85 -x353 -x222 -x346
0.00/0.07 v -x216 -x339 -x210 -x332 -x204 -x325 -x57 -x6 -x50 -x43 -x36 -x29 -x22 -x14 -x297 -x173 -x290 -x167 -x283 -x161 -x276 -x155 -x269
0.00/0.07 v -x149 -x262 -x121 -x114 -x107 -x100 -x93 -x86 -x361 -x229 -x354 -x223 -x347 -x217 -x340 -x211 -x333 -x205 -x326 -x65 -x7 -x58 -x51
0.00/0.07 v -x44 -x37 -x30 -x23 -x15 -x305 -x180 -x298 -x174 -x291 -x168 -x284 -x162 -x277 -x156 -x270 -x150 -x263 -x129 -x122 -x115 -x108 -x101
0.00/0.07 v -x94 -x87 -x369 -x236 -x362 -x230 -x355 -x224 -x348 -x218 -x341 -x212 -x334 -x206 -x327 -x73 -x8 -x66 -x59 -x52 -x45 -x38 -x31 -x24
0.00/0.07 v -x16 -x313 -x187 -x306 -x181 -x299 -x175 -x292 -x169 -x285 -x163 -x278 -x157 -x271 -x151 -x264 -x137 -x130 -x123 -x116 -x109 -x102
0.00/0.07 v -x95 -x88 -x377 -x243 -x370 -x237 -x363 -x231 -x356 -x225 -x349 -x219 -x342 -x213 -x335 -x207 -x328 -x74 -x67 -x60 -x53 -x46 -x39
0.00/0.07 v -x32 -x194 -x314 -x188 -x307 -x182 -x300 -x176 -x293 -x170 -x286 -x164 -x279 -x158 -x272 -x138 -x131 -x124 -x117 -x110 -x103 -x96
0.00/0.07 v -x250 -x378 -x244 -x371 -x238 -x364 -x232 -x357 -x226 -x350 -x220 -x343 -x214 -x336 -x75 -x68 -x61 -x54 -x47 -x40 -x195 -x315 -x189
0.00/0.07 v -x308 -x183 -x301 -x177 -x294 -x171 -x287 -x165 -x280 -x139 -x132 -x125 -x118 -x111 -x104 -x251 -x379 -x245 -x372 -x239 -x365 -x233
0.00/0.07 v -x358 -x227 -x351 -x221 -x344 -x76 -x69 -x62 -x55 -x48 -x196 -x316 -x190 -x309 -x184 -x302 -x178 -x295 -x172 -x288 -x140 -x133 -x126
0.00/0.07 v -x119 -x112 -x252 -x380 -x246 -x373 -x240 -x366 -x234 -x359 -x228 -x352 -x77 -x70 -x63 -x56 -x197 -x317 -x191 -x310 -x185 -x303
0.00/0.07 v -x179 -x296 -x141 -x134 -x127 -x120 -x253 -x381 -x247 -x374 -x241 -x367 -x235 -x360 -x78 -x71 -x64 -x198 -x318 -x192 -x311 -x186
0.00/0.07 v -x304 -x142 -x135 -x128 -x254 -x382 -x248 -x375 -x242 -x368 -x79 -x72 -x199 -x319 -x193 -x312 -x143 -x136 -x255 -x383 -x249 -x376
0.00/0.07 v -x80 -x200 -x320 -x144 -x256 -x384
0.00/0.07 c SCIP Status : problem is solved [optimal solution found]
0.00/0.07 c Total Time : 0.07
0.00/0.07 c solving : 0.07
0.00/0.07 c presolving : 0.04 (included in solving)
0.00/0.07 c reading : 0.00 (included in solving)
0.00/0.07 c copying : 0.00 (0 times copied the problem)
0.00/0.07 c Original Problem :
0.00/0.07 c Problem name : HOME/instance-4519111-1751547551.opb
0.00/0.07 c Variables : 416 (416 binary, 0 integer, 0 continuous)
0.00/0.07 c implied integral : 0 (0 binary, 0 integer, 0 continuous)
0.00/0.07 c Constraints : 608 initial, 608 maximal
0.00/0.07 c Objective : minimize, 32 non-zeros (abs.min = 1, abs.max = 32768)
0.00/0.07 c Presolved Problem :
0.00/0.07 c Problem name : t_HOME/instance-4519111-1751547551.opb
0.00/0.07 c Variables : 303 (303 binary, 0 integer, 0 continuous)
0.00/0.07 c implied integral : 0 (0 binary, 0 integer, 0 continuous)
0.00/0.07 c Constraints : 176 initial, 272 maximal
0.00/0.07 c Objective : minimize, 30 non-zeros (abs.min = 1, abs.max = 16384)
0.00/0.07 c Nonzeros : 736 constraint, 702 clique table
0.00/0.07 c Presolvers : ExecTime SetupTime Calls FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.07 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c domcol : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
0.00/0.07 c dualagg : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c dualcomp : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c dualinfer : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c dualsparsify : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.07 c gateextraction : 0.00 0.00 1 0 0 0 0 0 192 64 0 0
0.00/0.07 c implics : 0.00 0.00 5 0 0 0 0 0 0 0 0 0
0.00/0.07 c implint : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c milp : 0.00 0.00 1 0 0 0 0 0 496 304 0 0
0.00/0.07 c qpkktref : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c redvub : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c sparsify : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.07 c stuffing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c trivial : 0.00 0.00 6 0 0 0 0 0 0 0 0 0
0.00/0.07 c tworowbnd : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c dualfix : 0.00 0.00 6 0 0 0 0 0 0 0 0 0
0.00/0.07 c genvbounds : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c probing : 0.02 0.00 2 0 1 0 0 0 0 0 0 0
0.00/0.07 c pseudoobj : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
0.00/0.07 c symmetry : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.07 c vbounds : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
0.00/0.07 c knapsack : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c and : 0.00 0.00 4 0 0 0 0 0 0 0 0 0
0.00/0.07 c xor : 0.00 0.00 8 0 0 0 0 0 0 0 0 0
0.00/0.07 c linear : 0.01 0.00 9 0 112 0 0 0 112 0 0 0
0.00/0.07 c logicor : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
0.00/0.07 c components : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.07 c root node : - - - 0 - - 0 - - - - -
0.00/0.07 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoRelax #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Applied Conss Children
0.00/0.07 c integral : 0 0 0 0 0 0 0 9 0 0 0 0 0 0 0
0.00/0.07 c knapsack : 0+ 1 0 291 0 0 0 0 12 2 0 0 0 0 0
0.00/0.07 c and : 64 64 0 1373 0 0 0 4 497 2 0 0 0 0 0
0.00/0.07 c xor : 2 2 0 1380 0 0 0 3 18 2 0 0 0 0 0
0.00/0.07 c linear : 110+ 111 0 1390 0 0 0 6 1414 7 0 0 0 0 0
0.00/0.07 c logicor : 0+ 94 0 53 0 0 0 0 4 2 0 0 0 0 0
0.00/0.07 c fixedvar : 0 0 0 0 0 0 0 5 0 0 0 0 0 0 0
0.00/0.07 c countsols : 0 0 0 0 0 0 0 5 0 0 0 0 0 0 0
0.00/0.07 c components : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS EnfoRelax Check ResProp SB-Prop
0.00/0.07 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c xor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c linear : 0.01 0.00 0.00 0.01 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c fixedvar : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c components : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.00/0.07 c dualfix : 1 0 0 0
0.00/0.07 c genvbounds : 0 0 0 0
0.00/0.07 c nlobbt : 0 0 0 0
0.00/0.07 c obbt : 0 0 0 0
0.00/0.07 c probing : 0 0 0 0
0.00/0.07 c pseudoobj : 1 0 0 0
0.00/0.07 c redcost : 0 0 0 0
0.00/0.07 c rootredcost : 0 0 0 0
0.00/0.07 c symmetry : 0 0 0 0
0.00/0.07 c vbounds : 216 0 0 0
0.00/0.07 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp SB-Prop
0.00/0.07 c dualfix : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c genvbounds : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c nlobbt : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c obbt : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c probing : 0.02 0.00 0.02 0.00 0.00 0.00
0.00/0.07 c pseudoobj : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c redcost : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c rootredcost : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c symmetry : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c vbounds : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c Conflict Analysis : Time Calls Success DomReds Conflicts Literals Reconvs ReconvLits Dualrays Nonzeros LP Iters (pool size: [10000,10000])
0.00/0.07 c propagation : 0.00 13 13 - 128 32.7 0 0.0 - - -
0.00/0.07 c infeasible LP : 0.00 1 1 - 6 12.7 0 0.0 1 5.0 0
0.00/0.07 c bound exceed. LP : 0.00 1 1 - 17 37.4 0 0.0 1 30.0 0
0.00/0.07 c strong branching : 0.00 0 0 - 0 0.0 0 0.0 - - 0
0.00/0.07 c pseudo solution : 0.00 0 0 - 0 0.0 0 0.0 - - -
0.00/0.07 c applied globally : 0.00 - - 0 93 21.3 - - 2 - -
0.00/0.07 c applied locally : - - - 0 0 0.0 - - 0 - -
0.00/0.07 c Separators : ExecTime SetupTime Calls RootCalls Cutoffs DomReds FoundCuts ViaPoolAdd DirectAdd Applied ViaPoolApp DirectApp Conss
0.00/0.07 c cut pool : 0.00 - 0 0 - - 0 0 - - - - - (maximal pool size: 0)
0.00/0.07 c aggregation : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c > cmir : - - - - - - - 0 0 0 0 0 -
0.00/0.07 c > flowcover : - - - - - - - 0 0 0 0 0 -
0.00/0.07 c > knapsackcover : - - - - - - - 0 0 0 0 0 -
0.00/0.07 c cgmip : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c clique : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c closecuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c convexproj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c disjunctive : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c eccuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c gauge : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c gomory : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c > gomorymi : - - - - - - - 0 0 0 0 0 -
0.00/0.07 c > strongcg : - - - - - - - 0 0 0 0 0 -
0.00/0.07 c impliedbounds : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c interminor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c intobj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c lagromory : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c mcf : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c minor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c mixing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c multilinear : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c oddcycle : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c rapidlearning : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c rlt : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c zerohalf : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.07 c Cutselectors : ExecTime SetupTime Calls RootCalls Selected Forced Filtered RootSelec RootForc RootFilt
0.00/0.07 c hybrid : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c ensemble : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c dynamic : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c Pricers : ExecTime SetupTime Calls Vars
0.00/0.07 c problem variables: 0.00 - 0 0
0.00/0.07 c Branching Rules : ExecTime SetupTime BranchLP BranchExt BranchPS Cutoffs DomReds Cuts Conss Children
0.00/0.07 c allfullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c cloud : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c distribution : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c fullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c gomory : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c inference : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c leastinf : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c lookahead : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c mostinf : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c multaggr : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c nodereopt : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c pscost : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c random : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c relpscost : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c vanillafullstrong: 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c Primal Heuristics : ExecTime SetupTime Calls Found Best
0.00/0.07 c LP solutions : 0.00 - - 0 0
0.00/0.07 c relax solutions : 0.00 - - 0 0
0.00/0.07 c pseudo solutions : 0.00 - - 0 0
0.00/0.07 c strong branching : 0.00 - - 0 0
0.00/0.07 c actconsdiving : 0.00 0.00 0 0 0
0.00/0.07 c adaptivediving : 0.00 0.00 0 0 0
0.00/0.07 c alns : 0.00 0.00 0 0 0
0.00/0.07 c bound : 0.00 0.00 0 0 0
0.00/0.07 c clique : 0.00 0.00 1 0 0
0.00/0.07 c coefdiving : 0.00 0.00 0 0 0
0.00/0.07 c completesol : 0.00 0.00 0 0 0
0.00/0.07 c conflictdiving : 0.00 0.00 0 0 0
0.00/0.07 c crossover : 0.00 0.00 0 0 0
0.00/0.07 c dins : 0.00 0.00 0 0 0
0.00/0.07 c distributiondivin: 0.00 0.00 0 0 0
0.00/0.07 c dks : 0.00 0.00 0 0 0
0.00/0.07 c dps : 0.00 0.00 0 0 0
0.00/0.07 c dualval : 0.00 0.00 0 0 0
0.00/0.07 c farkasdiving : 0.00 0.00 0 0 0
0.00/0.07 c feaspump : 0.00 0.00 0 0 0
0.00/0.07 c fixandinfer : 0.00 0.00 0 0 0
0.00/0.07 c fracdiving : 0.00 0.00 0 0 0
0.00/0.07 c gins : 0.00 0.00 0 0 0
0.00/0.07 c guideddiving : 0.00 0.00 0 0 0
0.00/0.07 c indicator : 0.00 0.00 0 0 0
0.00/0.07 c indicatordiving : 0.00 0.00 0 0 0
0.00/0.07 c intdiving : 0.00 0.00 0 0 0
0.00/0.07 c intshifting : 0.00 0.00 0 0 0
0.00/0.07 c linesearchdiving : 0.00 0.00 0 0 0
0.00/0.07 c localbranching : 0.00 0.00 0 0 0
0.00/0.07 c locks : 0.00 0.00 1 0 0
0.00/0.07 c lpface : 0.00 0.00 0 0 0
0.00/0.07 c mpec : 0.00 0.00 0 0 0
0.00/0.07 c multistart : 0.00 0.00 0 0 0
0.00/0.07 c mutation : 0.00 0.00 0 0 0
0.00/0.07 c nlpdiving : 0.00 0.00 0 0 0
0.00/0.07 c objpscostdiving : 0.00 0.00 0 0 0
0.00/0.07 c octane : 0.00 0.00 0 0 0
0.00/0.07 c ofins : 0.00 0.00 0 0 0
0.00/0.07 c oneopt : 0.00 0.00 1 0 0
0.00/0.07 c padm : 0.00 0.00 0 0 0
0.00/0.07 c proximity : 0.00 0.00 0 0 0
0.00/0.07 c pscostdiving : 0.00 0.00 0 0 0
0.00/0.07 c randrounding : 0.00 0.00 0 0 0
0.00/0.07 c rens : 0.00 0.00 0 0 0
0.00/0.07 c reoptsols : 0.00 0.00 0 0 0
0.00/0.07 c repair : 0.00 0.00 0 0 0
0.00/0.07 c rins : 0.00 0.00 0 0 0
0.00/0.07 c rootsoldiving : 0.00 0.00 0 0 0
0.00/0.07 c rounding : 0.00 0.00 0 0 0
0.00/0.07 c scheduler : 0.00 0.00 0 0 0
0.00/0.07 c shiftandpropagate: 0.00 0.00 0 0 0
0.00/0.07 c shifting : 0.00 0.00 0 0 0
0.00/0.07 c simplerounding : 0.00 0.00 0 0 0
0.00/0.07 c subnlp : 0.00 0.00 0 0 0
0.00/0.07 c trivial : 0.00 0.00 2 1 1
0.00/0.07 c trivialnegation : 0.00 0.00 0 0 0
0.00/0.07 c trustregion : 0.00 0.00 0 0 0
0.00/0.07 c trysol : 0.00 0.00 1 0 0
0.00/0.07 c twoopt : 0.00 0.00 0 0 0
0.00/0.07 c undercover : 0.00 0.00 0 0 0
0.00/0.07 c vbounds : 0.01 0.00 1 0 0
0.00/0.07 c veclendiving : 0.00 0.00 0 0 0
0.00/0.07 c zeroobj : 0.00 0.00 0 0 0
0.00/0.07 c zirounding : 0.00 0.00 0 0 0
0.00/0.07 c other solutions : - - - 0 -
0.00/0.07 c LNS (Scheduler) : Calls SetupTime SolveTime SolveNodes Sols Best Exp3 Exp3-IX EpsGreedy UCB TgtFixRate Opt Inf Node Stal Sol Usr Othr Actv
0.00/0.07 c rens : 0 0.00 0.00 0 0 0 0.00000 0.12500 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
0.00/0.07 c rins : 0 0.00 0.00 0 0 0 0.00000 0.12500 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
0.00/0.07 c mutation : 0 0.00 0.00 0 0 0 0.00000 0.12500 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
0.00/0.07 c localbranching : 0 0.00 0.00 0 0 0 0.00000 0.12500 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
0.00/0.07 c crossover : 0 0.00 0.00 0 0 0 0.00000 0.12500 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
0.00/0.07 c proximity : 0 0.00 0.00 0 0 0 0.00000 0.12500 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
0.00/0.07 c zeroobjective : 0 0.00 0.00 0 0 0 0.00000 0.12500 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
0.00/0.07 c dins : 0 0.00 0.00 0 0 0 0.00000 0.12500 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
0.00/0.07 c trustregion : 0 0.00 0.00 0 0 0 0.00000 0.00000 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 0
0.00/0.07 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It ItLimit
0.00/0.07 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.07 c dual LP : 0.01 1 261 261.00 - 0.00 0
0.00/0.07 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.07 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.07 c resolve instable : 0.00 0 0 0.00 -
0.00/0.07 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.07 c strong branching : 0.00 0 0 0.00 - - - 0
0.00/0.07 c (at root node) : - 0 0 0.00 -
0.00/0.07 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.07 c Relaxators : Time Calls Cutoffs ImprBounds ImprTime ReducedDom Separated AddedConss
0.00/0.07 c benders : 0.00 0 0 0 0.00 0 0 0
0.00/0.07 c B&B Tree :
0.00/0.07 c number of runs : 1
0.00/0.07 c nodes : 1 (0 internal, 1 leaves)
0.00/0.07 c feasible leaves : 0
0.00/0.07 c infeas. leaves : 0
0.00/0.07 c objective leaves : 1
0.00/0.07 c nodes (total) : 1 (0 internal, 1 leaves)
0.00/0.07 c nodes left : 0
0.00/0.07 c max depth : 0
0.00/0.07 c max depth (total): 0
0.00/0.07 c backtracks : 0 (0.0%)
0.00/0.07 c early backtracks : 0 (0.0%)
0.00/0.07 c nodes exc. ref. : 0 (0.0%)
0.00/0.07 c delayed cutoffs : 0
0.00/0.07 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.07 c avg switch length: 2.00
0.00/0.07 c switching time : 0.00
0.00/0.08 c Root Node :
0.00/0.08 c First LP value : -
0.00/0.08 c First LP Iters : 261 (51096.32 Iter/sec)
0.00/0.08 c First LP Time : 0.01
0.00/0.08 c Final Dual Bound : -
0.00/0.08 c Final Root Iters : 261
0.00/0.08 c Root LP Estimate : -
0.00/0.08 c Solution :
0.00/0.08 c Solutions found : 1 (1 improvements)
0.00/0.08 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.00/0.08 c Gap First Sol. : infinite
0.00/0.08 c Gap Last Sol. : infinite
0.00/0.08 c Primal Bound : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.00/0.08 c Dual Bound : +0.00000000000000e+00
0.00/0.08 c Gap : 0.00 %
0.00/0.08 c Integrals : Total Avg%
0.00/0.08 c primal-dual : 7.01 99.87
0.00/0.08 c primal-ref : - - (not evaluated)
0.00/0.08 c dual-ref : - - (not evaluated)
0.00/0.08 c Time complete (sec): 0.079