use truth table to convert formula to CNF form

Question

   p q | ((p→q)∧p)→q
   1 1 | 1 
   1 0 | 1 
   0 1 | 1  
   0 0 | 1 

I want to convert a formula to CNF form by means of truth tables. However I have a problem I understand that the method is to look for the values of the table of truth that are zero but in this case, what should I do, if all the values are one ?

Answer 1

You can just do:

$$p \lor \neg p$$

This is in CNF, since a statement is in CNF iff it is a conjunction of disjunctions of literals (atomic statement or its negation), and this statement can be seen as $1$ conjunct consisting of two disjuncts, where each disjunct is a literal.