The 3-SATISFIABILITY problem is just a restricted version of SAT-ISFIABILITY in which all instances have exactly three literals per clause.
Its simple structure structure makes it one of the most widely used problems for proving other NP-completeness results.