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-4496973-1751388057.opb>
0.00/0.00 c original problem has 256 variables (256 bin, 0 int, 0 cont) and 351 constraints
0.00/0.00 c problem read in 0.001 seconds
0.00/0.00 o 235098
0.00/0.00 c feasible solution found by trivial heuristic after 0.0 seconds, objective value 2.350980e+05
0.00/0.00 c presolving:
0.00/0.00 c (round 1, fast) 90 del vars, 168 del conss, 0 add conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 152 clqs
0.00/0.00 c (round 2, fast) 91 del vars, 175 del conss, 0 add conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 152 clqs
0.00/0.00 c (0.0s) running MILP presolver
0.00/0.00 c (0.0s) MILP presolver found nothing
0.00/0.00 c (round 3, exhaustive) 91 del vars, 175 del conss, 0 add conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 131 upgd conss, 0 impls, 152 clqs
0.00/0.00 c (round 4, fast) 107 del vars, 176 del conss, 0 add conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 131 upgd conss, 0 impls, 152 clqs
0.00/0.00 c (round 5, fast) 108 del vars, 177 del conss, 0 add conss, 4 chg bounds, 0 chg sides, 9 chg coeffs, 131 upgd conss, 0 impls, 152 clqs
0.00/0.00 c (round 6, fast) 109 del vars, 178 del conss, 0 add conss, 4 chg bounds, 0 chg sides, 9 chg coeffs, 131 upgd conss, 0 impls, 151 clqs
0.00/0.00 c (round 7, exhaustive) 109 del vars, 178 del conss, 0 add conss, 4 chg bounds, 0 chg sides, 9 chg coeffs, 175 upgd conss, 0 impls, 151 clqs
0.00/0.00 c (round 8, fast) 114 del vars, 178 del conss, 0 add conss, 4 chg bounds, 0 chg sides, 9 chg coeffs, 175 upgd conss, 0 impls, 151 clqs
0.00/0.00 c (round 9, fast) 114 del vars, 178 del conss, 0 add conss, 4 chg bounds, 0 chg sides, 14 chg coeffs, 175 upgd conss, 0 impls, 151 clqs
0.00/0.00 c (round 10, exhaustive) 114 del vars, 271 del conss, 19 add conss, 4 chg bounds, 0 chg sides, 14 chg coeffs, 175 upgd conss, 0 impls, 151 clqs
0.00/0.00 c (0.0s) probing: 51/142 (35.9%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.00 c (0.0s) probing aborted: 50/50 successive totally useless probings
0.00/0.00 c (0.0s) symmetry computation started: requiring (bin +, int +, cont +), (fixed: bin -, int -, cont -)
0.00/0.00 c (0.0s) no symmetry present (symcode time: 0.00)
0.00/0.00 c presolving (11 rounds: 11 fast, 4 medium, 4 exhaustive):
0.00/0.00 c 114 deleted vars, 271 deleted constraints, 19 added constraints, 4 tightened bounds, 0 added holes, 0 changed sides, 14 changed coefficients
0.00/0.00 c 0 implications, 151 cliques
0.00/0.00 c presolved problem has 142 variables (142 bin, 0 int, 0 cont) and 99 constraints
0.00/0.00 c presolved problem has 0 implied integral variables (0 bin, 0 int, 0 cont)
0.00/0.00 c 77 constraints of type <setppc>
0.00/0.00 c 19 constraints of type <and>
0.00/0.00 c 3 constraints of type <logicor>
0.00/0.00 c transformed objective value is always integral (scale: 1)
0.00/0.00 c Presolving Time: 0.00
0.00/0.00 c
0.00/0.00 c - non default parameters ----------------------------------------------------------------------
0.00/0.00 c
0.00/0.00 c # SCIP version 10.0.0
0.00/0.00 c
0.00/0.00 c # maximal time in seconds to run
0.00/0.00 c # [type: real, advanced: FALSE, range: [0,1e+20], default: 1e+20]
0.00/0.00 c limits/time = 3596.998007
0.00/0.00 c
0.00/0.00 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.00 c # [type: real, advanced: FALSE, range: [0,8796093022207], default: 8796093022207]
0.00/0.00 c limits/memory = 27900
0.00/0.00 c
0.00/0.00 c # belongs reading time to solving time?
0.00/0.00 c # [type: bool, advanced: FALSE, range: {TRUE,FALSE}, default: FALSE]
0.00/0.00 c timing/reading = TRUE
0.00/0.00 c
0.00/0.00 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.00 c # [type: int, advanced: TRUE, range: [-1,2147483647], default: -1]
0.00/0.00 c reading/opbreader/maxintsize = 47
0.00/0.00 c
0.00/0.00 c # timing when propagator should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP, 15:ALWAYS))
0.00/0.00 c # [type: int, advanced: TRUE, range: [0,15], default: 15]
0.00/0.00 c propagating/genvbounds/timingmask = 0
0.00/0.00 c
0.00/0.00 c -----------------------------------------------------------------------------------------------
0.00/0.00 c
0.00/0.00 o 200255
0.00/0.00 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.00 c t 0.0s| 1 | 0 | 0 | - | trivial| 0 | 142 | 99 | 0 | 0 | 0 | 0 | 0 | 9.719000e+03 | 2.002550e+05 |1960.45%| unknown
0.00/0.00 o 13949
0.00/0.00 c p 0.0s| 1 | 0 | 0 | - | clique| 0 | 142 | 99 | 118 | 0 | 0 | 0 | 0 | 9.719000e+03 | 1.394900e+04 | 43.52%| unknown
0.00/0.01 c 0.0s| 1 | 0 | 10 | - | 3715k | 0 | 142 | 100 | 118 | 0 | 0 | 5 | 0 | 1.394900e+04 | 1.394900e+04 | 0.00%| unknown
0.00/0.01 c
0.00/0.01 c SCIP Status : problem is solved [optimal solution found]
0.00/0.01 c Solving Time (sec) : 0.01
0.00/0.01 c Solving Nodes : 1
0.00/0.01 c Primal Bound : +1.39490000000000e+04 (3 solutions)
0.00/0.01 c Dual Bound : +1.39490000000000e+04
0.00/0.01 c Gap : 0.00 %
0.00/0.01 s OPTIMUM FOUND
0.00/0.01 v -x28 -x29 -x31 -x32 -x33 -x35 -x37 -x39 -x40 -x42 -x44 -x45 -x46 -x47 -x49 -x50 -x52 -x53 -x55 x56 -x57 -x59 -x61 -x63 -x65 -x67
0.00/0.01 v -x69 -x71 -x73 -x75 -x77 -x78 -x80 -x81 -x83 -x85 -x87 -x88 -x90 -x92 -x94 x95 -x97 -x99 -x101 -x103 -x105 -x107 -x108 -x110 -x111
0.00/0.01 v -x113 -x115 -x117 -x119 -x121 -x122 -x124 -x125 -x127 -x129 -x131 -x132 -x134 -x135 -x136 -x137 -x139 -x140 -x141 -x143 -x144 -x146
0.00/0.01 v -x147 -x148 -x150 -x152 -x153 -x155 -x157 -x159 x160 -x161 -x163 -x165 -x167 -x169 -x170 -x172 -x173 -x175 -x176 -x178 -x180 -x182
0.00/0.01 v -x184 -x186 -x187 -x188 -x190 -x192 -x193 -x195 -x197 -x199 -x200 -x202 -x203 -x204 -x205 -x207 -x209 -x211 -x212 -x213 -x214 -x215
0.00/0.01 v -x216 -x217 -x219 -x221 -x223 -x225 -x226 -x227 -x228 -x229 -x230 -x231 -x233 -x234 -x235 x236 -x238 -x239 -x240 -x241 -x242 -x243
0.00/0.01 v x244 -x245 -x246 -x247 -x248 x249 -x250 -x251 x252 x253 x254 x255 -x256 -x27 -x1 -x30 -x2 -x3 -x34 -x4 -x36 -x38 -x41 -x43 -x5 -x6
0.00/0.01 v -x48 -x51 -x54 -x58 -x60 -x62 -x64 -x66 -x68 -x70 -x72 -x74 -x76 -x7 -x79 -x82 -x8 -x84 -x86 -x89 -x91 -x93 -x96 -x98 -x100 -x102
0.00/0.01 v -x104 -x106 -x109 -x112 -x114 -x116 -x118 -x9 -x120 -x123 -x10 -x126 -x11 -x128 -x130 -x133 -x12 -x13 -x14 -x138 -x15 -x142 -x145
0.00/0.01 v -x16 -x149 -x151 -x154 -x156 -x158 -x162 -x164 -x166 -x168 -x171 -x174 -x177 -x179 -x181 -x183 -x185 -x17 -x189 -x191 -x18 -x194
0.00/0.01 v -x196 -x198 -x201 -x19 -x20 -x206 -x208 -x210 -x21 -x22 -x23 -x218 -x220 -x222 -x24 -x224 -x25 -x232 -x26 -x237
0.00/0.01 c SCIP Status : problem is solved [optimal solution found]
0.00/0.01 c Total Time : 0.01
0.00/0.01 c solving : 0.01
0.00/0.01 c presolving : 0.00 (included in solving)
0.00/0.01 c reading : 0.00 (included in solving)
0.00/0.01 c copying : 0.00 (0 times copied the problem)
0.00/0.01 c Original Problem :
0.00/0.01 c Problem name : HOME/instance-4496973-1751388057.opb
0.00/0.01 c Variables : 256 (256 binary, 0 integer, 0 continuous)
0.00/0.01 c implied integral : 0 (0 binary, 0 integer, 0 continuous)
0.00/0.01 c Constraints : 351 initial, 351 maximal
0.00/0.01 c Objective : minimize, 152 non-zeros (abs.min = 1184, abs.max = 1848)
0.00/0.01 c Presolved Problem :
0.00/0.01 c Problem name : t_HOME/instance-4496973-1751388057.opb
0.00/0.01 c Variables : 142 (142 binary, 0 integer, 0 continuous)
0.00/0.01 c implied integral : 0 (0 binary, 0 integer, 0 continuous)
0.00/0.01 c Constraints : 99 initial, 101 maximal
0.00/0.01 c Objective : minimize, 123 non-zeros (abs.min = 1184, abs.max = 1848)
0.00/0.01 c Nonzeros : 289 constraint, 302 clique table
0.00/0.01 c Presolvers : ExecTime SetupTime Calls FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.01 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c domcol : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.01 c dualagg : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c dualcomp : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c dualinfer : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c dualsparsify : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.01 c gateextraction : 0.00 0.00 3 0 0 0 0 0 93 19 0 0
0.00/0.01 c implics : 0.00 0.00 4 0 0 0 0 0 0 0 0 0
0.00/0.01 c implint : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c milp : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.01 c qpkktref : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c redvub : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c sparsify : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.01 c stuffing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c trivial : 0.00 0.00 11 0 0 0 0 0 0 0 0 0
0.00/0.01 c tworowbnd : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c dualfix : 0.00 0.00 11 2 0 0 0 0 0 0 0 0
0.00/0.01 c genvbounds : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c probing : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.01 c pseudoobj : 0.00 0.00 4 0 0 0 0 0 0 0 0 0
0.00/0.01 c symmetry : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.01 c vbounds : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.01 c setppc : 0.00 0.00 13 0 0 0 0 0 0 0 0 0
0.00/0.01 c and : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
0.00/0.01 c linear : 0.00 0.00 9 4 86 0 4 0 176 0 0 0
0.00/0.01 c logicor : 0.00 0.00 12 21 1 0 0 0 2 0 0 14
0.00/0.01 c components : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.01 c root node : - - - 1 - - 1 - - - - -
0.00/0.01 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoRelax #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Applied Conss Children
0.00/0.01 c integral : 0 0 0 0 0 0 0 9 0 0 0 0 0 0 0
0.00/0.01 c setppc : 77 77 0 554 0 0 0 4 88 0 0 0 0 0 0
0.00/0.01 c and : 19 19 0 542 0 0 0 4 2 0 0 0 0 0 0
0.00/0.01 c logicor : 3+ 6 0 55 0 0 0 3 11 2 0 0 0 0 0
0.00/0.01 c fixedvar : 0 0 0 0 0 0 0 5 0 0 0 0 0 0 0
0.00/0.01 c countsols : 0 0 0 0 0 0 0 5 0 0 0 0 0 0 0
0.00/0.01 c components : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS EnfoRelax Check ResProp SB-Prop
0.00/0.01 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.01 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.01 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.01 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.01 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.01 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.01 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.01 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.00/0.01 c dualfix : 2 0 0 0
0.00/0.01 c genvbounds : 0 0 0 0
0.00/0.01 c nlobbt : 0 0 0 0
0.00/0.01 c obbt : 0 0 0 0
0.00/0.01 c probing : 0 0 0 0
0.00/0.01 c pseudoobj : 2 0 0 0
0.00/0.01 c redcost : 0 0 0 0
0.00/0.01 c rootredcost : 0 0 0 0
0.00/0.01 c symmetry : 0 0 0 0
0.00/0.01 c vbounds : 298 0 0 0
0.00/0.01 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp SB-Prop
0.00/0.01 c dualfix : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c genvbounds : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c nlobbt : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c obbt : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c probing : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c pseudoobj : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c redcost : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c rootredcost : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c symmetry : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c vbounds : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c Conflict Analysis : Time Calls Success DomReds Conflicts Literals Reconvs ReconvLits Dualrays Nonzeros LP Iters (pool size: [10000,10000])
0.00/0.01 c propagation : 0.00 2 2 - 18 29.0 0 0.0 - - -
0.00/0.01 c infeasible LP : 0.00 0 0 - 0 0.0 0 0.0 0 0.0 0
0.00/0.01 c bound exceed. LP : 0.00 5 3 - 3 4.7 0 0.0 0 0.0 29
0.00/0.01 c strong branching : 0.00 0 0 - 0 0.0 0 0.0 - - 0
0.00/0.01 c pseudo solution : 0.00 0 0 - 0 0.0 0 0.0 - - -
0.00/0.01 c applied globally : 0.00 - - 0 3 4.7 - - 0 - -
0.00/0.01 c applied locally : - - - 0 2 25.0 - - 0 - -
0.00/0.01 c Separators : ExecTime SetupTime Calls RootCalls Cutoffs DomReds FoundCuts ViaPoolAdd DirectAdd Applied ViaPoolApp DirectApp Conss
0.00/0.01 c cut pool : 0.00 - 0 0 - - 0 0 - - - - - (maximal pool size: 0)
0.00/0.01 c aggregation : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c > cmir : - - - - - - - 0 0 0 0 0 -
0.00/0.01 c > flowcover : - - - - - - - 0 0 0 0 0 -
0.00/0.01 c > knapsackcover : - - - - - - - 0 0 0 0 0 -
0.00/0.01 c cgmip : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c clique : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c closecuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c convexproj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c disjunctive : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c eccuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c gauge : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c gomory : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c > gomorymi : - - - - - - - 0 0 0 0 0 -
0.00/0.01 c > strongcg : - - - - - - - 0 0 0 0 0 -
0.00/0.01 c impliedbounds : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c interminor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c intobj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c lagromory : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c mcf : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c minor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c mixing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c multilinear : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c oddcycle : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c rapidlearning : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c rlt : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c zerohalf : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c Cutselectors : ExecTime SetupTime Calls RootCalls Selected Forced Filtered RootSelec RootForc RootFilt
0.00/0.01 c hybrid : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c ensemble : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c dynamic : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c Pricers : ExecTime SetupTime Calls Vars
0.00/0.01 c problem variables: 0.00 - 0 0
0.00/0.01 c Branching Rules : ExecTime SetupTime BranchLP BranchExt BranchPS Cutoffs DomReds Cuts Conss Children
0.00/0.01 c allfullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c cloud : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c distribution : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c fullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c gomory : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c inference : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c leastinf : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c lookahead : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c mostinf : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c multaggr : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c nodereopt : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c pscost : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c random : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c relpscost : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c vanillafullstrong: 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c Primal Heuristics : ExecTime SetupTime Calls Found Best
0.00/0.01 c LP solutions : 0.00 - - 0 0
0.00/0.01 c relax solutions : 0.00 - - 0 0
0.00/0.01 c pseudo solutions : 0.00 - - 0 0
0.00/0.01 c strong branching : 0.00 - - 0 0
0.00/0.01 c actconsdiving : 0.00 0.00 0 0 0
0.00/0.01 c adaptivediving : 0.00 0.00 0 0 0
0.00/0.01 c alns : 0.00 0.00 0 0 0
0.00/0.01 c bound : 0.00 0.00 0 0 0
0.00/0.01 c clique : 0.00 0.00 1 1 1
0.00/0.01 c coefdiving : 0.00 0.00 0 0 0
0.00/0.01 c completesol : 0.00 0.00 0 0 0
0.00/0.01 c conflictdiving : 0.00 0.00 0 0 0
0.00/0.01 c crossover : 0.00 0.00 0 0 0
0.00/0.01 c dins : 0.00 0.00 0 0 0
0.00/0.01 c distributiondivin: 0.00 0.00 0 0 0
0.00/0.01 c dks : 0.00 0.00 0 0 0
0.00/0.01 c dps : 0.00 0.00 0 0 0
0.00/0.01 c dualval : 0.00 0.00 0 0 0
0.00/0.01 c farkasdiving : 0.00 0.00 0 0 0
0.00/0.01 c feaspump : 0.00 0.00 0 0 0
0.00/0.01 c fixandinfer : 0.00 0.00 0 0 0
0.00/0.01 c fracdiving : 0.00 0.00 0 0 0
0.00/0.01 c gins : 0.00 0.00 0 0 0
0.00/0.01 c guideddiving : 0.00 0.00 0 0 0
0.00/0.01 c indicator : 0.00 0.00 0 0 0
0.00/0.01 c indicatordiving : 0.00 0.00 0 0 0
0.00/0.01 c intdiving : 0.00 0.00 0 0 0
0.00/0.01 c intshifting : 0.00 0.00 0 0 0
0.00/0.01 c linesearchdiving : 0.00 0.00 0 0 0
0.00/0.01 c localbranching : 0.00 0.00 0 0 0
0.00/0.01 c locks : 0.00 0.00 1 0 0
0.00/0.01 c lpface : 0.00 0.00 0 0 0
0.00/0.01 c mpec : 0.00 0.00 0 0 0
0.00/0.01 c multistart : 0.00 0.00 0 0 0
0.00/0.01 c mutation : 0.00 0.00 0 0 0
0.00/0.01 c nlpdiving : 0.00 0.00 0 0 0
0.00/0.01 c objpscostdiving : 0.00 0.00 0 0 0
0.00/0.01 c octane : 0.00 0.00 0 0 0
0.00/0.01 c ofins : 0.00 0.00 0 0 0
0.00/0.01 c oneopt : 0.00 0.00 1 0 0
0.00/0.01 c padm : 0.00 0.00 0 0 0
0.00/0.01 c proximity : 0.00 0.00 0 0 0
0.00/0.01 c pscostdiving : 0.00 0.00 0 0 0
0.00/0.01 c randrounding : 0.00 0.00 0 0 0
0.00/0.01 c rens : 0.00 0.00 0 0 0
0.00/0.01 c reoptsols : 0.00 0.00 0 0 0
0.00/0.01 c repair : 0.00 0.00 0 0 0
0.00/0.01 c rins : 0.00 0.00 0 0 0
0.00/0.01 c rootsoldiving : 0.00 0.00 0 0 0
0.00/0.01 c rounding : 0.00 0.00 0 0 0
0.00/0.01 c scheduler : 0.00 0.00 0 0 0
0.00/0.01 c shiftandpropagate: 0.00 0.00 0 0 0
0.00/0.01 c shifting : 0.00 0.00 0 0 0
0.00/0.01 c simplerounding : 0.00 0.00 0 0 0
0.00/0.01 c subnlp : 0.00 0.00 0 0 0
0.00/0.01 c trivial : 0.00 0.00 2 2 2
0.00/0.01 c trivialnegation : 0.00 0.00 0 0 0
0.00/0.01 c trustregion : 0.00 0.00 0 0 0
0.00/0.01 c trysol : 0.00 0.00 0 0 0
0.00/0.01 c twoopt : 0.00 0.00 0 0 0
0.00/0.01 c undercover : 0.00 0.00 0 0 0
0.00/0.01 c vbounds : 0.00 0.00 1 0 0
0.00/0.01 c veclendiving : 0.00 0.00 0 0 0
0.00/0.01 c zeroobj : 0.00 0.00 0 0 0
0.00/0.01 c zirounding : 0.00 0.00 0 0 0
0.00/0.01 c other solutions : - - - 0 -
0.00/0.01 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.01 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.01 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.01 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.01 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.01 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.01 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.01 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.01 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.01 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.01 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It ItLimit
0.00/0.01 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.01 c dual LP : 0.00 1 9 9.00 - 0.00 0
0.00/0.01 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.01 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.01 c resolve instable : 0.00 0 0 0.00 -
0.00/0.01 c diving/probing LP: 0.00 1 1 1.00 -
0.00/0.01 c strong branching : 0.00 0 0 0.00 - - - 0
0.00/0.01 c (at root node) : - 0 0 0.00 -
0.00/0.01 c conflict analysis: 0.00 5 29 5.80 -
0.00/0.01 c Relaxators : Time Calls Cutoffs ImprBounds ImprTime ReducedDom Separated AddedConss
0.00/0.01 c benders : 0.00 0 0 0 0.00 0 0 0
0.00/0.01 c B&B Tree :
0.00/0.01 c number of runs : 1
0.00/0.01 c nodes : 1 (0 internal, 1 leaves)
0.00/0.01 c feasible leaves : 0
0.00/0.01 c infeas. leaves : 0
0.00/0.01 c objective leaves : 1
0.00/0.01 c nodes (total) : 1 (0 internal, 1 leaves)
0.00/0.01 c nodes left : 0
0.00/0.01 c max depth : 0
0.00/0.01 c max depth (total): 0
0.00/0.01 c backtracks : 0 (0.0%)
0.00/0.01 c early backtracks : 0 (0.0%)
0.00/0.01 c nodes exc. ref. : 0 (0.0%)
0.00/0.01 c delayed cutoffs : 0
0.00/0.01 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.01 c avg switch length: 2.00
0.00/0.01 c switching time : 0.00
0.00/0.01 c Root Node :
0.00/0.01 c First LP value : -
0.00/0.01 c First LP Iters : 9 (140625.00 Iter/sec)
0.00/0.01 c First LP Time : 0.00
0.00/0.01 c Final Dual Bound : -
0.00/0.01 c Final Root Iters : 9
0.00/0.01 c Root LP Estimate : -
0.00/0.01 c Solution :
0.00/0.01 c Solutions found : 3 (3 improvements)
0.00/0.01 c First Solution : +2.35098000000000e+05 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.01 c Gap First Sol. : infinite
0.00/0.01 c Gap Last Sol. : 43.52 %
0.00/0.01 c Primal Bound : +1.39490000000000e+04 (in run 1, after 1 nodes, 0.01 seconds, depth 28, found by <clique>)
0.00/0.01 c Dual Bound : +1.39490000000000e+04
0.00/0.01 c Gap : 0.00 %
0.00/0.01 c Integrals : Total Avg%
0.00/0.01 c primal-dual : 0.75 80.01
0.00/0.01 c primal-ref : - - (not evaluated)
0.00/0.01 c dual-ref : - - (not evaluated)
0.00/0.01 c Time complete (sec): 0.013