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:
| no | date | tournament | winning score | to par | margin of victory | runner (s) - up |
| 1 | oct 5 , 2008 | turning stone resort championship | 72 + 68 + 70 + 69 = 279 | 9 | 1 stroke | robert allenby |
| 2 | feb 15 , 2009 | at&t pebble beach national pro - am | 65 + 69 + 67 = 201 | 15 | 4 strokes | mike weir |
| 3 | feb 14 , 2010 | at&t pebble beach national pro - am (2) | 64 + 68 + 64 + 74 = 270 | 16 | 1 stroke | david duval , j b holmes |
| 4 | sep 12 , 2010 | bmw championship | 68 + 70 + 68 + 69 = 275 | 9 | 1 stroke | paul casey |
| 5 | aug 27 , 2011 | the barclays | 66 + 63 + 65 = 194 | 19 | 2 strokes | matt kuchar |
| 6 | jun 10 , 2012 | fedex st jude classic | 70 + 68 + 67 + 66 = 271 | 9 | 1 stroke | john merrick |
| 7 | jan 8 , 2013 | hyundai tournament of champions | 69 + 66 + 68 = 203 | 16 | 4 strokes | steve stricker |
Title:
dustin johnson
Statement:
the highest winning score is 72 + 68 + 70 + 69 = 279
Answer:
supported