Made /rewriteFocalPredicates:1 the default

2 files changed, 4 insertions, 4 deletions

diff --git a/Test/dafny0/CoinductiveProofs.dfy b/Test/dafny0/CoinductiveProofs.dfy
index 0dce8af9..c8bb45c7 100644
--- a/Test/dafny0/CoinductiveProofs.dfy
+++ b/Test/dafny0/CoinductiveProofs.dfy
@@ -1,4 +1,4 @@
-// RUN: %dafny /compile:0 /print:"%t.print" /dprint:"%t.dprint" /rewriteFocalPredicates:1 "%s" > "%t"

+// RUN: %dafny /compile:0 /print:"%t.print" /dprint:"%t.dprint" "%s" > "%t"

 // RUN: %diff "%s.expect" "%t"

 

 codatatype Stream<T> = Cons(head: T, tail: Stream)

diff --git a/Test/dafny0/InductivePredicates.dfy b/Test/dafny0/InductivePredicates.dfy
index 8d05af11..e9aa7604 100644
--- a/Test/dafny0/InductivePredicates.dfy
+++ b/Test/dafny0/InductivePredicates.dfy
@@ -58,7 +58,7 @@ inductive lemma {:induction false} IL_EvenBetter(x: natinf)
   if {

     case x.N? && x.n == 0 =>

       // trivial

-    case x.N? && 2 <= x.n && Even(N(x.n - 2)) =>

+    case x.N? && 2 <= x.n && Even(N(x.n - 2)) =>  // syntactic rewrite makes this like in IL

       IL_EvenBetter(N(x.n - 2));

   }

 }

@@ -142,7 +142,7 @@ module Alt {
     }

   }

 

-  inductive lemma {:induction false} MyLemma_NiceButNotFast(x: natinf)

+  inductive lemma {:induction false} MyLemma_Nicer(x: natinf)  // same as MyLemma_NotSoNice but relying on syntactic rewrites

     requires Even(x)

     ensures x.N? && x.n % 2 == 0

   {

@@ -151,7 +151,7 @@ module Alt {
         // trivial

       case exists y :: x == S(S(y)) && Even(y) =>

         var y :| x == S(S(y)) && Even(y);

-        MyLemma_NiceButNotFast(y);

+        MyLemma_Nicer(y);

         assert x.n == y.n + 2;

     }

   }