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-4498400-1751269785.opb>
0.00/0.00 c original problem has 68 variables (20 bin, 0 int, 48 cont) and 99 constraints
0.00/0.00 c original problem has 48 implied integral variables (0 bin, 0 int, 48 cont)
0.00/0.00 c problem read in 0.000 seconds
0.00/0.00 o 0
0.00/0.00 c feasible solution found by trivial heuristic after 0.0 seconds, objective value 0.000000e+00
0.00/0.00 c presolving:
0.00/0.00 c (round 1, medium) 0 del vars, 88 del conss, 20 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 10 clqs
0.00/0.00 c (round 2, fast) 48 del vars, 88 del conss, 20 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 10 clqs
0.00/0.00 c (round 3, exhaustive) 48 del vars, 88 del conss, 20 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 30 upgd conss, 0 impls, 10 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 (4 rounds: 4 fast, 3 medium, 2 exhaustive):
0.00/0.00 c 48 deleted vars, 88 deleted constraints, 20 added constraints, 0 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 20 variables (20 bin, 0 int, 0 cont) and 31 constraints
0.00/0.00 c presolved problem has 0 implied integral variables (0 bin, 0 int, 0 cont)
0.00/0.00 c 20 constraints of type <knapsack>
0.00/0.00 c 10 constraints of type <setppc>
0.00/0.00 c 1 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.998276
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 transformed 1/1 original solutions to the transformed problem space
0.00/0.00 c
0.00/0.00 o -3
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 p 0.0s| 1 | 0 | 0 | - | clique| 0 | 20 | 31 | 31 | 0 | 0 | 0 | 0 |-1.000000e+01 |-3.000000e+00 | 233.33%| unknown
0.00/0.00 c 0.0s| 1 | 0 | 27 | - | 1542k | 0 | 20 | 31 | 31 | 0 | 0 | 1 | 0 |-5.000000e+00 |-3.000000e+00 | 66.67%| unknown
0.00/0.00 c 0.0s| 1 | 0 | 36 | - | 1776k | 0 | 20 | 31 | 32 | 1 | 1 | 1 | 0 |-5.000000e+00 |-3.000000e+00 | 66.67%| unknown
0.00/0.00 c 0.0s| 1 | 0 | 44 | - | 1903k | 0 | 20 | 31 | 33 | 2 | 2 | 1 | 0 |-4.963222e+00 |-3.000000e+00 | 65.44%| unknown
0.00/0.00 c 0.0s| 1 | 0 | 53 | - | 2089k | 0 | 20 | 31 | 34 | 3 | 3 | 1 | 0 |-4.000000e+00 |-3.000000e+00 | 33.33%| unknown
0.00/0.02 c 0.0s| 1 | 0 | 56 | - | 2278k | 0 | 20 | 31 | 35 | 4 | 4 | 1 | 0 |-4.000000e+00 |-3.000000e+00 | 33.33%| unknown
0.00/0.02 c 0.0s| 1 | 0 | 58 | - | 2498k | 0 | 20 | 31 | 37 | 6 | 5 | 1 | 0 |-4.000000e+00 |-3.000000e+00 | 33.33%| unknown
0.00/0.02 c 0.0s| 1 | 0 | 60 | - | 2635k | 0 | 20 | 31 | 39 | 8 | 6 | 1 | 0 |-4.000000e+00 |-3.000000e+00 | 33.33%| unknown
0.00/0.02 c 0.0s| 1 | 0 | 65 | - | 2920k | 0 | 20 | 31 | 40 | 9 | 7 | 1 | 0 |-4.000000e+00 |-3.000000e+00 | 33.33%| unknown
0.00/0.02 c 0.0s| 1 | 0 | 68 | - | 3397k | 0 | 20 | 31 | 41 | 10 | 8 | 1 | 0 |-4.000000e+00 |-3.000000e+00 | 33.33%| unknown
0.00/0.03 c 0.0s| 1 | 0 | 73 | - | 3544k | 0 | 20 | 31 | 43 | 12 | 9 | 1 | 0 |-4.000000e+00 |-3.000000e+00 | 33.33%| unknown
0.00/0.03 c 0.0s| 1 | 0 | 76 | - | 3696k | 0 | 20 | 31 | 45 | 14 | 10 | 1 | 0 |-4.000000e+00 |-3.000000e+00 | 33.33%| unknown
0.00/0.03 c 0.0s| 1 | 0 | 83 | - | 3701k | 0 | 20 | 31 | 46 | 15 | 11 | 1 | 0 |-4.000000e+00 |-3.000000e+00 | 33.33%| unknown
0.00/0.03 c 0.0s| 1 | 0 | 90 | - | 3706k | 0 | 20 | 31 | 48 | 17 | 12 | 1 | 0 |-4.000000e+00 |-3.000000e+00 | 33.33%| unknown
0.00/0.03 c 0.0s| 1 | 0 | 94 | - | 3711k | 0 | 20 | 31 | 50 | 19 | 13 | 1 | 0 |-4.000000e+00 |-3.000000e+00 | 33.33%| unknown
0.00/0.03 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.03 c 0.0s| 1 | 0 | 96 | - | 3716k | 0 | 20 | 31 | 51 | 20 | 14 | 1 | 0 |-4.000000e+00 |-3.000000e+00 | 33.33%| unknown
0.00/0.04 c 0.0s| 1 | 0 | 156 | - | 3964k | 0 | 20 | 37 | 51 | 20 | 14 | 14 | 12 |-4.000000e+00 |-3.000000e+00 | 33.33%| unknown
0.00/0.04 c (run 1, node 1) restarting after 6 global fixings of integer variables
0.00/0.04 c
0.00/0.04 c (restart) converted 20 cuts from the global cut pool into linear constraints
0.00/0.04 c
0.00/0.04 c presolving:
0.00/0.04 c (round 1, fast) 6 del vars, 33 del conss, 6 add conss, 0 chg bounds, 8 chg sides, 8 chg coeffs, 0 upgd conss, 0 impls, 5 clqs
0.00/0.04 c (round 2, exhaustive) 6 del vars, 33 del conss, 6 add conss, 0 chg bounds, 8 chg sides, 8 chg coeffs, 4 upgd conss, 0 impls, 5 clqs
0.00/0.04 c (round 3, exhaustive) 6 del vars, 34 del conss, 6 add conss, 0 chg bounds, 8 chg sides, 8 chg coeffs, 4 upgd conss, 0 impls, 5 clqs
0.00/0.04 c presolving (4 rounds: 4 fast, 3 medium, 3 exhaustive):
0.00/0.04 c 6 deleted vars, 34 deleted constraints, 6 added constraints, 0 tightened bounds, 0 added holes, 8 changed sides, 8 changed coefficients
0.00/0.04 c 0 implications, 5 cliques
0.00/0.04 c presolved problem has 14 variables (14 bin, 0 int, 0 cont) and 29 constraints
0.00/0.04 c presolved problem has 0 implied integral variables (0 bin, 0 int, 0 cont)
0.00/0.04 c 8 constraints of type <knapsack>
0.00/0.04 c 5 constraints of type <setppc>
0.00/0.04 c 9 constraints of type <linear>
0.00/0.04 c 7 constraints of type <logicor>
0.00/0.04 c transformed objective value is always integral (scale: 1)
0.00/0.04 c Presolving Time: 0.00
0.00/0.04 c transformed 5/11 original solutions to the transformed problem space
0.00/0.04 c
0.00/0.04 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.04 c 0.0s| 1 | 0 | 182 | - | 3973k | 0 | 14 | 29 | 28 | 0 | 0 | 14 | 12 |-4.000000e+00 |-3.000000e+00 | 33.33%| unknown
0.00/0.04 c 0.0s| 1 | 0 | 182 | - | 3974k | 0 | 14 | 29 | 28 | 0 | 0 | 14 | 12 |-4.000000e+00 |-3.000000e+00 | 33.33%| unknown
0.00/0.04 c 0.0s| 1 | 0 | 183 | - | 3977k | 0 | 14 | 29 | 28 | 1 | 1 | 14 | 12 |-3.000000e+00 |-3.000000e+00 | 0.00%| unknown
0.00/0.04 c 0.0s| 1 | 0 | 183 | - | 3977k | 0 | 14 | 29 | 28 | 1 | 1 | 14 | 12 |-3.000000e+00 |-3.000000e+00 | 0.00%| unknown
0.00/0.04 c
0.00/0.04 c SCIP Status : problem is solved [optimal solution found]
0.00/0.04 c Solving Time (sec) : 0.04
0.00/0.04 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
0.00/0.04 c Primal Bound : -3.00000000000000e+00 (12 solutions)
0.00/0.04 c Dual Bound : -3.00000000000000e+00
0.00/0.04 c Gap : 0.00 %
0.00/0.04 s OPTIMUM FOUND
0.00/0.04 v -x1 -x2 -x3 -x4 -x5 x6 x7 x8 -x9 -x10 x20 x19 -x16 -x12 x15 -x17 -x11 -x18 -x14 -x13
0.00/0.04 c SCIP Status : problem is solved [optimal solution found]
0.00/0.04 c Total Time : 0.04
0.00/0.04 c solving : 0.04
0.00/0.04 c presolving : 0.00 (included in solving)
0.00/0.04 c reading : 0.00 (included in solving)
0.00/0.04 c copying : 0.00 (2 #copies) (minimal 0.00, maximal 0.00, average 0.00)
0.00/0.04 c Original Problem :
0.00/0.04 c Problem name : HOME/instance-4498400-1751269785.opb
0.00/0.04 c Variables : 68 (20 binary, 0 integer, 48 continuous)
0.00/0.04 c implied integral : 48 (0 binary, 0 integer, 48 continuous)
0.00/0.04 c Constraints : 99 initial, 99 maximal
0.00/0.04 c Objective : minimize, 10 non-zeros (abs.min = 1, abs.max = 1)
0.00/0.04 c Presolved Problem :
0.00/0.04 c Problem name : t_HOME/instance-4498400-1751269785.opb
0.00/0.04 c Variables : 14 (14 binary, 0 integer, 0 continuous)
0.00/0.04 c implied integral : 0 (0 binary, 0 integer, 0 continuous)
0.00/0.04 c Constraints : 29 initial, 29 maximal
0.00/0.04 c Objective : minimize, 7 non-zeros (abs.min = 1, abs.max = 1)
0.00/0.04 c Nonzeros : 194 constraint, 8 clique table
0.00/0.04 c Presolvers : ExecTime SetupTime Calls FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.04 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c domcol : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
0.00/0.04 c dualagg : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c dualcomp : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c dualinfer : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c dualsparsify : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.04 c gateextraction : 0.00 0.00 3 0 0 0 0 0 0 0 0 0
0.00/0.04 c implics : 0.00 0.00 6 0 0 0 0 0 0 0 0 0
0.00/0.04 c implint : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c milp : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c qpkktref : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c redvub : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c sparsify : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.04 c stuffing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c trivial : 0.00 0.00 8 6 0 0 0 0 0 0 0 0
0.00/0.04 c tworowbnd : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c dualfix : 0.00 0.00 8 48 0 0 0 0 0 0 0 0
0.00/0.04 c genvbounds : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c probing : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.04 c pseudoobj : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
0.00/0.04 c symmetry : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.04 c vbounds : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
0.00/0.04 c knapsack : 0.00 0.00 13 0 0 0 0 0 15 6 6 6
0.00/0.04 c setppc : 0.00 0.00 15 0 0 0 0 0 6 0 0 0
0.00/0.04 c linear : 0.00 0.00 13 0 0 0 0 0 12 0 2 2
0.00/0.04 c logicor : 0.00 0.00 9 0 0 0 0 0 1 0 0 0
0.00/0.04 c pseudoboolean : 0.00 0.00 1 0 0 0 0 0 88 20 0 0
0.00/0.04 c components : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
0.00/0.04 c root node : - - - 9 - - 9 - - - - -
0.00/0.04 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoRelax #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Applied Conss Children
0.00/0.04 c integral : 0 0 0 0 1 0 0 32 0 0 0 0 0 5 0
0.00/0.04 c knapsack : 8 8 15 282 0 0 0 25 9 1 0 108 0 0 0
0.00/0.04 c setppc : 5 5 15 268 0 0 0 25 6 0 0 0 0 0 0
0.00/0.04 c linear : 9 9 15 279 0 0 0 24 2 22 0 0 0 0 0
0.00/0.04 c logicor : 7 7 1 4 0 0 0 6 0 0 0 0 0 0 0
0.00/0.04 c fixedvar : 0 0 0 0 0 0 0 20 0 0 0 0 0 0 0
0.00/0.04 c countsols : 0 0 0 0 0 0 0 20 0 0 0 0 0 0 0
0.00/0.04 c components : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS EnfoRelax Check ResProp SB-Prop
0.00/0.04 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.04 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.04 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.04 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.04 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.04 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.04 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.04 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.04 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.00/0.04 c dualfix : 3 0 0 0
0.00/0.04 c genvbounds : 0 0 0 0
0.00/0.04 c nlobbt : 0 0 0 0
0.00/0.04 c obbt : 0 0 0 0
0.00/0.04 c probing : 0 0 0 0
0.00/0.04 c pseudoobj : 23 0 0 0
0.00/0.04 c redcost : 19 0 0 2
0.00/0.04 c rootredcost : 0 0 0 0
0.00/0.04 c symmetry : 0 0 0 0
0.00/0.04 c vbounds : 116 0 0 0
0.00/0.04 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp SB-Prop
0.00/0.04 c dualfix : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c genvbounds : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c nlobbt : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c obbt : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c probing : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c pseudoobj : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c redcost : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c rootredcost : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c symmetry : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c vbounds : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c Conflict Analysis : Time Calls Success DomReds Conflicts Literals Reconvs ReconvLits Dualrays Nonzeros LP Iters (pool size: [10000,10000])
0.00/0.04 c propagation : 0.00 1 1 - 4 7.0 0 0.0 - - -
0.00/0.04 c infeasible LP : 0.00 0 0 - 0 0.0 0 0.0 0 0.0 0
0.00/0.04 c bound exceed. LP : 0.00 13 8 - 12 1.8 0 0.0 6 3.8 56
0.00/0.04 c strong branching : 0.00 0 0 - 0 0.0 0 0.0 - - 0
0.00/0.04 c pseudo solution : 0.00 0 0 - 0 0.0 0 0.0 - - -
0.00/0.04 c applied globally : 0.00 - - 1 7 1.1 - - 6 - -
0.00/0.04 c applied locally : - - - 0 1 4.0 - - 0 - -
0.00/0.04 c Separators : ExecTime SetupTime Calls RootCalls Cutoffs DomReds FoundCuts ViaPoolAdd DirectAdd Applied ViaPoolApp DirectApp Conss
0.00/0.04 c cut pool : 0.00 - 28 28 - - 507 964 - - - - - (maximal pool size: 479)
0.00/0.04 c aggregation : 0.00 0.00 15 15 0 0 86 163 0 8 8 0 0
0.00/0.04 c > cmir : - - - - - - - 113 0 2 2 0 -
0.00/0.04 c > flowcover : - - - - - - - 45 0 6 6 0 -
0.00/0.04 c > knapsackcover : - - - - - - - 5 0 0 0 0 -
0.00/0.04 c cgmip : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c clique : 0.00 0.00 15 15 0 0 0 0 0 0 0 0 0
0.00/0.04 c closecuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c convexproj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c disjunctive : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c eccuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c gauge : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c gomory : 0.00 0.00 11 11 0 0 406 777 0 11 11 0 0
0.00/0.04 c > gomorymi : - - - - - - - 596 0 10 10 0 -
0.00/0.04 c > strongcg : - - - - - - - 181 0 1 1 0 -
0.00/0.04 c impliedbounds : 0.00 0.00 15 15 0 1 0 0 0 0 0 0 0
0.00/0.04 c interminor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c intobj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c lagromory : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c mcf : 0.00 0.00 2 2 0 0 0 0 0 0 0 0 0
0.00/0.04 c minor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c mixing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c multilinear : 0.00 0.00 15 15 0 0 0 0 0 0 0 0 0
0.00/0.04 c oddcycle : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c rapidlearning : 0.02 0.00 1 1 0 0 0 0 0 0 0 0 0
0.00/0.04 c rlt : 0.00 0.00 11 11 0 0 0 0 0 0 0 0 0
0.00/0.04 c zerohalf : 0.00 0.00 15 15 0 0 15 24 0 2 2 0 0
0.00/0.04 c Cutselectors : ExecTime SetupTime Calls RootCalls Selected Forced Filtered RootSelec RootForc RootFilt
0.00/0.04 c hybrid : 0.00 0.00 15 15 21 0 1051 21 0 1051
0.00/0.04 c ensemble : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c dynamic : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c Pricers : ExecTime SetupTime Calls Vars
0.00/0.04 c problem variables: 0.00 - 0 0
0.00/0.04 c Branching Rules : ExecTime SetupTime BranchLP BranchExt BranchPS Cutoffs DomReds Cuts Conss Children
0.00/0.04 c allfullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c cloud : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c distribution : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c fullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c gomory : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c inference : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c leastinf : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c lookahead : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c mostinf : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c multaggr : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c nodereopt : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c pscost : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c random : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c relpscost : 0.00 0.00 1 0 0 0 0 0 5 0
0.00/0.04 c vanillafullstrong: 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c Primal Heuristics : ExecTime SetupTime Calls Found Best
0.00/0.04 c LP solutions : 0.00 - - 0 0
0.00/0.04 c relax solutions : 0.00 - - 0 0
0.00/0.04 c pseudo solutions : 0.00 - - 0 0
0.00/0.04 c strong branching : 0.00 - - 0 0
0.00/0.04 c actconsdiving : 0.00 0.00 0 0 0
0.00/0.04 c adaptivediving : 0.00 0.00 0 0 0
0.00/0.04 c alns : 0.00 0.00 1 0 0
0.00/0.04 c bound : 0.00 0.00 0 0 0
0.00/0.04 c clique : 0.00 0.00 1 1 1
0.00/0.04 c coefdiving : 0.00 0.00 0 0 0
0.00/0.04 c completesol : 0.00 0.00 0 0 0
0.00/0.04 c conflictdiving : 0.00 0.00 1 0 0
0.00/0.04 c crossover : 0.00 0.00 0 0 0
0.00/0.04 c dins : 0.00 0.00 0 0 0
0.00/0.04 c distributiondivin: 0.00 0.00 0 0 0
0.00/0.04 c dks : 0.00 0.00 0 0 0
0.00/0.04 c dps : 0.00 0.00 0 0 0
0.00/0.04 c dualval : 0.00 0.00 0 0 0
0.00/0.04 c farkasdiving : 0.00 0.00 0 0 0
0.00/0.04 c feaspump : 0.00 0.00 0 0 0
0.00/0.04 c fixandinfer : 0.00 0.00 0 0 0
0.00/0.04 c fracdiving : 0.00 0.00 0 0 0
0.00/0.04 c gins : 0.00 0.00 0 0 0
0.00/0.04 c guideddiving : 0.00 0.00 0 0 0
0.00/0.04 c indicator : 0.00 0.00 0 0 0
0.00/0.04 c indicatordiving : 0.00 0.00 0 0 0
0.00/0.04 c intdiving : 0.00 0.00 0 0 0
0.00/0.04 c intshifting : 0.00 0.00 0 0 0
0.00/0.04 c linesearchdiving : 0.00 0.00 0 0 0
0.00/0.04 c localbranching : 0.00 0.00 0 0 0
0.00/0.04 c locks : 0.00 0.00 1 0 0
0.00/0.04 c lpface : 0.00 0.00 0 0 0
0.00/0.04 c mpec : 0.00 0.00 0 0 0
0.00/0.04 c multistart : 0.00 0.00 0 0 0
0.00/0.04 c mutation : 0.00 0.00 0 0 0
0.00/0.04 c nlpdiving : 0.00 0.00 0 0 0
0.00/0.04 c objpscostdiving : 0.00 0.00 0 0 0
0.00/0.04 c octane : 0.00 0.00 0 0 0
0.00/0.04 c ofins : 0.00 0.00 0 0 0
0.00/0.04 c oneopt : 0.00 0.00 1 0 0
0.00/0.04 c padm : 0.00 0.00 0 0 0
0.00/0.04 c proximity : 0.00 0.00 0 0 0
0.00/0.04 c pscostdiving : 0.00 0.00 0 0 0
0.00/0.04 c randrounding : 0.00 0.00 16 5 0
0.00/0.04 c rens : 0.00 0.00 0 0 0
0.00/0.04 c reoptsols : 0.00 0.00 0 0 0
0.00/0.04 c repair : 0.00 0.00 0 0 0
0.00/0.04 c rins : 0.00 0.00 0 0 0
0.00/0.04 c rootsoldiving : 0.00 0.00 0 0 0
0.00/0.04 c rounding : 0.00 0.00 16 0 0
0.00/0.04 c scheduler : 0.00 0.00 0 0 0
0.00/0.04 c shiftandpropagate: 0.00 0.00 0 0 0
0.00/0.04 c shifting : 0.00 0.00 16 5 0
0.00/0.04 c simplerounding : 0.00 0.00 0 0 0
0.00/0.04 c subnlp : 0.00 0.00 0 0 0
0.00/0.04 c trivial : 0.00 0.00 4 1 1
0.00/0.04 c trivialnegation : 0.00 0.00 0 0 0
0.00/0.04 c trustregion : 0.00 0.00 0 0 0
0.00/0.04 c trysol : 0.00 0.00 0 0 0
0.00/0.04 c twoopt : 0.00 0.00 0 0 0
0.00/0.04 c undercover : 0.00 0.00 0 0 0
0.00/0.04 c vbounds : 0.00 0.00 2 0 0
0.00/0.04 c veclendiving : 0.00 0.00 0 0 0
0.00/0.04 c zeroobj : 0.00 0.00 0 0 0
0.00/0.04 c zirounding : 0.00 0.00 1 0 0
0.00/0.04 c other solutions : - - - 0 -
0.00/0.04 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.04 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.04 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.04 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.04 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.04 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.04 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.04 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.04 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.04 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.04 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It ItLimit
0.00/0.04 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.04 c dual LP : 0.00 19 123 7.24 - 0.00 2
0.00/0.04 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.04 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.04 c resolve instable : 0.00 0 0 0.00 -
0.00/0.04 c diving/probing LP: 0.00 4 60 15.00 -
0.00/0.04 c strong branching : 0.00 12 213 17.75 - - - 0
0.00/0.04 c (at root node) : - 12 213 17.75 -
0.00/0.04 c conflict analysis: 0.00 7 56 8.00 -
0.00/0.04 c Relaxators : Time Calls Cutoffs ImprBounds ImprTime ReducedDom Separated AddedConss
0.00/0.04 c benders : 0.00 0 0 0 0.00 0 0 0
0.00/0.04 c B&B Tree :
0.00/0.04 c number of runs : 2
0.00/0.04 c nodes : 1 (0 internal, 1 leaves)
0.00/0.04 c feasible leaves : 0
0.00/0.04 c infeas. leaves : 0
0.00/0.04 c objective leaves : 0
0.00/0.04 c nodes (total) : 2 (0 internal, 2 leaves)
0.00/0.04 c nodes left : 0
0.00/0.04 c max depth : 0
0.00/0.04 c max depth (total): 0
0.00/0.04 c backtracks : 0 (0.0%)
0.00/0.04 c early backtracks : 0 (0.0%)
0.00/0.04 c nodes exc. ref. : 0 (0.0%)
0.00/0.04 c delayed cutoffs : 0
0.00/0.04 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.04 c avg switch length: 2.00
0.00/0.04 c switching time : 0.00
0.00/0.04 c Root Node :
0.00/0.04 c First LP value : -5.00000000000000e+00
0.00/0.04 c First LP Iters : 27 (181208.05 Iter/sec)
0.00/0.04 c First LP Time : 0.00
0.00/0.04 c Final Dual Bound : -
0.00/0.04 c Final Root Iters : 123
0.00/0.04 c Root LP Estimate : -
0.00/0.04 c Solution :
0.00/0.04 c Solutions found : 12 (2 improvements)
0.00/0.04 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.04 c Gap First Sol. : infinite
0.00/0.04 c Gap Last Sol. : 233.33 %
0.00/0.04 c Primal Bound : -3.00000000000000e+00 (in run 1, after 1 nodes, 0.00 seconds, depth 5, found by <clique>)
0.00/0.04 c Dual Bound : -3.00000000000000e+00
0.00/0.04 c Gap : 0.00 %
0.00/0.04 c Integrals : Total Avg%
0.00/0.04 c primal-dual : 1.23 31.54
0.00/0.04 c primal-ref : - - (not evaluated)
0.00/0.04 c dual-ref : - - (not evaluated)
0.00/0.04 c Time complete (sec): 0.041