[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 8 from proof progress-left (previous step)

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

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 4, left 5, left 6, left 8, left 9, left 10, left 11, left 12, left 13, left 14, left 15, left 22, left 23, left 25

Additional information