Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

¬(F ∨ (((F ∨ r) ↔ r) ∧ ¬¬(T ∧ r)))

⇒ logic.propositional.notnot

¬(F ∨ (((F ∨ r) ↔ r) ∧ T ∧ r))

⇒ logic.propositional.truezeroand

¬(F ∨ (((F ∨ r) ↔ r) ∧ r))