问题:
[单选题]
If we have a magic machine that can solve 3-SAT problem in unit time. Which of the following problem can NOT be solve if we only use this machine polynomial times? (Assume P ≠ NP)
AINDEPENDENT-SET
BVERTEX-COVER
CPRIMES
DHALTING PROBLEM