0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2704338-1278553602.opb>
0.03/0.05 c original problem has 309 variables (309 bin, 0 int, 0 impl, 0 cont) and 963 constraints
0.03/0.05 c problem read
0.03/0.05 c presolving settings loaded
0.03/0.07 o 309
0.03/0.07 o 294
0.03/0.07 c feasible solution found by trivial heuristic, objective value 2.940000e+02
0.03/0.07 c presolving:
0.09/0.13 c (round 1) 0 del vars, 4 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 959 upgd conss, 0 impls, 0 clqs
0.09/0.16 c (0.1s) probing: 101/309 (32.7%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.09/0.16 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.09/0.16 c presolving (2 rounds):
0.09/0.16 c 0 deleted vars, 4 deleted constraints, 0 tightened bounds, 0 added holes, 3 changed sides, 0 changed coefficients
0.09/0.16 c 0 implications, 0 cliques
0.09/0.16 c presolved problem has 309 variables (309 bin, 0 int, 0 impl, 0 cont) and 959 constraints
0.09/0.16 c 959 constraints of type <logicor>
0.09/0.16 c transformed objective value is always integral (scale: 1)
0.09/0.16 c Presolving Time: 0.09
0.09/0.16 c - non default parameters ----------------------------------------------------------------------
0.09/0.16 c # SCIP version 1.2.1.3
0.09/0.16 c
0.09/0.16 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.16 c conflict/interconss = 0
0.09/0.16 c
0.09/0.16 c # should binary conflicts be preferred?
0.09/0.16 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.16 c conflict/preferbinary = TRUE
0.09/0.16 c
0.09/0.16 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.16 c constraints/agelimit = 1
0.09/0.16 c
0.09/0.16 c # should enforcement of pseudo solution be disabled?
0.09/0.16 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.16 c constraints/disableenfops = TRUE
0.09/0.16 c
0.09/0.16 c # frequency for displaying node information lines
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.16 c display/freq = 10000
0.09/0.16 c
0.09/0.16 c # maximal time in seconds to run
0.09/0.16 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.16 c limits/time = 1789.96
0.09/0.16 c
0.09/0.16 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.16 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.16 c limits/memory = 1620
0.09/0.16 c
0.09/0.16 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.16 c lp/solvefreq = 0
0.09/0.16 c
0.09/0.16 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.16 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.16 c lp/pricing = a
0.09/0.16 c
0.09/0.16 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.16 c # [type: int, range: [1,2], default: 1]
0.09/0.16 c timing/clocktype = 2
0.09/0.16 c
0.09/0.16 c # should presolving try to simplify inequalities
0.09/0.16 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.16 c constraints/linear/simplifyinequalities = TRUE
0.09/0.16 c
0.09/0.16 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.16 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.16 c constraints/indicator/addCouplingCons = TRUE
0.09/0.16 c
0.09/0.16 c # should presolving try to simplify knapsacks
0.09/0.16 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.16 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.16 c
0.09/0.16 c # priority of node selection rule <dfs> in standard mode
0.09/0.16 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.16 c nodeselection/dfs/stdpriority = 1000000
0.09/0.16 c
0.09/0.16 c -----------------------------------------------------------------------------------------------
0.09/0.16 c start solving
0.09/0.16 c
0.09/0.16 o 291
0.09/0.16 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.16 c t 0.1s| 1 | 0 | 0 | - |2449k| 0 | - | 309 | 959 | 0 | 0 | 0 | 0 | 0 | -- | 2.910000e+02 | Inf
0.09/0.18 o 14
0.09/0.18 c b 0.1s| 1 | 0 | 0 | - |3879k| 0 | - | 309 | 959 | 309 | 959 | 0 | 0 | 0 | -- | 1.400000e+01 | Inf
0.09/0.19 c 0.1s| 1 | 0 | 97 | - |3876k| 0 | 16 | 309 | 959 | 309 | 959 | 0 | 0 | 0 | 4.083333e+00 | 1.400000e+01 | 242.86%
0.09/0.19 o 12
0.09/0.19 c b 0.1s| 1 | 0 | 97 | - |3893k| 0 | 16 | 309 | 959 | 309 | 959 | 0 | 0 | 0 | 4.083333e+00 | 1.200000e+01 | 193.88%
0.39/0.45 c 0.4s| 1 | 0 | 109 | - |4117k| 0 | 23 | 309 | 959 | 309 | 960 | 1 | 0 | 0 | 4.218750e+00 | 1.200000e+01 | 184.44%
0.69/0.73 c 0.7s| 1 | 0 | 124 | - |4471k| 0 | 28 | 309 | 959 | 309 | 961 | 2 | 0 | 0 | 5.000000e+00 | 1.200000e+01 | 140.00%
1.10/1.12 c 1.1s| 1 | 0 | 132 | - |4843k| 0 | 23 | 309 | 959 | 309 | 962 | 3 | 0 | 0 | 5.000000e+00 | 1.200000e+01 | 140.00%
1.39/1.50 c 1.4s| 1 | 0 | 148 | - |4989k| 0 | 25 | 309 | 959 | 309 | 963 | 4 | 0 | 0 | 5.000000e+00 | 1.200000e+01 | 140.00%
1.79/1.85 c 1.8s| 1 | 0 | 156 | - |5040k| 0 | 25 | 309 | 959 | 309 | 964 | 5 | 0 | 0 | 5.000000e+00 | 1.200000e+01 | 140.00%
2.09/2.18 c 2.1s| 1 | 0 | 180 | - |5071k| 0 | 33 | 309 | 959 | 309 | 965 | 6 | 0 | 0 | 5.000000e+00 | 1.200000e+01 | 140.00%
2.49/2.53 c 2.5s| 1 | 0 | 208 | - |5120k| 0 | 39 | 309 | 959 | 309 | 966 | 7 | 0 | 0 | 5.000000e+00 | 1.200000e+01 | 140.00%
2.79/2.87 c 2.8s| 1 | 0 | 233 | - |5149k| 0 | 37 | 309 | 959 | 309 | 967 | 8 | 0 | 0 | 5.000000e+00 | 1.200000e+01 | 140.00%
2.89/2.94 o 6
2.89/2.94 c E 2.9s| 1 | 0 | 233 | - |5153k| 0 | 37 | 309 | 959 | 309 | 967 | 8 | 0 | 0 | 5.000000e+00 | 6.000000e+00 | 20.00%
2.89/2.95 c 2.9s| 1 | 0 | 233 | - |5153k| 0 | 37 | 309 | 959 | 309 | 967 | 8 | 0 | 0 | 5.000000e+00 | 6.000000e+00 | 20.00%
3.29/3.36 c 3.3s| 1 | 0 | 233 | - |5153k| 0 | 37 | 309 | 959 | 309 | 868 | 8 | 0 | 0 | 5.000000e+00 | 6.000000e+00 | 20.00%
3.99/4.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.99/4.04 c 4.0s| 1 | 0 | 321 | - |5122k| 0 | 34 | 309 | 938 | 309 | 868 | 8 | 0 | 15 | 5.000000e+00 | 6.000000e+00 | 20.00%
4.30/4.37 c 4.3s| 1 | 0 | 348 | - |5125k| 0 | 40 | 309 | 938 | 309 | 869 | 9 | 0 | 15 | 5.000000e+00 | 6.000000e+00 | 20.00%
4.89/4.91 c 4.9s| 1 | 0 | 392 | - |5124k| 0 | 41 | 309 | 936 | 309 | 869 | 9 | 0 | 24 | 5.000000e+00 | 6.000000e+00 | 20.00%
5.19/5.20 c 5.1s| 1 | 0 | 421 | - |5128k| 0 | 36 | 309 | 936 | 309 | 870 | 10 | 0 | 24 | 5.000000e+00 | 6.000000e+00 | 20.00%
5.99/6.08 c 6.0s| 1 | 0 | 476 | - |5122k| 0 | 46 | 309 | 928 | 309 | 870 | 10 | 0 | 37 | 5.000000e+00 | 6.000000e+00 | 20.00%
6.59/6.69 c 6.6s| 1 | 0 | 512 | - |5121k| 0 | 47 | 309 | 925 | 309 | 870 | 10 | 0 | 43 | 5.000000e+00 | 6.000000e+00 | 20.00%
7.29/7.30 c 7.2s| 1 | 0 | 538 | - |5120k| 0 | 47 | 309 | 923 | 309 | 870 | 10 | 0 | 48 | 5.000000e+00 | 6.000000e+00 | 20.00%
7.79/7.81 c 7.8s| 1 | 0 | 573 | - |5108k| 0 | 44 | 309 | 917 | 309 | 870 | 10 | 0 | 53 | 5.000000e+00 | 6.000000e+00 | 20.00%
8.28/8.40 c 8.3s| 1 | 0 | 585 | - |5107k| 0 | 42 | 309 | 915 | 309 | 867 | 10 | 0 | 59 | 5.000000e+00 | 6.000000e+00 | 20.00%
8.59/8.66 c 8.6s| 1 | 0 | 633 | - |5117k| 0 | 43 | 309 | 915 | 309 | 868 | 11 | 0 | 59 | 5.000000e+00 | 6.000000e+00 | 20.00%
8.89/8.99 c 8.9s| 1 | 0 | 633 | - |5117k| 0 | - | 309 | 915 | 309 | 868 | 11 | 0 | 65 | 5.000000e+00 | 6.000000e+00 | 20.00%
8.89/8.99 c (run 1, node 1) restarting after 66 global fixings of integer variables
8.89/8.99 c
8.89/8.99 c (restart) converted 8 cuts from the global cut pool into linear constraints
8.89/8.99 c
8.89/8.99 c presolving:
8.99/9.00 c (round 1) 66 del vars, 196 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 8 upgd conss, 0 impls, 0 clqs
8.99/9.03 c presolving (2 rounds):
8.99/9.03 c 66 deleted vars, 196 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
8.99/9.03 c 0 implications, 0 cliques
8.99/9.03 c presolved problem has 243 variables (243 bin, 0 int, 0 impl, 0 cont) and 727 constraints
8.99/9.03 c 8 constraints of type <knapsack>
8.99/9.03 c 719 constraints of type <logicor>
8.99/9.03 c transformed objective value is always integral (scale: 1)
8.99/9.03 c Presolving Time: 0.12
8.99/9.03 c
8.99/9.06 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
8.99/9.06 c 9.0s| 1 | 0 | 739 | - |3588k| 0 | 39 | 243 | 727 | 243 | 727 | 0 | 0 | 65 | 5.000000e+00 | 6.000000e+00 | 20.00%
10.19/10.23 c 10.2s| 1 | 0 | 763 | - |3588k| 0 | 39 | 243 | 727 | 243 | 727 | 0 | 0 | 83 | 5.000000e+00 | 6.000000e+00 | 20.00%
10.49/10.59 c 10.5s| 1 | 0 | 783 | - |3587k| 0 | 44 | 243 | 723 | 243 | 727 | 0 | 0 | 91 | 5.000000e+00 | 6.000000e+00 | 20.00%
10.90/10.95 c 10.9s| 1 | 0 | 796 | - |3586k| 0 | 45 | 243 | 722 | 243 | 727 | 0 | 0 | 98 | 5.000000e+00 | 6.000000e+00 | 20.00%
11.29/11.31 c 11.3s| 1 | 0 | 806 | - |3584k| 0 | 44 | 243 | 719 | 243 | 727 | 0 | 0 | 106 | 5.000000e+00 | 6.000000e+00 | 20.00%
11.48/11.60 c 11.5s| 1 | 0 | 818 | - |3584k| 0 | 37 | 243 | 717 | 243 | 727 | 0 | 0 | 112 | 5.000000e+00 | 6.000000e+00 | 20.00%
11.79/11.86 c 11.8s| 1 | 0 | 826 | - |3584k| 0 | 37 | 243 | 716 | 243 | 727 | 0 | 0 | 118 | 5.000000e+00 | 6.000000e+00 | 20.00%
12.00/12.08 c 12.0s| 1 | 0 | 835 | - |3581k| 0 | 36 | 243 | 707 | 243 | 727 | 0 | 0 | 125 | 5.000000e+00 | 6.000000e+00 | 20.00%
12.29/12.37 c 12.3s| 1 | 0 | 845 | - |3579k| 0 | 33 | 243 | 697 | 243 | 727 | 0 | 0 | 133 | 5.000000e+00 | 6.000000e+00 | 20.00%
12.49/12.56 c 12.5s| 1 | 0 | 852 | - |3569k| 0 | 26 | 243 | 680 | 243 | 727 | 0 | 0 | 138 | 5.000000e+00 | 6.000000e+00 | 20.00%
12.68/12.72 c 12.7s| 1 | 0 | 852 | - |3569k| 0 | - | 243 | 680 | 243 | 727 | 0 | 0 | 143 | 5.000000e+00 | 6.000000e+00 | 20.00%
12.68/12.72 c (run 2, node 1) restarting after 50 global fixings of integer variables
12.68/12.72 c
12.68/12.73 c presolving:
12.68/12.73 c (round 1) 50 del vars, 115 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
12.68/12.75 c presolving (2 rounds):
12.68/12.75 c 50 deleted vars, 115 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
12.68/12.75 c 0 implications, 0 cliques
12.68/12.75 c presolved problem has 193 variables (193 bin, 0 int, 0 impl, 0 cont) and 565 constraints
12.68/12.75 c 8 constraints of type <knapsack>
12.68/12.75 c 557 constraints of type <logicor>
12.68/12.75 c transformed objective value is always integral (scale: 1)
12.68/12.75 c Presolving Time: 0.15
12.68/12.75 c
12.68/12.77 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
12.68/12.77 c 12.7s| 1 | 0 | 938 | - |3194k| 0 | 32 | 193 | 565 | 193 | 565 | 0 | 0 | 143 | 5.000000e+00 | 6.000000e+00 | 20.00%
13.38/13.41 c 13.4s| 1 | 0 | 959 | - |3194k| 0 | 39 | 193 | 565 | 193 | 565 | 0 | 0 | 156 | 5.000000e+00 | 6.000000e+00 | 20.00%
13.69/13.75 c 13.7s| 1 | 0 | 977 | - |3194k| 0 | 40 | 193 | 564 | 193 | 565 | 0 | 0 | 167 | 5.000000e+00 | 6.000000e+00 | 20.00%
13.98/14.05 c 14.0s| 1 | 0 | 997 | - |3194k| 0 | 38 | 193 | 564 | 193 | 565 | 0 | 0 | 178 | 5.000000e+00 | 6.000000e+00 | 20.00%
14.19/14.30 c 14.2s| 1 | 0 | 1012 | - |3193k| 0 | 31 | 193 | 558 | 193 | 565 | 0 | 0 | 186 | 5.000000e+00 | 6.000000e+00 | 20.00%
14.39/14.47 c 14.4s| 1 | 0 | 1025 | - |3192k| 0 | 34 | 193 | 554 | 193 | 565 | 0 | 0 | 192 | 5.000000e+00 | 6.000000e+00 | 20.00%
14.59/14.65 c 14.6s| 1 | 0 | 1035 | - |3191k| 0 | 33 | 193 | 546 | 193 | 565 | 0 | 0 | 199 | 5.000000e+00 | 6.000000e+00 | 20.00%
14.88/14.91 c 14.9s| 1 | 0 | 1046 | - |3186k| 0 | 32 | 193 | 532 | 193 | 565 | 0 | 0 | 208 | 5.000000e+00 | 6.000000e+00 | 20.00%
14.99/15.07 c 15.0s| 1 | 0 | 1046 | - |3186k| 0 | - | 193 | 532 | 193 | 565 | 0 | 0 | 214 | 5.000000e+00 | 6.000000e+00 | 20.00%
14.99/15.07 c (run 3, node 1) restarting after 40 global fixings of integer variables
14.99/15.07 c
14.99/15.07 c presolving:
14.99/15.08 c (round 1) 40 del vars, 85 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
14.99/15.09 c (round 2) 40 del vars, 89 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
14.99/15.09 c presolving (3 rounds):
14.99/15.09 c 40 deleted vars, 89 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
14.99/15.09 c 0 implications, 0 cliques
14.99/15.09 c presolved problem has 153 variables (153 bin, 0 int, 0 impl, 0 cont) and 443 constraints
14.99/15.09 c 8 constraints of type <knapsack>
14.99/15.09 c 435 constraints of type <logicor>
14.99/15.09 c transformed objective value is always integral (scale: 1)
14.99/15.09 c Presolving Time: 0.17
14.99/15.09 c
15.09/15.10 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
15.09/15.10 c 15.0s| 1 | 0 | 1099 | - |2931k| 0 | 31 | 153 | 443 | 153 | 443 | 0 | 0 | 214 | 5.000000e+00 | 6.000000e+00 | 20.00%
15.18/15.23 c 15.2s| 1 | 0 | 1176 | - |2939k| 0 | 35 | 153 | 443 | 153 | 444 | 1 | 0 | 214 | 5.000000e+00 | 6.000000e+00 | 20.00%
15.79/15.83 c 15.8s| 1 | 0 | 1196 | - |2938k| 0 | 36 | 153 | 441 | 153 | 444 | 1 | 0 | 234 | 5.000000e+00 | 6.000000e+00 | 20.00%
15.99/16.01 c 16.0s| 1 | 0 | 1215 | - |2937k| 0 | 36 | 153 | 437 | 153 | 444 | 1 | 0 | 240 | 5.000000e+00 | 6.000000e+00 | 20.00%
16.29/16.32 c 16.3s| 1 | 0 | 1237 | - |2935k| 0 | 25 | 153 | 434 | 153 | 444 | 1 | 0 | 250 | 5.000000e+00 | 6.000000e+00 | 20.00%
16.49/16.58 c 16.5s| 1 | 0 | 1261 | - |2935k| 0 | 21 | 153 | 434 | 153 | 444 | 1 | 0 | 258 | 5.000000e+00 | 6.000000e+00 | 20.00%
16.68/16.73 c 16.7s| 1 | 0 | 1267 | - |2935k| 0 | 26 | 153 | 434 | 153 | 444 | 1 | 0 | 263 | 5.000000e+00 | 6.000000e+00 | 20.00%
16.78/16.86 c 16.8s| 1 | 0 | 1271 | - |2924k| 0 | 20 | 153 | 408 | 153 | 444 | 1 | 0 | 268 | 5.000000e+00 | 6.000000e+00 | 20.00%
16.78/16.86 c 16.8s| 1 | 2 | 1271 | - |2925k| 0 | 20 | 153 | 408 | 153 | 444 | 1 | 0 | 268 | 5.000000e+00 | 6.000000e+00 | 20.00%
16.78/16.86 c (run 4, node 1) restarting after 25 global fixings of integer variables
16.78/16.86 c
16.78/16.86 c (restart) converted 1 cuts from the global cut pool into linear constraints
16.78/16.86 c
16.78/16.87 c presolving:
16.78/16.87 c (round 1) 25 del vars, 60 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 0 impls, 0 clqs
16.78/16.88 c presolving (2 rounds):
16.78/16.88 c 25 deleted vars, 60 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
16.78/16.88 c 0 implications, 0 cliques
16.78/16.88 c presolved problem has 128 variables (128 bin, 0 int, 0 impl, 0 cont) and 349 constraints
16.78/16.88 c 9 constraints of type <knapsack>
16.78/16.88 c 340 constraints of type <logicor>
16.78/16.88 c transformed objective value is always integral (scale: 1)
16.78/16.88 c Presolving Time: 0.18
16.78/16.88 c
16.78/16.89 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
16.78/16.89 c 16.8s| 1 | 0 | 1339 | - |2788k| 0 | 30 | 128 | 349 | 128 | 349 | 0 | 0 | 268 | 5.000000e+00 | 6.000000e+00 | 20.00%
16.88/16.99 c 16.9s| 1 | 0 | 1356 | - |2806k| 0 | 28 | 128 | 349 | 128 | 350 | 1 | 0 | 268 | 5.000000e+00 | 6.000000e+00 | 20.00%
17.18/17.28 c 17.2s| 1 | 0 | 1378 | - |2806k| 0 | 27 | 128 | 349 | 128 | 350 | 1 | 0 | 290 | 5.000000e+00 | 6.000000e+00 | 20.00%
17.38/17.42 c 17.4s| 1 | 0 | 1393 | - |2806k| 0 | 23 | 128 | 349 | 128 | 350 | 1 | 0 | 301 | 5.000000e+00 | 6.000000e+00 | 20.00%
17.38/17.48 c 17.4s| 1 | 0 | 1398 | - |2805k| 0 | 24 | 128 | 347 | 128 | 350 | 1 | 0 | 305 | 5.000000e+00 | 6.000000e+00 | 20.00%
17.49/17.52 c 17.5s| 1 | 0 | 1403 | - |2805k| 0 | 23 | 128 | 347 | 128 | 350 | 1 | 0 | 309 | 5.000000e+00 | 6.000000e+00 | 20.00%
17.49/17.52 c 17.5s| 1 | 2 | 1403 | - |2806k| 0 | 23 | 128 | 347 | 128 | 350 | 1 | 0 | 309 | 5.000000e+00 | 6.000000e+00 | 20.00%
17.49/17.52 c (run 5, node 1) restarting after 14 global fixings of integer variables
17.49/17.52 c
17.49/17.52 c (restart) converted 1 cuts from the global cut pool into linear constraints
17.49/17.52 c
17.49/17.52 c presolving:
17.49/17.53 c (round 1) 14 del vars, 45 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 0 impls, 0 clqs
17.49/17.53 c (round 2) 14 del vars, 46 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 0 impls, 0 clqs
17.49/17.53 c presolving (3 rounds):
17.49/17.53 c 14 deleted vars, 46 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
17.49/17.53 c 0 implications, 0 cliques
17.49/17.53 c presolved problem has 114 variables (114 bin, 0 int, 0 impl, 0 cont) and 302 constraints
17.49/17.53 c 10 constraints of type <knapsack>
17.49/17.53 c 292 constraints of type <logicor>
17.49/17.53 c transformed objective value is always integral (scale: 1)
17.49/17.53 c Presolving Time: 0.20
17.49/17.53 c
17.49/17.54 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
17.49/17.54 c 17.5s| 1 | 0 | 1446 | - |2713k| 0 | 21 | 114 | 302 | 114 | 302 | 0 | 0 | 309 | 5.000000e+00 | 6.000000e+00 | 20.00%
17.78/17.86 c 17.8s| 1 | 0 | 1448 | - |2713k| 0 | 20 | 114 | 302 | 114 | 302 | 0 | 0 | 330 | 5.000000e+00 | 6.000000e+00 | 20.00%
17.78/17.87 c 17.8s| 1 | 0 | 1449 | - |2713k| 0 | 20 | 114 | 302 | 114 | 302 | 0 | 0 | 331 | 5.000000e+00 | 6.000000e+00 | 20.00%
17.78/17.88 c 17.8s| 1 | 0 | 1452 | - |2713k| 0 | 20 | 114 | 302 | 114 | 302 | 0 | 0 | 332 | 5.000000e+00 | 6.000000e+00 | 20.00%
17.78/17.89 c 17.8s| 1 | 0 | 1454 | - |2713k| 0 | 20 | 114 | 302 | 114 | 302 | 0 | 0 | 334 | 5.000000e+00 | 6.000000e+00 | 20.00%
17.89/17.90 c 17.8s| 1 | 0 | 1458 | - |2713k| 0 | 22 | 114 | 302 | 114 | 302 | 0 | 0 | 336 | 5.000000e+00 | 6.000000e+00 | 20.00%
17.89/17.96 c 17.9s| 1 | 0 | 1462 | - |2713k| 0 | 20 | 114 | 302 | 114 | 302 | 0 | 0 | 341 | 5.000000e+00 | 6.000000e+00 | 20.00%
17.89/17.98 c 17.9s| 1 | 0 | 1465 | - |2713k| 0 | 24 | 114 | 302 | 114 | 302 | 0 | 0 | 343 | 5.000000e+00 | 6.000000e+00 | 20.00%
17.98/18.05 c 18.0s| 1 | 0 | 1468 | - |2713k| 0 | 21 | 114 | 302 | 114 | 302 | 0 | 0 | 348 | 5.000000e+00 | 6.000000e+00 | 20.00%
17.98/18.05 c 18.0s| 1 | 2 | 1468 | - |2714k| 0 | 21 | 114 | 302 | 114 | 302 | 0 | 0 | 348 | 5.000000e+00 | 6.000000e+00 | 20.00%
17.98/18.05 c (run 6, node 1) restarting after 14 global fixings of integer variables
17.98/18.05 c
17.98/18.05 c presolving:
17.98/18.05 c (round 1) 14 del vars, 53 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
17.98/18.06 c presolving (2 rounds):
17.98/18.06 c 14 deleted vars, 53 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
17.98/18.06 c 0 implications, 0 cliques
17.98/18.06 c presolved problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 249 constraints
17.98/18.06 c 10 constraints of type <knapsack>
17.98/18.06 c 239 constraints of type <logicor>
17.98/18.06 c transformed objective value is always integral (scale: 1)
17.98/18.06 c Presolving Time: 0.21
17.98/18.06 c
17.98/18.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
17.98/18.07 c 18.0s| 1 | 0 | 1520 | - |2638k| 0 | 23 | 100 | 249 | 100 | 249 | 0 | 0 | 348 | 5.000000e+00 | 6.000000e+00 | 20.00%
18.29/18.33 c 18.3s| 1 | 0 | 1523 | - |2638k| 0 | 21 | 100 | 249 | 100 | 249 | 0 | 0 | 371 | 5.000000e+00 | 6.000000e+00 | 20.00%
18.29/18.34 c 18.3s| 1 | 0 | 1524 | - |2638k| 0 | 21 | 100 | 249 | 100 | 249 | 0 | 0 | 372 | 5.000000e+00 | 6.000000e+00 | 20.00%
18.29/18.34 c 18.3s| 1 | 2 | 1524 | - |2638k| 0 | 21 | 100 | 249 | 100 | 249 | 0 | 0 | 373 | 5.000000e+00 | 6.000000e+00 | 20.00%
21.48/21.51 c 21.5s| 10000 | 12 | 1524 | 0.0 |2687k| 53 | - | 100 | 254 | 0 | 0 | 0 |3550 | 373 | 5.000000e+00 | 6.000000e+00 | 20.00%
24.78/24.86 c 24.8s| 20000 | 10 | 1524 | 0.0 |2693k| 53 | - | 100 | 264 | 0 | 0 | 0 |7990 | 373 | 5.000000e+00 | 6.000000e+00 | 20.00%
25.18/25.23 o 5
25.18/25.23 c *25.2s| 21164 | 0 | 1524 | 0.0 |2702k| 53 | - | 100 | 269 | 0 | 0 | 0 |8514 | 373 | 5.000000e+00 | 5.000000e+00 | 0.00%
25.18/25.23 c
25.18/25.23 c SCIP Status : problem is solved [optimal solution found]
25.18/25.23 c Solving Time (sec) : 25.17
25.18/25.23 c Solving Nodes : 21164 (total of 21170 nodes in 7 runs)
25.18/25.23 c Primal Bound : +5.00000000000000e+00 (9 solutions)
25.18/25.23 c Dual Bound : +5.00000000000000e+00
25.18/25.23 c Gap : 0.00 %
25.18/25.23 s OPTIMUM FOUND
25.18/25.23 v -x309 -x308 -x307 -x306 -x305 -x304 -x303 -x302 -x301 -x300 -x299 -x298 -x297 -x296 -x295 -x294 -x293 -x292 -x291 -x290 -x289 -x288
25.18/25.23 v -x287 -x286 -x285 -x284 -x283 -x282 -x281 -x280 -x279 x278 -x277 -x276 -x275 -x274 -x273 -x272 -x271 -x270 -x269 -x268 -x267
25.18/25.23 v -x266 -x265 -x264 -x263 -x262 -x261 -x260 -x259 -x258 -x257 -x256 -x255 -x254 -x253 -x252 -x251 -x250 -x249 -x248 -x247
25.18/25.23 v -x246 -x245 -x244 -x243 -x242 -x241 -x240 -x239 -x238 -x237 -x236 -x235 -x234 -x233 -x232 x231 -x230 -x229 -x228 -x227 -x226
25.18/25.23 v -x225 -x224 -x223 -x222 -x221 -x220 -x219 -x218 -x217 -x216 -x215 -x214 -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 -x205
25.18/25.23 v -x204 -x203 -x202 -x201 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184
25.18/25.23 v -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163
25.18/25.23 v -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 x148 -x147 -x146 -x145 -x144 -x143 -x142
25.18/25.23 v -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121
25.18/25.23 v -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100
25.18/25.23 v -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75
25.18/25.23 v -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50
25.18/25.23 v -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 x30 -x29 -x28 -x27 -x26 -x25
25.18/25.23 v -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
25.18/25.23 c SCIP Status : problem is solved [optimal solution found]
25.18/25.23 c Solving Time : 25.17
25.18/25.23 c Original Problem :
25.18/25.23 c Problem name : HOME/instance-2704338-1278553602.opb
25.18/25.23 c Variables : 309 (309 binary, 0 integer, 0 implicit integer, 0 continuous)
25.18/25.23 c Constraints : 963 initial, 963 maximal
25.18/25.23 c Presolved Problem :
25.18/25.23 c Problem name : t_HOME/instance-2704338-1278553602.opb
25.18/25.23 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
25.18/25.23 c Constraints : 249 initial, 367 maximal
25.18/25.23 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
25.18/25.23 c trivial : 0.00 209 0 0 0 0 0 0 0
25.18/25.23 c dualfix : 0.00 0 0 0 0 0 0 0 0
25.18/25.23 c boundshift : 0.00 0 0 0 0 0 0 0 0
25.18/25.23 c inttobinary : 0.00 0 0 0 0 0 0 0 0
25.18/25.23 c implics : 0.00 0 0 0 0 0 0 0 0
25.18/25.23 c probing : 0.01 0 0 0 0 0 0 0 0
25.18/25.23 c knapsack : 0.04 0 0 0 0 0 0 0 0
25.18/25.23 c linear : 0.05 0 0 0 0 0 4 3 0
25.18/25.23 c logicor : 0.09 0 0 0 0 0 559 0 0
25.18/25.23 c root node : - 215 - - 215 - - - -
25.18/25.23 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
25.18/25.23 c integral : 0 0 0 50 0 0 187 0 0 8
25.18/25.23 c knapsack : 10 6 48822 0 0 3188 0 0 0 0
25.18/25.23 c logicor : 239+ 22 26583 0 1 7757 32932 0 0 0
25.18/25.23 c countsols : 0 0 0 0 1 0 0 0 0 0
25.18/25.23 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
25.18/25.23 c integral : 11.89 0.00 0.00 11.89 0.00
25.18/25.23 c knapsack : 3.64 0.22 3.41 0.00 0.00
25.18/25.23 c logicor : 0.55 0.00 0.55 0.00 0.00
25.18/25.23 c countsols : 0.00 0.00 0.00 0.00 0.00
25.18/25.23 c Propagators : Time Calls Cutoffs DomReds
25.18/25.23 c vbounds : 0.01 8 0 0
25.18/25.23 c rootredcost : 0.02 0 0 0
25.18/25.23 c pseudoobj : 1.24 48993 152 505577
25.18/25.23 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
25.18/25.23 c propagation : 0.26 7909 7905 7905 10.6 613 9.7 -
25.18/25.23 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
25.18/25.23 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
25.18/25.23 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
25.18/25.23 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
25.18/25.23 c applied globally : - - - 8513 10.5 - - -
25.18/25.23 c applied locally : - - - 1 31.0 - - -
25.18/25.23 c Separators : Time Calls Cutoffs DomReds Cuts Conss
25.18/25.23 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
25.18/25.23 c redcost : 0.00 22 0 26 0 0
25.18/25.23 c impliedbounds : 0.00 22 0 0 0 0
25.18/25.23 c intobj : 0.00 0 0 0 0 0
25.18/25.23 c cgmip : 0.00 0 0 0 0 0
25.18/25.23 c gomory : 2.67 22 0 0 1500 0
25.18/25.23 c strongcg : 2.33 22 0 0 1999 0
25.18/25.23 c cmir : 0.16 16 0 0 0 0
25.18/25.23 c flowcover : 0.27 16 0 0 0 0
25.18/25.23 c clique : 0.00 7 0 0 0 0
25.18/25.23 c zerohalf : 0.00 0 0 0 0 0
25.18/25.23 c mcf : 0.01 7 0 0 0 0
25.18/25.23 c rapidlearning : 0.00 0 0 0 0 0
25.18/25.23 c Pricers : Time Calls Vars
25.18/25.23 c problem variables: 0.00 0 0
25.18/25.23 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
25.18/25.23 c relpscost : 11.89 50 0 187 0 0 8
25.18/25.23 c pscost : 0.00 0 0 0 0 0 0
25.18/25.23 c inference : 0.16 12546 0 0 0 0 25092
25.18/25.23 c mostinf : 0.00 0 0 0 0 0 0
25.18/25.23 c leastinf : 0.00 0 0 0 0 0 0
25.18/25.23 c fullstrong : 0.00 0 0 0 0 0 0
25.18/25.23 c allfullstrong : 0.00 0 0 0 0 0 0
25.18/25.23 c random : 0.00 0 0 0 0 0 0
25.18/25.23 c Primal Heuristics : Time Calls Found
25.18/25.23 c LP solutions : 0.00 - 0
25.18/25.23 c pseudo solutions : 0.00 - 1
25.18/25.23 c crossover : 0.00 0 0
25.18/25.23 c oneopt : 0.03 4 2
25.18/25.23 c trivial : 0.00 2 4
25.18/25.23 c simplerounding : 0.00 0 0
25.18/25.23 c zirounding : 0.00 2 0
25.18/25.23 c rounding : 0.01 63 0
25.18/25.23 c shifting : 0.01 63 1
25.18/25.23 c intshifting : 0.00 0 0
25.18/25.23 c twoopt : 0.00 0 0
25.18/25.23 c fixandinfer : 0.00 0 0
25.18/25.23 c feaspump : 0.00 0 0
25.18/25.23 c coefdiving : 0.00 0 0
25.18/25.23 c pscostdiving : 0.00 0 0
25.18/25.23 c fracdiving : 0.00 0 0
25.18/25.23 c veclendiving : 0.00 0 0
25.18/25.23 c intdiving : 0.00 0 0
25.18/25.23 c actconsdiving : 0.00 0 0
25.18/25.23 c objpscostdiving : 0.00 0 0
25.18/25.23 c rootsoldiving : 0.00 0 0
25.18/25.23 c linesearchdiving : 0.00 0 0
25.18/25.23 c guideddiving : 0.00 0 0
25.18/25.23 c octane : 0.00 0 0
25.18/25.23 c rens : 0.08 1 1
25.18/25.23 c rins : 0.00 0 0
25.18/25.23 c localbranching : 0.00 0 0
25.18/25.23 c mutation : 0.00 0 0
25.18/25.23 c dins : 0.00 0 0
25.18/25.23 c undercover : 0.00 0 0
25.18/25.23 c nlp : 0.00 0 0
25.18/25.23 c trysol : 0.00 0 0
25.18/25.23 c LP : Time Calls Iterations Iter/call Iter/sec
25.18/25.23 c primal LP : 0.00 0 0 0.00 -
25.18/25.23 c dual LP : 0.27 63 1524 24.19 5686.67
25.18/25.23 c lex dual LP : 0.00 0 0 0.00 -
25.18/25.23 c barrier LP : 0.00 0 0 0.00 -
25.18/25.23 c diving/probing LP: 0.00 0 0 0.00 -
25.18/25.23 c strong branching : 11.88 373 58134 155.86 4891.83
25.18/25.23 c (at root node) : - 373 58134 155.86 -
25.18/25.23 c conflict analysis: 0.00 0 0 0.00 -
25.18/25.23 c B&B Tree :
25.18/25.23 c number of runs : 7
25.18/25.23 c nodes : 21164
25.18/25.23 c nodes (total) : 21170
25.18/25.23 c nodes left : 0
25.18/25.23 c max depth : 53
25.18/25.23 c max depth (total): 53
25.18/25.23 c backtracks : 9192 (43.4%)
25.18/25.23 c delayed cutoffs : 3904
25.18/25.23 c repropagations : 16796 (118697 domain reductions, 2481 cutoffs)
25.18/25.23 c avg switch length: 3.00
25.18/25.23 c switching time : 0.89
25.18/25.23 c Solution :
25.18/25.23 c Solutions found : 9 (7 improvements)
25.18/25.23 c First Solution : +3.09000000000000e+02 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
25.18/25.23 c Primal Bound : +5.00000000000000e+00 (in run 7, after 21164 nodes, 25.17 seconds, depth 32, found by <relaxation>)
25.18/25.23 c Dual Bound : +5.00000000000000e+00
25.18/25.23 c Gap : 0.00 %
25.18/25.23 c Root Dual Bound : +5.00000000000000e+00
25.18/25.23 c Root Iterations : 1524
25.18/25.24 c Time complete: 25.23.