0.00/0.00 c SCIP version 10.0.0 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Soplex 7.0.0] [GitHash: 405ed0d46f]
0.00/0.00 c Copyright (c) 2002-2024 Zuse Institute Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-4444635-1721301819.opb>
0.00/0.00 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.00 c problem read in 0.00
0.00/0.00 c No objective function, only one solution is needed.
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.01 c (0.0s) sparsify finished: 28/841 (3.3%) nonzeros canceled - in total 28 canceled nonzeros, 117 changed coefficients, 0 added nonzeros
0.00/0.01 c (round 3, exhaustive) 0 del vars, 101 del conss, 73 add conss, 0 chg bounds, 0 chg sides, 117 chg coeffs, 73 upgd conss, 0 impls, 72 clqs
0.00/0.01 c (round 4, exhaustive) 0 del vars, 101 del conss, 73 add conss, 0 chg bounds, 0 chg sides, 117 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, 117 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 impl, 0 cont) and 73 constraints
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 - non default parameters ----------------------------------------------------------------------
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.997057
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 # solving stops, if the given number of solutions were found; this limit is first checked in presolving (-1: no limit)
0.00/0.01 c # [type: int, advanced: FALSE, range: [-1,2147483647], default: -1]
0.00/0.01 c limits/solutions = 1
0.00/0.01 c
0.00/0.01 c # bitset describing used symmetry handling technique: (0: off; 1: constraint-based (orbitopes and/or symresacks); 2: orbital fixing; 3: orbitopes and orbital fixing; 4: Schreier Sims cuts; 5: Schreier Sims cuts and orbitopes; 6: Schreier Sims cuts and orbital fixing; 7: Schreier Sims cuts, orbitopes, and orbital fixing) See type_symmetry.h.
0.00/0.01 c # [type: int, advanced: FALSE, range: [0,7], default: 7]
0.00/0.01 c misc/usesymmetry = 3
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 # Should we check whether the components of the symmetry group can be handled by double lex matrices?
0.00/0.01 c # [type: bool, advanced: TRUE, range: {TRUE,FALSE}, default: TRUE]
0.00/0.01 c propagating/symmetry/detectdoublelex = FALSE
0.00/0.01 c
0.00/0.01 c # Should we try to detect symmetric subgroups of the symmetry group on binary variables?
0.00/0.01 c # [type: bool, advanced: TRUE, range: {TRUE,FALSE}, default: TRUE]
0.00/0.01 c propagating/symmetry/detectsubgroups = FALSE
0.00/0.01 c
0.00/0.01 c # Type of symmetries that shall be computed?
0.00/0.01 c # [type: int, advanced: TRUE, range: [0,1], default: 0]
0.00/0.01 c propagating/symmetry/symtype = 1
0.00/0.01 c
0.00/0.01 c # Should components consisting of a single full reflection be handled?
0.00/0.01 c # [type: bool, advanced: TRUE, range: {TRUE,FALSE}, default: TRUE]
0.00/0.01 c propagating/symmetry/usesimplesgncomp = FALSE
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
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 | 218 | - | 3066k | 0 | 169 | 115 | 73 | 0 | 0 | 44 | 0 | 0.000000e+00 | -- | Inf | unknown
0.00/0.07 c 0.1s| 1 | 0 | 512 | - | 6664k | 0 | 169 | 245 | 77 | 4 | 1 | 45 | 0 | 0.000000e+00 | -- | Inf | unknown
0.00/0.08 c 0.1s| 1 | 0 | 543 | - | 10M | 0 | 169 | 245 | 84 | 11 | 2 | 45 | 0 | 0.000000e+00 | -- | Inf | unknown
0.00/0.09 c 0.1s| 1 | 0 | 571 | - | 12M | 0 | 169 | 248 | 88 | 15 | 3 | 48 | 0 | 0.000000e+00 | -- | Inf | unknown
0.09/0.10 c 0.1s| 1 | 0 | 590 | - | 15M | 0 | 169 | 250 | 92 | 19 | 4 | 50 | 0 | 0.000000e+00 | -- | Inf | unknown
0.09/0.12 c 0.1s| 1 | 0 | 613 | - | 18M | 0 | 169 | 251 | 99 | 26 | 5 | 51 | 0 | 0.000000e+00 | -- | Inf | unknown
0.09/0.13 c 0.1s| 1 | 0 | 631 | - | 20M | 0 | 169 | 253 | 104 | 31 | 6 | 53 | 0 | 0.000000e+00 | -- | Inf | unknown
0.09/0.15 c 0.1s| 1 | 0 | 654 | - | 25M | 0 | 169 | 256 | 106 | 33 | 7 | 56 | 0 | 0.000000e+00 | -- | Inf | unknown
0.09/0.16 c 0.2s| 1 | 0 | 682 | - | 28M | 0 | 169 | 256 | 109 | 36 | 8 | 56 | 0 | 0.000000e+00 | -- | Inf | unknown
0.09/0.18 c 0.2s| 1 | 0 | 719 | - | 29M | 0 | 169 | 256 | 114 | 41 | 9 | 56 | 0 | 0.000000e+00 | -- | Inf | unknown
0.09/0.20 c 0.2s| 1 | 0 | 747 | - | 32M | 0 | 169 | 261 | 115 | 42 | 10 | 61 | 0 | 0.000000e+00 | -- | Inf | unknown
0.20/0.21 c 0.2s| 1 | 0 | 759 | - | 32M | 0 | 169 | 262 | 118 | 45 | 11 | 62 | 0 | 0.000000e+00 | -- | Inf | unknown
0.30/0.34 c 0.3s| 1 | 0 | 1309 | - | 32M | 0 | 169 | 259 | 118 | 45 | 11 | 85 | 12 | 0.000000e+00 | -- | Inf | unknown
0.30/0.35 c 0.4s| 1 | 0 | 1331 | - | 32M | 0 | 169 | 256 | 122 | 49 | 12 | 86 | 12 | 0.000000e+00 | -- | Inf | unknown
0.30/0.35 c 0.4s| 1 | 0 | 1339 | - | 32M | 0 | 169 | 256 | 124 | 51 | 13 | 86 | 12 | 0.000000e+00 | -- | Inf | unknown
0.30/0.37 c time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl.
0.30/0.37 c 0.4s| 1 | 0 | 1405 | - | 32M | 0 | 169 | 261 | 124 | 51 | 13 | 109 | 18 | 0.000000e+00 | -- | Inf | unknown
0.30/0.37 c (run 1, node 1) restarting after 55 global fixings of integer variables
0.30/0.37 c
0.30/0.37 c (restart) converted 51 cuts from the global cut pool into linear constraints
0.30/0.37 c
0.30/0.38 c presolving:
0.30/0.38 c (round 1, fast) 55 del vars, 185 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 60 chg coeffs, 0 upgd conss, 0 impls, 81 clqs
0.30/0.38 c (0.4s) running MILP presolver
0.30/0.38 c (0.4s) MILP presolver found nothing
0.30/0.38 c (round 2, exhaustive) 55 del vars, 188 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 60 chg coeffs, 0 upgd conss, 0 impls, 81 clqs
0.30/0.38 c (round 3, exhaustive) 55 del vars, 188 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 60 chg coeffs, 28 upgd conss, 0 impls, 81 clqs
0.30/0.38 c (round 4, exhaustive) 55 del vars, 188 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 61 chg coeffs, 28 upgd conss, 0 impls, 81 clqs
0.30/0.38 c (round 5, exhaustive) 55 del vars, 190 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 61 chg coeffs, 28 upgd conss, 0 impls, 81 clqs
0.30/0.38 c (round 6, exhaustive) 55 del vars, 190 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 66 chg coeffs, 28 upgd conss, 0 impls, 81 clqs
0.30/0.38 c presolving (7 rounds: 7 fast, 6 medium, 6 exhaustive):
0.30/0.38 c 55 deleted vars, 190 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 66 changed coefficients
0.30/0.38 c 0 implications, 81 cliques
0.30/0.38 c presolved problem has 114 variables (114 bin, 0 int, 0 impl, 0 cont) and 122 constraints
0.30/0.38 c 9 constraints of type <knapsack>
0.30/0.38 c 78 constraints of type <setppc>
0.30/0.38 c 23 constraints of type <linear>
0.30/0.38 c 12 constraints of type <logicor>
0.30/0.38 c transformed objective value is always integral (scale: 1)
0.30/0.38 c Presolving Time: 0.01
0.30/0.38 c
0.49/0.60 c time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl.
0.49/0.60 c 0.6s| 1 | 0 | 1467 | - | 31M | 0 | 114 | 141 | 110 | 0 | 0 | 128 | 18 | 0.000000e+00 | -- | Inf | unknown
0.59/0.67 c 0.7s| 1 | 0 | 1489 | - | 31M | 0 | 114 | 345 | 114 | 4 | 1 | 132 | 18 | 0.000000e+00 | -- | Inf | unknown
0.59/0.69 c 0.7s| 1 | 0 | 1510 | - | 31M | 0 | 114 | 345 | 117 | 7 | 2 | 132 | 18 | 0.000000e+00 | -- | Inf | unknown
0.68/0.70 c 0.7s| 1 | 0 | 1534 | - | 32M | 0 | 114 | 347 | 120 | 10 | 3 | 134 | 18 | 0.000000e+00 | -- | Inf | unknown
0.68/0.71 c 0.7s| 1 | 0 | 1553 | - | 32M | 0 | 114 | 349 | 124 | 14 | 4 | 136 | 18 | 0.000000e+00 | -- | Inf | unknown
0.68/0.73 c 0.7s| 1 | 0 | 1588 | - | 32M | 0 | 114 | 351 | 127 | 17 | 5 | 138 | 18 | 0.000000e+00 | -- | Inf | unknown
0.68/0.74 c 0.7s| 1 | 0 | 1617 | - | 33M | 0 | 114 | 355 | 131 | 21 | 6 | 142 | 18 | 0.000000e+00 | -- | Inf | unknown
0.68/0.76 c 0.8s| 1 | 0 | 1629 | - | 33M | 0 | 114 | 357 | 133 | 23 | 7 | 144 | 18 | 0.000000e+00 | -- | Inf | unknown
0.68/0.77 c 0.8s| 1 | 0 | 1654 | - | 33M | 0 | 114 | 358 | 135 | 25 | 8 | 145 | 18 | 0.000000e+00 | -- | Inf | unknown
0.68/0.79 c 0.8s| 1 | 0 | 1670 | - | 34M | 0 | 114 | 362 | 138 | 28 | 9 | 149 | 18 | 0.000000e+00 | -- | Inf | unknown
0.78/0.81 c 0.8s| 1 | 0 | 1699 | - | 35M | 0 | 114 | 362 | 140 | 30 | 10 | 149 | 18 | 0.000000e+00 | -- | Inf | unknown
0.78/0.82 c 0.8s| 1 | 0 | 1717 | - | 35M | 0 | 114 | 363 | 144 | 34 | 11 | 150 | 18 | 0.000000e+00 | -- | Inf | unknown
0.78/0.84 c 0.8s| 1 | 0 | 1814 | - | 35M | 0 | 114 | 367 | 144 | 34 | 11 | 159 | 19 | 0.000000e+00 | -- | Inf | unknown
0.78/0.84 c (run 2, node 1) restarting after 26 global fixings of integer variables
0.78/0.84 c
0.78/0.84 c (restart) converted 34 cuts from the global cut pool into linear constraints
0.78/0.84 c
0.78/0.84 c presolving:
0.78/0.85 c (round 1, fast) 26 del vars, 118 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 26 chg coeffs, 0 upgd conss, 0 impls, 83 clqs
0.78/0.85 c (0.8s) running MILP presolver
0.78/0.85 c (0.8s) MILP presolver found nothing
0.78/0.85 c (round 2, exhaustive) 26 del vars, 119 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 26 chg coeffs, 0 upgd conss, 0 impls, 83 clqs
0.78/0.85 c (round 3, exhaustive) 26 del vars, 129 del conss, 0 add conss, 0 chg bounds, 8 chg sides, 26 chg coeffs, 0 upgd conss, 0 impls, 83 clqs
0.78/0.85 c (round 4, exhaustive) 26 del vars, 129 del conss, 0 add conss, 0 chg bounds, 8 chg sides, 26 chg coeffs, 132 upgd conss, 0 impls, 83 clqs
0.78/0.85 c (round 5, exhaustive) 26 del vars, 130 del conss, 0 add conss, 0 chg bounds, 8 chg sides, 26 chg coeffs, 132 upgd conss, 0 impls, 83 clqs
0.78/0.85 c (round 6, exhaustive) 26 del vars, 131 del conss, 0 add conss, 0 chg bounds, 8 chg sides, 55 chg coeffs, 132 upgd conss, 0 impls, 83 clqs
0.78/0.85 c (round 7, exhaustive) 26 del vars, 131 del conss, 0 add conss, 0 chg bounds, 8 chg sides, 1087 chg coeffs, 132 upgd conss, 0 impls, 83 clqs
0.78/0.85 c (round 8, exhaustive) 26 del vars, 131 del conss, 0 add conss, 0 chg bounds, 8 chg sides, 1090 chg coeffs, 132 upgd conss, 0 impls, 83 clqs
0.78/0.85 c presolving (9 rounds: 9 fast, 8 medium, 8 exhaustive):
0.78/0.85 c 26 deleted vars, 131 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 8 changed sides, 1090 changed coefficients
0.78/0.85 c 0 implications, 83 cliques
0.78/0.85 c presolved problem has 88 variables (88 bin, 0 int, 0 impl, 0 cont) and 270 constraints
0.78/0.85 c 16 constraints of type <knapsack>
0.78/0.85 c 78 constraints of type <setppc>
0.78/0.85 c 39 constraints of type <linear>
0.78/0.85 c 137 constraints of type <logicor>
0.78/0.85 c transformed objective value is always integral (scale: 1)
0.78/0.85 c Presolving Time: 0.02
0.78/0.85 c
0.99/1.06 c time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl.
0.99/1.06 c 1.1s| 1 | 0 | 1903 | - | 35M | 0 | 88 | 275 | 133 | 0 | 0 | 164 | 19 | 0.000000e+00 | -- | Inf | unknown
1.09/1.15 c 1.2s| 1 | 0 | 1928 | - | 35M | 0 | 88 | 476 | 137 | 4 | 1 | 165 | 19 | 0.000000e+00 | -- | Inf | unknown
1.09/1.17 c 1.2s| 1 | 0 | 1947 | - | 35M | 0 | 88 | 477 | 141 | 8 | 2 | 166 | 19 | 0.000000e+00 | -- | Inf | unknown
1.09/1.18 c 1.2s| 1 | 0 | 1965 | - | 36M | 0 | 88 | 479 | 144 | 11 | 3 | 168 | 19 | 0.000000e+00 | -- | Inf | unknown
1.18/1.20 c 1.2s| 1 | 0 | 1983 | - | 36M | 0 | 88 | 480 | 146 | 13 | 4 | 169 | 19 | 0.000000e+00 | -- | Inf | unknown
1.18/1.21 c 1.2s| 1 | 0 | 2012 | - | 37M | 0 | 88 | 482 | 148 | 15 | 5 | 171 | 19 | 0.000000e+00 | -- | Inf | unknown
1.18/1.23 c 1.2s| 1 | 0 | 2047 | - | 37M | 0 | 88 | 482 | 150 | 17 | 6 | 171 | 19 | 0.000000e+00 | -- | Inf | unknown
1.18/1.24 c 1.2s| 1 | 0 | 2074 | - | 37M | 0 | 88 | 484 | 151 | 18 | 7 | 173 | 19 | 0.000000e+00 | -- | Inf | unknown
1.18/1.26 c 1.3s| 1 | 0 | 2091 | - | 37M | 0 | 88 | 486 | 155 | 22 | 8 | 175 | 19 | 0.000000e+00 | -- | Inf | unknown
1.18/1.27 c 1.3s| 1 | 0 | 2108 | - | 37M | 0 | 88 | 487 | 157 | 24 | 9 | 176 | 19 | 0.000000e+00 | -- | Inf | unknown
1.18/1.29 c 1.3s| 1 | 0 | 2137 | - | 38M | 0 | 88 | 488 | 91 | 25 | 10 | 177 | 19 | 0.000000e+00 | -- | Inf | unknown
1.18/1.29 c 1.3s| 1 | 0 | 2154 | - | 38M | 0 | 88 | 492 | 93 | 27 | 11 | 181 | 19 | 0.000000e+00 | -- | Inf | unknown
1.29/1.31 c 1.3s| 1 | 0 | 2238 | - | 38M | 0 | 88 | 499 | 93 | 27 | 11 | 205 | 24 | cutoff | -- | 0.00%| unknown
1.29/1.31 c
1.29/1.31 c SCIP Status : problem is solved [infeasible]
1.29/1.31 c Solving Time (sec) : 1.31
1.29/1.31 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
1.29/1.31 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1.29/1.31 c Dual Bound : +1.00000000000000e+20
1.29/1.31 c Gap : 0.00 %
1.29/1.31 s UNSATISFIABLE
1.29/1.31 c SCIP Status : problem is solved [infeasible]
1.29/1.31 c Total Time : 1.31
1.29/1.31 c solving : 1.31
1.29/1.31 c presolving : 0.02 (included in solving)
1.29/1.31 c reading : 0.00 (included in solving)
1.29/1.31 c copying : 0.02 (7 #copies) (minimal 0.00, maximal 0.00, average 0.00)
1.29/1.31 c Original Problem :
1.29/1.31 c Problem name : HOME/instance-4444635-1721301819.opb
1.29/1.31 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.31 c Constraints : 101 initial, 101 maximal
1.29/1.31 c Objective : minimize, 0 non-zeros (abs.min = 1e+20, abs.max = -1e+20)
1.29/1.31 c Presolved Problem :
1.29/1.31 c Problem name : t_HOME/instance-4444635-1721301819.opb
1.29/1.31 c Variables : 88 (88 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.31 c Constraints : 270 initial, 499 maximal
1.29/1.31 c Objective : minimize, 0 non-zeros (abs.min = 1e+20, abs.max = -1e+20)
1.29/1.31 c Nonzeros : 6037 constraint, 446 clique table
1.29/1.31 c Presolvers : ExecTime SetupTime Calls FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
1.29/1.31 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c domcol : 0.00 0.00 4 0 0 0 0 0 0 0 0 0
1.29/1.31 c dualagg : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c dualcomp : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c dualinfer : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c dualsparsify : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
1.29/1.31 c gateextraction : 0.00 0.00 14 0 0 0 0 0 0 0 0 0
1.29/1.31 c implics : 0.00 0.00 19 0 0 0 0 0 0 0 0 0
1.29/1.31 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c milp : 0.00 0.00 3 0 0 0 0 0 101 73 0 0
1.29/1.31 c qpkktref : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c redvub : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c sparsify : 0.00 0.00 2 0 0 0 0 0 0 0 0 117
1.29/1.31 c stuffing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c trivial : 0.00 0.00 21 81 0 0 0 0 0 0 0 0
1.29/1.31 c tworowbnd : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c dualfix : 0.00 0.00 21 0 0 0 0 0 0 0 0 0
1.29/1.31 c genvbounds : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c probing : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
1.29/1.31 c pseudoobj : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
1.29/1.31 c symmetry : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
1.29/1.31 c vbounds : 0.00 0.00 3 0 0 0 0 0 0 0 0 0
1.29/1.31 c knapsack : 0.00 0.00 50 0 0 0 0 0 0 0 0 1
1.29/1.31 c setppc : 0.00 0.00 52 0 0 0 0 0 20 0 0 0
1.29/1.31 c linear : 0.01 0.00 31 0 0 0 0 0 203 0 9 0
1.29/1.31 c logicor : 0.00 0.00 36 0 0 0 0 0 98 0 0 1155
1.29/1.31 c benders : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c components : 0.00 0.00 3 0 0 0 0 0 0 0 0 0
1.29/1.31 c root node : - - - 105 - - 105 - - - - -
1.29/1.31 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoRelax #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Applied Conss Children
1.29/1.31 c benderslp : 0 0 0 0 4 0 0 25 0 0 0 0 0 0 0
1.29/1.31 c integral : 0 0 0 0 4 0 0 25 0 1 48 0 0 6 0
1.29/1.31 c knapsack : 16 16 34 1148 0 0 0 20 450 16 0 0 0 0 0
1.29/1.31 c setppc : 78+ 79 34 1132 0 0 0 10 1344 51 0 0 0 0 0
1.29/1.31 c linear : 39+ 239 36 745 0 0 0 2 4 2 0 4 1 0 0
1.29/1.31 c logicor : 137+ 165 34 355 0 0 0 0 16 2 0 0 0 0 0
1.29/1.31 c benders : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c fixedvar : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c components : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS EnfoRelax Check ResProp SB-Prop
1.29/1.31 c benderslp : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.29/1.31 c integral : 0.05 0.00 0.00 0.00 0.05 0.00 0.00 0.00 0.00 0.00
1.29/1.31 c knapsack : 0.02 0.00 0.01 0.01 0.00 0.00 0.00 0.00 0.00 0.00
1.29/1.31 c setppc : 0.02 0.00 0.00 0.02 0.00 0.00 0.00 0.00 0.00 0.00
1.29/1.31 c linear : 0.01 0.00 0.00 0.01 0.00 0.00 0.00 0.00 0.00 0.00
1.29/1.31 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.29/1.31 c benders : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.29/1.31 c fixedvar : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.29/1.31 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.29/1.31 c components : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.29/1.31 c Propagators : #Propagate #ResProp Cutoffs DomReds
1.29/1.31 c dualfix : 4 0 0 0
1.29/1.31 c genvbounds : 0 0 0 0
1.29/1.31 c nlobbt : 0 0 0 0
1.29/1.31 c obbt : 0 0 0 0
1.29/1.31 c probing : 0 0 0 0
1.29/1.31 c pseudoobj : 0 0 0 0
1.29/1.31 c redcost : 0 0 0 0
1.29/1.31 c rootredcost : 0 0 0 0
1.29/1.31 c symmetry : 0 0 0 0
1.29/1.31 c vbounds : 353 0 0 0
1.29/1.31 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp SB-Prop
1.29/1.31 c dualfix : 0.00 0.00 0.00 0.00 0.00 0.00
1.29/1.31 c genvbounds : 0.00 0.00 0.00 0.00 0.00 0.00
1.29/1.31 c nlobbt : 0.00 0.00 0.00 0.00 0.00 0.00
1.29/1.31 c obbt : 0.00 0.00 0.00 0.00 0.00 0.00
1.29/1.31 c probing : 0.00 0.00 0.00 0.00 0.00 0.00
1.29/1.31 c pseudoobj : 0.00 0.00 0.00 0.00 0.00 0.00
1.29/1.31 c redcost : 0.00 0.00 0.00 0.00 0.00 0.00
1.29/1.31 c rootredcost : 0.00 0.00 0.00 0.00 0.00 0.00
1.29/1.31 c symmetry : 0.00 0.00 0.00 0.00 0.00 0.00
1.29/1.31 c vbounds : 0.00 0.00 0.00 0.00 0.00 0.00
1.29/1.31 c Symmetry :
1.29/1.31 c orbitopal red. : 0 reductions applied, 0 cutoffs
1.29/1.31 c orbital reduction: 0 reductions applied, 0 cutoffs
1.29/1.31 c lexicographic red: 0 reductions applied, 0 cutoffs
1.29/1.31 c shadow tree time : 0.00 s
1.29/1.31 c Conflict Analysis : Time Calls Success DomReds Conflicts Literals Reconvs ReconvLits Dualrays Nonzeros LP Iters (pool size: [10000,10000])
1.29/1.31 c propagation : 0.00 65 64 - 290 20.1 0 0.0 - - -
1.29/1.31 c infeasible LP : 0.00 25 61 - 49 7.9 0 0.0 36 1.0 0
1.29/1.31 c bound exceed. LP : 0.00 0 0 - 0 0.0 0 0.0 0 0.0 0
1.29/1.31 c strong branching : 0.00 0 0 - 0 0.0 0 0.0 - - 0
1.29/1.31 c pseudo solution : 0.00 0 0 - 0 0.0 0 0.0 - - -
1.29/1.31 c applied globally : 0.00 - - 36 166 7.2 - - 36 - -
1.29/1.31 c applied locally : - - - 0 3 34.0 - - 0 - -
1.29/1.31 c Separators : ExecTime SetupTime Calls RootCalls Cutoffs DomReds FoundCuts ViaPoolAdd DirectAdd Applied ViaPoolApp DirectApp Conss
1.29/1.31 c cut pool : 0.01 - 66 66 - - 3051 4834 - - - - - (maximal pool size: 1069)
1.29/1.31 c aggregation : 0.17 0.00 34 34 0 0 4 5 0 0 0 0 0
1.29/1.31 c > cmir : - - - - - - - 5 0 0 0 0 -
1.29/1.31 c > flowcover : - - - - - - - 0 0 0 0 0 -
1.29/1.31 c > knapsackcover : - - - - - - - 0 0 0 0 0 -
1.29/1.31 c cgmip : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c clique : 0.00 0.00 34 34 0 0 92 158 0 35 35 0 0
1.29/1.31 c closecuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c convexproj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c disjunctive : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c eccuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c gauge : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c gomory : 0.18 0.00 30 30 0 0 2921 4610 0 67 67 0 0
1.29/1.31 c > gomorymi : - - - - - - - 3670 0 57 57 0 -
1.29/1.31 c > strongcg : - - - - - - - 940 0 10 10 0 -
1.29/1.31 c impliedbounds : 0.00 0.00 34 34 0 0 0 0 0 0 0 0 0
1.29/1.31 c interminor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c intobj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c lagromory : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c mcf : 0.00 0.00 3 3 0 0 0 0 0 0 0 0 0
1.29/1.31 c minor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c mixing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c multilinear : 0.00 0.00 34 34 0 0 0 0 0 0 0 0 0
1.29/1.31 c oddcycle : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
1.29/1.31 c rapidlearning : 0.16 0.00 3 3 0 0 0 0 0 0 0 0 529
1.29/1.31 c rlt : 0.00 0.00 30 30 0 0 0 0 0 0 0 0 0
1.29/1.31 c zerohalf : 0.02 0.00 34 34 0 0 34 61 0 9 9 0 0
1.29/1.31 c Cutselectors : ExecTime SetupTime Calls RootCalls Selected Forced Filtered RootSelec RootForc RootFilt
1.29/1.31 c hybrid : 0.01 0.00 35 35 112 0 4726 112 0 4726
1.29/1.31 c ensemble : 0.00 0.00 0 0 0 0 0 0 0 0
1.29/1.31 c dynamic : 0.00 0.00 0 0 0 0 0 0 0 0
1.29/1.31 c Pricers : ExecTime SetupTime Calls Vars
1.29/1.31 c problem variables: 0.00 - 0 0
1.29/1.31 c Branching Rules : ExecTime SetupTime BranchLP BranchExt BranchPS Cutoffs DomReds Cuts Conss Children
1.29/1.31 c allfullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
1.29/1.31 c cloud : 0.00 0.00 0 0 0 0 0 0 0 0
1.29/1.31 c distribution : 0.00 0.00 0 0 0 0 0 0 0 0
1.29/1.31 c fullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
1.29/1.31 c gomory : 0.00 0.00 0 0 0 0 0 0 0 0
1.29/1.31 c inference : 0.00 0.00 0 0 0 0 0 0 0 0
1.29/1.31 c leastinf : 0.00 0.00 0 0 0 0 0 0 0 0
1.29/1.31 c lookahead : 0.00 0.00 0 0 0 0 0 0 0 0
1.29/1.31 c mostinf : 0.00 0.00 0 0 0 0 0 0 0 0
1.29/1.31 c multaggr : 0.00 0.00 0 0 0 0 0 0 0 0
1.29/1.31 c nodereopt : 0.00 0.00 0 0 0 0 0 0 0 0
1.29/1.31 c pscost : 0.00 0.00 0 0 0 0 0 0 0 0
1.29/1.31 c random : 0.00 0.00 0 0 0 0 0 0 0 0
1.29/1.31 c relpscost : 0.05 0.00 4 0 0 1 48 0 6 0
1.29/1.31 c vanillafullstrong: 0.00 0.00 0 0 0 0 0 0 0 0
1.29/1.31 c Primal Heuristics : ExecTime SetupTime Calls Found Best
1.29/1.31 c LP solutions : 0.00 - - 0 0
1.29/1.31 c relax solutions : 0.00 - - 0 0
1.29/1.31 c pseudo solutions : 0.00 - - 0 0
1.29/1.31 c strong branching : 0.00 - - 0 0
1.29/1.31 c actconsdiving : 0.00 0.00 0 0 0
1.29/1.31 c adaptivediving : 0.00 0.00 0 0 0
1.29/1.31 c alns : 0.00 0.00 1 0 0
1.29/1.31 c bound : 0.00 0.00 0 0 0
1.29/1.31 c clique : 0.00 0.00 1 0 0
1.29/1.31 c coefdiving : 0.00 0.00 0 0 0
1.29/1.31 c completesol : 0.00 0.00 0 0 0
1.29/1.31 c conflictdiving : 0.02 0.00 3 0 0
1.29/1.31 c crossover : 0.00 0.00 0 0 0
1.29/1.31 c dins : 0.00 0.00 0 0 0
1.29/1.31 c distributiondivin: 0.00 0.00 0 0 0
1.29/1.31 c dps : 0.00 0.00 0 0 0
1.29/1.31 c dualval : 0.00 0.00 0 0 0
1.29/1.31 c farkasdiving : 0.00 0.00 0 0 0
1.29/1.31 c feasjump : 0.42 0.00 3 0 0
1.29/1.31 c feaspump : 0.00 0.00 1 0 0
1.29/1.31 c fixandinfer : 0.00 0.00 0 0 0
1.29/1.31 c fracdiving : 0.00 0.00 0 0 0
1.29/1.31 c gins : 0.00 0.00 0 0 0
1.29/1.31 c guideddiving : 0.00 0.00 0 0 0
1.29/1.31 c indcoefdiving : 0.00 0.00 0 0 0
1.29/1.31 c indicator : 0.00 0.00 0 0 0
1.29/1.31 c indicatordiving : 0.00 0.00 0 0 0
1.29/1.31 c indoneopt : 0.00 0.00 0 0 0
1.29/1.31 c indrounding : 0.00 0.00 0 0 0
1.29/1.31 c indtwoopt : 0.00 0.00 0 0 0
1.29/1.31 c intdiving : 0.00 0.00 0 0 0
1.29/1.31 c intshifting : 0.00 0.00 0 0 0
1.29/1.31 c linesearchdiving : 0.00 0.00 0 0 0
1.29/1.31 c localbranching : 0.00 0.00 0 0 0
1.29/1.31 c locks : 0.00 0.00 1 0 0
1.29/1.31 c lpface : 0.00 0.00 0 0 0
1.29/1.31 c mpec : 0.00 0.00 0 0 0
1.29/1.31 c multistart : 0.00 0.00 0 0 0
1.29/1.31 c mutation : 0.00 0.00 0 0 0
1.29/1.31 c nlpdiving : 0.00 0.00 0 0 0
1.29/1.31 c objpscostdiving : 0.00 0.00 0 0 0
1.29/1.31 c octane : 0.00 0.00 0 0 0
1.29/1.31 c ofins : 0.00 0.00 0 0 0
1.29/1.31 c oneopt : 0.00 0.00 0 0 0
1.29/1.31 c padm : 0.00 0.00 0 0 0
1.29/1.31 c proximity : 0.00 0.00 0 0 0
1.29/1.31 c pscostdiving : 0.00 0.00 0 0 0
1.29/1.31 c randrounding : 0.05 0.00 39 0 0
1.29/1.31 c rens : 0.11 0.00 3 0 0
1.29/1.31 c reoptsols : 0.00 0.00 0 0 0
1.29/1.31 c repair : 0.00 0.00 0 0 0
1.29/1.31 c rins : 0.00 0.00 0 0 0
1.29/1.31 c rootsoldiving : 0.00 0.00 0 0 0
1.29/1.31 c rounding : 0.00 0.00 39 0 0
1.29/1.31 c scheduler : 0.00 0.00 0 0 0
1.29/1.31 c shiftandpropagate: 0.01 0.00 3 0 0
1.29/1.31 c shifting : 0.01 0.00 39 0 0
1.29/1.31 c simplerounding : 0.00 0.00 0 0 0
1.29/1.31 c smallcard : 0.00 0.00 0 0 0
1.29/1.31 c subnlp : 0.00 0.00 0 0 0
1.29/1.31 c trivial : 0.00 0.00 6 0 0
1.29/1.31 c trivialnegation : 0.00 0.00 0 0 0
1.29/1.31 c trustregion : 0.00 0.00 0 0 0
1.29/1.31 c trysol : 0.00 0.00 0 0 0
1.29/1.31 c twoopt : 0.00 0.00 0 0 0
1.29/1.31 c undercover : 0.00 0.00 0 0 0
1.29/1.31 c vbounds : 0.00 0.00 3 0 0
1.29/1.31 c veclendiving : 0.00 0.00 0 0 0
1.29/1.31 c zeroobj : 0.00 0.00 0 0 0
1.29/1.31 c zirounding : 0.00 0.00 3 0 0
1.29/1.31 c other solutions : - - - 0 -
1.29/1.31 c LNS (Scheduler) : Calls SetupTime SolveTime SolveNodes Sols Best Exp3 Exp3-IX EpsGreedy UCB TgtFixRate Opt Inf Node Stal Sol Usr Othr Actv
1.29/1.31 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
1.29/1.31 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
1.29/1.31 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
1.29/1.31 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
1.29/1.31 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
1.29/1.31 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
1.29/1.31 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
1.29/1.31 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
1.29/1.31 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
1.29/1.31 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It ItLimit
1.29/1.31 c primal LP : 0.00 1 0 0.00 - 0.00 1
1.29/1.31 c dual LP : 0.03 38 1152 30.32 44051.85 0.00 0
1.29/1.31 c lex dual LP : 0.00 0 0 0.00 -
1.29/1.31 c barrier LP : 0.00 0 0 0.00 - 0.00 0
1.29/1.31 c resolve instable : 0.00 0 0 0.00 -
1.29/1.31 c diving/probing LP: 0.02 26 1086 41.77 50291.75
1.29/1.31 c strong branching : 0.04 24 1641 68.38 44124.76 - - 0
1.29/1.31 c (at root node) : - 24 1641 68.38 -
1.29/1.31 c conflict analysis: 0.00 0 0 0.00 -
1.29/1.31 c B&B Tree :
1.29/1.31 c number of runs : 3
1.29/1.31 c nodes : 1 (0 internal, 1 leaves)
1.29/1.31 c feasible leaves : 0
1.29/1.31 c infeas. leaves : 0
1.29/1.31 c objective leaves : 0
1.29/1.31 c nodes (total) : 3 (0 internal, 3 leaves)
1.29/1.31 c nodes left : 0
1.29/1.31 c max depth : 0
1.29/1.31 c max depth (total): 0
1.29/1.31 c backtracks : 0 (0.0%)
1.29/1.31 c early backtracks : 0 (0.0%)
1.29/1.31 c nodes exc. ref. : 0 (0.0%)
1.29/1.31 c delayed cutoffs : 0
1.29/1.31 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.29/1.31 c avg switch length: 2.00
1.29/1.31 c switching time : 0.00
1.29/1.31 c Root Node :
1.29/1.31 c First LP value : +0.00000000000000e+00
1.29/1.31 c First LP Iters : 194 (97048.52 Iter/sec)
1.29/1.31 c First LP Time : 0.00
1.29/1.31 c Final Dual Bound : -
1.29/1.31 c Final Root Iters : 1417
1.29/1.31 c Root LP Estimate : -
1.29/1.31 c Solution :
1.29/1.31 c Solutions found : 0 (0 improvements)
1.29/1.31 c Primal Bound : infeasible
1.29/1.31 c Dual Bound : -
1.29/1.31 c Gap : 0.00 %
1.29/1.31 c Integrals : Total Avg%
1.29/1.31 c primal-dual : - - (problem infeasible)
1.29/1.31 c primal-ref : - - (problem infeasible)
1.29/1.31 c dual-ref : - - (problem infeasible)
1.29/1.32 c Time complete: 1.31634.