充足可能性問題
Note that the unrestricted Boolean satisfiability problem is an NP-complete problem.