[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 64 from proof spawn-sat-rg-strnger (previous step)

□ (Outf = Outf' ∧ Inpf = Inpf'), [:S | [PL ¬ GInv(S) ∨ ¬ Pr(n0 + 1)(S)] ∥ [PL GInv(S) ∧ Prton(n0)(S) ∧ (Rton(n0)(S', S'') ∧ (GInv(S') → GInv(S''))) -+-> (last ⊃ Poton(n0)(S) ∧ GInv(S);Gton(n0)(S, S') ∧ ¬ blocked ∧ (GInv(S) → GInv(S'))) ] ], ∀ m. m ≤ n0 + 1 → Pr(m)(S), GInv(S) ⊦ (Rton(n0 + 1)(S', S'') ∧ (GInv(S') → GInv(S''))) -+-> (last ⊃ Poton(n0 + 1)(S) ∧ GInv(S);Gton(n0 + 1)(S, S') ∧ ¬ blocked ∧ (GInv(S) → GInv(S'))), [:S | [PL ¬ Pr(n0 + 1)(S) ∨ ¬ GInv(S)] ∥ [PL (Rton(n0)(S', S'') ∧ (GInv(S') → GInv(S''))) -+-> (last ⊃ Poton(n0)(S);Gton(n0)(S, S') ∧ (GInv(S) → GInv(S')) ∧ (GInv(S) → ¬ blocked))] ]

User applied rule decompose

And obtained the following new goals

Rule argument

positions: 2, 2

Additional information