(70steps) PrintForm Definitions Lemmas mb hybrid Sections GenAutomata Doc

At: P causal switchable0 6 1 1 1
1. E: EventStruct
2. x: |E| List
3. y: |E| List
4. i:||x||. j:||x||. ji & is-send(E)(x[j]) & (x[j] =msg=(E) x[i])
5. i1: (||x||-1)
6. (x[i1] =msg=(E) x[(i1+1)])
7. is-send(E)(x[i1]) & is-send(E)(x[(i1+1)]) is-send(E)(x[i1]) & is-send(E)(x[(i1+1)])
8. y = swap(x;i1;i1+1)
9. i: ||y||
10. ||swap(x;i1;i1+1)|| = ||x||
11. ||y|| = ||x||
12. ||swap(y;i1;i1+1)|| = ||y||
13. (i1, i1+1) ||x||||x||
14. j: ||x||
15. j(i1, i1+1)(i)
16. is-send(E)(x[j])
17. x[j] =msg=(E) x[((i1, i1+1)(i))]

(i1, i1+1)(j)i
By:
MoveToConcl -3
THEN
Unfold `flip` 0
THEN
Reduce 0
THEN
Repeat SplitOnConclITE
Generated subgoals:

115. is-send(E)(x[j])
16. x[j] =msg=(E) x[((i1, i1+1)(i))]
17. i = i1
18. ji1+1
19. j = i1
i1+1i
215. is-send(E)(x[j])
16. x[j] =msg=(E) x[((i1, i1+1)(i))]
17. i = i1
18. jif i=i1+1 i1 else i fi
19. j = i1
i1+1i
315. is-send(E)(x[j])
16. x[j] =msg=(E) x[((i1, i1+1)(i))]
17. i = i1
18. jif i=i1+1 i1 else i fi
19. j = i1
20. j = i1+1
i1i
415. is-send(E)(x[j])
16. x[j] =msg=(E) x[((i1, i1+1)(i))]
17. i = i1
18. jif i=i1+1 i1 else i fi
19. j = i1
20. j = i1+1
ji

About:
listassertintnatural_numberaddsubtractapplyfunction
equalmemberandorallexists

(70steps) PrintForm Definitions Lemmas mb hybrid Sections GenAutomata Doc