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-4520905-1751552393.opb>
0.00/0.01 c original problem has 360 variables (360 bin, 0 int, 0 cont) and 360 constraints
0.00/0.01 c problem read in 0.003 seconds
0.00/0.01 o 360
0.00/0.01 c feasible solution found by trivial heuristic after 0.0 seconds, objective value 3.600000e+02
0.00/0.01 c presolving:
0.00/0.01 c (0.0s) running MILP presolver
0.00/0.01 c (0.0s) MILP presolver found nothing
0.00/0.02 c (round 1, exhaustive) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 360 upgd conss, 0 impls, 0 clqs
0.00/0.02 c (0.0s) probing: 51/360 (14.2%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.02 c (0.0s) probing aborted: 50/50 successive totally useless probings
0.00/0.02 c (0.0s) symmetry computation started: requiring (bin +, int +, cont +), (fixed: bin -, int -, cont -)
0.00/0.02 c (0.0s) symmetry computation finished: 4 generators found (max: 1500, log10 of symmetry group size: 2.86) (symcode time: 0.00)
0.00/0.02 c dynamic symmetry handling statistics:
0.00/0.02 c orbitopal reduction: no components
0.00/0.02 c orbital reduction: 1 components of sizes 4
0.00/0.02 c lexicographic reduction: 4 permutations with support sizes 348, 360, 360, 360
0.00/0.02 c handled 1 out of 1 symmetry components
0.00/0.02 c presolving (2 rounds: 2 fast, 2 medium, 2 exhaustive):
0.00/0.02 c 0 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 0 implications, 0 cliques
0.00/0.02 c presolved problem has 360 variables (360 bin, 0 int, 0 cont) and 360 constraints
0.00/0.02 c presolved problem has 0 implied integral variables (0 bin, 0 int, 0 cont)
0.00/0.02 c 360 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.02
0.00/0.02 c problem pure SAT
0.00/0.02 c
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c
0.00/0.02 c # SCIP version 10.0.0
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, advanced: FALSE, range: [0,1e+20], default: 1e+20]
0.00/0.02 c limits/time = 3596.995051
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, advanced: FALSE, range: [0,8796093022207], default: 8796093022207]
0.00/0.02 c limits/memory = 27900
0.00/0.02 c
0.00/0.02 c # belongs reading time to solving time?
0.00/0.02 c # [type: bool, advanced: FALSE, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c timing/reading = TRUE
0.00/0.02 c
0.00/0.02 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.02 c # [type: int, advanced: TRUE, range: [-1,2147483647], default: -1]
0.00/0.02 c reading/opbreader/maxintsize = 47
0.00/0.02 c
0.00/0.02 c # timing when propagator should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP, 15:ALWAYS))
0.00/0.02 c # [type: int, advanced: TRUE, range: [0,15], default: 15]
0.00/0.02 c propagating/genvbounds/timingmask = 0
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.03 c transformed 1/1 original solutions to the transformed problem space
0.00/0.03 c
0.00/0.03 o 90
0.00/0.03 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.03 c p 0.0s| 1 | 0 | 0 | - | locks| 0 | 360 | 360 | 360 | 0 | 0 | 0 | 0 | 0.000000e+00 | 9.000000e+01 | Inf | unknown
0.00/0.04 c 0.0s| 1 | 0 | 348 | - | 6997k | 0 | 360 | 360 | 360 | 0 | 0 | 0 | 0 | 9.000000e+01 | 9.000000e+01 | 0.00%| unknown
0.00/0.04 c
0.00/0.04 c SCIP Status : problem is solved [optimal solution found]
0.00/0.04 c Solving Time (sec) : 0.04
0.00/0.04 c Solving Nodes : 1
0.00/0.04 c Primal Bound : +9.00000000000000e+01 (2 solutions)
0.00/0.04 c Dual Bound : +9.00000000000000e+01
0.00/0.04 c Gap : 0.00 %
0.00/0.04 s OPTIMUM FOUND
0.00/0.04 v x1 -x2 x3 -x4 x5 -x6 -x7 -x8 -x9 -x10 -x11 -x12 -x13 x14 -x15 x16 -x17 x18 -x19 -x20 -x21 -x22 -x23 -x24 x25 -x26 x27 -x28 x29 -x30
0.00/0.04 v -x31 -x32 -x33 -x34 -x35 -x36 -x37 x38 -x39 x40 -x41 x42 -x43 -x44 -x45 -x46 -x47 -x48 x49 -x50 x51 -x52 x53 -x54 -x55 -x56 -x57
0.00/0.04 v -x58 -x59 -x60 -x61 x62 -x63 x64 -x65 x66 -x67 -x68 -x69 -x70 -x71 -x72 x73 -x74 x75 -x76 x77 -x78 -x79 -x80 -x81 -x82 -x83 -x84
0.00/0.04 v -x85 x86 -x87 x88 -x89 x90 -x91 -x92 -x93 -x94 -x95 -x96 x97 -x98 x99 -x100 x101 -x102 -x103 -x104 -x105 -x106 -x107 -x108 -x109
0.00/0.04 v x110 -x111 x112 -x113 x114 -x115 -x116 -x117 -x118 -x119 -x120 x121 -x122 x123 -x124 x125 -x126 -x127 -x128 -x129 -x130 -x131 -x132
0.00/0.04 v -x133 x134 -x135 x136 -x137 x138 -x139 -x140 -x141 -x142 -x143 -x144 x145 -x146 x147 -x148 x149 -x150 -x151 -x152 -x153 -x154 -x155
0.00/0.04 v -x156 -x157 x158 -x159 x160 -x161 x162 -x163 -x164 -x165 -x166 -x167 -x168 x169 -x170 x171 -x172 x173 -x174 -x175 -x176 -x177 -x178
0.00/0.04 v -x179 -x180 -x181 x182 -x183 x184 -x185 x186 -x187 -x188 -x189 -x190 -x191 -x192 x193 -x194 x195 -x196 x197 -x198 -x199 -x200 -x201
0.00/0.04 v -x202 -x203 -x204 -x205 x206 -x207 x208 -x209 x210 -x211 -x212 -x213 -x214 -x215 -x216 x217 -x218 x219 -x220 x221 -x222 -x223 -x224
0.00/0.04 v -x225 -x226 -x227 -x228 -x229 x230 -x231 x232 -x233 x234 -x235 -x236 -x237 -x238 -x239 -x240 x241 -x242 x243 -x244 x245 -x246 -x247
0.00/0.04 v -x248 -x249 -x250 -x251 -x252 -x253 x254 -x255 x256 -x257 x258 -x259 -x260 -x261 -x262 -x263 -x264 x265 -x266 x267 -x268 x269 -x270
0.00/0.04 v -x271 -x272 -x273 -x274 -x275 -x276 -x277 x278 -x279 x280 -x281 x282 -x283 -x284 -x285 -x286 -x287 -x288 x289 -x290 x291 -x292 x293
0.00/0.04 v -x294 -x295 -x296 -x297 -x298 -x299 -x300 -x301 x302 -x303 x304 -x305 x306 -x307 -x308 -x309 -x310 -x311 -x312 x313 -x314 x315 -x316
0.00/0.04 v x317 -x318 -x319 -x320 -x321 -x322 -x323 -x324 -x325 x326 -x327 x328 -x329 x330 -x331 -x332 -x333 -x334 -x335 -x336 x337 -x338 x339
0.00/0.04 v -x340 x341 -x342 -x343 -x344 -x345 -x346 -x347 -x348 -x349 x350 -x351 x352 -x353 x354 -x355 -x356 -x357 -x358 -x359 -x360
0.00/0.04 c SCIP Status : problem is solved [optimal solution found]
0.00/0.04 c Total Time : 0.04
0.00/0.04 c solving : 0.04
0.00/0.04 c presolving : 0.02 (included in solving)
0.00/0.04 c reading : 0.00 (included in solving)
0.00/0.04 c copying : 0.00 (0 times copied the problem)
0.00/0.04 c Original Problem :
0.00/0.04 c Problem name : HOME/instance-4520905-1751552393.opb
0.00/0.04 c Variables : 360 (360 binary, 0 integer, 0 continuous)
0.00/0.04 c implied integral : 0 (0 binary, 0 integer, 0 continuous)
0.00/0.04 c Constraints : 360 initial, 360 maximal
0.00/0.04 c Objective : minimize, 360 non-zeros (abs.min = 1, abs.max = 1)
0.00/0.04 c Presolved Problem :
0.00/0.04 c Problem name : t_HOME/instance-4520905-1751552393.opb
0.00/0.04 c Variables : 360 (360 binary, 0 integer, 0 continuous)
0.00/0.04 c implied integral : 0 (0 binary, 0 integer, 0 continuous)
0.00/0.04 c Constraints : 360 initial, 360 maximal
0.00/0.04 c Objective : minimize, 360 non-zeros (abs.min = 1, abs.max = 1)
0.00/0.04 c Nonzeros : 1440 constraint, 0 clique table
0.00/0.04 c Presolvers : ExecTime SetupTime Calls FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.04 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c domcol : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.04 c dualagg : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c dualcomp : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c dualinfer : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c dualsparsify : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.04 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c implics : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
0.00/0.04 c implint : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c milp : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.04 c qpkktref : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c redvub : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c sparsify : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.04 c stuffing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c trivial : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
0.00/0.04 c tworowbnd : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c dualfix : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
0.00/0.04 c genvbounds : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c probing : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.04 c pseudoobj : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.04 c symmetry : 0.01 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.04 c vbounds : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c linear : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
0.00/0.04 c logicor : 0.00 0.00 3 0 0 0 0 0 0 0 0 0
0.00/0.04 c components : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.04 c root node : - - - 0 - - 0 - - - - -
0.00/0.04 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoRelax #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Applied Conss Children
0.00/0.04 c integral : 0 0 0 0 0 0 0 7 0 0 0 0 0 0 0
0.00/0.04 c logicor : 360 360 0 50 0 0 0 3 0 0 0 0 0 0 0
0.00/0.04 c fixedvar : 0 0 0 0 0 0 0 5 0 0 0 0 0 0 0
0.00/0.04 c countsols : 0 0 0 0 0 0 0 5 0 0 0 0 0 0 0
0.00/0.04 c components : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS EnfoRelax Check ResProp SB-Prop
0.00/0.04 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.04 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.04 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.04 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.04 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.04 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.00/0.04 c dualfix : 2 0 0 0
0.00/0.04 c genvbounds : 0 0 0 0
0.00/0.04 c nlobbt : 0 0 0 0
0.00/0.04 c obbt : 0 0 0 0
0.00/0.04 c probing : 0 0 0 0
0.00/0.04 c pseudoobj : 2 0 0 0
0.00/0.04 c redcost : 0 0 0 0
0.00/0.04 c rootredcost : 0 0 0 0
0.00/0.04 c symmetry : 0 0 0 0
0.00/0.04 c vbounds : 0 0 0 0
0.00/0.04 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp SB-Prop
0.00/0.04 c dualfix : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c genvbounds : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c nlobbt : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c obbt : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c probing : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c pseudoobj : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c redcost : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c rootredcost : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c symmetry : 0.01 0.00 0.01 0.00 0.00 0.00
0.00/0.04 c vbounds : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c Symmetry :
0.00/0.04 c #affected vars : 360 (360 bin, 0 int, 0 cont)
0.00/0.04 c orbitopal red. : 0 reductions applied, 0 cutoffs
0.00/0.04 c orbital reduction: 0 reductions applied, 0 cutoffs
0.00/0.04 c lexicographic red: 0 reductions applied, 0 cutoffs
0.00/0.04 c shadow tree time : 0.00 s
0.00/0.04 c Conflict Analysis : Time Calls Success DomReds Conflicts Literals Reconvs ReconvLits Dualrays Nonzeros LP Iters (pool size: [--,--])
0.00/0.04 c propagation : 0.00 0 0 - 0 0.0 0 0.0 - - -
0.00/0.04 c infeasible LP : 0.00 0 0 - 0 0.0 0 0.0 0 0.0 0
0.00/0.04 c bound exceed. LP : 0.00 0 0 - 0 0.0 0 0.0 0 0.0 0
0.00/0.04 c strong branching : 0.00 0 0 - 0 0.0 0 0.0 - - 0
0.00/0.04 c pseudo solution : 0.00 0 0 - 0 0.0 0 0.0 - - -
0.00/0.04 c applied globally : 0.00 - - 0 0 0.0 - - 0 - -
0.00/0.04 c applied locally : - - - 0 0 0.0 - - 0 - -
0.00/0.04 c Separators : ExecTime SetupTime Calls RootCalls Cutoffs DomReds FoundCuts ViaPoolAdd DirectAdd Applied ViaPoolApp DirectApp Conss
0.00/0.04 c cut pool : 0.00 - 0 0 - - 0 0 - - - - - (maximal pool size: 0)
0.00/0.04 c aggregation : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c > cmir : - - - - - - - 0 0 0 0 0 -
0.00/0.04 c > flowcover : - - - - - - - 0 0 0 0 0 -
0.00/0.04 c > knapsackcover : - - - - - - - 0 0 0 0 0 -
0.00/0.04 c cgmip : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c clique : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c closecuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c convexproj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c disjunctive : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c eccuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c gauge : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c gomory : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c > gomorymi : - - - - - - - 0 0 0 0 0 -
0.00/0.04 c > strongcg : - - - - - - - 0 0 0 0 0 -
0.00/0.04 c impliedbounds : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c interminor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c intobj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c lagromory : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c mcf : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c minor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c mixing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c multilinear : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c oddcycle : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c rapidlearning : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c rlt : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c zerohalf : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c Cutselectors : ExecTime SetupTime Calls RootCalls Selected Forced Filtered RootSelec RootForc RootFilt
0.00/0.04 c hybrid : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c ensemble : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c dynamic : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c Pricers : ExecTime SetupTime Calls Vars
0.00/0.04 c problem variables: 0.00 - 0 0
0.00/0.04 c Branching Rules : ExecTime SetupTime BranchLP BranchExt BranchPS Cutoffs DomReds Cuts Conss Children
0.00/0.04 c allfullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c cloud : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c distribution : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c fullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c gomory : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c inference : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c leastinf : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c lookahead : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c mostinf : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c multaggr : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c nodereopt : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c pscost : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c random : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c relpscost : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c vanillafullstrong: 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c Primal Heuristics : ExecTime SetupTime Calls Found Best
0.00/0.04 c LP solutions : 0.00 - - 0 0
0.00/0.04 c relax solutions : 0.00 - - 0 0
0.00/0.04 c pseudo solutions : 0.00 - - 0 0
0.00/0.04 c strong branching : 0.00 - - 0 0
0.00/0.04 c actconsdiving : 0.00 0.00 0 0 0
0.00/0.04 c adaptivediving : 0.00 0.00 0 0 0
0.00/0.04 c alns : 0.00 0.00 0 0 0
0.00/0.04 c bound : 0.00 0.00 0 0 0
0.00/0.04 c clique : 0.00 0.00 0 0 0
0.00/0.04 c coefdiving : 0.00 0.00 0 0 0
0.00/0.04 c completesol : 0.00 0.00 0 0 0
0.00/0.04 c conflictdiving : 0.00 0.00 0 0 0
0.00/0.04 c crossover : 0.00 0.00 0 0 0
0.00/0.04 c dins : 0.00 0.00 0 0 0
0.00/0.04 c distributiondivin: 0.00 0.00 0 0 0
0.00/0.04 c dks : 0.00 0.00 0 0 0
0.00/0.04 c dps : 0.00 0.00 0 0 0
0.00/0.04 c dualval : 0.00 0.00 0 0 0
0.00/0.04 c farkasdiving : 0.00 0.00 0 0 0
0.00/0.04 c feaspump : 0.00 0.00 0 0 0
0.00/0.04 c fixandinfer : 0.00 0.00 0 0 0
0.00/0.04 c fracdiving : 0.00 0.00 0 0 0
0.00/0.04 c gins : 0.00 0.00 0 0 0
0.00/0.04 c guideddiving : 0.00 0.00 0 0 0
0.00/0.04 c indicator : 0.00 0.00 0 0 0
0.00/0.04 c indicatordiving : 0.00 0.00 0 0 0
0.00/0.04 c intdiving : 0.00 0.00 0 0 0
0.00/0.04 c intshifting : 0.00 0.00 0 0 0
0.00/0.04 c linesearchdiving : 0.00 0.00 0 0 0
0.00/0.04 c localbranching : 0.00 0.00 0 0 0
0.00/0.04 c locks : 0.00 0.00 1 1 1
0.00/0.04 c lpface : 0.00 0.00 0 0 0
0.00/0.04 c mpec : 0.00 0.00 0 0 0
0.00/0.04 c multistart : 0.00 0.00 0 0 0
0.00/0.04 c mutation : 0.00 0.00 0 0 0
0.00/0.04 c nlpdiving : 0.00 0.00 0 0 0
0.00/0.04 c objpscostdiving : 0.00 0.00 0 0 0
0.00/0.04 c octane : 0.00 0.00 0 0 0
0.00/0.04 c ofins : 0.00 0.00 0 0 0
0.00/0.04 c oneopt : 0.00 0.00 1 0 0
0.00/0.04 c padm : 0.00 0.00 0 0 0
0.00/0.04 c proximity : 0.00 0.00 0 0 0
0.00/0.04 c pscostdiving : 0.00 0.00 0 0 0
0.00/0.04 c randrounding : 0.00 0.00 0 0 0
0.00/0.04 c rens : 0.00 0.00 0 0 0
0.00/0.04 c reoptsols : 0.00 0.00 0 0 0
0.00/0.04 c repair : 0.00 0.00 0 0 0
0.00/0.04 c rins : 0.00 0.00 0 0 0
0.00/0.04 c rootsoldiving : 0.00 0.00 0 0 0
0.00/0.04 c rounding : 0.00 0.00 0 0 0
0.00/0.04 c scheduler : 0.00 0.00 0 0 0
0.00/0.04 c shiftandpropagate: 0.00 0.00 0 0 0
0.00/0.04 c shifting : 0.00 0.00 0 0 0
0.00/0.04 c simplerounding : 0.00 0.00 0 0 0
0.00/0.04 c subnlp : 0.00 0.00 0 0 0
0.00/0.04 c trivial : 0.00 0.00 2 1 1
0.00/0.04 c trivialnegation : 0.00 0.00 0 0 0
0.00/0.04 c trustregion : 0.00 0.00 0 0 0
0.00/0.04 c trysol : 0.00 0.00 0 0 0
0.00/0.04 c twoopt : 0.00 0.00 0 0 0
0.00/0.04 c undercover : 0.00 0.00 0 0 0
0.00/0.04 c vbounds : 0.00 0.00 0 0 0
0.00/0.04 c veclendiving : 0.00 0.00 0 0 0
0.00/0.04 c zeroobj : 0.00 0.00 0 0 0
0.00/0.04 c zirounding : 0.00 0.00 0 0 0
0.00/0.04 c other solutions : - - - 0 -
0.00/0.04 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.04 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.04 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.04 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.04 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.04 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.04 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.04 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.04 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.04 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.04 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It ItLimit
0.00/0.04 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.04 c dual LP : 0.01 1 348 348.00 30371.79 0.00 0
0.00/0.04 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.04 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.04 c resolve instable : 0.00 0 0 0.00 -
0.00/0.04 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.04 c strong branching : 0.00 0 0 0.00 - - - 0
0.00/0.04 c (at root node) : - 0 0 0.00 -
0.00/0.04 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.04 c Relaxators : Time Calls Cutoffs ImprBounds ImprTime ReducedDom Separated AddedConss
0.00/0.04 c benders : 0.00 0 0 0 0.00 0 0 0
0.00/0.04 c B&B Tree :
0.00/0.04 c number of runs : 1
0.00/0.04 c nodes : 1 (0 internal, 1 leaves)
0.00/0.04 c feasible leaves : 0
0.00/0.04 c infeas. leaves : 0
0.00/0.04 c objective leaves : 1
0.00/0.04 c nodes (total) : 1 (0 internal, 1 leaves)
0.00/0.04 c nodes left : 0
0.00/0.04 c max depth : 0
0.00/0.04 c max depth (total): 0
0.00/0.04 c backtracks : 0 (0.0%)
0.00/0.04 c early backtracks : 0 (0.0%)
0.00/0.04 c nodes exc. ref. : 0 (0.0%)
0.00/0.04 c delayed cutoffs : 0
0.00/0.04 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.04 c avg switch length: 2.00
0.00/0.04 c switching time : 0.00
0.00/0.04 c Root Node :
0.00/0.04 c First LP value : -
0.00/0.04 c First LP Iters : 348 (30353.25 Iter/sec)
0.00/0.04 c First LP Time : 0.01
0.00/0.04 c Final Dual Bound : -
0.00/0.04 c Final Root Iters : 348
0.00/0.04 c Root LP Estimate : -
0.00/0.04 c Solution :
0.00/0.04 c Solutions found : 2 (2 improvements)
0.00/0.04 c First Solution : +3.60000000000000e+02 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.00/0.04 c Gap First Sol. : infinite
0.00/0.04 c Gap Last Sol. : infinite
0.00/0.04 c Primal Bound : +9.00000000000000e+01 (in run 1, after 1 nodes, 0.03 seconds, depth 2, found by <locks>)
0.00/0.04 c Dual Bound : +9.00000000000000e+01
0.00/0.04 c Gap : 0.00 %
0.00/0.04 c Integrals : Total Avg%
0.00/0.04 c primal-dual : 3.76 99.79
0.00/0.04 c primal-ref : - - (not evaluated)
0.00/0.04 c dual-ref : - - (not evaluated)
0.00/0.04 c Time complete (sec): 0.047
runsolver version 3.4.2 (svn: 4680) Copyright (C) 2010-2013 Olivier ROUSSEL
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
NUMA information:
number of nodes: 2
memory of node 0: 63837 MiB (61422 MiB free)
memory of node 1: 64465 MiB (61526 MiB free)
node distances:
10 21
21 10
command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-4520905-1751552393/watcher-4520905-1751552393 -o /tmp/evaluation-result-4520905-1751552393/solver-4520905-1751552393 -C 3600 -W 3700 -M 31000 --bin-var /tmp/runsolver-exch-nodeC010-1751547548-78153 --watchdog 3760 pbsolver -f HOME/instance-4520905-1751552393.opb -t 3600 -m 31000
running on 2 cores: 1,3
CPU governors:
performance: 1 3
Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 3600 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 3630 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 3700 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 31744000 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 31795200 KiB
Linux 5.14.0-503.14.1.el9_5.x86_64
Starting watchdog thread
solver pid=80366, runsolver pid=80363
Current StackSize limit: 8192 KiB
[startup+0.0505889 s]
# the end of solver process 80366 was just reported to runsolver
# Child status: 0
# cumulated CPU time of all completed processes: user=0.040708 s, system=0.008967 s
Solver just ended.
??? end of watcher thread
Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.0507029
CPU time (s): 0.049675
CPU user time (s): 0.040708
CPU system time (s): 0.008967
CPU usage (%): 97.9727
Max. virtual memory (cumulated for all children) (KiB): 0
Max. memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.040708
system time used= 0.008967
maximum resident set size= 17664
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 2017
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 3
involuntary context switches= 0
# summary of solver processes directly reported to runsolver:
# pid: 80366
# total CPU time (s): 0.049675
# total CPU user time (s): 0.040708
# total CPU system time (s): 0.008967
??? join timestamper begins
??? join timestamper ends
??? end of timestamper thread
runsolver used 0.008478 second user time and 0.032162 second system time
The end