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-4495255-1751150042.opb>
0.00/0.00 c original problem has 169 variables (169 bin, 0 int, 0 cont) and 101 constraints
0.00/0.00 c problem read in 0.001 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, 101 del conss, 73 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 72 clqs
0.00/0.00 c (round 2, exhaustive) 0 del vars, 101 del conss, 73 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 0 impls, 72 clqs
0.00/0.00 c (0.0s) sparsify finished: 25/841 (3.0%) nonzeros canceled - in total 25 canceled nonzeros, 104 changed coefficients, 0 added nonzeros
0.00/0.00 c (round 3, exhaustive) 0 del vars, 101 del conss, 73 add conss, 0 chg bounds, 0 chg sides, 104 chg coeffs, 73 upgd conss, 0 impls, 72 clqs
0.00/0.00 c (round 4, exhaustive) 0 del vars, 101 del conss, 73 add conss, 0 chg bounds, 0 chg sides, 104 chg coeffs, 74 upgd conss, 0 impls, 72 clqs
0.00/0.01 c (0.0s) probing: 51/169 (30.2%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.01 c (0.0s) probing aborted: 50/50 successive totally useless probings
0.00/0.01 c (0.0s) symmetry computation started: requiring (bin +, int +, cont +), (fixed: bin -, int -, cont -)
0.00/0.01 c (0.0s) no symmetry present (symcode time: 0.00)
0.00/0.01 c presolving (5 rounds: 5 fast, 5 medium, 4 exhaustive):
0.00/0.01 c 0 deleted vars, 101 deleted constraints, 73 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 104 changed coefficients
0.00/0.01 c 0 implications, 72 cliques
0.00/0.01 c presolved problem has 169 variables (169 bin, 0 int, 0 cont) and 73 constraints
0.00/0.01 c presolved problem has 0 implied integral variables (0 bin, 0 int, 0 cont)
0.00/0.01 c 1 constraints of type <knapsack>
0.00/0.01 c 72 constraints of type <setppc>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.01
0.00/0.01 c
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c
0.00/0.01 c # SCIP version 10.0.0
0.00/0.01 c
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, advanced: FALSE, range: [0,1e+20], default: 1e+20]
0.00/0.01 c limits/time = 3596.99801
0.00/0.01 c
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, advanced: FALSE, range: [0,8796093022207], default: 8796093022207]
0.00/0.01 c limits/memory = 27900
0.00/0.01 c
0.00/0.01 c # belongs reading time to solving time?
0.00/0.01 c # [type: bool, advanced: FALSE, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c timing/reading = TRUE
0.00/0.01 c
0.00/0.01 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.01 c # [type: int, advanced: TRUE, range: [-1,2147483647], default: -1]
0.00/0.01 c reading/opbreader/maxintsize = 47
0.00/0.01 c
0.00/0.01 c # timing when propagator should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP, 15:ALWAYS))
0.00/0.01 c # [type: int, advanced: TRUE, range: [0,15], default: 15]
0.00/0.01 c propagating/genvbounds/timingmask = 0
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c
0.00/0.01 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.01 c 0.0s| 1 | 0 | 144 | - | 3269k | 0 | 169 | 97 | 73 | 0 | 0 | 24 | 0 | 0.000000e+00 | -- | Inf | unknown
0.00/0.05 c 0.1s| 1 | 0 | 509 | - | 6563k | 0 | 169 | 229 | 78 | 5 | 1 | 24 | 0 | 0.000000e+00 | -- | Inf | unknown
0.00/0.06 c 0.1s| 1 | 0 | 528 | - | 8780k | 0 | 169 | 231 | 82 | 9 | 2 | 26 | 0 | 0.000000e+00 | -- | Inf | unknown
0.00/0.07 c 0.1s| 1 | 0 | 545 | - | 10M | 0 | 169 | 233 | 88 | 15 | 3 | 28 | 0 | 0.000000e+00 | -- | Inf | unknown
0.00/0.08 c 0.1s| 1 | 0 | 576 | - | 13M | 0 | 169 | 235 | 91 | 18 | 4 | 30 | 0 | 0.000000e+00 | -- | Inf | unknown
0.00/0.09 c 0.1s| 1 | 0 | 606 | - | 14M | 0 | 169 | 237 | 94 | 21 | 5 | 32 | 0 | 0.000000e+00 | -- | Inf | unknown
0.10/0.11 c 0.1s| 1 | 0 | 621 | - | 17M | 0 | 169 | 240 | 97 | 24 | 6 | 35 | 0 | 0.000000e+00 | -- | Inf | unknown
0.10/0.12 c 0.1s| 1 | 0 | 643 | - | 21M | 0 | 169 | 243 | 102 | 29 | 7 | 38 | 0 | 0.000000e+00 | -- | Inf | unknown
0.10/0.14 c 0.1s| 1 | 0 | 675 | - | 24M | 0 | 169 | 245 | 109 | 36 | 8 | 40 | 0 | 0.000000e+00 | -- | Inf | unknown
0.10/0.15 c 0.2s| 1 | 0 | 690 | - | 26M | 0 | 169 | 247 | 113 | 40 | 9 | 42 | 0 | 0.000000e+00 | -- | Inf | unknown
0.10/0.17 c 0.2s| 1 | 0 | 718 | - | 28M | 0 | 169 | 249 | 116 | 43 | 10 | 44 | 0 | 0.000000e+00 | -- | Inf | unknown
0.10/0.18 c 0.2s| 1 | 0 | 726 | - | 28M | 0 | 169 | 250 | 116 | 47 | 11 | 45 | 0 | 0.000000e+00 | -- | Inf | unknown
0.20/0.21 c 0.2s| 1 | 0 | 1131 | - | 28M | 0 | 169 | 251 | 116 | 47 | 11 | 67 | 10 | 0.000000e+00 | -- | Inf | unknown
0.20/0.21 c 0.2s| 1 | 0 | 1140 | - | 28M | 0 | 169 | 246 | 119 | 50 | 12 | 68 | 10 | 0.000000e+00 | -- | Inf | unknown
0.20/0.22 c 0.2s| 1 | 0 | 1149 | - | 28M | 0 | 169 | 248 | 121 | 52 | 13 | 70 | 10 | 0.000000e+00 | -- | Inf | unknown
0.20/0.22 c time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl.
0.20/0.22 c 0.2s| 1 | 0 | 1208 | - | 28M | 0 | 169 | 251 | 121 | 52 | 13 | 117 | 16 | 0.000000e+00 | -- | Inf | unknown
0.20/0.22 c (run 1, node 1) restarting after 50 global fixings of integer variables
0.20/0.22 c
0.20/0.22 c (restart) converted 48 cuts from the global cut pool into linear constraints
0.20/0.22 c
0.20/0.23 c presolving:
0.20/0.23 c (round 1, fast) 50 del vars, 41 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 82 chg coeffs, 0 upgd conss, 0 impls, 97 clqs
0.20/0.23 c (0.2s) running MILP presolver
0.20/0.23 c (0.2s) MILP presolver found nothing
0.20/0.23 c (round 2, exhaustive) 50 del vars, 48 del conss, 0 add conss, 0 chg bounds, 6 chg sides, 82 chg coeffs, 0 upgd conss, 0 impls, 97 clqs
0.20/0.23 c (round 3, exhaustive) 50 del vars, 48 del conss, 0 add conss, 0 chg bounds, 6 chg sides, 82 chg coeffs, 128 upgd conss, 0 impls, 97 clqs
0.20/0.23 c (round 4, exhaustive) 50 del vars, 49 del conss, 0 add conss, 0 chg bounds, 6 chg sides, 82 chg coeffs, 128 upgd conss, 0 impls, 97 clqs
0.20/0.24 c (round 5, exhaustive) 50 del vars, 144 del conss, 0 add conss, 0 chg bounds, 6 chg sides, 82 chg coeffs, 128 upgd conss, 0 impls, 97 clqs
0.20/0.24 c (0.2s) running MILP presolver
0.20/0.24 c (0.2s) MILP presolver found nothing
0.20/0.24 c (round 6, exhaustive) 50 del vars, 144 del conss, 0 add conss, 0 chg bounds, 6 chg sides, 139 chg coeffs, 128 upgd conss, 0 impls, 97 clqs
0.20/0.24 c presolving (7 rounds: 7 fast, 6 medium, 6 exhaustive):
0.20/0.24 c 50 deleted vars, 144 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 6 changed sides, 139 changed coefficients
0.20/0.24 c 0 implications, 97 cliques
0.20/0.24 c presolved problem has 119 variables (119 bin, 0 int, 0 cont) and 155 constraints
0.20/0.24 c presolved problem has 0 implied integral variables (0 bin, 0 int, 0 cont)
0.20/0.24 c 2 constraints of type <knapsack>
0.20/0.24 c 95 constraints of type <setppc>
0.20/0.24 c 19 constraints of type <linear>
0.20/0.24 c 39 constraints of type <logicor>
0.20/0.24 c transformed objective value is always integral (scale: 1)
0.20/0.24 c Presolving Time: 0.01
0.20/0.24 c
0.20/0.24 c time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl.
0.20/0.24 c 0.2s| 1 | 0 | 1353 | - | 27M | 0 | 119 | 159 | 116 | 0 | 0 | 121 | 16 | 0.000000e+00 | -- | Inf | unknown
0.20/0.30 c 0.3s| 1 | 0 | 1394 | - | 27M | 0 | 119 | 347 | 120 | 4 | 1 | 122 | 16 | 0.000000e+00 | -- | Inf | unknown
0.30/0.32 c 0.3s| 1 | 0 | 1432 | - | 27M | 0 | 119 | 349 | 124 | 8 | 2 | 124 | 16 | 0.000000e+00 | -- | Inf | unknown
0.30/0.33 c 0.3s| 1 | 0 | 1448 | - | 28M | 0 | 119 | 351 | 129 | 13 | 3 | 126 | 16 | cutoff | -- | 0.00%| unknown
0.30/0.33 c 0.3s| 1 | 0 | 1448 | - | 28M | 0 | 119 | 351 | 129 | 13 | 3 | 126 | 16 | cutoff | -- | 0.00%| unknown
0.30/0.33 c
0.30/0.33 c SCIP Status : problem is solved [infeasible]
0.30/0.33 c Solving Time (sec) : 0.34
0.30/0.33 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
0.30/0.33 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.30/0.33 c Dual Bound : +1.00000000000000e+20
0.30/0.33 c Gap : 0.00 %
0.30/0.33 s UNSATISFIABLE
0.30/0.33 c SCIP Status : problem is solved [infeasible]
0.30/0.33 c Total Time : 0.34
0.30/0.33 c solving : 0.34
0.30/0.33 c presolving : 0.01 (included in solving)
0.30/0.33 c reading : 0.00 (included in solving)
0.30/0.33 c copying : 0.01 (3 #copies) (minimal 0.00, maximal 0.00, average 0.00)
0.30/0.33 c Original Problem :
0.30/0.33 c Problem name : HOME/instance-4495255-1751150042.opb
0.30/0.33 c Variables : 169 (169 binary, 0 integer, 0 continuous)
0.30/0.33 c implied integral : 0 (0 binary, 0 integer, 0 continuous)
0.30/0.33 c Constraints : 101 initial, 101 maximal
0.30/0.33 c Objective : minimize, 0 non-zeros (abs.min = 1e+20, abs.max = -1e+20)
0.30/0.33 c Presolved Problem :
0.30/0.33 c Problem name : t_HOME/instance-4495255-1751150042.opb
0.30/0.33 c Variables : 119 (119 binary, 0 integer, 0 continuous)
0.30/0.33 c implied integral : 0 (0 binary, 0 integer, 0 continuous)
0.30/0.33 c Constraints : 155 initial, 351 maximal
0.30/0.33 c Objective : minimize, 0 non-zeros (abs.min = 1e+20, abs.max = -1e+20)
0.30/0.33 c Nonzeros : 3212 constraint, 584 clique table
0.30/0.33 c Presolvers : ExecTime SetupTime Calls FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.30/0.33 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c domcol : 0.00 0.00 3 0 0 0 0 0 0 0 0 0
0.30/0.33 c dualagg : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c dualcomp : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c dualinfer : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c dualsparsify : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.30/0.33 c gateextraction : 0.00 0.00 6 0 0 0 0 0 0 0 0 0
0.30/0.33 c implics : 0.00 0.00 11 0 0 0 0 0 0 0 0 0
0.30/0.33 c implint : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c milp : 0.00 0.00 3 0 0 0 0 0 101 73 0 0
0.30/0.33 c qpkktref : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c redvub : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c sparsify : 0.00 0.00 2 0 0 0 0 0 0 0 0 104
0.30/0.33 c stuffing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c trivial : 0.00 0.00 12 50 0 0 0 0 0 0 0 0
0.30/0.33 c tworowbnd : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c dualfix : 0.00 0.00 12 0 0 0 0 0 0 0 0 0
0.30/0.33 c genvbounds : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c probing : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.30/0.33 c pseudoobj : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.30/0.33 c symmetry : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.30/0.33 c vbounds : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
0.30/0.33 c knapsack : 0.00 0.00 25 0 0 0 0 0 0 0 0 0
0.30/0.33 c setppc : 0.00 0.00 28 0 0 0 0 0 4 0 0 0
0.30/0.33 c linear : 0.00 0.00 17 0 0 0 0 0 19 0 6 0
0.30/0.33 c logicor : 0.00 0.00 16 0 0 0 0 0 121 0 0 139
0.30/0.33 c components : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
0.30/0.33 c root node : - - - 50 - - 50 - - - - -
0.30/0.33 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoRelax #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Applied Conss Children
0.30/0.33 c integral : 0 0 0 0 2 0 0 13 0 0 0 0 0 5 0
0.30/0.33 c knapsack : 2 2 15 726 0 0 0 9 323 12 0 0 0 0 0
0.30/0.33 c setppc : 95 95 15 714 0 0 0 0 933 29 0 0 0 0 0
0.30/0.33 c linear : 19+ 206 16 349 0 0 0 2 2 0 0 0 0 0 0
0.30/0.33 c logicor : 39+ 48 15 176 0 0 0 0 4 0 0 0 0 0 0
0.30/0.33 c fixedvar : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c components : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS EnfoRelax Check ResProp SB-Prop
0.30/0.33 c integral : 0.02 0.00 0.00 0.00 0.02 0.00 0.00 0.00 0.00 0.00
0.30/0.33 c knapsack : 0.01 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.30/0.33 c setppc : 0.01 0.00 0.00 0.01 0.00 0.00 0.00 0.00 0.00 0.00
0.30/0.33 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.30/0.33 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.30/0.33 c fixedvar : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.30/0.33 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.30/0.33 c components : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.30/0.33 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.30/0.33 c dualfix : 3 0 0 0
0.30/0.33 c genvbounds : 0 0 0 0
0.30/0.33 c nlobbt : 0 0 0 0
0.30/0.33 c obbt : 0 0 0 0
0.30/0.33 c probing : 0 0 0 0
0.30/0.33 c pseudoobj : 0 0 0 0
0.30/0.33 c redcost : 0 0 0 0
0.30/0.33 c rootredcost : 0 0 0 0
0.30/0.33 c symmetry : 0 0 0 0
0.30/0.33 c vbounds : 198 0 0 0
0.30/0.33 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp SB-Prop
0.30/0.33 c dualfix : 0.00 0.00 0.00 0.00 0.00 0.00
0.30/0.33 c genvbounds : 0.00 0.00 0.00 0.00 0.00 0.00
0.30/0.33 c nlobbt : 0.00 0.00 0.00 0.00 0.00 0.00
0.30/0.33 c obbt : 0.00 0.00 0.00 0.00 0.00 0.00
0.30/0.33 c probing : 0.00 0.00 0.00 0.00 0.00 0.00
0.30/0.33 c pseudoobj : 0.00 0.00 0.00 0.00 0.00 0.00
0.30/0.33 c redcost : 0.00 0.00 0.00 0.00 0.00 0.00
0.30/0.33 c rootredcost : 0.00 0.00 0.00 0.00 0.00 0.00
0.30/0.33 c symmetry : 0.00 0.00 0.00 0.00 0.00 0.00
0.30/0.33 c vbounds : 0.00 0.00 0.00 0.00 0.00 0.00
0.30/0.33 c Conflict Analysis : Time Calls Success DomReds Conflicts Literals Reconvs ReconvLits Dualrays Nonzeros LP Iters (pool size: [10000,10000])
0.30/0.33 c propagation : 0.00 36 36 - 177 22.9 1 35.0 - - -
0.30/0.33 c infeasible LP : 0.00 14 55 - 26 6.1 0 0.0 41 1.0 0
0.30/0.33 c bound exceed. LP : 0.00 0 0 - 0 0.0 0 0.0 0 0.0 0
0.30/0.33 c strong branching : 0.00 0 0 - 0 0.0 0 0.0 - - 0
0.30/0.33 c pseudo solution : 0.00 0 0 - 0 0.0 0 0.0 - - -
0.30/0.33 c applied globally : 0.00 - - 41 84 8.1 - - 41 - -
0.30/0.33 c applied locally : - - - 0 1 31.0 - - 0 - -
0.30/0.33 c Separators : ExecTime SetupTime Calls RootCalls Cutoffs DomReds FoundCuts ViaPoolAdd DirectAdd Applied ViaPoolApp DirectApp Conss
0.30/0.33 c cut pool : 0.00 - 29 29 - - 1462 2242 - - - - - (maximal pool size: 1024)
0.30/0.33 c aggregation : 0.04 0.00 15 15 0 0 0 0 0 0 0 0 0
0.30/0.33 c > cmir : - - - - - - - 0 0 0 0 0 -
0.30/0.33 c > flowcover : - - - - - - - 0 0 0 0 0 -
0.30/0.33 c > knapsackcover : - - - - - - - 0 0 0 0 0 -
0.30/0.33 c cgmip : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c clique : 0.00 0.00 15 15 0 0 55 92 0 35 35 0 0
0.30/0.33 c closecuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c convexproj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c disjunctive : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c eccuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c gauge : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c gomory : 0.10 0.00 13 13 0 0 1392 2118 0 29 29 0 0
0.30/0.33 c > gomorymi : - - - - - - - 1492 0 27 27 0 -
0.30/0.33 c > strongcg : - - - - - - - 626 0 2 2 0 -
0.30/0.33 c impliedbounds : 0.00 0.00 15 15 0 0 0 0 0 0 0 0 0
0.30/0.33 c interminor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c intobj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c lagromory : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c mcf : 0.00 0.00 2 2 0 0 0 0 0 0 0 0 0
0.30/0.33 c minor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c mixing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c multilinear : 0.00 0.00 15 15 0 0 0 0 0 0 0 0 0
0.30/0.33 c oddcycle : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.30/0.33 c rapidlearning : 0.07 0.00 2 2 0 0 0 0 0 0 0 0 319
0.30/0.33 c rlt : 0.00 0.00 13 13 0 0 0 0 0 0 0 0 0
0.30/0.33 c zerohalf : 0.01 0.00 15 15 0 0 15 32 0 1 1 0 0
0.30/0.33 c Cutselectors : ExecTime SetupTime Calls RootCalls Selected Forced Filtered RootSelec RootForc RootFilt
0.30/0.33 c hybrid : 0.00 0.00 16 16 65 0 2177 65 0 2177
0.30/0.33 c ensemble : 0.00 0.00 0 0 0 0 0 0 0 0
0.30/0.33 c dynamic : 0.00 0.00 0 0 0 0 0 0 0 0
0.30/0.33 c Pricers : ExecTime SetupTime Calls Vars
0.30/0.33 c problem variables: 0.00 - 0 0
0.30/0.33 c Branching Rules : ExecTime SetupTime BranchLP BranchExt BranchPS Cutoffs DomReds Cuts Conss Children
0.30/0.33 c allfullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
0.30/0.33 c cloud : 0.00 0.00 0 0 0 0 0 0 0 0
0.30/0.33 c distribution : 0.00 0.00 0 0 0 0 0 0 0 0
0.30/0.33 c fullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
0.30/0.33 c gomory : 0.00 0.00 0 0 0 0 0 0 0 0
0.30/0.33 c inference : 0.00 0.00 0 0 0 0 0 0 0 0
0.30/0.33 c leastinf : 0.00 0.00 0 0 0 0 0 0 0 0
0.30/0.33 c lookahead : 0.00 0.00 0 0 0 0 0 0 0 0
0.30/0.33 c mostinf : 0.00 0.00 0 0 0 0 0 0 0 0
0.30/0.33 c multaggr : 0.00 0.00 0 0 0 0 0 0 0 0
0.30/0.33 c nodereopt : 0.00 0.00 0 0 0 0 0 0 0 0
0.30/0.33 c pscost : 0.00 0.00 0 0 0 0 0 0 0 0
0.30/0.33 c random : 0.00 0.00 0 0 0 0 0 0 0 0
0.30/0.33 c relpscost : 0.02 0.00 2 0 0 0 0 0 5 0
0.30/0.33 c vanillafullstrong: 0.00 0.00 0 0 0 0 0 0 0 0
0.30/0.33 c Primal Heuristics : ExecTime SetupTime Calls Found Best
0.30/0.33 c LP solutions : 0.00 - - 0 0
0.30/0.33 c relax solutions : 0.00 - - 0 0
0.30/0.33 c pseudo solutions : 0.00 - - 0 0
0.30/0.33 c strong branching : 0.00 - - 0 0
0.30/0.33 c actconsdiving : 0.00 0.00 0 0 0
0.30/0.33 c adaptivediving : 0.00 0.00 0 0 0
0.30/0.33 c alns : 0.00 0.00 0 0 0
0.30/0.33 c bound : 0.00 0.00 0 0 0
0.30/0.33 c clique : 0.00 0.00 1 0 0
0.30/0.33 c coefdiving : 0.00 0.00 0 0 0
0.30/0.33 c completesol : 0.00 0.00 0 0 0
0.30/0.33 c conflictdiving : 0.01 0.00 1 0 0
0.30/0.33 c crossover : 0.00 0.00 0 0 0
0.30/0.33 c dins : 0.00 0.00 0 0 0
0.30/0.33 c distributiondivin: 0.00 0.00 0 0 0
0.30/0.33 c dks : 0.00 0.00 0 0 0
0.30/0.33 c dps : 0.00 0.00 0 0 0
0.30/0.33 c dualval : 0.00 0.00 0 0 0
0.30/0.33 c farkasdiving : 0.00 0.00 0 0 0
0.30/0.33 c feaspump : 0.00 0.00 1 0 0
0.30/0.33 c fixandinfer : 0.00 0.00 0 0 0
0.30/0.33 c fracdiving : 0.00 0.00 0 0 0
0.30/0.33 c gins : 0.00 0.00 0 0 0
0.30/0.33 c guideddiving : 0.00 0.00 0 0 0
0.30/0.33 c indicator : 0.00 0.00 0 0 0
0.30/0.33 c indicatordiving : 0.00 0.00 0 0 0
0.30/0.33 c intdiving : 0.00 0.00 0 0 0
0.30/0.33 c intshifting : 0.00 0.00 0 0 0
0.30/0.33 c linesearchdiving : 0.00 0.00 0 0 0
0.30/0.33 c localbranching : 0.00 0.00 0 0 0
0.30/0.33 c locks : 0.00 0.00 1 0 0
0.30/0.33 c lpface : 0.00 0.00 0 0 0
0.30/0.33 c mpec : 0.00 0.00 0 0 0
0.30/0.33 c multistart : 0.00 0.00 0 0 0
0.30/0.33 c mutation : 0.00 0.00 0 0 0
0.30/0.33 c nlpdiving : 0.00 0.00 0 0 0
0.30/0.33 c objpscostdiving : 0.00 0.00 0 0 0
0.30/0.33 c octane : 0.00 0.00 0 0 0
0.30/0.33 c ofins : 0.00 0.00 0 0 0
0.30/0.33 c oneopt : 0.00 0.00 0 0 0
0.30/0.33 c padm : 0.00 0.00 0 0 0
0.30/0.33 c proximity : 0.00 0.00 0 0 0
0.30/0.33 c pscostdiving : 0.00 0.00 0 0 0
0.30/0.33 c randrounding : 0.02 0.00 18 0 0
0.30/0.33 c rens : 0.01 0.00 1 0 0
0.30/0.33 c reoptsols : 0.00 0.00 0 0 0
0.30/0.33 c repair : 0.00 0.00 0 0 0
0.30/0.33 c rins : 0.00 0.00 0 0 0
0.30/0.33 c rootsoldiving : 0.00 0.00 0 0 0
0.30/0.33 c rounding : 0.00 0.00 18 0 0
0.30/0.33 c scheduler : 0.00 0.00 0 0 0
0.30/0.33 c shiftandpropagate: 0.00 0.00 2 0 0
0.30/0.33 c shifting : 0.00 0.00 18 0 0
0.30/0.33 c simplerounding : 0.00 0.00 0 0 0
0.30/0.33 c subnlp : 0.00 0.00 0 0 0
0.30/0.33 c trivial : 0.00 0.00 4 0 0
0.30/0.33 c trivialnegation : 0.00 0.00 0 0 0
0.30/0.33 c trustregion : 0.00 0.00 0 0 0
0.30/0.33 c trysol : 0.00 0.00 0 0 0
0.30/0.33 c twoopt : 0.00 0.00 0 0 0
0.30/0.33 c undercover : 0.00 0.00 0 0 0
0.30/0.33 c vbounds : 0.00 0.00 2 0 0
0.30/0.33 c veclendiving : 0.00 0.00 0 0 0
0.30/0.33 c zeroobj : 0.00 0.00 0 0 0
0.30/0.33 c zirounding : 0.00 0.00 1 0 0
0.30/0.33 c other solutions : - - - 0 -
0.30/0.33 c LNS (Scheduler) : Calls SetupTime SolveTime SolveNodes Sols Best Exp3 Exp3-IX EpsGreedy UCB TgtFixRate Opt Inf Node Stal Sol Usr Othr Actv
0.30/0.33 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.30/0.33 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.30/0.33 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.30/0.33 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.30/0.33 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.30/0.33 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.30/0.33 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.30/0.33 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.30/0.33 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.30/0.33 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It ItLimit
0.30/0.33 c primal LP : 0.00 1 0 0.00 - 0.00 1
0.30/0.33 c dual LP : 0.01 18 642 35.67 50491.55 0.00 0
0.30/0.33 c lex dual LP : 0.00 0 0 0.00 -
0.30/0.33 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.30/0.33 c resolve instable : 0.00 0 0 0.00 -
0.30/0.33 c diving/probing LP: 0.01 19 806 42.42 62577.64
0.30/0.33 c strong branching : 0.02 16 930 58.12 52165.13 - - 0
0.30/0.33 c (at root node) : - 16 930 58.12 -
0.30/0.33 c conflict analysis: 0.00 0 0 0.00 -
0.30/0.33 c Relaxators : Time Calls Cutoffs ImprBounds ImprTime ReducedDom Separated AddedConss
0.30/0.33 c benders : 0.00 0 0 0 0.00 0 0 0
0.30/0.33 c B&B Tree :
0.30/0.33 c number of runs : 2
0.30/0.33 c nodes : 1 (0 internal, 1 leaves)
0.30/0.33 c feasible leaves : 0
0.30/0.33 c infeas. leaves : 1
0.30/0.33 c objective leaves : 0
0.30/0.33 c nodes (total) : 2 (0 internal, 2 leaves)
0.30/0.33 c nodes left : 0
0.30/0.33 c max depth : 0
0.30/0.33 c max depth (total): 0
0.30/0.33 c backtracks : 0 (0.0%)
0.30/0.33 c early backtracks : 0 (0.0%)
0.30/0.33 c nodes exc. ref. : 0 (0.0%)
0.30/0.33 c delayed cutoffs : 0
0.30/0.33 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.30/0.33 c avg switch length: 2.00
0.30/0.33 c switching time : 0.00
0.30/0.33 c Root Node :
0.30/0.33 c First LP value : +0.00000000000000e+00
0.30/0.33 c First LP Iters : 144 (93023.26 Iter/sec)
0.30/0.33 c First LP Time : 0.00
0.30/0.33 c Final Dual Bound : -
0.30/0.33 c Final Root Iters : 984
0.30/0.33 c Root LP Estimate : -
0.30/0.33 c Solution :
0.30/0.33 c Solutions found : 0 (0 improvements)
0.30/0.33 c Primal Bound : infeasible
0.30/0.33 c Dual Bound : -
0.30/0.33 c Gap : 0.00 %
0.30/0.33 c Integrals : Total Avg%
0.30/0.33 c primal-dual : - - (problem infeasible)
0.30/0.33 c primal-ref : - - (problem infeasible)
0.30/0.33 c dual-ref : - - (problem infeasible)
0.30/0.34 c Time complete (sec): 0.338