Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.
I'm sorry mama, I never meant to hurt you. I never meant to make you cry, but tonight I'm cleaning out my closet.