# How to show that this formula is a tautology using resolution?

I know how to show a CNF formula is a tautology using resolution, I've come across this DNF now and have to show its a tautology, is it the same technique or do I need to change it to a CNF? if so how?

             F := (A ∧ B) ∨ (A ∧ ¬B) ∨ (¬A ∧ B) ∨ (¬A ∧ ¬B)

• Group the first two and second two terms together. – Cameron Williams Jan 19 at 16:51
• You can just use a truth table, and show that $F$ is always True. I can give answer below if needed – NazimJ Jan 19 at 16:58

$$\begin{bmatrix} & | & A & \neg A \\ \hline B & | & T \lor F \lor F \lor F = T & F \lor F \lor T \lor F = T \\ \neg B & | & F \lor T \lor F \lor F = T & F \lor F \lor F \lor T = T \end{bmatrix}$$