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-4543449-1753214294.opb>
0.00/0.00 c original problem has 70 variables (70 bin, 0 int, 0 cont) and 141 constraints
0.00/0.00 c problem read in 0.000 seconds
0.00/0.00 c problem without objective
0.00/0.00 c presolving:
0.00/0.00 c (0.0s) running MILP presolver
0.00/0.00 c (0.0s) MILP presolver (2 rounds): 0 aggregations, 0 fixings, 0 bound changes
0.00/0.00 c (round 1, medium) 0 del vars, 141 del conss, 71 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 70 clqs
0.00/0.00 c (round 2, exhaustive) 0 del vars, 141 del conss, 71 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 71 upgd conss, 0 impls, 70 clqs
0.00/0.00 c (0.0s) sparsify finished: 60/350 (17.1%) nonzeros canceled - in total 60 canceled nonzeros, 60 changed coefficients, 0 added nonzeros
0.00/0.00 c (round 3, exhaustive) 0 del vars, 141 del conss, 71 add conss, 0 chg bounds, 0 chg sides, 60 chg coeffs, 71 upgd conss, 0 impls, 70 clqs
0.00/0.00 c (round 4, exhaustive) 0 del vars, 141 del conss, 71 add conss, 0 chg bounds, 0 chg sides, 60 chg coeffs, 72 upgd conss, 0 impls, 70 clqs
0.00/0.00 c (0.0s) probing: 51/70 (72.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) symmetry computation finished: 1 generators found (max: 1500, log10 of symmetry group size: 0.70) (symcode time: 0.00)
0.00/0.00 c dynamic symmetry handling statistics:
0.00/0.00 c orbitopal reduction: no components
0.00/0.00 c orbital reduction: 1 components of sizes 1
0.00/0.00 c lexicographic reduction: 1 permutations with support sizes 70
0.00/0.00 c handled 1 out of 1 symmetry components
0.00/0.00 c presolving (5 rounds: 5 fast, 5 medium, 4 exhaustive):
0.00/0.00 c 0 deleted vars, 141 deleted constraints, 71 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 60 changed coefficients
0.00/0.00 c 0 implications, 70 cliques
0.00/0.00 c presolved problem has 70 variables (70 bin, 0 int, 0 cont) and 71 constraints
0.00/0.00 c presolved problem has 0 implied integral variables (0 bin, 0 int, 0 cont)
0.00/0.00 c 1 constraints of type <knapsack>
0.00/0.00 c 70 constraints of type <setppc>
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.998008
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 | 77 | - | 3182k | 0 | 70 | 120 | 71 | 0 | 0 | 48 | 0 | cutoff | -- | 0.00%| unknown
0.00/0.00 c 0.0s| 1 | 0 | 77 | - | 3182k | 0 | 70 | 120 | 71 | 0 | 0 | 48 | 0 | cutoff | -- | 0.00%| unknown
0.00/0.00 c
0.00/0.00 c SCIP Status : problem is solved [infeasible]
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 : +1.00000000000000e+20 (0 solutions)
0.00/0.00 c Dual Bound : +1.00000000000000e+20
0.00/0.00 c Gap : 0.00 %
0.00/0.00 s UNSATISFIABLE
0.00/0.00 c SCIP Status : problem is solved [infeasible]
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-4543449-1753214294.opb
0.00/0.00 c Variables : 70 (70 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 : 141 initial, 141 maximal
0.00/0.00 c Objective : minimize, 0 non-zeros (abs.min = 1e+20, abs.max = -1e+20)
0.00/0.00 c Presolved Problem :
0.00/0.00 c Problem name : t_HOME/instance-4543449-1753214294.opb
0.00/0.00 c Variables : 70 (70 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 : 71 initial, 120 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 : 290 constraint, 290 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 2 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 5 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 0 0 0 0 141 71 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 2 0 0 0 0 0 0 0 0 60
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 1 0 0 0 0 0 0 0 0 0
0.00/0.00 c knapsack : 0.00 0.00 6 0 0 0 0 0 0 0 0 0
0.00/0.00 c setppc : 0.00 0.00 9 0 0 0 0 0 0 0 0 0
0.00/0.00 c linear : 0.00 0.00 5 0 0 0 0 0 0 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 5 0 0 0 0 0 0 0
0.00/0.00 c knapsack : 1 1 0 213 0 0 0 3 3 0 0 0 0 0 0
0.00/0.00 c setppc : 70+ 75 0 242 0 0 0 2 247 30 0 0 0 0 0
0.00/0.00 c logicor : 0+ 44 0 60 0 0 0 0 21 1 0 0 0 0 0
0.00/0.00 c fixedvar : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c countsols : 0 0 0 0 0 0 0 0 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 knapsack : 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 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 : 84 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 Symmetry :
0.00/0.00 c #affected vars : 70 (70 bin, 0 int, 0 cont)
0.00/0.00 c orbitopal red. : 0 reductions applied, 0 cutoffs
0.00/0.00 c orbital reduction: 0 reductions applied, 0 cutoffs
0.00/0.00 c lexicographic red: 0 reductions applied, 0 cutoffs
0.00/0.00 c shadow tree time : 0.00 s
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 28 28 - 51 4.9 2 7.5 - - -
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 48 4.1 - - 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 0 0 0
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 0 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 0 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 0 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 1 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.00 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.00 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.00 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.00 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.00 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.00 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.00 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.00 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.00 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.00 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It ItLimit
0.00/0.00 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.00 c dual LP : 0.00 1 77 77.00 - 0.00 0
0.00/0.00 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.00 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.00 c resolve instable : 0.00 0 0 0.00 -
0.00/0.00 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.00 c strong branching : 0.00 0 0 0.00 - - - 0
0.00/0.00 c (at root node) : - 0 0 0.00 -
0.00/0.00 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.00 c Relaxators : Time Calls Cutoffs ImprBounds ImprTime ReducedDom Separated AddedConss
0.00/0.00 c benders : 0.00 0 0 0 0.00 0 0 0
0.00/0.00 c B&B Tree :
0.00/0.00 c number of runs : 1
0.00/0.00 c nodes : 1 (0 internal, 1 leaves)
0.00/0.00 c feasible leaves : 0
0.00/0.00 c infeas. leaves : 1
0.00/0.00 c objective leaves : 0
0.00/0.00 c nodes (total) : 1 (0 internal, 1 leaves)
0.00/0.00 c nodes left : 0
0.00/0.00 c max depth : 0
0.00/0.00 c max depth (total): 0
0.00/0.00 c backtracks : 0 (0.0%)
0.00/0.00 c early backtracks : 0 (0.0%)
0.00/0.00 c nodes exc. ref. : 0 (0.0%)
0.00/0.00 c delayed cutoffs : 0
0.00/0.00 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.00 c avg switch length: 2.00
0.00/0.00 c switching time : 0.00
0.00/0.00 c Root Node :
0.00/0.00 c First LP value : -
0.00/0.00 c First LP Iters : 0
0.00/0.00 c First LP Time : 0.00
0.00/0.00 c Final Dual Bound : -
0.00/0.00 c Final Root Iters : 77
0.00/0.00 c Root LP Estimate : -
0.00/0.00 c Solution :
0.00/0.00 c Solutions found : 0 (0 improvements)
0.00/0.00 c Primal Bound : infeasible
0.00/0.00 c Dual Bound : -
0.00/0.00 c Gap : 0.00 %
0.00/0.00 c Integrals : Total Avg%
0.00/0.00 c primal-dual : - - (problem infeasible)
0.00/0.00 c primal-ref : - - (problem infeasible)
0.00/0.00 c dual-ref : - - (problem infeasible)
0.00/0.00 c Time complete (sec): 0.009