diff options
author | Rustan Leino <leino@microsoft.com> | 2011-11-04 16:00:43 -0700 |
---|---|---|
committer | Rustan Leino <leino@microsoft.com> | 2011-11-04 16:00:43 -0700 |
commit | 34bd565010ed0608c8f4e870df297deadf4544c5 (patch) | |
tree | b9f9bb303c6d967a0dcc5e9a7182f1c0d6d1f5b4 /Test/dafny1 | |
parent | e853248a0db01853b36c7ce2446ccdff69807bf4 (diff) |
Dafny: in test suite (Rippling.dfy), replaced an inline lemma with a call to a previous lemma
Diffstat (limited to 'Test/dafny1')
-rw-r--r-- | Test/dafny1/Rippling.dfy | 5 |
1 files changed, 2 insertions, 3 deletions
diff --git a/Test/dafny1/Rippling.dfy b/Test/dafny1/Rippling.dfy index 4a1c4bbe..c9a9f3b7 100644 --- a/Test/dafny1/Rippling.dfy +++ b/Test/dafny1/Rippling.dfy @@ -397,9 +397,8 @@ ghost method P19() ghost method P20()
ensures forall xs :: len(sort(xs)) == len(xs);
{
- // proving this theorem requires an additional lemma:
- assert forall k, ks :: len(ins(k, ks)) == len(Cons(k, ks));
- // ...and one manually introduced case study:
+ P15(); // use the statement of problem 15 as a lemma
+ // ... and manually introduce a case distinction:
assert forall ys ::
sort(ys) == Nil ||
exists z, zs :: sort(ys) == Cons(z, zs);
|