anchor.diff:        d str;
         Util.print2 "Generated term for %s: %s\n" str (Print.term_to_string t);
         let t, { res_typ = res_typ }, _ = tc_term env t in
  -      let t = normalize env t in
         let res_typ = normalize env res_typ in
  -      Util.print2 "Inferred type for %s: %s\n" str (Print.term_to_string res_typ);
  -      Util.print2 "Elaborated term for %s: %s\n" str (Print.term_to_string t)
  +      Util.print2 "Inferred type for %s: %s\n" str (Print.term_to_string res_typ)
       end
     in
   
  
positive.code:     let wp1 = S.gen_bv "wp1" None wp_a in
      let wp2 = S.gen_bv "wp2" None wp_a in
      let body = mk_leq wp_a (S.bv_to_name wp1) (S.bv_to_name wp2) in
      U.abs (S.binders_of_list [ wp1; wp2 ]) body ret_tot_type0
    in
    check env "stronger" (U.abs (binders @ [ S.mk_binder a ]) stronger None);
  
    let null_wp = snd ed.null_wp in
  
  
negative.code: 
    let ret_tot_type0 = Some (Inl (U.lcomp_of_comp <| S.mk_Total U.ktype0)) in
    let mk_forall (x: S.bv) (body: S.term): S.term =
      S.mk (Tm_app (U.tforall, [ S.as_arg (U.abs [ S.mk_binder x ] body ret_tot_type0)])) None Range.dummyRange
    in
  
    (* For each (target) type t, we define a binary relation in t called ≤_t.
  