# converting predicate logic to clause form

Lets say we have a statement in predicate logic which we have to convert to clause form to apply unification:

$\forall x, P1(x) \vee P2(x) \Rightarrow P3(x)$

or,

$\exists x,\neg( P1(x) \vee P2(x)) \vee P3(x)$

or,

$\exists x,(\neg P1(x) \wedge \neg P2(x)) \vee P3(x)$

How to go from here? Does it divide into two separate statements, like so-

$\neg P1(x) \vee P3(x)$

$\neg P2(x) \vee P3(x)$

?