Suppose that a propositional logic formula does not syntactically contain a literal and its

negation $($for any literal$).$ Then, the formula must be satisfiable if $...($check all that apply$)$

$($Assume that the formula does not contain the boolean constants true and false$)$

$-$ It is in CNF

$-$ It is in DNF

$-$ It is in NNF

$-$ This is true for any formula

$-$ As long as it does not contain $$ or