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-2666206-1276593215.opb>
0.00/0.03 c original problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 515 constraints
0.00/0.03 c problem read
0.00/0.03 c presolving settings loaded
0.00/0.04 o 220
0.00/0.04 o 211
0.00/0.04 c feasible solution found by trivial heuristic, objective value 2.110000e+02
0.00/0.04 c presolving:
0.05/0.06 c (round 1) 0 del vars, 5 del conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.05/0.08 c (round 2) 0 del vars, 47 del conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 510 upgd conss, 0 impls, 0 clqs
0.05/0.09 c (0.1s) probing: 101/220 (45.9%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.05/0.09 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.05/0.09 c presolving (3 rounds):
0.05/0.09 c 0 deleted vars, 47 deleted constraints, 0 tightened bounds, 0 added holes, 4 changed sides, 0 changed coefficients
0.05/0.09 c 0 implications, 0 cliques
0.05/0.09 c presolved problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 468 constraints
0.05/0.09 c 468 constraints of type <logicor>
0.05/0.09 c transformed objective value is always integral (scale: 1)
0.05/0.09 c Presolving Time: 0.04
0.05/0.09 c - non default parameters ----------------------------------------------------------------------
0.05/0.09 c # SCIP version 1.2.1.2
0.05/0.09 c
0.05/0.09 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.05/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.05/0.09 c conflict/interconss = 0
0.05/0.09 c
0.05/0.09 c # should binary conflicts be preferred?
0.05/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.05/0.09 c conflict/preferbinary = TRUE
0.05/0.09 c
0.05/0.09 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.05/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.05/0.09 c constraints/agelimit = 1
0.05/0.09 c
0.05/0.09 c # should enforcement of pseudo solution be disabled?
0.05/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.05/0.09 c constraints/disableenfops = TRUE
0.05/0.09 c
0.05/0.09 c # frequency for displaying node information lines
0.05/0.09 c # [type: int, range: [-1,2147483647], default: 100]
0.05/0.09 c display/freq = 10000
0.05/0.09 c
0.05/0.09 c # maximal time in seconds to run
0.05/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.05/0.09 c limits/time = 1799.98
0.05/0.09 c
0.05/0.09 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.05/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.05/0.09 c limits/memory = 1620
0.05/0.09 c
0.05/0.09 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.05/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.05/0.09 c lp/solvefreq = 0
0.05/0.09 c
0.05/0.09 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.05/0.09 c # [type: char, range: {lafpsqd}, default: l]
0.05/0.09 c lp/pricing = a
0.05/0.09 c
0.05/0.09 c # should presolving try to simplify inequalities
0.05/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.05/0.09 c constraints/linear/simplifyinequalities = TRUE
0.05/0.09 c
0.05/0.09 c # should presolving try to simplify knapsacks
0.05/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.05/0.09 c constraints/knapsack/simplifyinequalities = TRUE
0.05/0.09 c
0.05/0.09 c # priority of node selection rule <dfs> in standard mode
0.05/0.09 c # [type: int, range: [-536870912,536870911], default: 0]
0.05/0.09 c nodeselection/dfs/stdpriority = 1000000
0.05/0.09 c
0.05/0.09 c -----------------------------------------------------------------------------------------------
0.05/0.09 c start solving
0.05/0.09 c
0.05/0.09 o 189
0.05/0.09 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.05/0.09 c t 0.1s| 1 | 0 | 0 | - |1501k| 0 | - | 220 | 468 | 0 | 0 | 0 | 0 | 0 | -- | 1.890000e+02 | Inf
0.09/0.10 o 9
0.09/0.10 c b 0.1s| 1 | 0 | 0 | - |2168k| 0 | - | 220 | 468 | 220 | 468 | 0 | 0 | 0 | -- | 9.000000e+00 | Inf
0.09/0.10 c 0.1s| 1 | 0 | 62 | - |2165k| 0 | 25 | 220 | 468 | 220 | 468 | 0 | 0 | 0 | 3.023256e+00 | 9.000000e+00 | 197.69%
0.09/0.10 o 9
0.09/0.10 c s 0.1s| 1 | 0 | 62 | - |2173k| 0 | 25 | 220 | 468 | 220 | 468 | 0 | 0 | 0 | 3.023256e+00 | 9.000000e+00 | 197.69%
0.09/0.10 o 6
0.09/0.10 c b 0.1s| 1 | 0 | 62 | - |2178k| 0 | 25 | 220 | 468 | 220 | 468 | 0 | 0 | 0 | 3.023256e+00 | 6.000000e+00 | 98.46%
0.19/0.25 c 0.2s| 1 | 0 | 101 | - |2319k| 0 | 43 | 220 | 468 | 220 | 469 | 1 | 0 | 0 | 3.333333e+00 | 6.000000e+00 | 80.00%
0.39/0.48 c 0.4s| 1 | 0 | 124 | - |2554k| 0 | 43 | 220 | 468 | 220 | 470 | 2 | 0 | 0 | 3.333333e+00 | 6.000000e+00 | 80.00%
0.59/0.61 c 0.6s| 1 | 0 | 152 | - |2777k| 0 | 39 | 220 | 468 | 220 | 471 | 3 | 0 | 0 | 3.333333e+00 | 6.000000e+00 | 80.00%
0.69/0.74 c 0.7s| 1 | 0 | 190 | - |3002k| 0 | 25 | 220 | 468 | 220 | 472 | 4 | 0 | 0 | 3.333333e+00 | 6.000000e+00 | 80.00%
0.79/0.87 c 0.8s| 1 | 0 | 263 | - |3080k| 0 | 48 | 220 | 468 | 220 | 473 | 5 | 0 | 0 | 3.333333e+00 | 6.000000e+00 | 80.00%
0.99/1.01 o 5
0.99/1.01 c E 0.9s| 1 | 0 | 263 | - |3083k| 0 | 48 | 220 | 468 | 220 | 473 | 5 | 0 | 0 | 3.333333e+00 | 5.000000e+00 | 50.00%
0.99/1.02 c 0.9s| 1 | 0 | 263 | - |3083k| 0 | 48 | 220 | 468 | 220 | 473 | 5 | 0 | 0 | 3.333333e+00 | 5.000000e+00 | 50.00%
0.99/1.10 c 1.0s| 1 | 0 | 263 | - |3083k| 0 | 48 | 220 | 468 | 220 | 461 | 5 | 0 | 0 | 3.333333e+00 | 5.000000e+00 | 50.00%
1.39/1.41 c 1.3s| 1 | 0 | 390 | - |3082k| 0 | 53 | 220 | 466 | 220 | 461 | 5 | 0 | 9 | 3.333333e+00 | 5.000000e+00 | 50.00%
1.49/1.55 c 1.4s| 1 | 0 | 467 | - |3419k| 0 | 41 | 220 | 466 | 220 | 462 | 6 | 0 | 9 | 3.333333e+00 | 5.000000e+00 | 50.00%
1.79/1.88 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.79/1.88 c 1.8s| 1 | 0 | 487 | - |3419k| 0 | 47 | 220 | 466 | 220 | 462 | 6 | 0 | 21 | 3.333333e+00 | 5.000000e+00 | 50.00%
1.99/2.07 c 1.9s| 1 | 0 | 501 | - |3419k| 0 | 46 | 220 | 466 | 220 | 462 | 6 | 0 | 26 | 3.333333e+00 | 5.000000e+00 | 50.00%
2.20/2.27 c 2.1s| 1 | 0 | 511 | - |3419k| 0 | 44 | 220 | 466 | 220 | 462 | 6 | 0 | 32 | 3.333333e+00 | 5.000000e+00 | 50.00%
2.29/2.34 c 2.2s| 1 | 0 | 585 | - |3455k| 0 | 49 | 220 | 466 | 220 | 463 | 7 | 0 | 32 | 3.333333e+00 | 5.000000e+00 | 50.00%
2.39/2.48 c 2.3s| 1 | 0 | 604 | - |3455k| 0 | 46 | 220 | 466 | 220 | 463 | 7 | 0 | 39 | 3.333333e+00 | 5.000000e+00 | 50.00%
2.49/2.55 c 2.4s| 1 | 0 | 668 | - |3568k| 0 | 40 | 220 | 466 | 220 | 464 | 8 | 0 | 39 | 3.333333e+00 | 5.000000e+00 | 50.00%
2.59/2.67 c 2.5s| 1 | 0 | 706 | - |3567k| 0 | 42 | 220 | 465 | 220 | 464 | 8 | 0 | 44 | 3.333333e+00 | 5.000000e+00 | 50.00%
2.69/2.80 c 2.6s| 1 | 0 | 765 | - |3713k| 0 | 35 | 220 | 465 | 220 | 465 | 9 | 0 | 44 | 3.333333e+00 | 5.000000e+00 | 50.00%
2.89/2.93 c 2.8s| 1 | 0 | 779 | - |3713k| 0 | 32 | 220 | 465 | 220 | 465 | 9 | 0 | 52 | 3.333333e+00 | 5.000000e+00 | 50.00%
2.99/3.02 c 2.9s| 1 | 0 | 832 | - |3744k| 0 | 31 | 220 | 465 | 220 | 461 | 10 | 0 | 52 | 3.333333e+00 | 5.000000e+00 | 50.00%
2.99/3.08 c 2.9s| 1 | 0 | 832 | - |3744k| 0 | - | 220 | 465 | 220 | 461 | 10 | 0 | 58 | 3.333333e+00 | 5.000000e+00 | 50.00%
2.99/3.08 c (run 1, node 1) restarting after 45 global fixings of integer variables
2.99/3.08 c
2.99/3.08 c (restart) converted 5 cuts from the global cut pool into linear constraints
2.99/3.08 c
2.99/3.09 c presolving:
2.99/3.09 c (round 1) 45 del vars, 106 del conss, 0 chg bounds, 0 chg sides, 18 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
3.09/3.10 c (round 2) 45 del vars, 106 del conss, 0 chg bounds, 0 chg sides, 18 chg coeffs, 5 upgd conss, 0 impls, 0 clqs
3.09/3.11 c presolving (3 rounds):
3.09/3.11 c 45 deleted vars, 106 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 18 changed coefficients
3.09/3.11 c 0 implications, 0 cliques
3.09/3.11 c presolved problem has 175 variables (175 bin, 0 int, 0 impl, 0 cont) and 364 constraints
3.09/3.11 c 5 constraints of type <knapsack>
3.09/3.11 c 359 constraints of type <logicor>
3.09/3.11 c transformed objective value is always integral (scale: 1)
3.09/3.11 c Presolving Time: 0.05
3.09/3.11 c
3.09/3.12 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.09/3.12 c 3.0s| 1 | 0 | 868 | - |2063k| 0 | 25 | 175 | 364 | 175 | 364 | 0 | 0 | 58 | 3.333333e+00 | 5.000000e+00 | 50.00%
3.20/3.24 c 3.1s| 1 | 0 | 883 | - |2409k| 0 | 18 | 175 | 364 | 175 | 365 | 1 | 0 | 58 | 3.333333e+00 | 5.000000e+00 | 50.00%
3.29/3.34 c 3.2s| 1 | 0 | 905 | - |2409k| 0 | 18 | 175 | 364 | 175 | 365 | 1 | 0 | 71 | 3.333333e+00 | 5.000000e+00 | 50.00%
3.39/3.40 c 3.2s| 1 | 0 | 931 | - |2409k| 0 | 19 | 175 | 364 | 175 | 365 | 1 | 0 | 81 | 3.385992e+00 | 5.000000e+00 | 47.67%
3.39/3.43 c 3.2s| 1 | 0 | 951 | - |2409k| 0 | 23 | 175 | 364 | 175 | 365 | 1 | 0 | 86 | 3.421232e+00 | 5.000000e+00 | 46.15%
3.39/3.45 c 3.3s| 1 | 0 | 963 | - |2408k| 0 | 16 | 175 | 360 | 175 | 365 | 1 | 0 | 91 | 3.450915e+00 | 5.000000e+00 | 44.89%
3.39/3.47 c 3.3s| 1 | 0 | 971 | - |2408k| 0 | 17 | 175 | 360 | 175 | 365 | 1 | 0 | 96 | 3.500000e+00 | 5.000000e+00 | 42.86%
3.39/3.48 c 3.3s| 1 | 0 | 979 | - |2406k| 0 | 19 | 175 | 354 | 175 | 365 | 1 | 0 | 99 | 3.500000e+00 | 5.000000e+00 | 42.86%
3.49/3.51 c 3.3s| 1 | 0 | 989 | - |2406k| 0 | 11 | 175 | 354 | 175 | 365 | 1 | 0 | 104 | 3.500000e+00 | 5.000000e+00 | 42.86%
3.49/3.51 c 3.3s| 1 | 0 | 990 | - |2406k| 0 | 10 | 175 | 354 | 175 | 365 | 1 | 0 | 105 | 3.500000e+00 | 5.000000e+00 | 42.86%
3.49/3.51 c 3.3s| 1 | 2 | 990 | - |2407k| 0 | 10 | 175 | 354 | 175 | 365 | 1 | 0 | 105 | 3.500000e+00 | 5.000000e+00 | 42.86%
3.49/3.51 c (run 2, node 1) restarting after 31 global fixings of integer variables
3.49/3.51 c
3.49/3.52 c presolving:
3.49/3.52 c (round 1) 31 del vars, 67 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
3.49/3.53 c presolving (2 rounds):
3.49/3.53 c 31 deleted vars, 67 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
3.49/3.53 c 0 implications, 0 cliques
3.49/3.53 c presolved problem has 144 variables (144 bin, 0 int, 0 impl, 0 cont) and 287 constraints
3.49/3.53 c 5 constraints of type <knapsack>
3.49/3.53 c 282 constraints of type <logicor>
3.49/3.53 c transformed objective value is always integral (scale: 1)
3.49/3.53 c Presolving Time: 0.06
3.49/3.53 c
3.49/3.54 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.49/3.54 c 3.4s| 1 | 0 | 1022 | - |1904k| 0 | 11 | 144 | 287 | 144 | 287 | 0 | 0 | 105 | 3.500000e+00 | 5.000000e+00 | 42.86%
3.59/3.62 c 3.4s| 1 | 0 | 1055 | - |1943k| 0 | 23 | 144 | 287 | 144 | 288 | 1 | 0 | 105 | 3.558104e+00 | 5.000000e+00 | 40.52%
3.59/3.65 c 3.5s| 1 | 0 | 1064 | - |1943k| 0 | 36 | 144 | 287 | 144 | 288 | 1 | 0 | 112 | 3.569630e+00 | 5.000000e+00 | 40.07%
3.59/3.67 c 3.5s| 1 | 0 | 1069 | - |1943k| 0 | 27 | 144 | 287 | 144 | 288 | 1 | 0 | 118 | 3.570990e+00 | 5.000000e+00 | 40.02%
3.59/3.69 c 3.5s| 1 | 0 | 1081 | - |1943k| 0 | 21 | 144 | 287 | 144 | 288 | 1 | 0 | 123 | 3.589564e+00 | 5.000000e+00 | 39.29%
3.69/3.71 c 3.5s| 1 | 0 | 1093 | - |1943k| 0 | 20 | 144 | 287 | 144 | 288 | 1 | 0 | 128 | 3.653846e+00 | 5.000000e+00 | 36.84%
3.69/3.73 c 3.5s| 1 | 0 | 1104 | - |1943k| 0 | 12 | 144 | 287 | 144 | 288 | 1 | 0 | 139 | 3.700000e+00 | 5.000000e+00 | 35.14%
3.69/3.74 c 3.5s| 1 | 0 | 1104 | - |1943k| 0 | - | 144 | 287 | 144 | 288 | 1 | 0 | 146 | 3.700000e+00 | 5.000000e+00 | 35.14%
3.69/3.74 c (run 3, node 1) restarting after 29 global fixings of integer variables
3.69/3.74 c
3.69/3.74 c (restart) converted 1 cuts from the global cut pool into linear constraints
3.69/3.74 c
3.69/3.74 c presolving:
3.69/3.75 c (round 1) 29 del vars, 70 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 0 impls, 0 clqs
3.69/3.75 c (round 2) 29 del vars, 71 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 0 impls, 0 clqs
3.69/3.76 c presolving (3 rounds):
3.69/3.76 c 29 deleted vars, 71 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
3.69/3.76 c 0 implications, 0 cliques
3.69/3.76 c presolved problem has 115 variables (115 bin, 0 int, 0 impl, 0 cont) and 217 constraints
3.69/3.76 c 6 constraints of type <knapsack>
3.69/3.76 c 211 constraints of type <logicor>
3.69/3.76 c transformed objective value is always integral (scale: 1)
3.69/3.76 c Presolving Time: 0.07
3.69/3.76 c
3.69/3.76 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.69/3.76 c 3.5s| 1 | 0 | 1129 | - |1769k| 0 | 10 | 115 | 217 | 115 | 217 | 0 | 0 | 146 | 4.000000e+00 | 5.000000e+00 | 25.00%
3.79/3.80 c 3.6s| 1 | 0 | 1134 | - |1773k| 0 | 9 | 115 | 210 | 115 | 203 | 1 | 0 | 146 | 4.000000e+00 | 5.000000e+00 | 25.00%
3.79/3.82 c 3.6s| 1 | 2 | 1134 | - |1774k| 0 | 9 | 115 | 210 | 115 | 203 | 1 | 0 | 155 | 4.000000e+00 | 5.000000e+00 | 25.00%
3.79/3.82 c (run 4, node 1) restarting after 11 global fixings of integer variables
3.79/3.82 c
3.79/3.82 c (restart) converted 1 cuts from the global cut pool into linear constraints
3.79/3.82 c
3.79/3.82 c presolving:
3.79/3.83 c (round 1) 11 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 40 impls, 0 clqs
3.79/3.83 c presolving (2 rounds):
3.79/3.83 c 11 deleted vars, 8 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
3.79/3.83 c 40 implications, 0 cliques
3.79/3.83 c presolved problem has 104 variables (104 bin, 0 int, 0 impl, 0 cont) and 203 constraints
3.79/3.83 c 6 constraints of type <knapsack>
3.79/3.83 c 197 constraints of type <logicor>
3.79/3.83 c transformed objective value is always integral (scale: 1)
3.79/3.83 c Presolving Time: 0.08
3.79/3.83 c
3.79/3.84 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.79/3.84 c 3.6s| 1 | 0 | 1172 | - |1742k| 0 | 11 | 104 | 203 | 104 | 203 | 0 | 0 | 155 | 4.000000e+00 | 5.000000e+00 | 25.00%
3.79/3.87 c 3.7s| 1 | 0 | 1183 | - |1752k| 0 | 20 | 104 | 203 | 104 | 204 | 1 | 0 | 155 | 4.000000e+00 | 5.000000e+00 | 25.00%
3.79/3.89 c 3.7s| 1 | 0 | 1195 | - |1752k| 0 | 16 | 104 | 202 | 104 | 204 | 1 | 0 | 168 | 4.000000e+00 | 5.000000e+00 | 25.00%
3.89/3.90 c 3.7s| 1 | 0 | 1201 | - |1751k| 0 | 6 | 104 | 201 | 104 | 204 | 1 | 0 | 173 | 4.000000e+00 | 5.000000e+00 | 25.00%
3.89/3.91 c 3.7s| 1 | 2 | 1201 | - |1755k| 0 | 6 | 104 | 201 | 104 | 204 | 1 | 0 | 176 | 4.000000e+00 | 5.000000e+00 | 25.00%
3.89/3.99 o 4
3.89/3.99 c * 3.8s| 315 | 0 | 1201 | 0.0 |1793k| 56 | - | 104 | 209 | 0 | 0 | 1 | 174 | 176 | 4.000000e+00 | 4.000000e+00 | 0.00%
3.89/3.99 c
3.89/3.99 c SCIP Status : problem is solved [optimal solution found]
3.89/3.99 c Solving Time (sec) : 3.77
3.89/3.99 c Solving Nodes : 315 (total of 319 nodes in 5 runs)
3.89/3.99 c Primal Bound : +4.00000000000000e+00 (11 solutions)
3.89/3.99 c Dual Bound : +4.00000000000000e+00
3.89/3.99 c Gap : 0.00 %
3.89/3.99 s OPTIMUM FOUND
3.89/3.99 v -x220 -x219 -x218 -x217 -x216 -x215 -x214 -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 -x205 x204 -x203 -x202 -x201 -x200 -x199
3.89/3.99 v -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178
3.89/3.99 v -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158
3.89/3.99 v -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137
3.89/3.99 v -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116
3.89/3.99 v -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94
3.89/3.99 v -x93 -x92 -x91 -x90 -x89 x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69
3.89/3.99 v -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44
3.89/3.99 v -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19
3.89/3.99 v x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
3.89/3.99 c SCIP Status : problem is solved [optimal solution found]
3.89/3.99 c Solving Time : 3.77
3.89/3.99 c Original Problem :
3.89/3.99 c Problem name : HOME/instance-2666206-1276593215.opb
3.89/3.99 c Variables : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
3.89/3.99 c Constraints : 515 initial, 515 maximal
3.89/3.99 c Presolved Problem :
3.89/3.99 c Problem name : t_HOME/instance-2666206-1276593215.opb
3.89/3.99 c Variables : 104 (104 binary, 0 integer, 0 implicit integer, 0 continuous)
3.89/3.99 c Constraints : 203 initial, 220 maximal
3.89/3.99 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.89/3.99 c trivial : 0.00 116 0 0 0 0 0 0 0
3.89/3.99 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.89/3.99 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.89/3.99 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.89/3.99 c implics : 0.00 0 0 0 0 0 0 0 0
3.89/3.99 c probing : 0.01 0 0 0 0 0 0 0 0
3.89/3.99 c knapsack : 0.01 0 0 0 0 0 0 0 0
3.89/3.99 c linear : 0.02 0 0 0 0 0 5 4 18
3.89/3.99 c logicor : 0.03 0 0 0 0 0 294 0 0
3.89/3.99 c root node : - 126 - - 126 - - - -
3.89/3.99 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.89/3.99 c integral : 0 0 0 27 0 0 109 0 0 6
3.89/3.99 c knapsack : 6 4 866 0 0 13 6 0 0 0
3.89/3.99 c logicor : 197+ 18 667 0 0 143 1213 0 0 0
3.89/3.99 c countsols : 0 0 0 0 1 0 0 0 0 0
3.89/3.99 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.89/3.99 c integral : 1.65 0.00 0.00 1.65 0.00
3.89/3.99 c knapsack : 0.08 0.06 0.02 0.00 0.00
3.89/3.99 c logicor : 0.00 0.00 0.00 0.00 0.00
3.89/3.99 c countsols : 0.00 0.00 0.00 0.00 0.00
3.89/3.99 c Propagators : Time Calls Cutoffs DomReds
3.89/3.99 c vbounds : 0.00 6 0 0
3.89/3.99 c rootredcost : 0.00 0 0 0
3.89/3.99 c pseudoobj : 0.04 902 10 4826
3.89/3.99 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.89/3.99 c propagation : 0.01 153 153 153 14.5 23 7.5 -
3.89/3.99 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.89/3.99 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.89/3.99 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.89/3.99 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.89/3.99 c applied globally : - - - 157 10.8 - - -
3.89/3.99 c applied locally : - - - 17 36.4 - - -
3.89/3.99 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.89/3.99 c cut pool : 0.00 0 - - 0 - (maximal pool size: 2)
3.89/3.99 c redcost : 0.00 18 0 17 0 0
3.89/3.99 c impliedbounds : 0.00 18 0 0 0 0
3.89/3.99 c intobj : 0.00 0 0 0 0 0
3.89/3.99 c cgmip : 0.00 0 0 0 0 0
3.89/3.99 c gomory : 0.78 18 0 0 1609 0
3.89/3.99 c strongcg : 0.60 18 0 0 2575 0
3.89/3.99 c cmir : 0.05 14 0 0 0 0
3.89/3.99 c flowcover : 0.14 14 0 0 0 0
3.89/3.99 c clique : 0.00 5 0 0 0 0
3.89/3.99 c zerohalf : 0.00 0 0 0 0 0
3.89/3.99 c mcf : 0.01 5 0 0 0 0
3.89/3.99 c rapidlearning : 0.00 0 0 0 0 0
3.89/3.99 c Pricers : Time Calls Vars
3.89/3.99 c problem variables: 0.00 0 0
3.89/3.99 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.89/3.99 c relpscost : 1.65 27 0 109 0 0 6
3.89/3.99 c pscost : 0.00 0 0 0 0 0 0
3.89/3.99 c inference : 0.01 230 0 0 0 0 460
3.89/3.99 c mostinf : 0.00 0 0 0 0 0 0
3.89/3.99 c leastinf : 0.00 0 0 0 0 0 0
3.89/3.99 c fullstrong : 0.00 0 0 0 0 0 0
3.89/3.99 c allfullstrong : 0.00 0 0 0 0 0 0
3.89/3.99 c random : 0.00 0 0 0 0 0 0
3.89/3.99 c Primal Heuristics : Time Calls Found
3.89/3.99 c LP solutions : 0.00 - 0
3.89/3.99 c pseudo solutions : 0.00 - 1
3.89/3.99 c crossover : 0.00 0 0
3.89/3.99 c oneopt : 0.00 4 2
3.89/3.99 c trivial : 0.00 2 4
3.89/3.99 c simplerounding : 0.00 8 0
3.89/3.99 c zirounding : 0.00 2 0
3.89/3.99 c rounding : 0.01 41 0
3.89/3.99 c shifting : 0.03 41 3
3.89/3.99 c intshifting : 0.00 0 0
3.89/3.99 c twoopt : 0.00 0 0
3.89/3.99 c fixandinfer : 0.00 0 0
3.89/3.99 c feaspump : 0.00 0 0
3.89/3.99 c coefdiving : 0.00 0 0
3.89/3.99 c pscostdiving : 0.00 0 0
3.89/3.99 c fracdiving : 0.00 0 0
3.89/3.99 c veclendiving : 0.00 0 0
3.89/3.99 c intdiving : 0.00 0 0
3.89/3.99 c actconsdiving : 0.00 0 0
3.89/3.99 c objpscostdiving : 0.00 0 0
3.89/3.99 c rootsoldiving : 0.00 0 0
3.89/3.99 c linesearchdiving : 0.00 0 0
3.89/3.99 c guideddiving : 0.00 0 0
3.89/3.99 c octane : 0.00 0 0
3.89/3.99 c rens : 0.06 1 1
3.89/3.99 c rins : 0.00 0 0
3.89/3.99 c localbranching : 0.00 0 0
3.89/3.99 c mutation : 0.00 0 0
3.89/3.99 c dins : 0.00 0 0
3.89/3.99 c undercover : 0.00 0 0
3.89/3.99 c nlp : 0.00 0 0
3.89/3.99 c trysol : 0.00 0 0
3.89/3.99 c LP : Time Calls Iterations Iter/call Iter/sec
3.89/3.99 c primal LP : 0.00 0 0 0.00 -
3.89/3.99 c dual LP : 0.18 41 1201 29.29 6672.22
3.89/3.99 c lex dual LP : 0.00 0 0 0.00 -
3.89/3.99 c barrier LP : 0.00 0 0 0.00 -
3.89/3.99 c diving/probing LP: 0.00 0 0 0.00 -
3.89/3.99 c strong branching : 1.65 176 14177 80.55 8592.12
3.89/3.99 c (at root node) : - 176 14177 80.55 -
3.89/3.99 c conflict analysis: 0.00 0 0 0.00 -
3.89/3.99 c B&B Tree :
3.89/3.99 c number of runs : 5
3.89/3.99 c nodes : 315
3.89/3.99 c nodes (total) : 319
3.89/3.99 c nodes left : 0
3.89/3.99 c max depth : 56
3.89/3.99 c max depth (total): 56
3.89/3.99 c backtracks : 100 (31.7%)
3.89/3.99 c delayed cutoffs : 116
3.89/3.99 c repropagations : 238 (2836 domain reductions, 83 cutoffs)
3.89/3.99 c avg switch length: 2.65
3.89/3.99 c switching time : 0.01
3.89/3.99 c Solution :
3.89/3.99 c Solutions found : 11 (8 improvements)
3.89/3.99 c First Solution : +2.20000000000000e+02 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
3.89/3.99 c Primal Bound : +4.00000000000000e+00 (in run 5, after 315 nodes, 3.77 seconds, depth 35, found by <relaxation>)
3.89/3.99 c Dual Bound : +4.00000000000000e+00
3.89/3.99 c Gap : 0.00 %
3.89/3.99 c Root Dual Bound : +4.00000000000000e+00
3.89/3.99 c Root Iterations : 1201
3.99/4.00 c Time complete: 4.