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:
| position | team | played | wins | draws | losses | scored | conceded | points |
| 1 | olimpia | 9 | 4 | 4 | 1 | 14 | 6 | 16 |
| 2 | 12 de octubre | 9 | 3 | 6 | 0 | 14 | 8 | 15 |
| 3 | cerro porteño | 9 | 3 | 5 | 1 | 16 | 10 | 14 |
| 4 | guaraní | 9 | 3 | 5 | 1 | 8 | 6 | 14 |
| 5 | cerro corá | 9 | 3 | 4 | 2 | 9 | 8 | 13 |
| 6 | atl colegiales | 9 | 3 | 4 | 2 | 9 | 9 | 13 |
| 7 | sol de américa | 9 | 2 | 5 | 2 | 11 | 10 | 11 |
| 8 | san lorenzo | 9 | 3 | 1 | 5 | 13 | 18 | 10 |
| 9 | universal | 9 | 1 | 3 | 5 | 9 | 17 | 6 |
| 10 | sportivo luqueño | 9 | 0 | 3 | 6 | 8 | 19 | 3 |
Title:
2000 in paraguayan football
Statement:
team universal has 3 for draws , points smaller than 15 , a cone timeded larger than 10 , a position larger than 8 and a wins of 1
Answer:
supported