Exercise logic.propositional.cnf.unicode
Description
Proposition to CNF (unicode support)
Derivation
Final term is not finished
T ∧ ¬(((r ∧ r) ∨ (¬r ∧ ¬r ∧ ¬r ∧ ¬r) ∨ F) ∧ ((T ∧ r) ∨ (T ∧ r)))
⇒ logic.propositional.falsezeroorT ∧ ¬(((r ∧ r) ∨ (¬r ∧ ¬r ∧ ¬r ∧ ¬r)) ∧ ((T ∧ r) ∨ (T ∧ r)))
⇒ logic.propositional.idempandT ∧ ¬(((r ∧ r) ∨ (¬r ∧ ¬r)) ∧ ((T ∧ r) ∨ (T ∧ r)))
⇒ logic.propositional.idempandT ∧ ¬(((r ∧ r) ∨ ¬r) ∧ ((T ∧ r) ∨ (T ∧ r)))