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:
| tournament | 2001 | 2002 | 2003 | 2004 | 2005 | 2006 | 2007 | 2008 | 2009 | 2011 | 2012 | 2013 | career sr | career win - loss |
| grand slams | grand slams | grand slams | grand slams | grand slams | grand slams | grand slams | grand slams | grand slams | grand slams | grand slams | grand slams | grand slams | grand slams | grand slams |
| australian open | a | 3r | 1r | a | 1r | a | 1r | a | 2r | qf | 2r | 3r | 0 / 9 | 10 - 9 |
| french open | a | 1r | 1r | a | a | a | 2r | 3r | 1r | 3r | 2r | 1r | 1 / 9 | 6 - 9 |
| wimbledon | 2r | 1r | 2r | 1r | 1r | 2r | 1r | 1r | 1r | 2r | 3r | 2r | 0 / 13 | 7 - 13 |
| us open | a | 1r | 1r | a | a | a | 1r | 1r | 1r | 1r | 3r | 1r | 0 / 9 | 2 - 9 |
| grand slam sr | 0 / 1 | 0 / 4 | 0 / 4 | 0 / 1 | 0 / 2 | 0 / 1 | 0 / 4 | 0 / 3 | 0 / 4 | 0 / 4 | 0 / 4 | 0 / 4 | 0 / 40 | n / a |
| annual win - loss | 1 - 1 | 2 - 4 | 1 - 4 | 0 - 1 | 0 - 2 | 1 - 1 | 1 - 4 | 2 - 3 | 1 - 4 | 6 - 4 | 6 - 4 | 3 - 4 | n / a | 25 - 40 |
Title:
natalie grandin
Statement:
the grand slam where natalie grandin had the most wins was at the australian open
Answer:
supported