[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 rg2-sound-main-unfair (previous step)

R2(pm, S', S'') -+-> (last ⊃ Post2(pm, s, S);G2(pm, S, S')), \A ∀ N, Post1, pm, s, S, G1, R1, Post2, G2, R2, Pre1, I, Pre2. N < n → [:S | [PL R1(pm, S', S'') -+-> (last ⊃ Post1(pm, s, S);G1(pm, S, S'))] ∥nf [PL R2(pm, S', S'') -+-> (last ⊃ Post2(pm, s, S);G2(pm, S, S'))]] ∧ RG-restr(pm, R1, G1, Pre1, Post1, I, R2, G2, Pre2, Post2) ∧ Pre1(pm, s) ∧ Pre2(pm, s) ∧ I(pm, S) → ((R1(pm, S', S'') ∧ R2(pm, S', S'')) ∧ N = N'' +1) -+-> (last ⊃ Post1(pm, s, S) ∧ Post2(pm, s, S);G1(pm, S, S') ∨ G2(pm, S, S')), n = N + 1, R1(pm, s2, s2), R1(pm, s2, S), Post1(pm, s, s2), I(pm, s2), R1(pm, s2, s3), R1(pm, s3, S), R2(pm, s3, S), G2(pm, s2, s3), I(pm, s), Pre2(pm, s), Pre1(pm, s), RG-restr(pm, R1, G1, Pre1, Post1, I, R2, G2, Pre2, Post2), I(pm, S), I(pm, s3), Post1(pm, s, S), Post1(pm, s, s3), boolvar → s2 = s3 ∧ N + 1 = n0 ⊦ (R1(pm, S', S'') ∧ R2(pm, S', S'') ∧ N = N'' + 1) -+-> (last ⊃ Post1(pm, s, S) ∧ Post2(pm, s, S);G1(pm, S, S') ∨ G2(pm, S, S'))

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 2, left 3, left 4, left 5, left 6, left 7, left 8, left 9, left 10, left 11, left 12, left 17, left 19, left 20

Additional information