answer in 30 min please

Prove that Subset sum is NP-Hard using the following CNF formula. O = (x1 v -x2 v x3) ^ (x1 v x2 v-x4) A (x2 v x3 v x4) A (-x1 v x2 v -x4) where - is the negation operation