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-4498101-1751268243.opb>
0.00/0.00 c original problem has 88 variables (24 bin, 0 int, 64 cont) and 68 constraints
0.00/0.00 c original problem has 64 implied integral variables (0 bin, 0 int, 64 cont)
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) 4 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 12 chg coeffs, 0 upgd conss, 0 impls, 112 clqs
0.00/0.00 c (round 2, fast) 22 del vars, 15 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 27 chg coeffs, 0 upgd conss, 0 impls, 95 clqs
0.00/0.00 c (round 3, fast) 23 del vars, 16 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 28 chg coeffs, 0 upgd conss, 0 impls, 94 clqs
0.00/0.00 c (round 4, exhaustive) 24 del vars, 17 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 28 chg coeffs, 0 upgd conss, 0 impls, 92 clqs
0.00/0.00 c (round 5, exhaustive) 24 del vars, 17 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 28 chg coeffs, 2 upgd conss, 0 impls, 92 clqs
0.00/0.00 c (0.0s) probing: 51/66 (77.3%) - 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 (6 rounds: 6 fast, 3 medium, 3 exhaustive):
0.00/0.00 c 24 deleted vars, 17 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 28 changed coefficients
0.00/0.00 c 0 implications, 92 cliques
0.00/0.00 c presolved problem has 66 variables (20 bin, 0 int, 46 cont) and 50 constraints
0.00/0.00 c presolved problem has 46 implied integral variables (0 bin, 0 int, 46 cont)
0.00/0.00 c 46 constraints of type <and>
0.00/0.00 c 1 constraints of type <linear>
0.00/0.00 c 2 constraints of type <logicor>
0.00/0.00 c 1 constraints of type <pseudoboolean>
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.99801
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 | 6 | - | 2162k | 0 | 66 | 51 | 95 | 0 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf | unknown
0.00/0.01 o 3
0.00/0.01 c * 0.0s| 1 | 0 | 9 | - | LP | 0 | 66 | 51 | 95 | 0 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%| unknown
0.00/0.01 c 0.0s| 1 | 0 | 9 | - | 2214k | 0 | 66 | 56 | 95 | 0 | 1 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%| unknown
0.00/0.01 c 0.0s| 1 | 0 | 9 | - | 2214k | 0 | 66 | 56 | 95 | 0 | 1 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 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 : +3.00000000000000e+00 (1 solutions)
0.00/0.01 c Dual Bound : +3.00000000000000e+00
0.00/0.01 c Gap : 0.00 %
0.00/0.01 s OPTIMUM FOUND
0.00/0.01 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
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 (1 #copies) (minimal 0.00, maximal 0.00, average 0.00)
0.00/0.01 c Original Problem :
0.00/0.01 c Problem name : HOME/instance-4498101-1751268243.opb
0.00/0.01 c Variables : 88 (24 binary, 0 integer, 64 continuous)
0.00/0.01 c implied integral : 64 (0 binary, 0 integer, 64 continuous)
0.00/0.01 c Constraints : 68 initial, 68 maximal
0.00/0.01 c Objective : minimize, 8 non-zeros (abs.min = 1, abs.max = 128)
0.00/0.01 c Presolved Problem :
0.00/0.01 c Problem name : t_HOME/instance-4498101-1751268243.opb
0.00/0.01 c Variables : 66 (20 binary, 0 integer, 46 continuous)
0.00/0.01 c implied integral : 46 (0 binary, 0 integer, 46 continuous)
0.00/0.01 c Constraints : 50 initial, 56 maximal
0.00/0.01 c Objective : minimize, 7 non-zeros (abs.min = 1, abs.max = 64)
0.00/0.01 c Nonzeros : 376 constraint, 184 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 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c implics : 0.00 0.00 3 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 0 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 6 2 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 6 0 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 0 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 and : 0.00 0.00 9 0 17 0 0 0 17 0 0 16
0.00/0.01 c linear : 0.00 0.00 8 1 2 0 0 0 0 0 0 12
0.00/0.01 c logicor : 0.00 0.00 3 0 0 0 0 0 0 0 0 0
0.00/0.01 c pseudoboolean : 0.00 0.00 3 0 0 0 0 0 0 0 0 0
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 : - - - 51 - - 51 - - - - -
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 12 0 0 0 0 0 0 0
0.00/0.01 c and : 46 46 1 336 0 0 0 0 0 0 0 1 0 0 0
0.00/0.01 c linear : 1+ 6 1 336 0 0 0 9 0 19 0 0 0 0 0
0.00/0.01 c logicor : 2+ 3 1 58 0 0 0 2 0 0 0 0 0 0 0
0.00/0.01 c pseudoboolean : 1 1 0 0 0 0 0 2 0 0 0 0 0 0 0
0.00/0.01 c fixedvar : 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0
0.00/0.01 c countsols : 0 0 0 0 0 0 0 3 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 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 linear : 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 pseudoboolean : 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 : 1 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 : 1 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 : 105 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 0 0 - 0 0.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 0 0 - 0 0.0 0 0.0 0 0.0 0
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 0 0.0 - - 0 - -
0.00/0.01 c applied locally : - - - 0 0 0.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 1 1 0 0 0 0 0 0 0 0 0
0.00/0.01 c multilinear : 0.00 0.00 1 1 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.01 0.00 1 1 0 51 0 0 0 0 0 0 5
0.00/0.01 c rlt : 0.00 0.00 1 1 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 0 0
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 1 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 0 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 1 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 1 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 1 0 0
0.00/0.01 c shifting : 0.00 0.00 1 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 0 0
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 1 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 2 6 6.00 - 0.00 1
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 2 3 1.50 -
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 : 0
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 : +3.00000000000000e+00
0.00/0.01 c First LP Iters : 6 (40268.46 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 : 1 (1 improvements)
0.00/0.01 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.01 seconds, depth 0, found by <relaxation>)
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 : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.01 seconds, depth 0, found by <relaxation>)
0.00/0.01 c Dual Bound : +3.00000000000000e+00
0.00/0.01 c Gap : 0.00 %
0.00/0.01 c Integrals : Total Avg%
0.00/0.01 c primal-dual : 1.17 95.79
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.015