I'm wondering how to test whether or not two arguments are logically equivalent or not by using the tree method.
Example:
1) $\neg \forall x(Lxa → Lax) $
2) $\exists x(Lxa ∧ \neg Lax) $
I have already checked that they're true using rules of inference, but I'm not sure how to do it on a truth tree.