Yes.
SAT
(the set of unsatisfiable clausal propositional formulas) is CoNP-complete.