If a CNF contains only Horn and Xor clauses, then what is the complexity of determining Satisfiability?
Hint: Using XOR clauses you can express "$x = \lnot y$", and this allows you to simulate general clauses by Horn clauses.