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