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 | 1966 | us championships (1 / 1) | grass | fred stolle | 6 - 4 , 10 - 12 , 3 - 6 , 4 - 6 |
| winner | 1967 | wimbledon | grass | wilhelm bungert | 6 - 2 , 6 - 1 , 6 - 1 |
| winner | 1967 | us championships (2 / 1) | grass | clark graebner | 6 - 4 , 6 - 4 , 8 - 6 |
| runner - up | 1969 | wimbledon | grass | rod laver | 4 - 6 , 7 - 5 , 4 - 6 , 4 - 6 |
| winner | 1970 | wimbledon | grass | ken rosewall | 5 - 7 , 6 - 3 , 6 - 2 , 3 - 6 , 6 - 1 |
| winner | 1971 | wimbledon | grass | stan smith | 6 - 3 , 5 - 7 , 2 - 6 , 6 - 4 , 6 - 4 |
| winner | 1973 | australian open | grass | onny parun | 6 - 3 , 6 - 7 , 7 - 5 , 6 - 1 |
| winner | 1973 | us open | grass | jan kodeš | 6 - 4 , 1 - 6 , 4 - 6 , 6 - 2 , 6 - 3 |
| winner | 1975 | australian open | grass | jimmy connors | 7 - 5 , 3 - 6 , 6 - 4 , 7 - 6 |
Title:
john newcombe career statistics
Statement:
john newcombe has won at wimbledon two times , the same amount of times as the us championship
Answer:
refuted