0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2666053-1276407598.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.00/0.05 o 372
0.00/0.05 c feasible solution found by trivial heuristic, objective value 3.720000e+02
0.00/0.05 c presolving:
0.00/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.00/0.07 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.04
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.13 c 0.1s| 1 | 0 | 109 | - |2700k| 0 | 47 | 367 | 508 | 367 | 508 | 0 | 0 | 0 | 2.475000e+01 | 3.400000e+01 | 37.37%
0.19/0.25 c 0.2s| 1 | 0 | 143 | - |3285k| 0 | 44 | 367 | 508 | 367 | 513 | 5 | 0 | 0 | 2.500000e+01 | 3.400000e+01 | 36.00%
0.39/0.43 c 0.3s| 1 | 0 | 165 | - |3949k| 0 | 42 | 367 | 508 | 367 | 515 | 7 | 0 | 0 | 2.500000e+01 | 3.400000e+01 | 36.00%
0.59/0.66 c 0.6s| 1 | 0 | 191 | - |4500k| 0 | 42 | 367 | 508 | 367 | 518 | 10 | 0 | 0 | 2.500000e+01 | 3.400000e+01 | 36.00%
0.79/0.81 c 0.7s| 1 | 0 | 226 | - |4888k| 0 | 45 | 367 | 508 | 367 | 519 | 11 | 0 | 0 | 2.500000e+01 | 3.400000e+01 | 36.00%
0.89/0.98 c 0.9s| 1 | 0 | 250 | - |5564k| 0 | 51 | 367 | 508 | 367 | 522 | 14 | 0 | 0 | 2.500000e+01 | 3.400000e+01 | 36.00%
1.10/1.17 c 1.1s| 1 | 0 | 269 | - |5775k| 0 | 56 | 367 | 508 | 367 | 523 | 15 | 0 | 0 | 2.500000e+01 | 3.400000e+01 | 36.00%
1.29/1.31 o 26
1.29/1.31 c E 1.2s| 1 | 0 | 269 | - |5780k| 0 | 56 | 367 | 508 | 367 | 523 | 15 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%
1.29/1.32 c 1.2s| 1 | 0 | 269 | - |5780k| 0 | 56 | 367 | 508 | 367 | 523 | 15 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%
1.49/1.50 c 1.4s| 1 | 0 | 278 | - |5766k| 0 | 50 | 367 | 380 | 367 | 333 | 16 | 0 | 0 | 2.500000e+01 | 2.600000e+01 | 4.00%
1.59/1.68 c 1.5s| 1 | 0 | 278 | - |5766k| 0 | - | 367 | 380 | 367 | 333 | 16 | 0 | 33 | 2.500000e+01 | 2.600000e+01 | 4.00%
1.59/1.68 c (run 1, node 1) restarting after 179 global fixings of integer variables
1.59/1.68 c
1.59/1.68 c (restart) converted 16 cuts from the global cut pool into linear constraints
1.59/1.68 c
1.59/1.68 c presolving:
1.59/1.69 c (round 1) 179 del vars, 90 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 8 impls, 0 clqs
1.69/1.70 c (round 2) 180 del vars, 98 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 15 upgd conss, 8 impls, 0 clqs
1.69/1.70 c presolving (3 rounds):
1.69/1.70 c 180 deleted vars, 98 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
1.69/1.70 c 8 implications, 0 cliques
1.69/1.70 c presolved problem has 187 variables (187 bin, 0 int, 0 impl, 0 cont) and 298 constraints
1.69/1.70 c 14 constraints of type <knapsack>
1.69/1.70 c 284 constraints of type <logicor>
1.69/1.70 c transformed objective value is always integral (scale: 1)
1.69/1.70 c Presolving Time: 0.06
1.69/1.71 c
1.69/1.72 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.69/1.72 c 1.6s| 1 | 0 | 396 | - |2270k| 0 | 41 | 187 | 298 | 187 | 298 | 0 | 0 | 33 | 2.500000e+01 | 2.600000e+01 | 4.00%
1.69/1.78 c 1.6s| 1 | 0 | 433 | - |2476k| 0 | 51 | 187 | 270 | 187 | 253 | 5 | 0 | 33 | 2.500000e+01 | 2.600000e+01 | 4.00%
1.89/1.91 c 1.7s| 1 | 0 | 433 | - |2476k| 0 | - | 187 | 270 | 187 | 253 | 5 | 0 | 69 | 2.500000e+01 | 2.600000e+01 | 4.00%
1.89/1.91 c (run 2, node 1) restarting after 47 global fixings of integer variables
1.89/1.91 c
1.89/1.91 c (restart) converted 5 cuts from the global cut pool into linear constraints
1.89/1.91 c
1.89/1.92 c presolving:
1.89/1.92 c (round 1) 47 del vars, 29 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 5 upgd conss, 36 impls, 0 clqs
1.89/1.93 c (round 2) 47 del vars, 40 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 5 upgd conss, 36 impls, 0 clqs
1.89/1.94 c (round 3) 49 del vars, 43 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 5 upgd conss, 36 impls, 0 clqs
1.89/1.94 c presolving (4 rounds):
1.89/1.94 c 49 deleted vars, 43 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.89/1.94 c 36 implications, 0 cliques
1.89/1.94 c presolved problem has 138 variables (138 bin, 0 int, 0 impl, 0 cont) and 232 constraints
1.89/1.94 c 17 constraints of type <knapsack>
1.89/1.94 c 215 constraints of type <logicor>
1.89/1.94 c transformed objective value is always integral (scale: 1)
1.89/1.94 c Presolving Time: 0.07
1.89/1.94 c
1.89/1.95 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.89/1.95 c 1.8s| 1 | 0 | 563 | - |2155k| 0 | 43 | 138 | 232 | 138 | 232 | 0 | 0 | 69 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.00/2.00 c 1.8s| 1 | 0 | 593 | - |2315k| 0 | 49 | 138 | 217 | 138 | 192 | 3 | 0 | 69 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.10/2.12 c 1.9s| 1 | 0 | 593 | - |2315k| 0 | - | 138 | 217 | 138 | 192 | 3 | 0 | 99 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.10/2.12 c (run 3, node 1) restarting after 34 global fixings of integer variables
2.10/2.12 c
2.10/2.12 c (restart) converted 3 cuts from the global cut pool into linear constraints
2.10/2.12 c
2.10/2.12 c presolving:
2.10/2.12 c (round 1) 34 del vars, 40 del conss, 0 chg bounds, 2 chg sides, 70 chg coeffs, 3 upgd conss, 42 impls, 0 clqs
2.10/2.13 c presolving (2 rounds):
2.10/2.13 c 34 deleted vars, 40 deleted constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 70 changed coefficients
2.10/2.13 c 42 implications, 0 cliques
2.10/2.13 c presolved problem has 104 variables (104 bin, 0 int, 0 impl, 0 cont) and 180 constraints
2.10/2.13 c 19 constraints of type <knapsack>
2.10/2.13 c 161 constraints of type <logicor>
2.10/2.13 c transformed objective value is always integral (scale: 1)
2.10/2.13 c Presolving Time: 0.08
2.10/2.13 c
2.10/2.14 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.10/2.14 c 1.9s| 1 | 0 | 682 | - |2073k| 0 | 25 | 104 | 180 | 104 | 180 | 0 | 0 | 99 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.10/2.16 c 2.0s| 1 | 0 | 722 | - |2140k| 0 | 49 | 104 | 180 | 104 | 183 | 3 | 0 | 99 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.20/2.22 c 2.0s| 1 | 0 | 737 | - |2140k| 0 | 47 | 104 | 180 | 104 | 183 | 3 | 0 | 119 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.20/2.28 c 2.1s| 1 | 0 | 758 | - |2139k| 0 | 52 | 104 | 178 | 104 | 183 | 3 | 0 | 143 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.29/2.33 c 2.1s| 1 | 0 | 779 | - |2138k| 0 | 44 | 104 | 177 | 104 | 183 | 3 | 0 | 158 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.29/2.36 c 2.1s| 1 | 0 | 788 | - |2138k| 0 | 42 | 104 | 177 | 104 | 183 | 3 | 0 | 167 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.29/2.37 c 2.1s| 1 | 0 | 788 | - |2138k| 0 | - | 104 | 177 | 104 | 183 | 3 | 0 | 171 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.29/2.37 c (run 4, node 1) restarting after 23 global fixings of integer variables
2.29/2.37 c
2.29/2.37 c (restart) converted 3 cuts from the global cut pool into linear constraints
2.29/2.37 c
2.29/2.37 c presolving:
2.29/2.37 c (round 1) 23 del vars, 29 del conss, 0 chg bounds, 1 chg sides, 1 chg coeffs, 3 upgd conss, 62 impls, 0 clqs
2.29/2.38 c (round 2) 23 del vars, 38 del conss, 0 chg bounds, 1 chg sides, 1 chg coeffs, 3 upgd conss, 62 impls, 0 clqs
2.29/2.38 c (round 3) 25 del vars, 39 del conss, 0 chg bounds, 2 chg sides, 3 chg coeffs, 3 upgd conss, 62 impls, 0 clqs
2.29/2.39 c presolving (4 rounds):
2.29/2.39 c 25 deleted vars, 39 deleted constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 3 changed coefficients
2.29/2.39 c 62 implications, 0 cliques
2.29/2.39 c presolved problem has 79 variables (79 bin, 0 int, 0 impl, 0 cont) and 142 constraints
2.29/2.39 c 21 constraints of type <knapsack>
2.29/2.39 c 1 constraints of type <setppc>
2.29/2.39 c 120 constraints of type <logicor>
2.29/2.39 c transformed objective value is always integral (scale: 1)
2.29/2.39 c Presolving Time: 0.09
2.29/2.39 c
2.29/2.39 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.29/2.39 c 2.1s| 1 | 0 | 859 | - |2032k| 0 | 23 | 79 | 142 | 79 | 142 | 0 | 0 | 171 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.39/2.41 c 2.2s| 1 | 0 | 871 | - |2076k| 0 | 27 | 79 | 142 | 79 | 145 | 3 | 0 | 171 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.39/2.43 c 2.2s| 1 | 0 | 877 | - |2075k| 0 | 0 | 79 | 139 | 79 | 145 | 3 | 0 | 185 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.39/2.43 c (run 5, node 1) restarting after 7 global fixings of integer variables
2.39/2.43 c
2.39/2.43 c (restart) converted 3 cuts from the global cut pool into linear constraints
2.39/2.43 c
2.39/2.43 c presolving:
2.39/2.44 c (round 1) 7 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 3 upgd conss, 72 impls, 0 clqs
2.39/2.44 c (round 2) 7 del vars, 15 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 3 upgd conss, 72 impls, 0 clqs
2.39/2.44 c presolving (3 rounds):
2.39/2.44 c 7 deleted vars, 15 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.39/2.44 c 72 implications, 0 cliques
2.39/2.44 c presolved problem has 72 variables (72 bin, 0 int, 0 impl, 0 cont) and 127 constraints
2.39/2.44 c 23 constraints of type <knapsack>
2.39/2.44 c 1 constraints of type <setppc>
2.39/2.44 c 103 constraints of type <logicor>
2.39/2.44 c transformed objective value is always integral (scale: 1)
2.39/2.44 c Presolving Time: 0.09
2.39/2.45 c
2.39/2.45 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.39/2.45 c 2.2s| 1 | 0 | 964 | - |2014k| 0 | 0 | 72 | 127 | 72 | 127 | 0 | 0 | 185 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.39/2.45 c 2.2s| 1 | 0 | 964 | - |2011k| 0 | 0 | 72 | 123 | 72 | 114 | 0 | 0 | 185 | 2.500000e+01 | 2.600000e+01 | 4.00%
2.39/2.45 o 25
2.39/2.45 c * 2.2s| 1 | 0 | 964 | - |2015k| 0 | - | 72 | 123 | 72 | 114 | 0 | 0 | 185 | 2.500000e+01 | 2.500000e+01 | 0.00%
2.39/2.45 c
2.39/2.45 c SCIP Status : problem is solved [optimal solution found]
2.39/2.45 c Solving Time (sec) : 2.20
2.39/2.45 c Solving Nodes : 1 (total of 6 nodes in 6 runs)
2.39/2.45 c Primal Bound : +2.50000000000000e+01 (6 solutions)
2.39/2.45 c Dual Bound : +2.50000000000000e+01
2.39/2.45 c Gap : 0.00 %
2.39/2.45 s OPTIMUM FOUND
2.39/2.45 v -x372 -x371 x370 -x369 -x368 -x367 x366 x365 -x364 -x363 -x362 -x361 x360 -x359 -x358 -x357 -x356 -x355 -x354 -x353 -x352 -x351
2.39/2.45 v -x350 -x349 -x348 -x347 -x346 -x345 -x344 -x343 -x342 -x341 x340 -x339 -x338 -x337 -x336 -x335 -x334 -x333 -x332 -x331 x330
2.39/2.45 v -x329 -x328 x327 -x326 -x325 -x324 x323 x322 -x321 x320 -x319 -x318 -x317 -x316 -x315 x314 -x313 -x312 -x311 -x310 -x309 -x308
2.39/2.45 v -x307 -x306 -x305 -x304 -x303 -x302 -x301 -x300 -x299 -x298 -x297 -x296 x295 -x294 -x293 -x292 -x291 -x290 -x289 -x288 x287
2.39/2.45 v -x286 -x285 -x284 -x283 -x282 -x281 -x280 -x279 -x278 -x277 -x276 -x275 -x274 -x273 -x272 -x271 -x270 -x269 -x268 -x267 -x266
2.39/2.45 v x265 -x264 -x263 -x262 -x261 -x260 -x259 -x258 -x257 -x256 -x255 -x254 -x253 -x252 -x251 -x250 -x249 -x248 -x247 -x246 -x245
2.39/2.45 v -x244 -x243 -x242 -x241 -x240 -x239 -x238 -x237 -x236 x235 -x234 -x233 -x232 -x231 -x230 -x229 -x228 -x227 -x226 -x225 -x224
2.39/2.45 v -x223 -x222 -x221 -x220 -x219 -x218 -x217 x216 -x215 x214 -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203
2.39/2.45 v -x202 -x201 -x200 -x199 -x198 -x197 -x196 -x195 x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 -x182
2.39/2.45 v -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161
2.39/2.45 v -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140
2.39/2.45 v -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 x120 -x119
2.39/2.45 v -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 x103 -x102 -x101 -x100 -x99 -x98
2.39/2.45 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
2.39/2.45 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
2.39/2.45 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
2.39/2.45 v -x21 -x20 -x19 -x18 x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
2.39/2.45 c SCIP Status : problem is solved [optimal solution found]
2.39/2.45 c Solving Time : 2.20
2.39/2.45 c Original Problem :
2.39/2.45 c Problem name : HOME/instance-2666053-1276407598.opb
2.39/2.45 c Variables : 372 (372 binary, 0 integer, 0 implicit integer, 0 continuous)
2.39/2.45 c Constraints : 772 initial, 772 maximal
2.39/2.45 c Presolved Problem :
2.39/2.45 c Problem name : t_HOME/instance-2666053-1276407598.opb
2.39/2.45 c Variables : 72 (72 binary, 0 integer, 0 implicit integer, 0 continuous)
2.39/2.45 c Constraints : 127 initial, 127 maximal
2.39/2.45 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.39/2.45 c trivial : 0.01 290 0 0 0 0 0 0 0
2.39/2.45 c dualfix : 0.00 5 0 0 0 0 0 0 0
2.39/2.45 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.39/2.45 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.39/2.45 c implics : 0.00 0 0 0 0 0 0 0 0
2.39/2.45 c probing : 0.00 0 0 0 0 0 0 0 0
2.39/2.45 c knapsack : 0.01 0 0 0 0 0 0 4 73
2.39/2.45 c setppc : 0.00 0 0 0 0 0 0 0 0
2.39/2.45 c linear : 0.04 5 0 0 5 0 148 4 0
2.39/2.45 c logicor : 0.02 0 0 0 0 0 351 0 0
2.39/2.45 c root node : - 309 - - 309 - - - -
2.39/2.45 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.39/2.45 c integral : 0 0 0 11 0 0 40 0 0 0
2.39/2.45 c knapsack : 23 5 16 0 0 0 0 2 0 0
2.39/2.45 c setppc : 1 2 6 0 0 0 0 0 0 0
2.39/2.45 c logicor : 103 12 101 2 0 0 4 0 0 0
2.39/2.45 c countsols : 0 0 0 2 0 0 0 0 0 0
2.39/2.45 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.39/2.45 c integral : 0.58 0.00 0.00 0.58 0.00
2.39/2.45 c knapsack : 0.04 0.04 0.00 0.00 0.00
2.39/2.45 c setppc : 0.00 0.00 0.00 0.00 0.00
2.39/2.45 c logicor : 0.00 0.00 0.00 0.00 0.00
2.39/2.45 c countsols : 0.00 0.00 0.00 0.00 0.00
2.39/2.45 c Propagators : Time Calls Cutoffs DomReds
2.39/2.45 c vbounds : 0.00 7 0 0
2.39/2.45 c rootredcost : 0.00 0 0 0
2.39/2.45 c pseudoobj : 0.00 26 0 0
2.39/2.45 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.39/2.45 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.39/2.45 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.45 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.45 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.45 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.39/2.45 c applied globally : - - - 0 0.0 - - -
2.39/2.45 c applied locally : - - - 0 0.0 - - -
2.39/2.45 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.39/2.45 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
2.39/2.45 c redcost : 0.00 12 0 265 0 0
2.39/2.45 c impliedbounds : 0.00 11 0 0 0 0
2.39/2.45 c intobj : 0.00 0 0 0 0 0
2.39/2.45 c cgmip : 0.00 0 0 0 0 0
2.39/2.45 c gomory : 0.57 11 0 0 2574 0
2.39/2.45 c strongcg : 0.46 11 0 0 2426 0
2.39/2.45 c cmir : 0.07 11 0 0 1 0
2.39/2.45 c flowcover : 0.11 11 0 0 3 0
2.39/2.45 c clique : 0.01 5 0 0 0 0
2.39/2.45 c zerohalf : 0.00 0 0 0 0 0
2.39/2.45 c mcf : 0.00 5 0 0 0 0
2.39/2.45 c rapidlearning : 0.00 0 0 0 0 0
2.39/2.45 c Pricers : Time Calls Vars
2.39/2.45 c problem variables: 0.00 0 0
2.39/2.45 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.39/2.45 c relpscost : 0.58 9 0 40 0 0 0
2.39/2.46 c pscost : 0.00 0 0 0 0 0 0
2.39/2.46 c inference : 0.00 0 0 0 0 0 0
2.39/2.46 c mostinf : 0.00 0 0 0 0 0 0
2.39/2.46 c leastinf : 0.00 0 0 0 0 0 0
2.39/2.46 c fullstrong : 0.00 0 0 0 0 0 0
2.39/2.46 c allfullstrong : 0.00 0 0 0 0 0 0
2.39/2.46 c random : 0.00 0 0 0 0 0 0
2.39/2.46 c Primal Heuristics : Time Calls Found
2.39/2.46 c LP solutions : 0.00 - 1
2.39/2.46 c pseudo solutions : 0.00 - 0
2.39/2.46 c oneopt : 0.01 3 1
2.39/2.46 c trivial : 0.00 2 3
2.39/2.46 c simplerounding : 0.00 20 0
2.39/2.46 c zirounding : 0.00 1 0
2.39/2.46 c rounding : 0.00 20 0
2.39/2.46 c shifting : 0.00 20 0
2.39/2.46 c intshifting : 0.00 0 0
2.39/2.46 c twoopt : 0.00 0 0
2.39/2.46 c fixandinfer : 0.00 0 0
2.39/2.46 c feaspump : 0.00 0 0
2.39/2.46 c coefdiving : 0.00 0 0
2.39/2.46 c pscostdiving : 0.00 0 0
2.39/2.46 c fracdiving : 0.00 0 0
2.39/2.46 c veclendiving : 0.00 0 0
2.39/2.46 c intdiving : 0.00 0 0
2.39/2.46 c actconsdiving : 0.00 0 0
2.39/2.46 c objpscostdiving : 0.00 0 0
2.39/2.46 c rootsoldiving : 0.00 0 0
2.39/2.46 c linesearchdiving : 0.00 0 0
2.39/2.46 c guideddiving : 0.00 0 0
2.39/2.46 c octane : 0.00 0 0
2.39/2.46 c rens : 0.10 1 1
2.39/2.46 c rins : 0.00 0 0
2.39/2.46 c localbranching : 0.00 0 0
2.39/2.46 c mutation : 0.00 0 0
2.39/2.46 c crossover : 0.00 0 0
2.39/2.46 c dins : 0.00 0 0
2.39/2.46 c undercover : 0.00 0 0
2.39/2.46 c nlp : 0.00 0 0
2.39/2.46 c trysol : 0.00 0 0
2.39/2.46 c LP : Time Calls Iterations Iter/call Iter/sec
2.39/2.46 c primal LP : 0.00 0 0 0.00 -
2.39/2.46 c dual LP : 0.09 22 964 43.82 10711.11
2.39/2.46 c lex dual LP : 0.00 0 0 0.00 -
2.39/2.46 c barrier LP : 0.00 0 0 0.00 -
2.39/2.46 c diving/probing LP: 0.00 0 0 0.00 -
2.39/2.46 c strong branching : 0.58 185 7874 42.56 13575.86
2.39/2.46 c (at root node) : - 185 7874 42.56 -
2.39/2.46 c conflict analysis: 0.00 0 0 0.00 -
2.39/2.46 c B&B Tree :
2.39/2.46 c number of runs : 6
2.39/2.46 c nodes : 1
2.39/2.46 c nodes (total) : 6
2.39/2.46 c nodes left : 0
2.39/2.46 c max depth : 0
2.39/2.46 c max depth (total): 0
2.39/2.46 c backtracks : 0 (0.0%)
2.39/2.46 c delayed cutoffs : 0
2.39/2.46 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.39/2.46 c avg switch length: 2.00
2.39/2.46 c switching time : 0.00
2.39/2.46 c Solution :
2.39/2.46 c Solutions found : 6 (5 improvements)
2.39/2.46 c First Solution : +3.72000000000000e+02 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
2.39/2.46 c Primal Bound : +2.50000000000000e+01 (in run 6, after 1 nodes, 2.20 seconds, depth 0, found by <relaxation>)
2.39/2.46 c Dual Bound : +2.50000000000000e+01
2.39/2.46 c Gap : 0.00 %
2.39/2.46 c Root Dual Bound : +2.50000000000000e+01
2.39/2.46 c Root Iterations : 964
2.39/2.47 c Time complete: 2.46.