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:
| operation | binary | binomial | fibonacci | pairing | brodal | strict fibonacci heap |
| find - min | θ (1) | θ (1) | θ (1) | θ (1) | θ (1) | θ (1) |
| delete - min | θ (log n) | θ (log n) | o (log n) | o (log n) | o (log n) | o (log n) |
| insert | θ (log n) | o (log n) | θ (1) | θ (1) | θ (1) | θ (1) |
| decrease - key | θ (log n) | θ (log n) | θ (1) | o (log n) | θ (1) | θ (1) |
| merge | θ (n) | o (log n) | θ (1) | θ (1) | θ (1) | θ (1) |
Title:
none
Statement:
the binomial Θ (log n) has a pairing of θ (1)
Answer:
refuted