[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Proof step 20 from proof spawn-sat-rg-strnger (
previous step
)
□ Inpf = Inpf', Gr(0)(S, S'), GInv(S) → GInv(S') ⊦ (last ⊃ Poton(0)(S) ∧ GInv(S);Gton(0)(S, S') ∧ ¬ blocked ∧ (GInv(S) → GInv(S'))), last, blocked
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 21
:
□ Inpf = Inpf', Gr(0)(S, S'), ¬ Gton(0)(S, S'), GInv(S) → GInv(S') ⊦ last, blocked
Rule argument
Additional information