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 | partner | opponents in the final | score in the final |
| runner - up | 2000 | wimbledon | grass | julie halard | serena williams venus williams | 6 - 3 , 6 - 2 |
| winner | 2000 | us open | hard | julie halard | cara black elena likhovtseva | 6 - 0 , 1 - 6 , 6 - 1 |
| runner - up | 2001 | wimbledon (2) | grass | kim clijsters | lisa raymond rennae stubbs | 6 - 4 , 6 - 3 |
| winner | 2003 | french open | clay | kim clijsters | virginia ruano pascual paola suárez | 6 - 7 , 6 - 2 , 9 - 7 |
| winner | 2003 | wimbledon | grass | kim clijsters | virginia ruano pascual paola suárez | 6 - 4 6 - 4 |
| runner - up | 2004 | wimbledon (3) | grass | liezel huber | cara black rennae stubbs | 6 - 3 , 7 - 6 |
| runner - up | 2006 | french open | clay | daniela hantuchová | lisa raymond samantha stosur | 6 - 3 , 6 - 2 |
| runner - up | 2007 | french open (2) | clay | katarina srebotnik | alicia molik mara santangelo | 7 - 6 , 6 - 4 |
| runner - up | 2007 | wimbledon (4) | grass | katarina srebotnik | cara black liezel huber | 3 - 6 , 6 - 3 , 6 - 2 |
| runner - up | 2009 | australian open | hard | daniela hantuchová | serena williams venus williams | 6 - 3 , 6 - 3 |
Title:
ai sugiyama
Statement:
the surface for the 2009 australian open and the 2000 us open was hard
Answer:
supported