# The resolution method

how do I find the resolvent of this formula?

$(A \vee C) \wedge ( \neg A \vee B) \wedge C$

Is it as easy as taking every clause with the same statements?

$(A \vee C)$ and $( \neg A \vee B)$ and put out the contradiction (in this case $A$ and $\neg A$)

Could you recommend me some source for resolution method except Wikipedia, because there are too easy examples?

-
Try Googling "resolution proof system". – Yuval Filmus Dec 5 '10 at 23:52
The version of resolution I'm aware of is a proof system for refuting a conjunction of clauses, but your formula is not contradictory. In fact, it is a 2-SAT formula and so there's a simple efficient algorithm for deciding whether it's satisfiable. – Yuval Filmus Dec 5 '10 at 23:53