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-4518927-1751547549.opb>
0.00/0.01 c original problem has 112 variables (112 bin, 0 int, 0 cont) and 160 constraints
0.00/0.01 c problem read in 0.001 seconds
0.00/0.01 o 0
0.00/0.01 c feasible solution found by trivial heuristic after 0.0 seconds, objective value 0.000000e+00
0.00/0.01 c presolving:
0.00/0.01 c (round 1, fast) 40 del vars, 40 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 40 clqs
0.00/0.01 c (0.0s) running MILP presolver
0.00/0.01 c (0.0s) MILP presolver (2 rounds): 0 aggregations, 0 fixings, 0 bound changes
0.00/0.01 c (round 2, medium) 40 del vars, 160 del conss, 72 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 40 clqs
0.00/0.01 c (round 3, exhaustive) 40 del vars, 160 del conss, 72 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 50 upgd conss, 0 impls, 40 clqs
0.00/0.01 c (round 4, exhaustive) 40 del vars, 208 del conss, 88 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 50 upgd conss, 0 impls, 40 clqs
0.00/0.01 c (0.0s) probing cycle finished: starting next cycle
0.00/0.01 c (round 5, exhaustive) 41 del vars, 208 del conss, 88 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 50 upgd conss, 0 impls, 105 clqs
0.00/0.02 c (0.0s) probing cycle finished: starting next cycle
0.00/0.02 c (0.0s) symmetry computation started: requiring (bin +, int +, cont +), (fixed: bin -, int -, cont -)
0.00/0.02 c (0.0s) no symmetry present (symcode time: 0.00)
0.00/0.02 c presolving (6 rounds: 6 fast, 5 medium, 4 exhaustive):
0.00/0.02 c 41 deleted vars, 208 deleted constraints, 88 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 0 implications, 113 cliques
0.00/0.02 c presolved problem has 71 variables (71 bin, 0 int, 0 cont) and 40 constraints
0.00/0.02 c presolved problem has 0 implied integral variables (0 bin, 0 int, 0 cont)
0.00/0.02 c 16 constraints of type <and>
0.00/0.02 c 2 constraints of type <xor>
0.00/0.02 c 22 constraints of type <linear>
0.00/0.02 c transformed objective value is always integral (scale: 2)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c
0.00/0.02 c # SCIP version 10.0.0
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, advanced: FALSE, range: [0,1e+20], default: 1e+20]
0.00/0.02 c limits/time = 3596.994759
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, advanced: FALSE, range: [0,8796093022207], default: 8796093022207]
0.00/0.02 c limits/memory = 27900
0.00/0.02 c
0.00/0.02 c # belongs reading time to solving time?
0.00/0.02 c # [type: bool, advanced: FALSE, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c timing/reading = TRUE
0.00/0.02 c
0.00/0.02 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.02 c # [type: int, advanced: TRUE, range: [-1,2147483647], default: -1]
0.00/0.02 c reading/opbreader/maxintsize = 47
0.00/0.02 c
0.00/0.02 c # timing when propagator should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP, 15:ALWAYS))
0.00/0.02 c # [type: int, advanced: TRUE, range: [0,15], default: 15]
0.00/0.02 c propagating/genvbounds/timingmask = 0
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c transformed 1/1 original solutions to the transformed problem space
0.00/0.02 c
0.00/0.02 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.02 c 0.0s| 1 | 0 | 57 | - | 2367k | 0 | 71 | 60 | 56 | 0 | 0 | 19 | 0 | 0.000000e+00 | 0.000000e+00 | 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 : +0.00000000000000e+00 (1 solutions)
0.00/0.02 c Dual Bound : +0.00000000000000e+00
0.00/0.02 c Gap : 0.00 %
0.00/0.02 s OPTIMUM FOUND
0.00/0.02 v -x105 -x97 -x106 -x98 -x107 -x99 -x108 -x100 -x109 -x101 -x110 -x102 -x111 -x103 -x112 -x104 -x9 -x1 -x5 -x65 -x25 -x81 -x13 -x2
0.00/0.02 v -x10 -x6 -x69 -x41 -x66 -x29 -x26 -x85 -x53 -x82 -x17 -x3 -x14 -x11 -x7 -x73 -x44 -x70 -x42 -x67 -x33 -x30 -x27 -x89 -x56 -x86 -x54
0.00/0.02 v -x83 -x21 -x4 -x18 -x15 -x12 -x8 -x77 -x47 -x74 -x45 -x71 -x43 -x68 -x37 -x34 -x31 -x28 -x93 -x59 -x90 -x57 -x87 -x55 -x84 -x22
0.00/0.02 v -x19 -x16 -x50 -x78 -x48 -x75 -x46 -x72 -x38 -x35 -x32 -x62 -x94 -x60 -x91 -x58 -x88 -x23 -x20 -x51 -x79 -x49 -x76 -x39 -x36 -x63
0.00/0.02 v -x95 -x61 -x92 -x24 -x52 -x80 -x40 -x64 -x96
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.01 (included in solving)
0.00/0.02 c reading : 0.00 (included in solving)
0.00/0.02 c copying : 0.00 (0 times copied the problem)
0.00/0.02 c Original Problem :
0.00/0.02 c Problem name : HOME/instance-4518927-1751547549.opb
0.00/0.02 c Variables : 112 (112 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 : 160 initial, 160 maximal
0.00/0.02 c Objective : minimize, 16 non-zeros (abs.min = 1, abs.max = 128)
0.00/0.02 c Presolved Problem :
0.00/0.02 c Problem name : t_HOME/instance-4518927-1751547549.opb
0.00/0.02 c Variables : 71 (71 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 : 40 initial, 60 maximal
0.00/0.02 c Objective : minimize, 14 non-zeros (abs.min = 1, abs.max = 64)
0.00/0.02 c Nonzeros : 160 constraint, 226 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 2 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 48 16 0 0
0.00/0.02 c implics : 0.00 0.00 5 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 0 0 0 0 120 72 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 6 0 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 6 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.01 0.00 2 0 1 0 0 0 0 0 0 0
0.00/0.02 c pseudoobj : 0.00 0.00 2 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 2 0 0 0 0 0 0 0 0 0
0.00/0.02 c and : 0.00 0.00 4 0 0 0 0 0 0 0 0 0
0.00/0.02 c xor : 0.00 0.00 8 0 0 0 0 0 0 0 0 0
0.00/0.02 c linear : 0.00 0.00 9 0 40 0 0 0 40 0 0 0
0.00/0.02 c logicor : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
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 : - - - 0 - - 0 - - - - -
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 9 0 0 0 0 0 0 0
0.00/0.02 c and : 16 16 0 446 0 0 0 4 86 0 0 0 0 0 0
0.00/0.02 c xor : 2 2 0 445 0 0 0 3 10 1 0 0 0 0 0
0.00/0.02 c linear : 22 22 0 455 0 0 0 6 149 5 0 0 0 0 0
0.00/0.02 c logicor : 0+ 20 0 28 0 0 0 0 5 1 0 0 0 0 0
0.00/0.02 c fixedvar : 0 0 0 0 0 0 0 5 0 0 0 0 0 0 0
0.00/0.02 c countsols : 0 0 0 0 0 0 0 5 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 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 xor : 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 : 1 0 0 0
0.00/0.02 c redcost : 0 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 : 96 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.01 0.00 0.01 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 5 5 - 14 7.5 4 8.5 - - -
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 4 4 - 21 13.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 19 5.6 - - 0 - -
0.00/0.02 c applied locally : - - - 0 0 0.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 - 0 0 - - 0 0 - - - - - (maximal pool size: 0)
0.00/0.02 c aggregation : 0.00 0.00 0 0 0 0 0 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 0 0 0 0 0 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 0 0 0 0 0 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 0 0 0 0 0 0 0 0 0 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 0 0 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 0 0 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.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c rlt : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c zerohalf : 0.00 0.00 0 0 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 0 0 0 0 0 0 0 0
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 0 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 1 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 0 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 0 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 0 0 0
0.00/0.02 c shifting : 0.00 0.00 0 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 1 1
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 1 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 0 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 1 57 57.00 - 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 0 0 0.00 -
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 : 1
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 : -
0.00/0.02 c First LP Iters : 57 (76000.00 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 : 57
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 : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.02 c Gap First Sol. : infinite
0.00/0.02 c Gap Last Sol. : infinite
0.00/0.02 c Primal Bound : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.02 c Dual Bound : +0.00000000000000e+00
0.00/0.02 c Gap : 0.00 %
0.00/0.02 c Integrals : Total Avg%
0.00/0.02 c primal-dual : 1.92 99.44
0.00/0.02 c primal-ref : - - (not evaluated)
0.00/0.02 c dual-ref : - - (not evaluated)
0.00/0.03 c Time complete (sec): 0.027