--- Job acc-tight-3 Start 07/17/08 10:55:36 GAMS Rev 227 Copyright (C) 1987-2008 GAMS Development. All rights reserved Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- acc-tight-3.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/acc-tight-3.gdx --- acc-tight-3.gms(148) 4 Mb --- Starting execution: elapsed 0:00:00.037 --- acc-tight-3.gms(123) 4 Mb --- Generating MIP model m --- acc-tight-3.gms(124) 5 Mb --- 3,048 rows 1,336 columns 16,110 non-zeroes --- 1,335 discrete-columns --- acc-tight-3.gms(124) 5 Mb --- Executing Cbc: elapsed 0:00:00.094 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Reading parameter(s) from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" >> threads 2 Finished reading from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" Problem statistics: 1335 columns and 3047 rows. 1335 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.10.00, build Jul 15 2008 command line - GAMS/CBC -threads 2 -solve -quit threads was changed from 0 to 2 Continuous objective value is 0 - 0.91 seconds 163 fixed, 0 tightened bounds, 0 strengthened rows, 186 substitutions 163 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 2 fixed, 0 tightened bounds, 0 strengthened rows, 94 substitutions 0 fixed, 0 tightened bounds, 0 strengthened rows, 94 substitutions 0 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions 0 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions 0 fixed, 0 tightened bounds, 0 strengthened rows, 1 substitutions 0 fixed, 0 tightened bounds, 0 strengthened rows, 5 substitutions processed model has 2620 rows, 1083 columns (1083 integer) and 13632 elements Pass 1: suminf. 86.16848 obj. 0 iterations 1914 Pass 2: suminf. 77.93901 obj. 0 iterations 1063 Pass 3: suminf. 71.52945 obj. 0 iterations 638 Pass 4: suminf. 67.49311 obj. 0 iterations 504 Pass 5: suminf. 64.97854 obj. 0 iterations 500 Pass 6: suminf. 59.34775 obj. 0 iterations 1055 Pass 7: suminf. 57.30532 obj. 0 iterations 462 Pass 8: suminf. 54.51165 obj. 0 iterations 518 Pass 9: suminf. 54.08709 obj. 0 iterations 432 Pass 10: suminf. 52.54139 obj. 0 iterations 932 Pass 11: suminf. 51.98571 obj. 0 iterations 274 Pass 12: suminf. 51.88482 obj. 0 iterations 162 Pass 13: suminf. 52.26332 obj. 0 iterations 370 Pass 14: suminf. 51.80962 obj. 0 iterations 309 Pass 15: suminf. 51.71919 obj. 0 iterations 140 Pass 16: suminf. 52.88183 obj. 0 iterations 509 Pass 17: suminf. 51.79155 obj. 0 iterations 487 Pass 18: suminf. 51.31984 obj. 0 iterations 600 Pass 19: suminf. 50.38649 obj. 0 iterations 305 Pass 20: suminf. 49.84961 obj. 0 iterations 254 No solution found this major pass Before mini branch and bound, 181 integers at bound fixed and 0 continuous Full problem 2620 rows 1083 columns, reduced to 2330 rows 899 columns - too large Mini branch and bound did not improve solution (4.70 seconds) After 4.70 seconds - Feasibility pump exiting - took 4.70 seconds 83 added rows had average density of 18.6867 At root node, 83 cuts changed objective from 0 to 0 in 3 passes Cut generator 0 (Probing) - 487 row cuts (79 active), 0 column cuts in 0.088 seconds - new frequency is 1 Cut generator 1 (Gomory) - 422 row cuts (1 active), 0 column cuts in 0.620 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 row cuts (0 active), 0 column cuts in 0.012 seconds - new frequency is -100 Cut generator 3 (Clique) - 8 row cuts (3 active), 0 column cuts in 0.020 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in 0.020 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 0 row cuts (0 active), 0 column cuts in 0.232 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0 (35.43 seconds) After 100 nodes, 43 on tree, 1e+50 best solution, best possible 0 (208.11 seconds) After 200 nodes, 55 on tree, 1e+50 best solution, best possible 0 (299.30 seconds) After 300 nodes, 66 on tree, 1e+50 best solution, best possible 0 (359.48 seconds) After 400 nodes, 76 on tree, 1e+50 best solution, best possible 0 (401.13 seconds) After 500 nodes, 81 on tree, 1e+50 best solution, best possible 0 (429.08 seconds) After 600 nodes, 77 on tree, 1e+50 best solution, best possible 0 (463.19 seconds) After 700 nodes, 72 on tree, 1e+50 best solution, best possible 0 (495.90 seconds) After 800 nodes, 70 on tree, 1e+50 best solution, best possible 0 (523.70 seconds) After 900 nodes, 78 on tree, 1e+50 best solution, best possible 0 (552.75 seconds) After 1000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (585.18 seconds) After 1100 nodes, 81 on tree, 1e+50 best solution, best possible 0 (610.99 seconds) After 1200 nodes, 74 on tree, 1e+50 best solution, best possible 0 (637.35 seconds) After 1300 nodes, 83 on tree, 1e+50 best solution, best possible 0 (668.77 seconds) After 1400 nodes, 70 on tree, 1e+50 best solution, best possible 0 (699.30 seconds) After 1500 nodes, 76 on tree, 1e+50 best solution, best possible 0 (724.56 seconds) After 1600 nodes, 67 on tree, 1e+50 best solution, best possible 0 (754.86 seconds) After 1700 nodes, 65 on tree, 1e+50 best solution, best possible 0 (784.85 seconds) After 1800 nodes, 62 on tree, 1e+50 best solution, best possible 0 (815.34 seconds) After 1900 nodes, 62 on tree, 1e+50 best solution, best possible 0 (847.77 seconds) After 2000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (867.83 seconds) After 2100 nodes, 58 on tree, 1e+50 best solution, best possible 0 (889.60 seconds) After 2200 nodes, 58 on tree, 1e+50 best solution, best possible 0 (914.44 seconds) After 2300 nodes, 69 on tree, 1e+50 best solution, best possible 0 (938.57 seconds) After 2400 nodes, 71 on tree, 1e+50 best solution, best possible 0 (959.66 seconds) After 2500 nodes, 68 on tree, 1e+50 best solution, best possible 0 (994.23 seconds) After 2600 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1028.22 seconds) After 2700 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1064.46 seconds) After 2800 nodes, 59 on tree, 1e+50 best solution, best possible 0 (1095.88 seconds) After 2900 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1138.37 seconds) After 3000 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1172.07 seconds) After 3100 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1191.06 seconds) After 3200 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1213.98 seconds) After 3300 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1242.08 seconds) After 3400 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1263.09 seconds) After 3500 nodes, 69 on tree, 1e+50 best solution, best possible 0 (1292.44 seconds) After 3600 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1315.67 seconds) After 3700 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1342.84 seconds) After 3800 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1370.25 seconds) After 3900 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1396.22 seconds) After 4000 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1428.36 seconds) After 4100 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1467.39 seconds) After 4200 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1508.74 seconds) After 4300 nodes, 60 on tree, 1e+50 best solution, best possible 0 (1555.35 seconds) After 4400 nodes, 62 on tree, 1e+50 best solution, best possible 0 (1576.51 seconds) After 4500 nodes, 64 on tree, 1e+50 best solution, best possible 0 (1602.58 seconds) After 4600 nodes, 61 on tree, 1e+50 best solution, best possible 0 (1631.90 seconds) After 4700 nodes, 77 on tree, 1e+50 best solution, best possible 0 (1658.86 seconds) After 4800 nodes, 67 on tree, 1e+50 best solution, best possible 0 (1682.36 seconds) After 4900 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1717.88 seconds) After 5000 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1751.44 seconds) After 5100 nodes, 66 on tree, 1e+50 best solution, best possible 0 (1794.80 seconds) After 5200 nodes, 74 on tree, 1e+50 best solution, best possible 0 (1846.98 seconds) After 5300 nodes, 70 on tree, 1e+50 best solution, best possible 0 (1903.24 seconds) After 5400 nodes, 68 on tree, 1e+50 best solution, best possible 0 (1941.13 seconds) After 5500 nodes, 65 on tree, 1e+50 best solution, best possible 0 (1984.28 seconds) After 5600 nodes, 74 on tree, 1e+50 best solution, best possible 0 (2009.40 seconds) After 5700 nodes, 75 on tree, 1e+50 best solution, best possible 0 (2030.51 seconds) After 5800 nodes, 79 on tree, 1e+50 best solution, best possible 0 (2055.70 seconds) After 5900 nodes, 74 on tree, 1e+50 best solution, best possible 0 (2077.59 seconds) After 6000 nodes, 75 on tree, 1e+50 best solution, best possible 0 (2097.91 seconds) After 6100 nodes, 66 on tree, 1e+50 best solution, best possible 0 (2125.08 seconds) After 6200 nodes, 66 on tree, 1e+50 best solution, best possible 0 (2150.57 seconds) After 6300 nodes, 71 on tree, 1e+50 best solution, best possible 0 (2177.03 seconds) After 6400 nodes, 69 on tree, 1e+50 best solution, best possible 0 (2207.48 seconds) After 6500 nodes, 76 on tree, 1e+50 best solution, best possible 0 (2234.46 seconds) After 6600 nodes, 79 on tree, 1e+50 best solution, best possible 0 (2259.66 seconds) After 6700 nodes, 74 on tree, 1e+50 best solution, best possible 0 (2287.81 seconds) After 6800 nodes, 77 on tree, 1e+50 best solution, best possible 0 (2317.34 seconds) After 6900 nodes, 81 on tree, 1e+50 best solution, best possible 0 (2345.81 seconds) After 7000 nodes, 78 on tree, 1e+50 best solution, best possible 0 (2374.54 seconds) After 7100 nodes, 85 on tree, 1e+50 best solution, best possible 0 (2401.98 seconds) After 7200 nodes, 82 on tree, 1e+50 best solution, best possible 0 (2439.04 seconds) After 7300 nodes, 88 on tree, 1e+50 best solution, best possible 0 (2472.02 seconds) After 7400 nodes, 88 on tree, 1e+50 best solution, best possible 0 (2508.84 seconds) After 7500 nodes, 90 on tree, 1e+50 best solution, best possible 0 (2545.16 seconds) After 7600 nodes, 95 on tree, 1e+50 best solution, best possible 0 (2587.61 seconds) After 7700 nodes, 89 on tree, 1e+50 best solution, best possible 0 (2630.25 seconds) After 7800 nodes, 88 on tree, 1e+50 best solution, best possible 0 (2664.40 seconds) After 7900 nodes, 94 on tree, 1e+50 best solution, best possible 0 (2701.27 seconds) After 8000 nodes, 93 on tree, 1e+50 best solution, best possible 0 (2736.55 seconds) After 8100 nodes, 93 on tree, 1e+50 best solution, best possible 0 (2771.43 seconds) After 8200 nodes, 93 on tree, 1e+50 best solution, best possible 0 (2805.91 seconds) After 8300 nodes, 90 on tree, 1e+50 best solution, best possible 0 (2834.89 seconds) After 8400 nodes, 89 on tree, 1e+50 best solution, best possible 0 (2869.50 seconds) After 8500 nodes, 89 on tree, 1e+50 best solution, best possible 0 (2903.73 seconds) After 8600 nodes, 94 on tree, 1e+50 best solution, best possible 0 (2934.58 seconds) After 8700 nodes, 86 on tree, 1e+50 best solution, best possible 0 (2966.16 seconds) After 8800 nodes, 90 on tree, 1e+50 best solution, best possible 0 (3000.08 seconds) After 8900 nodes, 86 on tree, 1e+50 best solution, best possible 0 (3029.12 seconds) After 9000 nodes, 87 on tree, 1e+50 best solution, best possible 0 (3048.53 seconds) After 9100 nodes, 88 on tree, 1e+50 best solution, best possible 0 (3066.60 seconds) After 9200 nodes, 83 on tree, 1e+50 best solution, best possible 0 (3089.53 seconds) After 9300 nodes, 89 on tree, 1e+50 best solution, best possible 0 (3116.78 seconds) After 9400 nodes, 86 on tree, 1e+50 best solution, best possible 0 (3150.52 seconds) After 9500 nodes, 81 on tree, 1e+50 best solution, best possible 0 (3185.48 seconds) After 9600 nodes, 76 on tree, 1e+50 best solution, best possible 0 (3221.69 seconds) After 9700 nodes, 80 on tree, 1e+50 best solution, best possible 0 (3252.84 seconds) After 9800 nodes, 70 on tree, 1e+50 best solution, best possible 0 (3285.38 seconds) After 9900 nodes, 90 on tree, 1e+50 best solution, best possible 0 (3309.50 seconds) After 10000 nodes, 81 on tree, 1e+50 best solution, best possible 0 (3334.25 seconds) After 10100 nodes, 88 on tree, 1e+50 best solution, best possible 0 (3359.57 seconds) After 10200 nodes, 75 on tree, 1e+50 best solution, best possible 0 (3385.23 seconds) After 10300 nodes, 85 on tree, 1e+50 best solution, best possible 0 (3413.40 seconds) After 10400 nodes, 82 on tree, 1e+50 best solution, best possible 0 (3447.51 seconds) After 10500 nodes, 80 on tree, 1e+50 best solution, best possible 0 (3479.04 seconds) After 10600 nodes, 85 on tree, 1e+50 best solution, best possible 0 (3512.74 seconds) After 10700 nodes, 81 on tree, 1e+50 best solution, best possible 0 (3547.63 seconds) After 10800 nodes, 82 on tree, 1e+50 best solution, best possible 0 (3579.10 seconds) After 10900 nodes, 80 on tree, 1e+50 best solution, best possible 0 (3607.87 seconds) After 11000 nodes, 76 on tree, 1e+50 best solution, best possible 0 (3653.53 seconds) After 11100 nodes, 146 on tree, 1e+50 best solution, best possible 0 (3708.85 seconds) After 11200 nodes, 171 on tree, 1e+50 best solution, best possible 0 (3752.30 seconds) After 11300 nodes, 227 on tree, 1e+50 best solution, best possible 0 (3788.89 seconds) After 11400 nodes, 263 on tree, 1e+50 best solution, best possible 0 (3824.72 seconds) After 11500 nodes, 316 on tree, 1e+50 best solution, best possible 0 (3858.17 seconds) After 11600 nodes, 359 on tree, 1e+50 best solution, best possible 0 (3895.21 seconds) After 11700 nodes, 398 on tree, 1e+50 best solution, best possible 0 (3926.77 seconds) After 11800 nodes, 449 on tree, 1e+50 best solution, best possible 0 (3963.11 seconds) After 11900 nodes, 503 on tree, 1e+50 best solution, best possible 0 (4004.03 seconds) After 12000 nodes, 520 on tree, 1e+50 best solution, best possible 0 (4041.55 seconds) After 12100 nodes, 553 on tree, 1e+50 best solution, best possible 0 (4084.64 seconds) After 12200 nodes, 595 on tree, 1e+50 best solution, best possible 0 (4123.37 seconds) After 12300 nodes, 639 on tree, 1e+50 best solution, best possible 0 (4166.99 seconds) After 12400 nodes, 693 on tree, 1e+50 best solution, best possible 0 (4212.45 seconds) After 12500 nodes, 711 on tree, 1e+50 best solution, best possible 0 (4248.37 seconds) After 12600 nodes, 742 on tree, 1e+50 best solution, best possible 0 (4283.89 seconds) After 12700 nodes, 782 on tree, 1e+50 best solution, best possible 0 (4321.89 seconds) After 12800 nodes, 823 on tree, 1e+50 best solution, best possible 0 (4362.18 seconds) After 12900 nodes, 862 on tree, 1e+50 best solution, best possible 0 (4406.56 seconds) After 13000 nodes, 910 on tree, 1e+50 best solution, best possible 0 (4448.33 seconds) After 13100 nodes, 955 on tree, 1e+50 best solution, best possible 0 (4498.40 seconds) After 13200 nodes, 978 on tree, 1e+50 best solution, best possible 0 (4535.97 seconds) After 13300 nodes, 1000 on tree, 1e+50 best solution, best possible 0 (4574.85 seconds) After 13400 nodes, 1040 on tree, 1e+50 best solution, best possible 0 (4608.84 seconds) After 13500 nodes, 1078 on tree, 1e+50 best solution, best possible 0 (4642.81 seconds) After 13600 nodes, 1117 on tree, 1e+50 best solution, best possible 0 (4680.70 seconds) After 13700 nodes, 1149 on tree, 1e+50 best solution, best possible 0 (4723.16 seconds) After 13800 nodes, 1190 on tree, 1e+50 best solution, best possible 0 (4771.35 seconds) After 13900 nodes, 1238 on tree, 1e+50 best solution, best possible 0 (4822.57 seconds) After 14000 nodes, 1291 on tree, 1e+50 best solution, best possible 0 (4870.06 seconds) After 14100 nodes, 1327 on tree, 1e+50 best solution, best possible 0 (4910.51 seconds) After 14200 nodes, 1339 on tree, 1e+50 best solution, best possible 0 (4945.85 seconds) After 14300 nodes, 1361 on tree, 1e+50 best solution, best possible 0 (4984.04 seconds) After 14400 nodes, 1399 on tree, 1e+50 best solution, best possible 0 (5016.34 seconds) After 14500 nodes, 1431 on tree, 1e+50 best solution, best possible 0 (5047.48 seconds) After 14600 nodes, 1473 on tree, 1e+50 best solution, best possible 0 (5080.13 seconds) After 14700 nodes, 1511 on tree, 1e+50 best solution, best possible 0 (5112.75 seconds) After 14800 nodes, 1549 on tree, 1e+50 best solution, best possible 0 (5151.11 seconds) After 14900 nodes, 1577 on tree, 1e+50 best solution, best possible 0 (5190.05 seconds) After 15000 nodes, 1622 on tree, 1e+50 best solution, best possible 0 (5225.70 seconds) After 15100 nodes, 1673 on tree, 1e+50 best solution, best possible 0 (5259.64 seconds) After 15200 nodes, 1720 on tree, 1e+50 best solution, best possible 0 (5299.08 seconds) After 15300 nodes, 1775 on tree, 1e+50 best solution, best possible 0 (5334.13 seconds) After 15400 nodes, 1816 on tree, 1e+50 best solution, best possible 0 (5373.89 seconds) After 15500 nodes, 1837 on tree, 1e+50 best solution, best possible 0 (5404.53 seconds) After 15600 nodes, 1844 on tree, 1e+50 best solution, best possible 0 (5446.30 seconds) After 15700 nodes, 1878 on tree, 1e+50 best solution, best possible 0 (5481.15 seconds) After 15800 nodes, 1908 on tree, 1e+50 best solution, best possible 0 (5514.16 seconds) After 15900 nodes, 1935 on tree, 1e+50 best solution, best possible 0 (5548.23 seconds) After 16000 nodes, 1966 on tree, 1e+50 best solution, best possible 0 (5581.01 seconds) After 16100 nodes, 2006 on tree, 1e+50 best solution, best possible 0 (5613.22 seconds) After 16200 nodes, 2043 on tree, 1e+50 best solution, best possible 0 (5646.26 seconds) After 16300 nodes, 2085 on tree, 1e+50 best solution, best possible 0 (5680.91 seconds) After 16400 nodes, 2108 on tree, 1e+50 best solution, best possible 0 (5723.89 seconds) After 16500 nodes, 2138 on tree, 1e+50 best solution, best possible 0 (5766.66 seconds) After 16600 nodes, 2175 on tree, 1e+50 best solution, best possible 0 (5802.96 seconds) After 16700 nodes, 2215 on tree, 1e+50 best solution, best possible 0 (5844.47 seconds) After 16800 nodes, 2270 on tree, 1e+50 best solution, best possible 0 (5891.22 seconds) After 16900 nodes, 2311 on tree, 1e+50 best solution, best possible 0 (5939.65 seconds) After 17000 nodes, 2356 on tree, 1e+50 best solution, best possible 0 (5981.84 seconds) After 17100 nodes, 2404 on tree, 1e+50 best solution, best possible 0 (6020.67 seconds) After 17200 nodes, 2441 on tree, 1e+50 best solution, best possible 0 (6060.45 seconds) After 17300 nodes, 2469 on tree, 1e+50 best solution, best possible 0 (6091.01 seconds) After 17400 nodes, 2475 on tree, 1e+50 best solution, best possible 0 (6127.96 seconds) After 17500 nodes, 2491 on tree, 1e+50 best solution, best possible 0 (6165.43 seconds) After 17600 nodes, 2517 on tree, 1e+50 best solution, best possible 0 (6200.51 seconds) After 17700 nodes, 2546 on tree, 1e+50 best solution, best possible 0 (6231.94 seconds) After 17800 nodes, 2573 on tree, 1e+50 best solution, best possible 0 (6263.00 seconds) After 17900 nodes, 2604 on tree, 1e+50 best solution, best possible 0 (6295.09 seconds) After 18000 nodes, 2623 on tree, 1e+50 best solution, best possible 0 (6331.00 seconds) After 18100 nodes, 2654 on tree, 1e+50 best solution, best possible 0 (6367.49 seconds) After 18200 nodes, 2690 on tree, 1e+50 best solution, best possible 0 (6400.20 seconds) After 18300 nodes, 2729 on tree, 1e+50 best solution, best possible 0 (6436.65 seconds) After 18400 nodes, 2771 on tree, 1e+50 best solution, best possible 0 (6471.20 seconds) After 18500 nodes, 2799 on tree, 1e+50 best solution, best possible 0 (6512.29 seconds) After 18600 nodes, 2815 on tree, 1e+50 best solution, best possible 0 (6556.32 seconds) After 18700 nodes, 2853 on tree, 1e+50 best solution, best possible 0 (6597.83 seconds) After 18800 nodes, 2875 on tree, 1e+50 best solution, best possible 0 (6651.15 seconds) After 18900 nodes, 2911 on tree, 1e+50 best solution, best possible 0 (6704.38 seconds) After 19000 nodes, 2953 on tree, 1e+50 best solution, best possible 0 (6745.25 seconds) After 19100 nodes, 3003 on tree, 1e+50 best solution, best possible 0 (6781.13 seconds) After 19200 nodes, 3042 on tree, 1e+50 best solution, best possible 0 (6824.22 seconds) After 19300 nodes, 3087 on tree, 1e+50 best solution, best possible 0 (6863.38 seconds) After 19400 nodes, 3131 on tree, 1e+50 best solution, best possible 0 (6904.71 seconds) After 19500 nodes, 3177 on tree, 1e+50 best solution, best possible 0 (6943.17 seconds) After 19600 nodes, 3213 on tree, 1e+50 best solution, best possible 0 (6986.90 seconds) After 19700 nodes, 3251 on tree, 1e+50 best solution, best possible 0 (7020.31 seconds) After 19800 nodes, 3264 on tree, 1e+50 best solution, best possible 0 (7053.00 seconds) After 19900 nodes, 3271 on tree, 1e+50 best solution, best possible 0 (7093.15 seconds) After 20000 nodes, 3284 on tree, 1e+50 best solution, best possible 0 (7128.85 seconds) After 20100 nodes, 3313 on tree, 1e+50 best solution, best possible 0 (7166.44 seconds) Thread 0 used 10117 times, waiting to start 1.76748, 60152 locks, 3.21938 locked, 0.106171 waiting for locks Thread 1 used 10073 times, waiting to start 5.07323, 59722 locks, 3.15216 locked, 0.106864 waiting for locks Main thread 3584.72 waiting for threads, 40605 locks, 0.0873804 locked, 0.067968 waiting for locks Exiting on maximum time Partial search - best objective 1e+50 (best possible 0), took 6370395 iterations and 20189 nodes (7194.21 seconds) Strong branching done 6932 times (672629 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 59, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 2476 times and created 11599 cuts of which 6470 were active after adding rounds of cuts (11.281 seconds) Gomory was tried 2476 times and created 4011 cuts of which 197 were active after adding rounds of cuts (65.696 seconds) Knapsack was tried 9 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.036 seconds) Clique was tried 9 times and created 24 cuts of which 9 were active after adding rounds of cuts (0.060 seconds) MixedIntegerRounding2 was tried 9 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.060 seconds) FlowCover was tried 9 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 9 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.696 seconds) Result - Stopped on time objective 1e+50 after 20189 nodes and 6370395 iterations - took 7201.20 seconds (total time 7202.11) Total time 7202.11 Time limit reached. No feasible solution found. wallclocktime: 3637.34 used seconds: 7202.12 Best possible: 0 --- Restarting execution --- acc-tight-3.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job acc-tight-3.gms Stop 07/17/08 11:56:13 elapsed 1:00:37.476