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)) /\ ((q /\ p) || ~p)
ready: no
Feedback
Environment
initial=TList [TVar "q"]
Path 1
path | [0, 0, 4, 0, 0, 3, 0, 0, 0, 0, 1, 0, 5, 6, 1, 3] |
steps | 16 |
major rules | 1 |
active labels | - consequence
- simplify
- andrules
|
enter consequence,
initial,
navigator.down,
navigator.down,
enter cnf,
exit cnf,
navigator.up,
navigator.up,
navigator.downlast,
enter cnf,
check,
enter simplify,
navigator.down,
navigator.right,
enter andrules,
logic.propositional.absorpand