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:
| outcome | year | championship | surface | opponent in the final | score in the final |
| runner - up | 1990 | french open | clay | andrés gómez | 3 - 6 , 6 - 2 , 4 - 6 , 4 - 6 |
| runner - up | 1990 | us open | hard | pete sampras | 4 - 6 , 3 - 6 , 2 - 6 |
| runner - up | 1991 | french open | clay | jim courier | 6 - 3 , 4 - 6 , 6 - 2 , 1 - 6 , 4 - 6 |
| winner | 1992 | wimbledon | grass | goran ivanišević | 6 - 7 (8 - 10) , 6 - 4 , 6 - 4 , 1 - 6 , 6 - 4 |
| winner | 1994 | us open | hard | michael stich | 6 - 1 , 7 - 6 (7 - 5) , 7 - 5 |
| winner | 1995 | australian open | hard | pete sampras | 4 - 6 , 6 - 1 , 7 - 6 (8 - 6) , 6 - 4 |
| runner - up | 1995 | us open | hard | pete sampras | 4 - 6 , 3 - 6 , 6 - 4 , 5 - 7 |
| winner | 1999 | french open | clay | andrei medvedev | 1 - 6 , 2 - 6 , 6 - 4 , 6 - 3 , 6 - 4 |
| runner - up | 1999 | wimbledon | grass | pete sampras | 3 - 6 , 4 - 6 , 5 - 7 |
| winner | 1999 | us open | hard | todd martin | 6 - 4 , 6 - 7 (5 - 7) , 6 - 7 (2 - 7) , 6 - 3 , 6 - 2 |
| winner | 2000 | australian open | hard | yevgeny kafelnikov | 3 - 6 , 6 - 3 , 6 - 2 , 6 - 4 |
| winner | 2001 | australian open | hard | arnaud clément | 6 - 4 , 6 - 2 , 6 - 2 |
| runner - up | 2002 | us open | hard | pete sampras | 3 - 6 , 4 - 6 , 7 - 5 , 4 - 6 |
| winner | 2003 | australian open | hard | rainer schüttler | 6 - 2 , 6 - 2 , 6 - 1 |
Title:
andre agassi career statistics
Statement:
pete sampras was the opponent in the 1990 us open only
Answer:
refuted