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-4508561-1751508428.opb>
0.00/0.00 c original problem has 144 variables (144 bin, 0 int, 0 cont) and 70 constraints
0.00/0.00 c problem read in 0.000 seconds
0.00/0.00 c presolving:
0.00/0.00 c (round 1, fast) 12 del vars, 9 del conss, 0 add conss, 9 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 9 clqs
0.00/0.00 c (0.0s) running MILP presolver
0.00/0.00 c (0.0s) MILP presolver (2 rounds): 1 aggregations, 0 fixings, 0 bound changes
0.00/0.00 c (round 2, medium) 13 del vars, 9 del conss, 0 add conss, 9 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 9 clqs
0.00/0.00 c (round 3, fast) 13 del vars, 10 del conss, 0 add conss, 9 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 10 clqs
0.00/0.00 c (round 4, exhaustive) 13 del vars, 10 del conss, 0 add conss, 9 chg bounds, 0 chg sides, 0 chg coeffs, 8 upgd conss, 0 impls, 10 clqs
0.00/0.00 c (0.0s) probing: 51/131 (38.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 (5 rounds: 5 fast, 3 medium, 2 exhaustive):
0.00/0.00 c 13 deleted vars, 10 deleted constraints, 0 added constraints, 9 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.00 c 0 implications, 10 cliques
0.00/0.00 c presolved problem has 131 variables (131 bin, 0 int, 0 cont) and 60 constraints
0.00/0.00 c presolved problem has 0 implied integral variables (0 bin, 0 int, 0 cont)
0.00/0.00 c 8 constraints of type <setppc>
0.00/0.00 c 52 constraints of type <linear>
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.998009
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 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 0.0s| 1 | 0 | 174 | - | 2861k | 0 | 131 | 74 | 60 | 0 | 0 | 14 | 0 | 6.600000e+01 | -- | Inf | unknown
0.00/0.00 o 66
0.00/0.00 c o 0.0s| 1 | 0 | 187 | - |feaspump| 0 | 131 | 74 | 60 | 0 | 0 | 14 | 0 | 6.600000e+01 | 6.600000e+01 | 0.00%| unknown
0.00/0.00 c 0.0s| 1 | 0 | 187 | - | 2871k | 0 | 131 | 74 | 60 | 0 | 0 | 14 | 0 | 6.600000e+01 | 6.600000e+01 | 0.00%| unknown
0.00/0.00 c
0.00/0.00 c SCIP Status : problem is solved [optimal solution found]
0.00/0.00 c Solving Time (sec) : 0.01
0.00/0.00 c Solving Nodes : 1
0.00/0.00 c Primal Bound : +6.60000000000000e+01 (1 solutions)
0.00/0.00 c Dual Bound : +6.60000000000000e+01
0.00/0.00 c Gap : 0.00 %
0.00/0.00 s OPTIMUM FOUND
0.00/0.00 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.00 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 x58 x59
0.00/0.00 v -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 -x85 x86 -x87
0.00/0.00 v x88 -x89 x90 x91 -x92 -x93 x94 x95 -x96 x97 -x98 -x99 x100 x101 -x102 -x103 x104 -x105 -x106 x107 -x108 x109 x110 -x111 -x112 -x113
0.00/0.00 v -x114 -x115 x116 x117 -x118 x119 x120 x121 -x122 x123 x124 -x125 x126 -x127 x128 x129 x130 x131 -x132 x133 x134 -x135 -x136 -x137
0.00/0.00 v x138 -x139 -x140 x141 -x142 x143 -x144
0.00/0.00 c SCIP Status : problem is solved [optimal solution found]
0.00/0.00 c Total Time : 0.01
0.00/0.00 c solving : 0.01
0.00/0.00 c presolving : 0.00 (included in solving)
0.00/0.00 c reading : 0.00 (included in solving)
0.00/0.00 c copying : 0.00 (0 times copied the problem)
0.00/0.00 c Original Problem :
0.00/0.00 c Problem name : HOME/instance-4508561-1751508428.opb
0.00/0.00 c Variables : 144 (144 binary, 0 integer, 0 continuous)
0.00/0.00 c implied integral : 0 (0 binary, 0 integer, 0 continuous)
0.00/0.00 c Constraints : 70 initial, 70 maximal
0.00/0.00 c Objective : minimize, 144 non-zeros (abs.min = 1, abs.max = 1)
0.00/0.00 c Presolved Problem :
0.00/0.00 c Problem name : t_HOME/instance-4508561-1751508428.opb
0.00/0.00 c Variables : 131 (131 binary, 0 integer, 0 continuous)
0.00/0.00 c implied integral : 0 (0 binary, 0 integer, 0 continuous)
0.00/0.00 c Constraints : 60 initial, 74 maximal
0.00/0.00 c Objective : minimize, 0 non-zeros (abs.min = 1e+20, abs.max = -1e+20)
0.00/0.00 c Nonzeros : 536 constraint, 48 clique table
0.00/0.00 c Presolvers : ExecTime SetupTime Calls FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.00 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c domcol : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.00 c dualagg : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c dualcomp : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c dualinfer : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c dualsparsify : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.00 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c implics : 0.00 0.00 3 0 0 0 0 0 0 0 0 0
0.00/0.00 c implint : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c milp : 0.00 0.00 1 0 1 0 0 0 0 0 0 0
0.00/0.00 c qpkktref : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c redvub : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c sparsify : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.00 c stuffing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c trivial : 0.00 0.00 5 0 0 0 0 0 0 0 0 0
0.00/0.00 c tworowbnd : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c dualfix : 0.00 0.00 5 0 0 0 0 0 0 0 0 0
0.00/0.00 c genvbounds : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c probing : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.00 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c symmetry : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.00 c vbounds : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
0.00/0.00 c setppc : 0.00 0.00 3 0 0 0 0 0 0 0 0 0
0.00/0.00 c linear : 0.00 0.00 7 9 3 0 9 0 10 0 0 0
0.00/0.00 c logicor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c components : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.00 c root node : - - - 0 - - 0 - - - - -
0.00/0.00 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoRelax #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Applied Conss Children
0.00/0.00 c integral : 0 0 0 0 0 0 0 10 0 0 0 0 0 0 0
0.00/0.00 c setppc : 8 8 0 197 0 0 0 4 19 2 0 0 0 0 0
0.00/0.00 c linear : 52 52 0 196 0 0 0 4 58 8 0 0 0 0 0
0.00/0.00 c logicor : 0+ 14 0 9 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c fixedvar : 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0
0.00/0.00 c countsols : 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0
0.00/0.00 c components : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS EnfoRelax Check ResProp SB-Prop
0.00/0.00 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.00 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.00 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.00 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.00 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.00 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.00 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.00 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.00/0.00 c dualfix : 1 0 0 0
0.00/0.00 c genvbounds : 0 0 0 0
0.00/0.00 c nlobbt : 0 0 0 0
0.00/0.00 c obbt : 0 0 0 0
0.00/0.00 c probing : 0 0 0 0
0.00/0.00 c pseudoobj : 0 0 0 0
0.00/0.00 c redcost : 0 0 0 0
0.00/0.00 c rootredcost : 0 0 0 0
0.00/0.00 c symmetry : 0 0 0 0
0.00/0.00 c vbounds : 28 0 0 0
0.00/0.00 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp SB-Prop
0.00/0.00 c dualfix : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c genvbounds : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c nlobbt : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c obbt : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c probing : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c pseudoobj : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c redcost : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c rootredcost : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c symmetry : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c vbounds : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c Conflict Analysis : Time Calls Success DomReds Conflicts Literals Reconvs ReconvLits Dualrays Nonzeros LP Iters (pool size: [10000,10000])
0.00/0.00 c propagation : 0.00 4 4 - 17 12.2 0 0.0 - - -
0.00/0.00 c infeasible LP : 0.00 0 0 - 0 0.0 0 0.0 0 0.0 0
0.00/0.00 c bound exceed. LP : 0.00 0 0 - 0 0.0 0 0.0 0 0.0 0
0.00/0.00 c strong branching : 0.00 0 0 - 0 0.0 0 0.0 - - 0
0.00/0.00 c pseudo solution : 0.00 0 0 - 0 0.0 0 0.0 - - -
0.00/0.00 c applied globally : 0.00 - - 0 14 11.2 - - 0 - -
0.00/0.00 c applied locally : - - - 0 0 0.0 - - 0 - -
0.00/0.00 c Separators : ExecTime SetupTime Calls RootCalls Cutoffs DomReds FoundCuts ViaPoolAdd DirectAdd Applied ViaPoolApp DirectApp Conss
0.00/0.00 c cut pool : 0.00 - 0 0 - - 0 0 - - - - - (maximal pool size: 0)
0.00/0.00 c aggregation : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c > cmir : - - - - - - - 0 0 0 0 0 -
0.00/0.00 c > flowcover : - - - - - - - 0 0 0 0 0 -
0.00/0.00 c > knapsackcover : - - - - - - - 0 0 0 0 0 -
0.00/0.00 c cgmip : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c clique : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c closecuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c convexproj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c disjunctive : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c eccuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c gauge : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c gomory : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c > gomorymi : - - - - - - - 0 0 0 0 0 -
0.00/0.00 c > strongcg : - - - - - - - 0 0 0 0 0 -
0.00/0.00 c impliedbounds : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c interminor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c intobj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c lagromory : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c mcf : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c minor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c mixing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c multilinear : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c oddcycle : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c rapidlearning : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c rlt : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c zerohalf : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c Cutselectors : ExecTime SetupTime Calls RootCalls Selected Forced Filtered RootSelec RootForc RootFilt
0.00/0.00 c hybrid : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c ensemble : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c dynamic : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c Pricers : ExecTime SetupTime Calls Vars
0.00/0.00 c problem variables: 0.00 - 0 0
0.00/0.00 c Branching Rules : ExecTime SetupTime BranchLP BranchExt BranchPS Cutoffs DomReds Cuts Conss Children
0.00/0.00 c allfullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c cloud : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c distribution : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c fullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c gomory : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c inference : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c leastinf : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c lookahead : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c mostinf : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c multaggr : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c nodereopt : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c pscost : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c random : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c relpscost : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c vanillafullstrong: 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c Primal Heuristics : ExecTime SetupTime Calls Found Best
0.00/0.00 c LP solutions : 0.00 - - 0 0
0.00/0.00 c relax solutions : 0.00 - - 0 0
0.00/0.00 c pseudo solutions : 0.00 - - 0 0
0.00/0.00 c strong branching : 0.00 - - 0 0
0.00/0.00 c actconsdiving : 0.00 0.00 0 0 0
0.00/0.00 c adaptivediving : 0.00 0.00 0 0 0
0.00/0.00 c alns : 0.00 0.00 0 0 0
0.00/0.00 c bound : 0.00 0.00 0 0 0
0.00/0.00 c clique : 0.00 0.00 1 0 0
0.00/0.00 c coefdiving : 0.00 0.00 0 0 0
0.00/0.00 c completesol : 0.00 0.00 0 0 0
0.00/0.00 c conflictdiving : 0.00 0.00 0 0 0
0.00/0.00 c crossover : 0.00 0.00 0 0 0
0.00/0.00 c dins : 0.00 0.00 0 0 0
0.00/0.00 c distributiondivin: 0.00 0.00 0 0 0
0.00/0.00 c dks : 0.00 0.00 0 0 0
0.00/0.00 c dps : 0.00 0.00 0 0 0
0.00/0.00 c dualval : 0.00 0.00 0 0 0
0.00/0.00 c farkasdiving : 0.00 0.00 0 0 0
0.00/0.00 c feaspump : 0.00 0.00 1 1 1
0.00/0.00 c fixandinfer : 0.00 0.00 0 0 0
0.00/0.00 c fracdiving : 0.00 0.00 0 0 0
0.00/0.00 c gins : 0.00 0.00 0 0 0
0.00/0.00 c guideddiving : 0.00 0.00 0 0 0
0.00/0.00 c indicator : 0.00 0.00 0 0 0
0.00/0.00 c indicatordiving : 0.00 0.00 0 0 0
0.00/0.00 c intdiving : 0.00 0.00 0 0 0
0.00/0.00 c intshifting : 0.00 0.00 0 0 0
0.00/0.00 c linesearchdiving : 0.00 0.00 0 0 0
0.00/0.00 c localbranching : 0.00 0.00 0 0 0
0.00/0.00 c locks : 0.00 0.00 1 0 0
0.00/0.00 c lpface : 0.00 0.00 0 0 0
0.00/0.00 c mpec : 0.00 0.00 0 0 0
0.00/0.00 c multistart : 0.00 0.00 0 0 0
0.00/0.00 c mutation : 0.00 0.00 0 0 0
0.00/0.00 c nlpdiving : 0.00 0.00 0 0 0
0.00/0.00 c objpscostdiving : 0.00 0.00 0 0 0
0.00/0.00 c octane : 0.00 0.00 0 0 0
0.00/0.00 c ofins : 0.00 0.00 0 0 0
0.00/0.00 c oneopt : 0.00 0.00 0 0 0
0.00/0.00 c padm : 0.00 0.00 0 0 0
0.00/0.00 c proximity : 0.00 0.00 0 0 0
0.00/0.00 c pscostdiving : 0.00 0.00 0 0 0
0.00/0.00 c randrounding : 0.00 0.00 1 0 0
0.00/0.00 c rens : 0.00 0.00 0 0 0
0.00/0.00 c reoptsols : 0.00 0.00 0 0 0
0.00/0.00 c repair : 0.00 0.00 0 0 0
0.00/0.00 c rins : 0.00 0.00 0 0 0
0.00/0.00 c rootsoldiving : 0.00 0.00 0 0 0
0.00/0.00 c rounding : 0.00 0.00 1 0 0
0.00/0.00 c scheduler : 0.00 0.00 0 0 0
0.00/0.00 c shiftandpropagate: 0.00 0.00 1 0 0
0.00/0.00 c shifting : 0.00 0.00 1 0 0
0.00/0.00 c simplerounding : 0.00 0.00 0 0 0
0.00/0.00 c subnlp : 0.00 0.00 0 0 0
0.00/0.00 c trivial : 0.00 0.00 2 0 0
0.00/0.00 c trivialnegation : 0.00 0.00 0 0 0
0.00/0.00 c trustregion : 0.00 0.00 0 0 0
0.00/0.00 c trysol : 0.00 0.00 0 0 0
0.00/0.00 c twoopt : 0.00 0.00 0 0 0
0.00/0.00 c undercover : 0.00 0.00 0 0 0
0.00/0.00 c vbounds : 0.00 0.00 0 0 0
0.00/0.00 c veclendiving : 0.00 0.00 0 0 0
0.00/0.00 c zeroobj : 0.00 0.00 0 0 0
0.00/0.00 c zirounding : 0.00 0.00 0 0 0
0.00/0.00 c other solutions : - - - 0 -
0.00/0.00 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.14286 -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.14286 -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.14286 -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.14286 -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.14286 -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.14286 -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.14286 -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.00000 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 0
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 174 174.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 13 13.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 0 0 0.00 -
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 : +6.60000000000000e+01
0.00/0.01 c First LP Iters : 174 (117488.18 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 : 187
0.00/0.01 c Root LP Estimate : -
0.00/0.01 c Solution :
0.00/0.01 c Solutions found : 1 (1 improvements)
0.00/0.01 c First Solution : +6.60000000000000e+01 (in run 1, after 1 nodes, 0.01 seconds, depth 0, found by <feaspump>)
0.00/0.01 c Gap First Sol. : 0.00 %
0.00/0.01 c Gap Last Sol. : 0.00 %
0.00/0.01 c Primal Bound : +6.60000000000000e+01 (in run 1, after 1 nodes, 0.01 seconds, depth 0, found by <feaspump>)
0.00/0.01 c Dual Bound : +6.60000000000000e+01
0.00/0.01 c Gap : 0.00 %
0.00/0.01 c Integrals : Total Avg%
0.00/0.01 c primal-dual : 0.66 99.47
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.009