Exercise logic.propositional.consequence
Description
Prove that formula is a logical consequence of a set of formulas
![](http://ideas.cs.uu.nl/images/external.png)
~q => (p || (~(p || q) /\ ~p)) /\ (p || q || (~p /\ ~q /\ ~p))
ready: no
Feedback
Environment
initial=TList [TCon logic1.not [TVar "q"]]
Path 1
path | [0, 0, 4, 0, 0, 3, 0, 0, 0, 0, 1, 4, 4, 5, 4, 5, 4, 1] |
steps | 18 |
major rules | 1 |
active labels | |
enter consequence,
initial,
navigator.down,
navigator.down,
enter cnf,
exit cnf,
navigator.up,
navigator.up,
navigator.downlast,
enter cnf,
check,
enter demorgan,
navigator.down,
navigator.right,
navigator.down,
navigator.right,
navigator.down,
logic.propositional.demorganor