0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik 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-2667483-1276407601.opb>
0.00/0.04 c original problem has 372 variables (372 bin, 0 int, 0 impl, 0 cont) and 772 constraints
0.00/0.04 c problem read
0.00/0.04 c presolving settings loaded
0.04/0.05 o 372
0.04/0.05 c feasible solution found by trivial heuristic, objective value 3.720000e+02
0.04/0.05 c presolving:
0.04/0.06 c (round 1) 5 del vars, 128 del conss, 5 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 6 impls, 0 clqs
0.04/0.08 c (round 2) 5 del vars, 147 del conss, 5 chg bounds, 3 chg sides, 0 chg coeffs, 0 upgd conss, 6 impls, 0 clqs
0.09/0.10 c (round 3) 5 del vars, 262 del conss, 5 chg bounds, 3 chg sides, 0 chg coeffs, 622 upgd conss, 6 impls, 0 clqs
0.09/0.10 c (round 4) 5 del vars, 264 del conss, 5 chg bounds, 3 chg sides, 0 chg coeffs, 625 upgd conss, 6 impls, 0 clqs
0.09/0.11 c (0.1s) probing: 101/367 (27.5%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.09/0.11 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.09/0.11 c presolving (5 rounds):
0.09/0.11 c 5 deleted vars, 264 deleted constraints, 5 tightened bounds, 0 added holes, 3 changed sides, 0 changed coefficients
0.09/0.11 c 6 implications, 0 cliques
0.09/0.11 c presolved problem has 367 variables (367 bin, 0 int, 0 impl, 0 cont) and 508 constraints
0.09/0.11 c 508 constraints of type <logicor>
0.09/0.11 c transformed objective value is always integral (scale: 1)
0.09/0.11 c Presolving Time: 0.05
0.09/0.11 c - non default parameters ----------------------------------------------------------------------
0.09/0.11 c # SCIP version 1.2.1.2
0.09/0.11 c
0.09/0.11 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.11 c conflict/interconss = 0
0.09/0.11 c
0.09/0.11 c # should binary conflicts be preferred?
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c conflict/preferbinary = TRUE
0.09/0.11 c
0.09/0.11 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.11 c constraints/agelimit = 1
0.09/0.11 c
0.09/0.11 c # should enforcement of pseudo solution be disabled?
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/disableenfops = TRUE
0.09/0.11 c
0.09/0.11 c # frequency for displaying node information lines
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.11 c display/freq = 10000
0.09/0.11 c
0.09/0.11 c # maximal time in seconds to run
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/time = 1799.97
0.09/0.11 c
0.09/0.11 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/memory = 1620
0.09/0.11 c
0.09/0.11 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.11 c lp/solvefreq = 0
0.09/0.11 c
0.09/0.11 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.09/0.11 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.11 c lp/pricing = a
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify inequalities
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/linear/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify knapsacks
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # priority of node selection rule <dfs> in standard mode
0.09/0.11 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.11 c nodeselection/dfs/stdpriority = 1000000
0.09/0.11 c
0.09/0.11 c -----------------------------------------------------------------------------------------------
0.09/0.11 c start solving
0.09/0.11 c
0.09/0.11 o 349
0.09/0.11 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.11 c t 0.1s| 1 | 0 | 0 | - |1919k| 0 | - | 367 | 508 | 0 | 0 | 0 | 0 | 0 | -- | 3.490000e+02 | Inf
0.09/0.12 o 34
0.09/0.12 c b 0.1s| 1 | 0 | 0 | - |2704k| 0 | - | 367 | 508 | 367 | 508 | 0 | 0 | 0 | -- | 3.400000e+01 | Inf
0.09/0.14 c 0.1s| 1 | 0 | 170 | - |2700k| 0 | 53 | 367 | 508 | 367 | 508 | 0 | 0 | 0 | 2.475000e+01 | 3.400000e+01 | 37.37%
0.29/0.32 c 0.2s| 1 | 0 | 223 | - |3419k| 0 | 61 | 367 | 508 | 367 | 513 | 5 | 0 | 0 | 2.500000e+01 | 3.400000e+01 | 36.00%
0.49/0.57 c 0.5s| 1 | 0 | 252 | - |4443k| 0 | 60 | 367 | 508 | 367 | 517 | 9 | 0 | 0 | 2.500000e+01 | 3.400000e+01 | 36.00%
0.79/0.83 c 0.8s| 1 | 0 | 286 | - |4752k| 0 | 57 | 367 | 508 | 367 | 518 | 10 | 0 | 0 | 2.500000e+01 | 3.400000e+01 | 36.00%
1.00/1.06 c 1.0s| 1 | 0 | 326 | - |4886k| 0 | 57 | 367 | 508 | 367 | 520 | 12 | 0 | 0 | 2.500000e+01 | 3.400000e+01 | 36.00%
1.19/1.27 c 1.2s| 1 | 0 | 358 | - |4930k| 0 | 55 | 367 | 508 | 367 | 521 | 13 | 0 | 0 | 2.500000e+01 | 3.400000e+01 | 36.00%
1.39/1.49 c 1.4s| 1 | 0 | 387 | - |4966k| 0 | 57 | 367 | 508 | 367 | 522 | 14 | 0 | 0 | 2.500000e+01 | 3.400000e+01 | 36.00%
1.59/1.61 o 26
1.59/1.61 c E 1.5s| 1 | 0 | 387 | - |4970k| 0 | 57 | 367 | 508 | 367 | 522 | 14 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%
1.59/1.61 c 1.5s| 1 | 0 | 387 | - |4970k| 0 | 57 | 367 | 508 | 367 | 522 | 14 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%
1.79/1.83 c 1.7s| 1 | 0 | 427 | - |4819k| 0 | 61 | 367 | 380 | 367 | 332 | 15 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.49/2.53 c 2.4s| 1 | 0 | 427 | - |4819k| 0 | - | 367 | 380 | 367 | 332 | 15 | 0 | 37 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.49/2.53 c (run 1, node 1) restarting after 178 global fixings of integer variables
2.49/2.53 c
2.49/2.53 c (restart) converted 15 cuts from the global cut pool into linear constraints
2.49/2.53 c
2.49/2.54 c presolving:
2.49/2.54 c (round 1) 178 del vars, 89 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 8 impls, 0 clqs
2.49/2.55 c (round 2) 179 del vars, 97 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 13 upgd conss, 8 impls, 0 clqs
2.49/2.56 c presolving (3 rounds):
2.49/2.56 c 179 deleted vars, 97 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.49/2.56 c 8 implications, 0 cliques
2.49/2.56 c presolved problem has 188 variables (188 bin, 0 int, 0 impl, 0 cont) and 298 constraints
2.49/2.56 c 9 constraints of type <knapsack>
2.49/2.56 c 289 constraints of type <logicor>
2.49/2.56 c transformed objective value is always integral (scale: 1)
2.49/2.56 c Presolving Time: 0.07
2.49/2.56 c
2.49/2.59 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.49/2.59 c 2.5s| 1 | 0 | 770 | - |2271k| 0 | 46 | 188 | 298 | 188 | 298 | 0 | 0 | 37 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.59/2.67 c 2.5s| 1 | 0 | 814 | - |2360k| 0 | 52 | 188 | 273 | 188 | 263 | 2 | 0 | 37 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.69/2.78 c 2.6s| 1 | 0 | 814 | - |2360k| 0 | - | 188 | 273 | 188 | 263 | 2 | 0 | 73 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.69/2.78 c (run 2, node 1) restarting after 42 global fixings of integer variables
2.69/2.78 c
2.69/2.78 c (restart) converted 2 cuts from the global cut pool into linear constraints
2.69/2.78 c
2.69/2.78 c presolving:
2.69/2.79 c (round 1) 42 del vars, 19 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2 upgd conss, 18 impls, 0 clqs
2.69/2.79 c (round 2) 42 del vars, 20 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2 upgd conss, 18 impls, 0 clqs
2.79/2.80 c (round 3) 44 del vars, 23 del conss, 0 chg bounds, 4 chg sides, 4 chg coeffs, 2 upgd conss, 18 impls, 0 clqs
2.79/2.80 c presolving (4 rounds):
2.79/2.80 c 44 deleted vars, 23 deleted constraints, 0 tightened bounds, 0 added holes, 4 changed sides, 4 changed coefficients
2.79/2.80 c 18 implications, 0 cliques
2.79/2.80 c presolved problem has 144 variables (144 bin, 0 int, 0 impl, 0 cont) and 252 constraints
2.79/2.80 c 11 constraints of type <knapsack>
2.79/2.80 c 241 constraints of type <logicor>
2.79/2.80 c transformed objective value is always integral (scale: 1)
2.79/2.80 c Presolving Time: 0.09
2.79/2.80 c
2.79/2.82 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.79/2.82 c 2.7s| 1 | 0 | 1019 | - |2165k| 0 | 50 | 144 | 252 | 144 | 252 | 0 | 0 | 73 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.89/2.90 c 2.7s| 1 | 0 | 1035 | - |2535k| 0 | 46 | 144 | 241 | 144 | 224 | 3 | 0 | 73 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.99/3.03 c 2.9s| 1 | 0 | 1035 | - |2535k| 0 | - | 144 | 241 | 144 | 224 | 3 | 0 | 112 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.99/3.03 c (run 3, node 1) restarting after 29 global fixings of integer variables
2.99/3.03 c
2.99/3.03 c (restart) converted 3 cuts from the global cut pool into linear constraints
2.99/3.03 c
2.99/3.04 c presolving:
2.99/3.04 c (round 1) 29 del vars, 32 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 3 upgd conss, 20 impls, 0 clqs
2.99/3.05 c (round 2) 29 del vars, 57 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 3 upgd conss, 20 impls, 0 clqs
2.99/3.05 c presolving (3 rounds):
2.99/3.05 c 29 deleted vars, 57 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.99/3.05 c 20 implications, 0 cliques
2.99/3.05 c presolved problem has 115 variables (115 bin, 0 int, 0 impl, 0 cont) and 187 constraints
2.99/3.05 c 14 constraints of type <knapsack>
2.99/3.05 c 173 constraints of type <logicor>
2.99/3.05 c transformed objective value is always integral (scale: 1)
2.99/3.05 c Presolving Time: 0.10
2.99/3.05 c
2.99/3.06 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.99/3.06 c 2.9s| 1 | 0 | 1193 | - |2081k| 0 | 20 | 115 | 187 | 115 | 187 | 0 | 0 | 112 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.99/3.10 c 2.9s| 1 | 0 | 1222 | - |2142k| 0 | 39 | 115 | 187 | 115 | 189 | 2 | 0 | 112 | 2.500000e+01 | 2.600000e+01 | 4.00%
3.09/3.14 c 3.0s| 1 | 0 | 1240 | - |2142k| 0 | 47 | 115 | 186 | 115 | 189 | 2 | 0 | 129 | 2.500000e+01 | 2.600000e+01 | 4.00%
3.09/3.16 c 3.0s| 1 | 0 | 1256 | - |2141k| 0 | 45 | 115 | 183 | 115 | 189 | 2 | 0 | 136 | 2.500000e+01 | 2.600000e+01 | 4.00%
3.09/3.19 c 3.0s| 1 | 0 | 1291 | - |2139k| 0 | 41 | 115 | 179 | 115 | 189 | 2 | 0 | 145 | 2.500000e+01 | 2.600000e+01 | 4.00%
3.19/3.21 c 3.0s| 1 | 0 | 1339 | - |2138k| 0 | 0 | 115 | 175 | 115 | 189 | 2 | 0 | 151 | 2.500000e+01 | 2.600000e+01 | 4.00%
3.19/3.21 c (run 4, node 1) restarting after 21 global fixings of integer variables
3.19/3.21 c
3.19/3.21 c (restart) converted 2 cuts from the global cut pool into linear constraints
3.19/3.21 c
3.19/3.21 c presolving:
3.19/3.22 c (round 1) 21 del vars, 31 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2 upgd conss, 34 impls, 0 clqs
3.19/3.22 c (round 2) 23 del vars, 32 del conss, 0 chg bounds, 2 chg sides, 3 chg coeffs, 2 upgd conss, 34 impls, 0 clqs
3.19/3.22 c (round 3) 23 del vars, 51 del conss, 0 chg bounds, 2 chg sides, 3 chg coeffs, 2 upgd conss, 34 impls, 0 clqs
3.19/3.23 c (round 4) 24 del vars, 52 del conss, 0 chg bounds, 2 chg sides, 3 chg coeffs, 2 upgd conss, 34 impls, 0 clqs
3.19/3.23 c presolving (5 rounds):
3.19/3.23 c 24 deleted vars, 52 deleted constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 3 changed coefficients
3.19/3.23 c 34 implications, 0 cliques
3.19/3.23 c presolved problem has 91 variables (91 bin, 0 int, 0 impl, 0 cont) and 126 constraints
3.19/3.23 c 14 constraints of type <knapsack>
3.19/3.23 c 1 constraints of type <setppc>
3.19/3.23 c 111 constraints of type <logicor>
3.19/3.23 c transformed objective value is always integral (scale: 1)
3.19/3.23 c Presolving Time: 0.11
3.19/3.23 c
3.19/3.24 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.19/3.24 c 3.0s| 1 | 0 | 1450 | - |2013k| 0 | 0 | 91 | 126 | 91 | 126 | 0 | 0 | 151 | 2.500000e+01 | 2.600000e+01 | 4.00%
3.19/3.24 c 3.0s| 1 | 0 | 1450 | - |2013k| 0 | 0 | 91 | 126 | 91 | 126 | 0 | 0 | 151 | 2.500000e+01 | 2.600000e+01 | 4.00%
3.19/3.24 c (run 5, node 1) restarting after 5 global fixings of integer variables
3.19/3.24 c
3.19/3.24 c presolving:
3.19/3.24 c (round 1) 5 del vars, 2 del conss, 0 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 38 impls, 0 clqs
3.19/3.25 c (round 2) 8 del vars, 6 del conss, 0 chg bounds, 4 chg sides, 4 chg coeffs, 0 upgd conss, 38 impls, 0 clqs
3.19/3.25 c (round 3) 8 del vars, 17 del conss, 0 chg bounds, 4 chg sides, 4 chg coeffs, 0 upgd conss, 38 impls, 0 clqs
3.19/3.26 c (round 4) 10 del vars, 21 del conss, 0 chg bounds, 4 chg sides, 4 chg coeffs, 0 upgd conss, 38 impls, 0 clqs
3.19/3.26 c presolving (5 rounds):
3.19/3.26 c 10 deleted vars, 21 deleted constraints, 0 tightened bounds, 0 added holes, 4 changed sides, 4 changed coefficients
3.19/3.26 c 38 implications, 0 cliques
3.19/3.26 c presolved problem has 81 variables (81 bin, 0 int, 0 impl, 0 cont) and 105 constraints
3.19/3.26 c 14 constraints of type <knapsack>
3.19/3.26 c 1 constraints of type <setppc>
3.19/3.26 c 90 constraints of type <logicor>
3.19/3.26 c transformed objective value is always integral (scale: 1)
3.19/3.26 c Presolving Time: 0.12
3.19/3.26 c
3.19/3.26 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.19/3.26 c 3.1s| 1 | 0 | 1561 | - |1983k| 0 | 0 | 81 | 105 | 81 | 105 | 0 | 0 | 151 | 2.500000e+01 | 2.600000e+01 | 4.00%
3.19/3.26 c 3.1s| 1 | 0 | 1561 | - |1973k| 0 | 0 | 81 | 90 | 81 | 77 | 0 | 0 | 151 | 2.500000e+01 | 2.600000e+01 | 4.00%
3.19/3.26 c (run 6, node 1) restarting after 34 global fixings of integer variables
3.19/3.26 c
3.19/3.27 c presolving:
3.19/3.27 c (round 1) 34 del vars, 24 del conss, 0 chg bounds, 21 chg sides, 64 chg coeffs, 0 upgd conss, 54 impls, 0 clqs
3.19/3.28 c (round 2) 36 del vars, 66 del conss, 0 chg bounds, 180 chg sides, 271 chg coeffs, 0 upgd conss, 54 impls, 0 clqs
3.19/3.28 c (round 3) 36 del vars, 79 del conss, 0 chg bounds, 180 chg sides, 271 chg coeffs, 0 upgd conss, 54 impls, 0 clqs
3.19/3.29 c (round 4) 37 del vars, 79 del conss, 0 chg bounds, 180 chg sides, 271 chg coeffs, 0 upgd conss, 54 impls, 0 clqs
3.19/3.29 c presolving (5 rounds):
3.19/3.29 c 37 deleted vars, 79 deleted constraints, 0 tightened bounds, 0 added holes, 180 changed sides, 271 changed coefficients
3.19/3.29 c 54 implications, 0 cliques
3.19/3.29 c presolved problem has 44 variables (44 bin, 0 int, 0 impl, 0 cont) and 58 constraints
3.19/3.29 c 5 constraints of type <knapsack>
3.19/3.29 c 11 constraints of type <setppc>
3.19/3.29 c 42 constraints of type <logicor>
3.19/3.29 c transformed objective value is always integral (scale: 1)
3.19/3.29 c Presolving Time: 0.13
3.19/3.29 c
3.19/3.29 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.19/3.29 c 3.1s| 1 | 0 | 1594 | - |1876k| 0 | 0 | 44 | 58 | 44 | 58 | 0 | 0 | 151 | 2.500000e+01 | 2.600000e+01 | 4.00%
3.19/3.29 c 3.1s| 1 | 0 | 1594 | - |1868k| 0 | 0 | 44 | 43 | 44 | 43 | 0 | 0 | 151 | 2.500000e+01 | 2.600000e+01 | 4.00%
3.19/3.29 c (run 7, node 1) restarting after 20 global fixings of integer variables
3.19/3.29 c
3.19/3.29 c presolving:
3.19/3.30 c (round 1) 20 del vars, 12 del conss, 0 chg bounds, 10 chg sides, 12 chg coeffs, 0 upgd conss, 54 impls, 0 clqs
3.19/3.30 c (round 2) 21 del vars, 13 del conss, 0 chg bounds, 10 chg sides, 12 chg coeffs, 0 upgd conss, 54 impls, 0 clqs
3.19/3.30 c presolving (3 rounds):
3.19/3.30 c 21 deleted vars, 13 deleted constraints, 0 tightened bounds, 0 added holes, 10 changed sides, 12 changed coefficients
3.19/3.30 c 54 implications, 0 cliques
3.19/3.30 c presolved problem has 23 variables (23 bin, 0 int, 0 impl, 0 cont) and 32 constraints
3.19/3.30 c 3 constraints of type <knapsack>
3.19/3.30 c 5 constraints of type <setppc>
3.19/3.30 c 24 constraints of type <logicor>
3.19/3.30 c transformed objective value is always integral (scale: 1)
3.19/3.30 c Presolving Time: 0.13
3.19/3.30 c
3.19/3.30 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.19/3.30 c 3.1s| 1 | 0 | 1610 | - |1841k| 0 | 0 | 23 | 32 | 23 | 32 | 0 | 0 | 151 | 2.500000e+01 | 2.600000e+01 | 4.00%
3.30/3.30 c 3.1s| 1 | 0 | 1610 | - |1838k| 0 | 0 | 23 | 26 | 23 | 28 | 0 | 0 | 151 | 2.500000e+01 | 2.600000e+01 | 4.00%
3.30/3.30 c (run 8, node 1) restarting after 6 global fixings of integer variables
3.30/3.30 c
3.30/3.31 c presolving:
3.30/3.31 c (round 1) 6 del vars, 1 del conss, 0 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 80 impls, 0 clqs
3.30/3.31 c (round 2) 6 del vars, 2 del conss, 0 chg bounds, 1 chg sides, 3 chg coeffs, 0 upgd conss, 80 impls, 0 clqs
3.30/3.31 c presolving (3 rounds):
3.30/3.31 c 6 deleted vars, 2 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 3 changed coefficients
3.30/3.31 c 80 implications, 0 cliques
3.30/3.31 c presolved problem has 17 variables (17 bin, 0 int, 0 impl, 0 cont) and 24 constraints
3.30/3.31 c 2 constraints of type <knapsack>
3.30/3.31 c 3 constraints of type <setppc>
3.30/3.31 c 19 constraints of type <logicor>
3.30/3.31 c transformed objective value is always integral (scale: 1)
3.30/3.31 c Presolving Time: 0.13
3.30/3.31 c
3.30/3.31 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.30/3.31 c 3.1s| 1 | 0 | 1625 | - |1833k| 0 | 0 | 17 | 24 | 17 | 24 | 0 | 0 | 151 | 2.500000e+01 | 2.600000e+01 | 4.00%
3.30/3.32 c 3.1s| 1 | 0 | 1625 | - |1831k| 0 | 0 | 17 | 22 | 17 | 22 | 0 | 0 | 151 | 2.500000e+01 | 2.600000e+01 | 4.00%
3.30/3.32 c (run 9, node 1) restarting after 3 global fixings of integer variables
3.30/3.32 c
3.30/3.32 c presolving:
3.30/3.32 c (round 1) 3 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 88 impls, 0 clqs
3.30/3.32 c (round 2) 4 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 0 upgd conss, 88 impls, 0 clqs
3.30/3.33 c (round 3) 4 del vars, 3 del conss, 0 chg bounds, 2 chg sides, 6 chg coeffs, 0 upgd conss, 88 impls, 0 clqs
3.30/3.33 c presolving (4 rounds):
3.30/3.33 c 4 deleted vars, 3 deleted constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 6 changed coefficients
3.30/3.33 c 88 implications, 0 cliques
3.30/3.33 c presolved problem has 13 variables (13 bin, 0 int, 0 impl, 0 cont) and 21 constraints
3.30/3.33 c 1 constraints of type <knapsack>
3.30/3.33 c 4 constraints of type <setppc>
3.30/3.33 c 16 constraints of type <logicor>
3.30/3.33 c transformed objective value is always integral (scale: 1)
3.30/3.33 c Presolving Time: 0.14
3.30/3.33 c
3.30/3.33 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.30/3.33 c 3.1s| 1 | 0 | 1637 | - |1828k| 0 | 0 | 13 | 21 | 13 | 21 | 0 | 0 | 151 | 2.500000e+01 | 2.600000e+01 | 4.00%
3.30/3.33 c 3.1s| 1 | 0 | 1637 | - |1826k| 0 | 0 | 13 | 18 | 13 | 18 | 0 | 0 | 151 | 2.500000e+01 | 2.600000e+01 | 4.00%
3.30/3.33 c (run 10, node 1) restarting after 2 global fixings of integer variables
3.30/3.33 c
3.30/3.33 c presolving:
3.30/3.33 c (round 1) 2 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 88 impls, 0 clqs
3.30/3.34 c presolving (2 rounds):
3.30/3.34 c 2 deleted vars, 1 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
3.30/3.34 c 88 implications, 0 cliques
3.30/3.34 c presolved problem has 11 variables (11 bin, 0 int, 0 impl, 0 cont) and 17 constraints
3.30/3.34 c 1 constraints of type <knapsack>
3.30/3.34 c 2 constraints of type <setppc>
3.30/3.34 c 14 constraints of type <logicor>
3.30/3.34 c transformed objective value is always integral (scale: 1)
3.30/3.34 c Presolving Time: 0.14
3.30/3.34 c
3.30/3.34 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.30/3.34 c 3.1s| 1 | 0 | 1646 | - |1824k| 0 | 0 | 11 | 17 | 11 | 17 | 0 | 0 | 151 | 2.500000e+01 | 2.600000e+01 | 4.00%
3.30/3.34 o 25
3.30/3.34 c * 3.1s| 1 | 0 | 1646 | - |1828k| 0 | - | 11 | 17 | 11 | 17 | 0 | 0 | 151 | 2.500000e+01 | 2.500000e+01 | 0.00%
3.30/3.34 c
3.30/3.34 c SCIP Status : problem is solved [optimal solution found]
3.30/3.34 c Solving Time (sec) : 3.10
3.30/3.34 c Solving Nodes : 1 (total of 11 nodes in 11 runs)
3.30/3.34 c Primal Bound : +2.50000000000000e+01 (6 solutions)
3.30/3.34 c Dual Bound : +2.50000000000000e+01
3.30/3.34 c Gap : 0.00 %
3.30/3.34 s OPTIMUM FOUND
3.30/3.34 v -x372 -x371 x370 -x369 -x368 -x367 x366 x365 -x364 -x363 -x362 -x361 x360 -x359 -x358 -x357 -x356 -x355 -x354 -x353 -x352 -x351
3.30/3.34 v -x350 -x349 -x348 -x347 -x346 -x345 -x344 -x343 -x342 -x341 x340 -x339 -x338 -x337 -x336 -x335 -x334 -x333 -x332 -x331 x330
3.30/3.34 v -x329 -x328 x327 -x326 -x325 -x324 x323 x322 -x321 x320 -x319 -x318 -x317 -x316 -x315 x314 -x313 -x312 -x311 -x310 -x309 -x308
3.30/3.34 v -x307 -x306 -x305 -x304 -x303 -x302 -x301 -x300 -x299 -x298 -x297 -x296 x295 -x294 -x293 -x292 -x291 -x290 -x289 -x288 x287
3.30/3.34 v -x286 -x285 -x284 -x283 -x282 -x281 -x280 -x279 -x278 -x277 -x276 -x275 -x274 -x273 -x272 -x271 -x270 -x269 -x268 -x267 -x266
3.30/3.34 v x265 -x264 -x263 -x262 -x261 -x260 -x259 -x258 -x257 -x256 -x255 -x254 -x253 -x252 -x251 -x250 -x249 -x248 -x247 -x246 -x245
3.30/3.34 v -x244 -x243 -x242 -x241 -x240 -x239 -x238 -x237 -x236 x235 -x234 -x233 -x232 -x231 -x230 -x229 -x228 -x227 -x226 -x225 -x224
3.30/3.34 v -x223 -x222 -x221 -x220 -x219 -x218 -x217 x216 -x215 x214 -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203
3.30/3.34 v -x202 -x201 -x200 -x199 -x198 -x197 -x196 -x195 x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 -x182
3.30/3.34 v -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161
3.30/3.34 v -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140
3.30/3.34 v -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 x120 -x119
3.30/3.34 v -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 x103 -x102 -x101 -x100 -x99 -x98
3.30/3.34 v -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72
3.30/3.34 v -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 x53 -x52 -x51 -x50 -x49 -x48 -x47
3.30/3.34 v -x46 -x45 -x44 x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22
3.30/3.34 v -x21 -x20 -x19 -x18 x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
3.30/3.34 c SCIP Status : problem is solved [optimal solution found]
3.30/3.34 c Solving Time : 3.10
3.30/3.34 c Original Problem :
3.30/3.34 c Problem name : HOME/instance-2667483-1276407601.opb
3.30/3.34 c Variables : 372 (372 binary, 0 integer, 0 implicit integer, 0 continuous)
3.30/3.34 c Constraints : 772 initial, 772 maximal
3.30/3.34 c Presolved Problem :
3.30/3.34 c Problem name : t_HOME/instance-2667483-1276407601.opb
3.30/3.34 c Variables : 11 (11 binary, 0 integer, 0 implicit integer, 0 continuous)
3.30/3.34 c Constraints : 17 initial, 17 maximal
3.30/3.34 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.30/3.34 c trivial : 0.00 340 0 0 0 0 0 0 0
3.30/3.34 c dualfix : 0.00 16 0 0 0 0 0 0 0
3.30/3.34 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.30/3.34 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.30/3.34 c implics : 0.00 0 0 0 0 0 0 0 0
3.30/3.34 c probing : 0.00 0 0 0 0 0 0 0 0
3.30/3.34 c knapsack : 0.06 0 0 0 0 0 13 203 303
3.30/3.34 c setppc : 0.00 0 0 0 0 0 38 0 0
3.30/3.34 c linear : 0.03 5 0 0 5 0 149 3 0
3.30/3.34 c logicor : 0.04 0 0 0 0 0 412 0 0
3.30/3.34 c root node : - 340 - - 340 - - - -
3.30/3.34 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.30/3.34 c integral : 0 0 0 15 0 0 32 0 0 0
3.30/3.34 c knapsack : 1 10 23 0 0 0 0 0 0 0
3.30/3.34 c setppc : 2 7 13 0 0 0 0 0 0 0
3.30/3.34 c logicor : 14 17 107 8 0 0 22 0 0 0
3.30/3.34 c countsols : 0 0 0 8 0 0 0 0 0 0
3.30/3.34 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.30/3.34 c integral : 1.02 0.00 0.00 1.02 0.00
3.30/3.34 c knapsack : 0.04 0.04 0.00 0.00 0.00
3.30/3.34 c setppc : 0.00 0.00 0.00 0.00 0.00
3.30/3.34 c logicor : 0.01 0.01 0.00 0.00 0.00
3.30/3.34 c countsols : 0.00 0.00 0.00 0.00 0.00
3.30/3.34 c Propagators : Time Calls Cutoffs DomReds
3.30/3.34 c vbounds : 0.00 12 0 0
3.30/3.34 c rootredcost : 0.00 0 0 0
3.30/3.34 c pseudoobj : 0.00 38 0 0
3.30/3.34 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.30/3.34 c propagation : 0.00 0 0 0 0.0 0 0.0 -
3.30/3.34 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.30/3.34 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.30/3.34 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.30/3.34 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.30/3.34 c applied globally : - - - 0 0.0 - - -
3.30/3.34 c applied locally : - - - 0 0.0 - - -
3.30/3.34 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.30/3.34 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
3.30/3.34 c redcost : 0.00 17 0 286 0 0
3.30/3.34 c impliedbounds : 0.01 10 0 0 0 0
3.30/3.34 c intobj : 0.00 0 0 0 0 0
3.30/3.34 c cgmip : 0.00 0 0 0 0 0
3.30/3.34 c gomory : 0.72 10 0 0 1513 0
3.30/3.34 c strongcg : 0.67 10 0 0 1758 0
3.30/3.34 c cmir : 0.08 10 0 0 0 0
3.30/3.34 c flowcover : 0.11 10 0 0 0 0
3.30/3.34 c clique : 0.01 4 0 0 0 0
3.30/3.34 c zerohalf : 0.00 0 0 0 0 0
3.30/3.34 c mcf : 0.00 4 0 0 0 0
3.30/3.34 c rapidlearning : 0.00 0 0 0 0 0
3.30/3.34 c Pricers : Time Calls Vars
3.30/3.34 c problem variables: 0.00 0 0
3.30/3.34 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.30/3.34 c relpscost : 1.02 7 0 32 0 0 0
3.30/3.34 c pscost : 0.00 0 0 0 0 0 0
3.30/3.34 c inference : 0.00 0 0 0 0 0 0
3.30/3.34 c mostinf : 0.00 0 0 0 0 0 0
3.30/3.34 c leastinf : 0.00 0 0 0 0 0 0
3.30/3.34 c fullstrong : 0.00 0 0 0 0 0 0
3.30/3.34 c allfullstrong : 0.00 0 0 0 0 0 0
3.30/3.34 c random : 0.00 0 0 0 0 0 0
3.30/3.34 c Primal Heuristics : Time Calls Found
3.30/3.34 c LP solutions : 0.00 - 1
3.30/3.34 c pseudo solutions : 0.00 - 0
3.30/3.34 c oneopt : 0.00 3 1
3.30/3.34 c trivial : 0.01 2 3
3.30/3.34 c simplerounding : 0.00 17 0
3.30/3.34 c zirounding : 0.00 1 0
3.30/3.34 c rounding : 0.00 17 0
3.30/3.34 c shifting : 0.02 17 0
3.30/3.34 c intshifting : 0.00 0 0
3.30/3.34 c twoopt : 0.00 0 0
3.30/3.34 c fixandinfer : 0.00 0 0
3.30/3.34 c feaspump : 0.00 0 0
3.30/3.34 c coefdiving : 0.00 0 0
3.30/3.34 c pscostdiving : 0.00 0 0
3.30/3.34 c fracdiving : 0.00 0 0
3.30/3.34 c veclendiving : 0.00 0 0
3.30/3.34 c intdiving : 0.00 0 0
3.30/3.34 c actconsdiving : 0.00 0 0
3.30/3.34 c objpscostdiving : 0.00 0 0
3.30/3.34 c rootsoldiving : 0.00 0 0
3.30/3.34 c linesearchdiving : 0.00 0 0
3.30/3.34 c guideddiving : 0.00 0 0
3.30/3.34 c octane : 0.00 0 0
3.30/3.34 c rens : 0.10 1 1
3.30/3.34 c rins : 0.00 0 0
3.30/3.34 c localbranching : 0.00 0 0
3.30/3.34 c mutation : 0.00 0 0
3.30/3.34 c crossover : 0.00 0 0
3.30/3.34 c dins : 0.00 0 0
3.30/3.34 c undercover : 0.00 0 0
3.30/3.34 c nlp : 0.00 0 0
3.30/3.34 c trysol : 0.00 0 0
3.30/3.34 c LP : Time Calls Iterations Iter/call Iter/sec
3.30/3.34 c primal LP : 0.00 0 0 0.00 -
3.30/3.34 c dual LP : 0.13 25 1646 65.84 12661.54
3.30/3.34 c lex dual LP : 0.00 0 0 0.00 -
3.30/3.34 c barrier LP : 0.00 0 0 0.00 -
3.30/3.34 c diving/probing LP: 0.00 0 0 0.00 -
3.30/3.34 c strong branching : 1.02 151 8333 55.19 8169.61
3.30/3.34 c (at root node) : - 151 8333 55.19 -
3.30/3.34 c conflict analysis: 0.00 0 0 0.00 -
3.30/3.34 c B&B Tree :
3.30/3.34 c number of runs : 11
3.30/3.34 c nodes : 1
3.30/3.34 c nodes (total) : 11
3.30/3.34 c nodes left : 0
3.30/3.34 c max depth : 0
3.30/3.34 c max depth (total): 0
3.30/3.34 c backtracks : 0 (0.0%)
3.30/3.34 c delayed cutoffs : 0
3.30/3.34 c repropagations : 0 (0 domain reductions, 0 cutoffs)
3.30/3.34 c avg switch length: 2.00
3.30/3.34 c switching time : 0.00
3.30/3.34 c Solution :
3.30/3.34 c Solutions found : 6 (5 improvements)
3.30/3.34 c First Solution : +3.72000000000000e+02 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
3.30/3.34 c Primal Bound : +2.50000000000000e+01 (in run 11, after 1 nodes, 3.10 seconds, depth 0, found by <relaxation>)
3.30/3.34 c Dual Bound : +2.50000000000000e+01
3.30/3.34 c Gap : 0.00 %
3.30/3.34 c Root Dual Bound : +2.50000000000000e+01
3.30/3.34 c Root Iterations : 1646
3.30/3.35 c Time complete: 3.34.