Repeat: If the problem is NP-complete, the polynomial time hierarchy will collapse to its first level (i.e., NP will equal co-NP).
If the problem is NP-complete, the polynomial time hierarchy will collapse to its first level (i.e., NP will equal co-NP).