现实一点,要求不可能的事!
Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.