Give you a statement and table with its title in Markdown format, please determine whether the statement is supported or refuted by, or is unrelated to the table. It'a binary classification problem, you should choose the answer between supported and refuted. Table cells in one row are seperated by '|', and different rows are seperated by '
'.

Table:
| year | date final | venue | prize money | champion | runner - up | score in final | commercial name |
| 1989 | apr 26 - 30 | atlanta | 500000 | andre agassi | michael chang | 6 - 3 , 6 - 2 | at&t challenge of champions |
| 1988 | apr 28 - may 1 | atlanta | 500000 | ivan lendl | stefan edberg | 2 - 6 , 6 - 1 , 6 - 3 | at&t challenge of champions |
| 1987 | oct 6 - 11 | atlanta | 500000 | john mcenroe | paul annacone | 6 - 4 , 7 - 5 | at&t challenge of champions |
| 1986 | nov 25 - 30 | atlanta | 500000 | boris becker | john mcenroe | 3 - 6 , 6 - 3 , 7 - 5 | at&t challenge of champions |
| 1986 | jan 6 - 12 | atlanta | 500000 | ivan lendl | jimmy connors | 6 - 2 , 6 - 3 | at&t challenge of champions |
| 1985 | jan 1 - 6 | las vegas | 1290000 | john mcenroe | guillermo vilas | 7 - 5 , 6 - 0 | at&t challenge of champions |
| 1984 | jan 3 - 8 | rosemont | 250000 | jimmy connors | andrés gómez | 6 - 3 , 6 - 2 , 6 - 1 | lite challenge of champions |
| 1983 | jan 4 - 9 | rosemont | 250000 | ivan lendl | jimmy connors | 4 - 6 , 6 - 4 , 7 - 5 , 6 - 4 | lite challenge of champions |
| 1982 | jan 6 - 11 | rosemont | 310000 | jimmy connors | john mcenroe | 6 - 7 , 7 - 5 , 6 - 7 , 7 - 5 , 6 - 4 | michelob light challenge of champions |
| 1981 | jan 7 - 12 | rosemont | 310000 | john mcenroe | jimmy connors | 6 - 2 , 6 - 4 , 6 - 1 | challenge of champions |
Title:
challenge of champions
Statement:
the year 1985 had the challenge of champions with the highest prize money
Answer:
supported