Consider MAJORITY-OF-3 SAT, in which each clause contains three literals and at least two of them must be true for it to be satisfied. Either show that this problem is in p by reducing it to 2-SAT, or show that it is NP-complete by reducing 3-SAT to it.