Step
*
1
1
2
1
1
1
of Lemma
new_23_sig_progress-step9
1. Cmd : {T:Type| valueall-type(T)}
2. eq : EqDecider(Cmd)
3. reps : bag(Id)
4. clients : bag(Id)
5. coeff : {2...}
6. flrs : ℕ
7. propose : Atom List
8. notify : Atom List
9. slots : set-sig{i:l}(ℤ)
10. f : new_23_sig_headers_type{i:l}(Cmd;notify;propose)
11. (f propose) = (ℤ × Cmd) ∈ Type
12. (f notify) = (ℤ × Cmd) ∈ Type
13. (f ``new_23_sig decided``) = (ℤ × Cmd) ∈ Type
14. (f ``new_23_sig retry``) = (ℤ × ℤ × Cmd) ∈ Type
15. (f ``new_23_sig vote``) = (ℤ × ℤ × Cmd × Id) ∈ Type
16. f ∈ Name ─→ Type
17. es : EO+(Message(f))
18. e : E
19. n : ℤ
20. c : Cmd
21. faulty : bag(Id)
22. msgs-interface-delivered-with-omissions(f;es;new_23_sig_main();faulty;flrs;reps)@i
23. bag-no-repeats(Id;reps)@i
24. #(reps) = ((coeff * flrs) + flrs + 1) ∈ ℤ@i
25. loc(e) ↓∈ reps@i
26. ¬loc(e) ↓∈ faulty@i
27. <n, c> ∈ new_23_sig_Proposal(Cmd;notify;propose;f)(e)@i
28. ¬↑(set-sig-member(slots) n new_23_sig_ReplicaStateFun(Cmd;notify;propose;slots;f;es;e))@i
29. bs : (Id × E × Cmd) List
30. ((coeff * flrs) + 1) ≤ ||bs||
31. (∀x∈bs.(loc(fst(snd(x))) = loc(e) ∈ Id)
∧ e ≤loc fst(snd(x))
∧ <<<n, 0>, snd(snd(x))>, fst(x)> ∈ new_23_sig_vote'base(Cmd;notify;propose;f)(fst(snd(x))))
32. l-ordered(Id × E × Cmd;x,y.(fst(snd(x)) <loc fst(snd(y)));bs)
33. (∀e'∈[e, fst(snd(last(bs)))].(↑new_23_sig_vote_with_ballot(Cmd;notify;propose;f;es;e';n;0))
⇒ (e' ∈ map(λx.(fst(snd(x)));bs)))
34. b_all(Id;[x∈reps|¬bbag-deq-member(IdDeq;x;faulty)];i.(i ∈ map(λi.(fst(i));bs)))
35. 0 ≤ (coeff * flrs)
36. ((coeff * flrs) + 1) ≤ ||remove-repeats-fun(IdDeq;λx.(fst(x));bs)||
37. K : (Id × E × Cmd) List
38. J : (Id × E × Cmd) List
39. remove-repeats-fun(IdDeq;λx.(fst(x));bs) = (K @ J) ∈ ((Id × E × Cmd) List)
40. ||K|| = ((coeff * flrs) + 1) ∈ ℤ
41. ¬↑null(K)
42. remove-repeats-fun(IdDeq;λx.(fst(x));bs) ⊆ bs
43. K ⊆ remove-repeats-fun(IdDeq;λx.(fst(x));bs)
44. K ⊆ bs
45. ((coeff * flrs) + 1) = ||K|| ∈ ℤ
46. ∀x:Id × E × Cmd
((x ∈ K)
⇒ ((loc(fst(snd(x))) = loc(e) ∈ Id)
∧ e ≤loc fst(snd(x))
∧ <<<n, 0>, snd(snd(x))>, fst(x)> ∈ new_23_sig_vote'base(Cmd;notify;propose;f)(fst(snd(x)))))
47. x1 : Id@i
48. x3 : E@i
49. x4 : Cmd@i
50. (<x1, x3, x4> ∈ K)@i
51. loc(x3) = loc(e) ∈ Id
52. e ≤loc x3
53. <<<n, 0>, x4>, x1> ∈ new_23_sig_vote'base(Cmd;notify;propose;f)(x3)
54. loc(x3) = loc(e) ∈ Id
55. e ≤loc x3
56. <<<n, 0>, x4>, x1> ∈ new_23_sig_vote'base(Cmd;notify;propose;f)(x3)
57. e' : E@i
58. (e' ∈ [e;x3))@i
59. ↑new_23_sig_vote_with_ballot_and_id(Cmd;notify;propose;f;es;e';n;0;x1)@i
⊢ False
BY
{ ((FLemma `new_23_sig_vote_with_ballot_and_id-implies` [-1] THENA Auto)
THEN (Assert ⌈¬↑null(bs)⌉⋅ THENA (BLemma `non_null_iff_length` THEN Auto))
THEN (Assert ⌈(e' ∈ [e, fst(snd(last(bs)))])⌉⋅
THENA ((RW ListC (-4) THENA Auto)
THEN RW ListC 0
THEN Auto
THEN (Assert ⌈x3 ≤loc fst(snd(last(bs))) ⌉⋅ THEN Auto)
THEN (FLemma `member_sublist` [-20] THENA Auto)
THEN (InstHyp [⌈<x1, x3, x4>⌉] (-1)⋅ THENA Auto)
THEN RepeatFor 2 (D (-1))
THEN (Decide ⌈i = (||bs|| - 1) ∈ ℤ⌉⋅ THENA Auto)
THEN Try (Complete (((RWO "-1" (-2) THENA Auto) THEN Fold `last` (-2) THEN Auto)))
THEN (Using [`i',⌈||bs|| - 1⌉;`j',⌈i⌉] (FLemma `l-ordered-inst` [-37])⋅ THENA Auto')
THEN Fold `last` (-1)
THEN RevHypSubst (-3) (-1)
THEN AllReduce
THEN Auto)
)) }
1
1. Cmd : {T:Type| valueall-type(T)}
2. eq : EqDecider(Cmd)
3. reps : bag(Id)
4. clients : bag(Id)
5. coeff : {2...}
6. flrs : ℕ
7. propose : Atom List
8. notify : Atom List
9. slots : set-sig{i:l}(ℤ)
10. f : new_23_sig_headers_type{i:l}(Cmd;notify;propose)
11. (f propose) = (ℤ × Cmd) ∈ Type
12. (f notify) = (ℤ × Cmd) ∈ Type
13. (f ``new_23_sig decided``) = (ℤ × Cmd) ∈ Type
14. (f ``new_23_sig retry``) = (ℤ × ℤ × Cmd) ∈ Type
15. (f ``new_23_sig vote``) = (ℤ × ℤ × Cmd × Id) ∈ Type
16. f ∈ Name ─→ Type
17. es : EO+(Message(f))
18. e : E
19. n : ℤ
20. c : Cmd
21. faulty : bag(Id)
22. msgs-interface-delivered-with-omissions(f;es;new_23_sig_main();faulty;flrs;reps)@i
23. bag-no-repeats(Id;reps)@i
24. #(reps) = ((coeff * flrs) + flrs + 1) ∈ ℤ@i
25. loc(e) ↓∈ reps@i
26. ¬loc(e) ↓∈ faulty@i
27. <n, c> ∈ new_23_sig_Proposal(Cmd;notify;propose;f)(e)@i
28. ¬↑(set-sig-member(slots) n new_23_sig_ReplicaStateFun(Cmd;notify;propose;slots;f;es;e))@i
29. bs : (Id × E × Cmd) List
30. ((coeff * flrs) + 1) ≤ ||bs||
31. (∀x∈bs.(loc(fst(snd(x))) = loc(e) ∈ Id)
∧ e ≤loc fst(snd(x))
∧ <<<n, 0>, snd(snd(x))>, fst(x)> ∈ new_23_sig_vote'base(Cmd;notify;propose;f)(fst(snd(x))))
32. l-ordered(Id × E × Cmd;x,y.(fst(snd(x)) <loc fst(snd(y)));bs)
33. (∀e'∈[e, fst(snd(last(bs)))].(↑new_23_sig_vote_with_ballot(Cmd;notify;propose;f;es;e';n;0))
⇒ (e' ∈ map(λx.(fst(snd(x)));bs)))
34. b_all(Id;[x∈reps|¬bbag-deq-member(IdDeq;x;faulty)];i.(i ∈ map(λi.(fst(i));bs)))
35. 0 ≤ (coeff * flrs)
36. ((coeff * flrs) + 1) ≤ ||remove-repeats-fun(IdDeq;λx.(fst(x));bs)||
37. K : (Id × E × Cmd) List
38. J : (Id × E × Cmd) List
39. remove-repeats-fun(IdDeq;λx.(fst(x));bs) = (K @ J) ∈ ((Id × E × Cmd) List)
40. ||K|| = ((coeff * flrs) + 1) ∈ ℤ
41. ¬↑null(K)
42. remove-repeats-fun(IdDeq;λx.(fst(x));bs) ⊆ bs
43. K ⊆ remove-repeats-fun(IdDeq;λx.(fst(x));bs)
44. K ⊆ bs
45. ((coeff * flrs) + 1) = ||K|| ∈ ℤ
46. ∀x:Id × E × Cmd
((x ∈ K)
⇒ ((loc(fst(snd(x))) = loc(e) ∈ Id)
∧ e ≤loc fst(snd(x))
∧ <<<n, 0>, snd(snd(x))>, fst(x)> ∈ new_23_sig_vote'base(Cmd;notify;propose;f)(fst(snd(x)))))
47. x1 : Id@i
48. x3 : E@i
49. x4 : Cmd@i
50. (<x1, x3, x4> ∈ K)@i
51. loc(x3) = loc(e) ∈ Id
52. e ≤loc x3
53. <<<n, 0>, x4>, x1> ∈ new_23_sig_vote'base(Cmd;notify;propose;f)(x3)
54. loc(x3) = loc(e) ∈ Id
55. e ≤loc x3
56. <<<n, 0>, x4>, x1> ∈ new_23_sig_vote'base(Cmd;notify;propose;f)(x3)
57. e' : E@i
58. (e' ∈ [e;x3))@i
59. ↑new_23_sig_vote_with_ballot_and_id(Cmd;notify;propose;f;es;e';n;0;x1)@i
60. ↑new_23_sig_vote_with_ballot(Cmd;notify;propose;f;es;e';n;0)
61. ¬↑null(bs)
62. (e' ∈ [e, fst(snd(last(bs)))])
⊢ False
Latex:
Latex:
1. Cmd : \{T:Type| valueall-type(T)\}
2. eq : EqDecider(Cmd)
3. reps : bag(Id)
4. clients : bag(Id)
5. coeff : \{2...\}
6. flrs : \mBbbN{}
7. propose : Atom List
8. notify : Atom List
9. slots : set-sig\{i:l\}(\mBbbZ{})
10. f : new\_23\_sig\_headers\_type\{i:l\}(Cmd;notify;propose)
11. (f propose) = (\mBbbZ{} \mtimes{} Cmd)
12. (f notify) = (\mBbbZ{} \mtimes{} Cmd)
13. (f ``new\_23\_sig decided``) = (\mBbbZ{} \mtimes{} Cmd)
14. (f ``new\_23\_sig retry``) = (\mBbbZ{} \mtimes{} \mBbbZ{} \mtimes{} Cmd)
15. (f ``new\_23\_sig vote``) = (\mBbbZ{} \mtimes{} \mBbbZ{} \mtimes{} Cmd \mtimes{} Id)
16. f \mmember{} Name {}\mrightarrow{} Type
17. es : EO+(Message(f))
18. e : E
19. n : \mBbbZ{}
20. c : Cmd
21. faulty : bag(Id)
22. msgs-interface-delivered-with-omissions(f;es;new\_23\_sig\_main();faulty;flrs;reps)@i
23. bag-no-repeats(Id;reps)@i
24. \#(reps) = ((coeff * flrs) + flrs + 1)@i
25. loc(e) \mdownarrow{}\mmember{} reps@i
26. \mneg{}loc(e) \mdownarrow{}\mmember{} faulty@i
27. <n, c> \mmember{} new\_23\_sig\_Proposal(Cmd;notify;propose;f)(e)@i
28. \mneg{}\muparrow{}(set-sig-member(slots) n new\_23\_sig\_ReplicaStateFun(Cmd;notify;propose;slots;f;es;e))@i
29. bs : (Id \mtimes{} E \mtimes{} Cmd) List
30. ((coeff * flrs) + 1) \mleq{} ||bs||
31. (\mforall{}x\mmember{}bs.(loc(fst(snd(x))) = loc(e))
\mwedge{} e \mleq{}loc fst(snd(x))
\mwedge{} <<<n, 0>, snd(snd(x))>, fst(x)> \mmember{} new\_23\_sig\_vote'base(Cmd;notify;propose;f)(fst(snd(x))))
32. l-ordered(Id \mtimes{} E \mtimes{} Cmd;x,y.(fst(snd(x)) <loc fst(snd(y)));bs)
33. (\mforall{}e'\mmember{}[e, fst(snd(last(bs)))].(\muparrow{}new\_23\_sig\_vote\_with\_ballot(Cmd;notify;propose;f;es;e';n;0))
{}\mRightarrow{} (e' \mmember{} map(\mlambda{}x.(fst(snd(x)));bs)))
34. b\_all(Id;[x\mmember{}reps|\mneg{}\msubb{}bag-deq-member(IdDeq;x;faulty)];i.(i \mmember{} map(\mlambda{}i.(fst(i));bs)))
35. 0 \mleq{} (coeff * flrs)
36. ((coeff * flrs) + 1) \mleq{} ||remove-repeats-fun(IdDeq;\mlambda{}x.(fst(x));bs)||
37. K : (Id \mtimes{} E \mtimes{} Cmd) List
38. J : (Id \mtimes{} E \mtimes{} Cmd) List
39. remove-repeats-fun(IdDeq;\mlambda{}x.(fst(x));bs) = (K @ J)
40. ||K|| = ((coeff * flrs) + 1)
41. \mneg{}\muparrow{}null(K)
42. remove-repeats-fun(IdDeq;\mlambda{}x.(fst(x));bs) \msubseteq{} bs
43. K \msubseteq{} remove-repeats-fun(IdDeq;\mlambda{}x.(fst(x));bs)
44. K \msubseteq{} bs
45. ((coeff * flrs) + 1) = ||K||
46. \mforall{}x:Id \mtimes{} E \mtimes{} Cmd
((x \mmember{} K)
{}\mRightarrow{} ((loc(fst(snd(x))) = loc(e))
\mwedge{} e \mleq{}loc fst(snd(x))
\mwedge{} <<<n, 0>, snd(snd(x))>, fst(x)> \mmember{} new\_23\_sig\_vote'base(Cmd;notify;propose;f)(
fst(snd(x)))))
47. x1 : Id@i
48. x3 : E@i
49. x4 : Cmd@i
50. (<x1, x3, x4> \mmember{} K)@i
51. loc(x3) = loc(e)
52. e \mleq{}loc x3
53. <<<n, 0>, x4>, x1> \mmember{} new\_23\_sig\_vote'base(Cmd;notify;propose;f)(x3)
54. loc(x3) = loc(e)
55. e \mleq{}loc x3
56. <<<n, 0>, x4>, x1> \mmember{} new\_23\_sig\_vote'base(Cmd;notify;propose;f)(x3)
57. e' : E@i
58. (e' \mmember{} [e;x3))@i
59. \muparrow{}new\_23\_sig\_vote\_with\_ballot\_and\_id(Cmd;notify;propose;f;es;e';n;0;x1)@i
\mvdash{} False
By
Latex:
((FLemma `new\_23\_sig\_vote\_with\_ballot\_and\_id-implies` [-1] THENA Auto)
THEN (Assert \mkleeneopen{}\mneg{}\muparrow{}null(bs)\mkleeneclose{}\mcdot{} THENA (BLemma `non\_null\_iff\_length` THEN Auto))
THEN (Assert \mkleeneopen{}(e' \mmember{} [e, fst(snd(last(bs)))])\mkleeneclose{}\mcdot{}
THENA ((RW ListC (-4) THENA Auto)
THEN RW ListC 0
THEN Auto
THEN (Assert \mkleeneopen{}x3 \mleq{}loc fst(snd(last(bs))) \mkleeneclose{}\mcdot{} THEN Auto)
THEN (FLemma `member\_sublist` [-20] THENA Auto)
THEN (InstHyp [\mkleeneopen{}<x1, x3, x4>\mkleeneclose{}] (-1)\mcdot{} THENA Auto)
THEN RepeatFor 2 (D (-1))
THEN (Decide \mkleeneopen{}i = (||bs|| - 1)\mkleeneclose{}\mcdot{} THENA Auto)
THEN Try (Complete (((RWO "-1" (-2) THENA Auto) THEN Fold `last` (-2) THEN Auto)))
THEN (Using [`i',\mkleeneopen{}||bs|| - 1\mkleeneclose{};`j',\mkleeneopen{}i\mkleeneclose{}] (FLemma `l-ordered-inst` [-37])\mcdot{} THENA Auto')
THEN Fold `last` (-1)
THEN RevHypSubst (-3) (-1)
THEN AllReduce
THEN Auto)
))
Home
Index