What is the complexity of determining Satisfiability of a CNF containing both Horn and Dual Horn clauses?
3-CNF formulas contain a mixture of only Horn and dual-Horn clauses.  3-SAT, the Boolean satisfiability problem over 3-CNF formulas, is known to be NP-complete.  So it is unlikely that the satisfiability of such formulas can be decided in polynomial time.