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-4488137-1751317942.opb>
0.00/0.00 c original problem has 99 variables (99 bin, 0 int, 0 cont) and 244 constraints
0.00/0.00 c problem read in 0.001 seconds
0.00/0.00 c presolving:
0.00/0.00 c (round 1, fast) 4 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 144 clqs
0.00/0.00 c (round 2, fast) 6 del vars, 19 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 160 clqs
0.00/0.00 c (0.0s) running MILP presolver
0.00/0.00 c (0.0s) MILP presolver (5 rounds): 17 aggregations, 0 fixings, 0 bound changes
0.00/0.00 c (round 3, medium) 23 del vars, 19 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 126 clqs
0.00/0.00 c (round 4, fast) 24 del vars, 54 del conss, 1 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 125 clqs
0.00/0.00 c (round 5, fast) 24 del vars, 54 del conss, 1 add conss, 0 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 0 impls, 126 clqs
0.00/0.00 c (round 6, exhaustive) 24 del vars, 56 del conss, 1 add conss, 0 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 0 impls, 126 clqs
0.00/0.00 c (round 7, fast) 25 del vars, 57 del conss, 2 add conss, 0 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 0 impls, 124 clqs
0.00/0.00 c (round 8, fast) 25 del vars, 57 del conss, 2 add conss, 0 chg bounds, 2 chg sides, 2 chg coeffs, 0 upgd conss, 0 impls, 124 clqs
0.00/0.00 c (round 9, exhaustive) 25 del vars, 58 del conss, 2 add conss, 0 chg bounds, 2 chg sides, 2 chg coeffs, 0 upgd conss, 0 impls, 124 clqs
0.00/0.00 c (round 10, exhaustive) 25 del vars, 58 del conss, 2 add conss, 0 chg bounds, 2 chg sides, 2 chg coeffs, 186 upgd conss, 0 impls, 124 clqs
0.00/0.00 c (round 11, exhaustive) 25 del vars, 244 del conss, 64 add conss, 0 chg bounds, 2 chg sides, 2 chg coeffs, 186 upgd conss, 0 impls, 124 clqs
0.00/0.00 c (round 12, exhaustive) 26 del vars, 245 del conss, 64 add conss, 0 chg bounds, 2 chg sides, 2 chg coeffs, 186 upgd conss, 0 impls, 122 clqs
0.00/0.00 c (round 13, fast) 26 del vars, 245 del conss, 65 add conss, 0 chg bounds, 3 chg sides, 3 chg coeffs, 186 upgd conss, 0 impls, 122 clqs
0.00/0.00 c (round 14, fast) 26 del vars, 245 del conss, 65 add conss, 0 chg bounds, 4 chg sides, 4 chg coeffs, 186 upgd conss, 0 impls, 122 clqs
0.00/0.00 c (round 15, exhaustive) 26 del vars, 245 del conss, 65 add conss, 0 chg bounds, 5 chg sides, 4 chg coeffs, 186 upgd conss, 0 impls, 122 clqs
0.00/0.00 c (round 16, exhaustive) 26 del vars, 245 del conss, 65 add conss, 0 chg bounds, 5 chg sides, 4 chg coeffs, 187 upgd conss, 0 impls, 122 clqs
0.00/0.00 c (round 17, exhaustive) 26 del vars, 245 del conss, 65 add conss, 0 chg bounds, 5 chg sides, 6 chg coeffs, 187 upgd conss, 0 impls, 122 clqs
0.00/0.00 c (0.0s) probing cycle finished: starting next cycle
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 (18 rounds: 18 fast, 10 medium, 9 exhaustive):
0.00/0.00 c 26 deleted vars, 245 deleted constraints, 65 added constraints, 0 tightened bounds, 0 added holes, 5 changed sides, 6 changed coefficients
0.00/0.00 c 0 implications, 152 cliques
0.00/0.00 c presolved problem has 75 variables (75 bin, 0 int, 0 cont) and 64 constraints
0.00/0.00 c presolved problem has 0 implied integral variables (0 bin, 0 int, 0 cont)
0.00/0.00 c 61 constraints of type <and>
0.00/0.00 c 2 constraints of type <linear>
0.00/0.00 c 1 constraints of type <logicor>
0.00/0.00 c transformed objective value is always integral (scale: 2)
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.998264
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.01 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.01 c 0.0s| 1 | 0 | 38 | - | 2642k | 0 | 75 | 69 | 125 | 0 | 0 | 6 | 0 | 1.000000e+00 | -- | Inf | unknown
0.00/0.02 o 331
0.00/0.02 c * 0.0s| 1 | 0 | 87 | - | LP | 0 | 75 | 71 | 125 | 0 | 0 | 8 | 0 | 1.000000e+00 | 3.310000e+02 | Large | unknown
0.00/0.02 c 0.0s| 1 | 0 | 119 | - | 2772k | 0 | 75 | 93 | 35 | 5 | 1 | 8 | 0 | 3.310000e+02 | 3.310000e+02 | 0.00%| unknown
0.00/0.02 c 0.0s| 1 | 0 | 119 | - | 2772k | 0 | 75 | 93 | 35 | 5 | 1 | 8 | 0 | 3.310000e+02 | 3.310000e+02 | 0.00%| unknown
0.00/0.02 c
0.00/0.02 c SCIP Status : problem is solved [optimal solution found]
0.00/0.02 c Solving Time (sec) : 0.02
0.00/0.02 c Solving Nodes : 1
0.00/0.02 c Primal Bound : +3.31000000000000e+02 (1 solutions)
0.00/0.02 c Dual Bound : +3.31000000000000e+02
0.00/0.02 c Gap : 0.00 %
0.00/0.02 s OPTIMUM FOUND
0.00/0.02 v x1 x2 -x3 x4 -x5 -x6 x7 -x8 x9 x19 x10 x20 x11 -x21 -x12 x22 x13 x23 x14 x24 x15 x25 x16 -x26 -x17 x27 x18 x28 x29 -x30 x31 x32
0.00/0.02 v 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 -x58 -x59 -x60
0.00/0.02 v -x61 -x62 -x63 -x64 -x65 -x66 -x67 -x68 -x69 -x70 -x71 -x72 x73 x74 -x75 x76 x77 x78 x79 -x80 x81 -x82 -x83 -x84 -x85 -x86 -x87
0.00/0.02 v -x88 -x89 -x90 x91 x92 -x93 x94 x95 x96 x97 -x98 x99
0.00/0.02 c SCIP Status : problem is solved [optimal solution found]
0.00/0.02 c Total Time : 0.02
0.00/0.02 c solving : 0.02
0.00/0.02 c presolving : 0.00 (included in solving)
0.00/0.02 c reading : 0.00 (included in solving)
0.00/0.02 c copying : 0.00 (1 #copies) (minimal 0.00, maximal 0.00, average 0.00)
0.00/0.02 c Original Problem :
0.00/0.02 c Problem name : HOME/instance-4488137-1751317942.opb
0.00/0.02 c Variables : 99 (99 binary, 0 integer, 0 continuous)
0.00/0.02 c implied integral : 0 (0 binary, 0 integer, 0 continuous)
0.00/0.02 c Constraints : 244 initial, 244 maximal
0.00/0.02 c Objective : minimize, 9 non-zeros (abs.min = 1, abs.max = 256)
0.00/0.02 c Presolved Problem :
0.00/0.02 c Problem name : t_HOME/instance-4488137-1751317942.opb
0.00/0.02 c Variables : 75 (75 binary, 0 integer, 0 continuous)
0.00/0.02 c implied integral : 0 (0 binary, 0 integer, 0 continuous)
0.00/0.02 c Constraints : 64 initial, 99 maximal
0.00/0.02 c Objective : minimize, 8 non-zeros (abs.min = 1, abs.max = 128)
0.00/0.02 c Nonzeros : 265 constraint, 306 clique table
0.00/0.02 c Presolvers : ExecTime SetupTime Calls FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.02 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c domcol : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.02 c dualagg : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c dualcomp : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c dualinfer : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c dualsparsify : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.02 c gateextraction : 0.00 0.00 1 0 0 0 0 0 186 62 0 0
0.00/0.02 c implics : 0.00 0.00 10 0 0 0 0 0 0 0 0 0
0.00/0.02 c implint : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c milp : 0.00 0.00 1 0 17 0 0 0 0 0 0 0
0.00/0.02 c qpkktref : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c redvub : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c sparsify : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.02 c stuffing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c trivial : 0.00 0.00 18 2 0 0 0 0 0 0 0 0
0.00/0.02 c tworowbnd : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c dualfix : 0.00 0.00 18 0 0 0 0 0 0 0 0 0
0.00/0.02 c genvbounds : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c probing : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.02 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c symmetry : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.02 c vbounds : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.02 c setppc : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
0.00/0.02 c and : 0.00 0.00 12 0 1 0 0 0 1 0 0 0
0.00/0.02 c linear : 0.00 0.00 25 1 3 0 0 0 58 3 5 4
0.00/0.02 c logicor : 0.00 0.00 8 0 0 0 0 0 0 0 0 2
0.00/0.02 c components : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.02 c root node : - - - 64 - - 64 - - - - -
0.00/0.02 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoRelax #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Applied Conss Children
0.00/0.02 c integral : 0 0 0 0 0 0 0 10 0 0 0 0 0 0 0
0.00/0.02 c setppc : 0+ 1 2 121 0 0 0 0 1 0 0 1 0 0 0
0.00/0.02 c and : 61 61 2 364 0 0 0 4 117 4 0 35 4 0 0
0.00/0.02 c linear : 2+ 30 2 360 0 0 0 6 22 21 0 0 0 0 0
0.00/0.02 c logicor : 1+ 7 2 44 0 0 0 0 1 0 0 2 0 0 0
0.00/0.02 c fixedvar : 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0
0.00/0.02 c countsols : 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0
0.00/0.02 c components : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS EnfoRelax Check ResProp SB-Prop
0.00/0.02 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.02 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.02 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.02 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 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.02 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.02 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.02 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.02 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.00/0.02 c dualfix : 1 0 0 0
0.00/0.02 c genvbounds : 0 0 0 0
0.00/0.02 c nlobbt : 0 0 0 0
0.00/0.02 c obbt : 0 0 0 0
0.00/0.02 c probing : 0 0 0 0
0.00/0.02 c pseudoobj : 2 0 0 0
0.00/0.02 c redcost : 1 0 0 0
0.00/0.02 c rootredcost : 0 0 0 0
0.00/0.02 c symmetry : 0 0 0 0
0.00/0.02 c vbounds : 141 0 0 0
0.00/0.02 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp SB-Prop
0.00/0.02 c dualfix : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c genvbounds : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c nlobbt : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c obbt : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c probing : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c pseudoobj : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c redcost : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c rootredcost : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c symmetry : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c vbounds : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c Conflict Analysis : Time Calls Success DomReds Conflicts Literals Reconvs ReconvLits Dualrays Nonzeros LP Iters (pool size: [10000,10000])
0.00/0.02 c propagation : 0.00 8 8 - 22 20.7 2 22.0 - - -
0.00/0.02 c infeasible LP : 0.00 0 0 - 0 0.0 0 0.0 0 0.0 0
0.00/0.02 c bound exceed. LP : 0.00 0 0 - 0 0.0 0 0.0 0 0.0 0
0.00/0.02 c strong branching : 0.00 0 0 - 0 0.0 0 0.0 - - 0
0.00/0.02 c pseudo solution : 0.00 0 0 - 0 0.0 0 0.0 - - -
0.00/0.02 c applied globally : 0.00 - - 0 6 4.8 - - 0 - -
0.00/0.02 c applied locally : - - - 0 2 36.0 - - 0 - -
0.00/0.02 c Separators : ExecTime SetupTime Calls RootCalls Cutoffs DomReds FoundCuts ViaPoolAdd DirectAdd Applied ViaPoolApp DirectApp Conss
0.00/0.02 c cut pool : 0.00 - 1 1 - - 47 2 - - - - - (maximal pool size: 47)
0.00/0.02 c aggregation : 0.00 0.00 1 1 0 0 2 0 0 0 0 0 0
0.00/0.02 c > cmir : - - - - - - - 0 0 0 0 0 -
0.00/0.02 c > flowcover : - - - - - - - 0 0 0 0 0 -
0.00/0.02 c > knapsackcover : - - - - - - - 0 0 0 0 0 -
0.00/0.02 c cgmip : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c clique : 0.00 0.00 1 1 0 0 2 0 0 0 0 0 0
0.00/0.02 c closecuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c convexproj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c disjunctive : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c eccuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c gauge : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c gomory : 0.00 0.00 1 1 0 0 4 0 0 0 0 0 0
0.00/0.02 c > gomorymi : - - - - - - - 0 0 0 0 0 -
0.00/0.02 c > strongcg : - - - - - - - 0 0 0 0 0 -
0.00/0.02 c impliedbounds : 0.00 0.00 1 1 0 0 39 2 0 1 1 0 0
0.00/0.02 c interminor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c intobj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c lagromory : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c mcf : 0.00 0.00 1 1 0 0 0 0 0 0 0 0 0
0.00/0.02 c minor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c mixing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c multilinear : 0.00 0.00 1 1 0 0 0 0 0 0 0 0 0
0.00/0.02 c oddcycle : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c rapidlearning : 0.01 0.00 1 1 0 64 0 0 0 0 0 0 28
0.00/0.02 c rlt : 0.00 0.00 1 1 0 0 0 0 0 0 0 0 0
0.00/0.02 c zerohalf : 0.00 0.00 1 1 0 0 0 0 0 0 0 0 0
0.00/0.02 c Cutselectors : ExecTime SetupTime Calls RootCalls Selected Forced Filtered RootSelec RootForc RootFilt
0.00/0.02 c hybrid : 0.00 0.00 1 1 10 0 30 10 0 30
0.00/0.02 c ensemble : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c dynamic : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c Pricers : ExecTime SetupTime Calls Vars
0.00/0.02 c problem variables: 0.00 - 0 0
0.00/0.02 c Branching Rules : ExecTime SetupTime BranchLP BranchExt BranchPS Cutoffs DomReds Cuts Conss Children
0.00/0.02 c allfullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c cloud : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c distribution : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c fullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c gomory : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c inference : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c leastinf : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c lookahead : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c mostinf : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c multaggr : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c nodereopt : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c pscost : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c random : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c relpscost : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c vanillafullstrong: 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c Primal Heuristics : ExecTime SetupTime Calls Found Best
0.00/0.02 c LP solutions : 0.00 - - 0 0
0.00/0.02 c relax solutions : 0.00 - - 0 0
0.00/0.02 c pseudo solutions : 0.00 - - 0 0
0.00/0.02 c strong branching : 0.00 - - 0 0
0.00/0.02 c actconsdiving : 0.00 0.00 0 0 0
0.00/0.02 c adaptivediving : 0.00 0.00 0 0 0
0.00/0.02 c alns : 0.00 0.00 0 0 0
0.00/0.02 c bound : 0.00 0.00 0 0 0
0.00/0.02 c clique : 0.00 0.00 1 0 0
0.00/0.02 c coefdiving : 0.00 0.00 0 0 0
0.00/0.02 c completesol : 0.00 0.00 0 0 0
0.00/0.02 c conflictdiving : 0.00 0.00 0 0 0
0.00/0.02 c crossover : 0.00 0.00 0 0 0
0.00/0.02 c dins : 0.00 0.00 0 0 0
0.00/0.02 c distributiondivin: 0.00 0.00 0 0 0
0.00/0.02 c dks : 0.00 0.00 0 0 0
0.00/0.02 c dps : 0.00 0.00 0 0 0
0.00/0.02 c dualval : 0.00 0.00 0 0 0
0.00/0.02 c farkasdiving : 0.00 0.00 0 0 0
0.00/0.02 c feaspump : 0.00 0.00 1 0 0
0.00/0.02 c fixandinfer : 0.00 0.00 0 0 0
0.00/0.02 c fracdiving : 0.00 0.00 0 0 0
0.00/0.02 c gins : 0.00 0.00 0 0 0
0.00/0.02 c guideddiving : 0.00 0.00 0 0 0
0.00/0.02 c indicator : 0.00 0.00 0 0 0
0.00/0.02 c indicatordiving : 0.00 0.00 0 0 0
0.00/0.02 c intdiving : 0.00 0.00 0 0 0
0.00/0.02 c intshifting : 0.00 0.00 0 0 0
0.00/0.02 c linesearchdiving : 0.00 0.00 0 0 0
0.00/0.02 c localbranching : 0.00 0.00 0 0 0
0.00/0.02 c locks : 0.00 0.00 1 0 0
0.00/0.02 c lpface : 0.00 0.00 0 0 0
0.00/0.02 c mpec : 0.00 0.00 0 0 0
0.00/0.02 c multistart : 0.00 0.00 0 0 0
0.00/0.02 c mutation : 0.00 0.00 0 0 0
0.00/0.02 c nlpdiving : 0.00 0.00 0 0 0
0.00/0.02 c objpscostdiving : 0.00 0.00 0 0 0
0.00/0.02 c octane : 0.00 0.00 0 0 0
0.00/0.02 c ofins : 0.00 0.00 0 0 0
0.00/0.02 c oneopt : 0.00 0.00 0 0 0
0.00/0.02 c padm : 0.00 0.00 0 0 0
0.00/0.02 c proximity : 0.00 0.00 0 0 0
0.00/0.02 c pscostdiving : 0.00 0.00 0 0 0
0.00/0.02 c randrounding : 0.00 0.00 1 0 0
0.00/0.02 c rens : 0.00 0.00 0 0 0
0.00/0.02 c reoptsols : 0.00 0.00 0 0 0
0.00/0.02 c repair : 0.00 0.00 0 0 0
0.00/0.02 c rins : 0.00 0.00 0 0 0
0.00/0.02 c rootsoldiving : 0.00 0.00 0 0 0
0.00/0.02 c rounding : 0.00 0.00 1 0 0
0.00/0.02 c scheduler : 0.00 0.00 0 0 0
0.00/0.02 c shiftandpropagate: 0.00 0.00 1 0 0
0.00/0.02 c shifting : 0.00 0.00 1 0 0
0.00/0.02 c simplerounding : 0.00 0.00 0 0 0
0.00/0.02 c subnlp : 0.00 0.00 0 0 0
0.00/0.02 c trivial : 0.00 0.00 2 0 0
0.00/0.02 c trivialnegation : 0.00 0.00 0 0 0
0.00/0.02 c trustregion : 0.00 0.00 0 0 0
0.00/0.02 c trysol : 0.00 0.00 0 0 0
0.00/0.02 c twoopt : 0.00 0.00 0 0 0
0.00/0.02 c undercover : 0.00 0.00 1 0 0
0.00/0.02 c vbounds : 0.00 0.00 1 0 0
0.00/0.02 c veclendiving : 0.00 0.00 0 0 0
0.00/0.02 c zeroobj : 0.00 0.00 0 0 0
0.00/0.02 c zirounding : 0.00 0.00 0 0 0
0.00/0.02 c other solutions : - - - 0 -
0.00/0.02 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.02 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.02 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.02 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.02 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.02 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.02 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.02 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.02 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.02 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.02 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It ItLimit
0.00/0.02 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.02 c dual LP : 0.00 3 70 23.33 - 0.00 0
0.00/0.02 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.02 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.02 c resolve instable : 0.00 0 0 0.00 -
0.00/0.02 c diving/probing LP: 0.00 13 49 3.77 -
0.00/0.02 c strong branching : 0.00 0 0 0.00 - - - 0
0.00/0.02 c (at root node) : - 0 0 0.00 -
0.00/0.02 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.02 c Relaxators : Time Calls Cutoffs ImprBounds ImprTime ReducedDom Separated AddedConss
0.00/0.02 c benders : 0.00 0 0 0 0.00 0 0 0
0.00/0.02 c B&B Tree :
0.00/0.02 c number of runs : 1
0.00/0.02 c nodes : 1 (0 internal, 1 leaves)
0.00/0.02 c feasible leaves : 0
0.00/0.02 c infeas. leaves : 0
0.00/0.02 c objective leaves : 0
0.00/0.02 c nodes (total) : 1 (0 internal, 1 leaves)
0.00/0.02 c nodes left : 0
0.00/0.02 c max depth : 0
0.00/0.02 c max depth (total): 0
0.00/0.02 c backtracks : 0 (0.0%)
0.00/0.02 c early backtracks : 0 (0.0%)
0.00/0.02 c nodes exc. ref. : 0 (0.0%)
0.00/0.02 c delayed cutoffs : 0
0.00/0.02 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.02 c avg switch length: 2.00
0.00/0.02 c switching time : 0.00
0.00/0.02 c Root Node :
0.00/0.02 c First LP value : +1.00000000000000e+00
0.00/0.02 c First LP Iters : 38 (116207.95 Iter/sec)
0.00/0.02 c First LP Time : 0.00
0.00/0.02 c Final Dual Bound : -
0.00/0.02 c Final Root Iters : 119
0.00/0.02 c Root LP Estimate : -
0.00/0.02 c Solution :
0.00/0.02 c Solutions found : 1 (1 improvements)
0.00/0.02 c First Solution : +3.31000000000000e+02 (in run 1, after 1 nodes, 0.02 seconds, depth 0, found by <relaxation>)
0.00/0.02 c Gap First Sol. : 33000.00 %
0.00/0.02 c Gap Last Sol. : 33000.00 %
0.00/0.02 c Primal Bound : +3.31000000000000e+02 (in run 1, after 1 nodes, 0.02 seconds, depth 0, found by <relaxation>)
0.00/0.02 c Dual Bound : +3.31000000000000e+02
0.00/0.02 c Gap : 0.00 %
0.00/0.02 c Integrals : Total Avg%
0.00/0.02 c primal-dual : 2.23 96.28
0.00/0.02 c primal-ref : - - (not evaluated)
0.00/0.02 c dual-ref : - - (not evaluated)
0.00/0.02 c Time complete (sec): 0.027