src/HOL/Tools/Nitpick/nitpick_model.ML
author blanchet
Thu Oct 29 15:24:52 2009 +0100 (2009-10-29)
changeset 33571 3655e51f9958
parent 33565 5fad8e36dfb1
child 33580 45c33e97cb86
permissions -rw-r--r--
minor cleanup in Nitpick
blanchet@33192
     1
(*  Title:      HOL/Nitpick/Tools/nitpick_model.ML
blanchet@33192
     2
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@33192
     3
    Copyright   2009
blanchet@33192
     4
blanchet@33192
     5
Model reconstruction for Nitpick.
blanchet@33192
     6
*)
blanchet@33192
     7
blanchet@33192
     8
signature NITPICK_MODEL =
blanchet@33192
     9
sig
blanchet@33232
    10
  type scope = Nitpick_Scope.scope
blanchet@33232
    11
  type rep = Nitpick_Rep.rep
blanchet@33232
    12
  type nut = Nitpick_Nut.nut
blanchet@33192
    13
blanchet@33192
    14
  type params = {
blanchet@33192
    15
    show_skolems: bool,
blanchet@33192
    16
    show_datatypes: bool,
blanchet@33192
    17
    show_consts: bool}
blanchet@33192
    18
blanchet@33192
    19
  structure NameTable : TABLE
blanchet@33192
    20
blanchet@33192
    21
  val tuple_list_for_name :
blanchet@33192
    22
    nut NameTable.table -> Kodkod.raw_bound list -> nut -> int list list
blanchet@33192
    23
  val reconstruct_hol_model :
blanchet@33192
    24
    params -> scope -> (term option * int list) list -> styp list -> nut list
blanchet@33192
    25
    -> nut list -> nut list -> nut NameTable.table -> Kodkod.raw_bound list
blanchet@33192
    26
    -> Pretty.T * bool
blanchet@33192
    27
  val prove_hol_model :
blanchet@33192
    28
    scope -> Time.time option -> nut list -> nut list -> nut NameTable.table
blanchet@33192
    29
    -> Kodkod.raw_bound list -> term -> bool option
blanchet@33192
    30
end;
blanchet@33192
    31
blanchet@33232
    32
structure Nitpick_Model : NITPICK_MODEL =
blanchet@33192
    33
struct
blanchet@33192
    34
blanchet@33232
    35
open Nitpick_Util
blanchet@33232
    36
open Nitpick_HOL
blanchet@33232
    37
open Nitpick_Scope
blanchet@33232
    38
open Nitpick_Peephole
blanchet@33232
    39
open Nitpick_Rep
blanchet@33232
    40
open Nitpick_Nut
blanchet@33192
    41
blanchet@33192
    42
type params = {
blanchet@33192
    43
  show_skolems: bool,
blanchet@33192
    44
  show_datatypes: bool,
blanchet@33192
    45
  show_consts: bool}
blanchet@33192
    46
blanchet@33192
    47
val unknown = "?"
blanchet@33192
    48
val unrep = "\<dots>"
blanchet@33192
    49
val maybe_mixfix = "_\<^sup>?"
blanchet@33192
    50
val base_mixfix = "_\<^bsub>base\<^esub>"
blanchet@33192
    51
val step_mixfix = "_\<^bsub>step\<^esub>"
blanchet@33192
    52
val abs_mixfix = "\<guillemotleft>_\<guillemotright>"
blanchet@33192
    53
val non_opt_name = nitpick_prefix ^ "non_opt"
blanchet@33192
    54
blanchet@33192
    55
(* string -> typ -> int -> string *)
blanchet@33192
    56
fun atom_name prefix (T as Type (s, _)) j =
blanchet@33192
    57
    prefix ^ substring (short_name s, 0, 1) ^ nat_subscript (j + 1)
blanchet@33192
    58
  | atom_name prefix (T as TFree (s, _)) j =
blanchet@33192
    59
    prefix ^ perhaps (try (unprefix "'")) s ^ nat_subscript (j + 1)
blanchet@33232
    60
  | atom_name _ T _ = raise TYPE ("Nitpick_Model.atom_name", [T], [])
blanchet@33192
    61
(* bool -> typ -> int -> term *)
blanchet@33192
    62
fun atom for_auto T j =
blanchet@33192
    63
  if for_auto then
blanchet@33192
    64
    Free (atom_name (hd (space_explode "." nitpick_prefix)) T j, T)
blanchet@33192
    65
  else
blanchet@33192
    66
    Const (atom_name "" T j, T)
blanchet@33192
    67
blanchet@33192
    68
(* nut NameTable.table -> Kodkod.raw_bound list -> nut -> int list list *)
blanchet@33192
    69
fun tuple_list_for_name rel_table bounds name =
blanchet@33192
    70
  the (AList.lookup (op =) bounds (the_rel rel_table name)) handle NUT _ => [[]]
blanchet@33192
    71
blanchet@33192
    72
(* term -> term *)
blanchet@33192
    73
fun unbox_term (Const (@{const_name FunBox}, _) $ t1) = unbox_term t1
blanchet@33192
    74
  | unbox_term (Const (@{const_name PairBox},
blanchet@33192
    75
                       Type ("fun", [T1, Type ("fun", [T2, T3])])) $ t1 $ t2) =
blanchet@33192
    76
    let val Ts = map unbox_type [T1, T2] in
blanchet@33192
    77
      Const (@{const_name Pair}, Ts ---> Type ("*", Ts))
blanchet@33192
    78
      $ unbox_term t1 $ unbox_term t2
blanchet@33192
    79
    end
blanchet@33192
    80
  | unbox_term (Const (s, T)) = Const (s, unbox_type T)
blanchet@33192
    81
  | unbox_term (t1 $ t2) = unbox_term t1 $ unbox_term t2
blanchet@33192
    82
  | unbox_term (Free (s, T)) = Free (s, unbox_type T)
blanchet@33192
    83
  | unbox_term (Var (x, T)) = Var (x, unbox_type T)
blanchet@33192
    84
  | unbox_term (Bound j) = Bound j
blanchet@33192
    85
  | unbox_term (Abs (s, T, t')) = Abs (s, unbox_type T, unbox_term t')
blanchet@33192
    86
blanchet@33192
    87
(* typ -> typ -> (typ * typ) * (typ * typ) *)
blanchet@33192
    88
fun factor_out_types (T1 as Type ("*", [T11, T12]))
blanchet@33192
    89
                     (T2 as Type ("*", [T21, T22])) =
blanchet@33192
    90
    let val (n1, n2) = pairself num_factors_in_type (T11, T21) in
blanchet@33192
    91
      if n1 = n2 then
blanchet@33192
    92
        let
blanchet@33192
    93
          val ((T11', opt_T12'), (T21', opt_T22')) = factor_out_types T12 T22
blanchet@33192
    94
        in
blanchet@33192
    95
          ((Type ("*", [T11, T11']), opt_T12'),
blanchet@33192
    96
           (Type ("*", [T21, T21']), opt_T22'))
blanchet@33192
    97
        end
blanchet@33192
    98
      else if n1 < n2 then
blanchet@33192
    99
        case factor_out_types T1 T21 of
blanchet@33192
   100
          (p1, (T21', NONE)) => (p1, (T21', SOME T22))
blanchet@33192
   101
        | (p1, (T21', SOME T22')) =>
blanchet@33192
   102
          (p1, (T21', SOME (Type ("*", [T22', T22]))))
blanchet@33192
   103
      else
blanchet@33192
   104
        swap (factor_out_types T2 T1)
blanchet@33192
   105
    end
blanchet@33192
   106
  | factor_out_types (Type ("*", [T11, T12])) T2 = ((T11, SOME T12), (T2, NONE))
blanchet@33192
   107
  | factor_out_types T1 (Type ("*", [T21, T22])) = ((T1, NONE), (T21, SOME T22))
blanchet@33192
   108
  | factor_out_types T1 T2 = ((T1, NONE), (T2, NONE))
blanchet@33192
   109
blanchet@33192
   110
(* bool -> typ -> typ -> (term * term) list -> term *)
blanchet@33192
   111
fun make_plain_fun maybe_opt T1 T2 =
blanchet@33192
   112
  let
blanchet@33192
   113
    (* typ -> typ -> (term * term) list -> term *)
blanchet@33192
   114
    fun aux T1 T2 [] =
blanchet@33192
   115
        Const (if maybe_opt orelse T2 <> bool_T then @{const_name undefined}
blanchet@33192
   116
               else non_opt_name, T1 --> T2)
blanchet@33192
   117
      | aux T1 T2 ((t1, t2) :: ps) =
blanchet@33192
   118
        Const (@{const_name fun_upd}, [T1 --> T2, T1, T2] ---> T1 --> T2)
blanchet@33192
   119
        $ aux T1 T2 ps $ t1 $ t2
blanchet@33192
   120
  in aux T1 T2 o rev end
blanchet@33192
   121
(* term -> bool *)
blanchet@33192
   122
fun is_plain_fun (Const (s, _)) = s mem [@{const_name undefined}, non_opt_name]
blanchet@33192
   123
  | is_plain_fun (Const (@{const_name fun_upd}, _) $ t0 $ _ $ _) =
blanchet@33192
   124
    is_plain_fun t0
blanchet@33192
   125
  | is_plain_fun _ = false
blanchet@33192
   126
(* term -> bool * (term list * term list) *)
blanchet@33192
   127
val dest_plain_fun =
blanchet@33192
   128
  let
blanchet@33192
   129
    (* term -> term list * term list *)
blanchet@33192
   130
    fun aux (Const (s, _)) = (s <> non_opt_name, ([], []))
blanchet@33192
   131
      | aux (Const (@{const_name fun_upd}, _) $ t0 $ t1 $ t2) =
blanchet@33192
   132
        let val (s, (ts1, ts2)) = aux t0 in (s, (t1 :: ts1, t2 :: ts2)) end
blanchet@33232
   133
      | aux t = raise TERM ("Nitpick_Model.dest_plain_fun", [t])
blanchet@33192
   134
  in apsnd (pairself rev) o aux end
blanchet@33192
   135
blanchet@33565
   136
(* typ -> typ -> typ -> term -> term * term *)
blanchet@33565
   137
fun break_in_two T T1 T2 t =
blanchet@33565
   138
  let
blanchet@33565
   139
    val ps = HOLogic.flat_tupleT_paths T
blanchet@33565
   140
    val cut = length (HOLogic.strip_tupleT T1)
blanchet@33565
   141
    val (ps1, ps2) = pairself HOLogic.flat_tupleT_paths (T1, T2)
blanchet@33565
   142
    val (ts1, ts2) = t |> HOLogic.strip_ptuple ps |> chop cut
blanchet@33565
   143
  in (HOLogic.mk_ptuple ps1 T1 ts1, HOLogic.mk_ptuple ps2 T2 ts2) end
blanchet@33192
   144
(* typ -> term -> term -> term *)
blanchet@33192
   145
fun pair_up (Type ("*", [T1', T2']))
blanchet@33192
   146
            (t1 as Const (@{const_name Pair},
blanchet@33192
   147
                          Type ("fun", [_, Type ("fun", [_, T1])])) $ t11 $ t12)
blanchet@33192
   148
            t2 =
blanchet@33192
   149
    if T1 = T1' then HOLogic.mk_prod (t1, t2)
blanchet@33192
   150
    else HOLogic.mk_prod (t11, pair_up T2' t12 t2)
blanchet@33192
   151
  | pair_up _ t1 t2 = HOLogic.mk_prod (t1, t2)
blanchet@33192
   152
(* typ -> term -> term list * term list -> (term * term) list*)
blanchet@33192
   153
fun multi_pair_up T1 t1 (ts2, ts3) = map2 (pair o pair_up T1 t1) ts2 ts3
blanchet@33192
   154
blanchet@33192
   155
(* typ -> typ -> typ -> term -> term *)
blanchet@33192
   156
fun typecast_fun (Type ("fun", [T1', T2'])) T1 T2 t =
blanchet@33192
   157
    let
blanchet@33565
   158
      (* typ -> typ -> typ -> typ -> term -> term *)
blanchet@33565
   159
      fun do_curry T1 T1a T1b T2 t =
blanchet@33192
   160
        let
blanchet@33192
   161
          val (maybe_opt, ps) = dest_plain_fun t
blanchet@33192
   162
          val ps =
blanchet@33565
   163
            ps |>> map (break_in_two T1 T1a T1b)
blanchet@33192
   164
               |> uncurry (map2 (fn (t1a, t1b) => fn t2 => (t1a, (t1b, t2))))
blanchet@33192
   165
               |> AList.coalesce (op =)
blanchet@33192
   166
               |> map (apsnd (make_plain_fun maybe_opt T1b T2))
blanchet@33192
   167
        in make_plain_fun maybe_opt T1a (T1b --> T2) ps end
blanchet@33192
   168
      (* typ -> typ -> term -> term *)
blanchet@33192
   169
      and do_uncurry T1 T2 t =
blanchet@33192
   170
        let
blanchet@33192
   171
          val (maybe_opt, tsp) = dest_plain_fun t
blanchet@33192
   172
          val ps =
blanchet@33192
   173
            tsp |> op ~~
blanchet@33192
   174
                |> maps (fn (t1, t2) =>
blanchet@33192
   175
                            multi_pair_up T1 t1 (snd (dest_plain_fun t2)))
blanchet@33192
   176
        in make_plain_fun maybe_opt T1 T2 ps end
blanchet@33192
   177
      (* typ -> typ -> typ -> typ -> term -> term *)
blanchet@33192
   178
      and do_arrow T1' T2' _ _ (Const (s, _)) = Const (s, T1' --> T2')
blanchet@33192
   179
        | do_arrow T1' T2' T1 T2
blanchet@33192
   180
                   (Const (@{const_name fun_upd}, _) $ t0 $ t1 $ t2) =
blanchet@33192
   181
          Const (@{const_name fun_upd},
blanchet@33192
   182
                 [T1' --> T2', T1', T2'] ---> T1' --> T2')
blanchet@33192
   183
          $ do_arrow T1' T2' T1 T2 t0 $ do_term T1' T1 t1 $ do_term T2' T2 t2
blanchet@33192
   184
        | do_arrow _ _ _ _ t =
blanchet@33232
   185
          raise TERM ("Nitpick_Model.typecast_fun.do_arrow", [t])
blanchet@33192
   186
      and do_fun T1' T2' T1 T2 t =
blanchet@33192
   187
        case factor_out_types T1' T1 of
blanchet@33192
   188
          ((_, NONE), (_, NONE)) => t |> do_arrow T1' T2' T1 T2
blanchet@33192
   189
        | ((_, NONE), (T1a, SOME T1b)) =>
blanchet@33565
   190
          t |> do_curry T1 T1a T1b T2 |> do_arrow T1' T2' T1a (T1b --> T2)
blanchet@33192
   191
        | ((T1a', SOME T1b'), (_, NONE)) =>
blanchet@33192
   192
          t |> do_arrow T1a' (T1b' --> T2') T1 T2 |> do_uncurry T1' T2'
blanchet@33232
   193
        | _ => raise TYPE ("Nitpick_Model.typecast_fun.do_fun", [T1, T1'], [])
blanchet@33192
   194
      (* typ -> typ -> term -> term *)
blanchet@33192
   195
      and do_term (Type ("fun", [T1', T2'])) (Type ("fun", [T1, T2])) t =
blanchet@33192
   196
          do_fun T1' T2' T1 T2 t
blanchet@33192
   197
        | do_term (T' as Type ("*", Ts' as [T1', T2'])) (Type ("*", [T1, T2]))
blanchet@33192
   198
                  (Const (@{const_name Pair}, _) $ t1 $ t2) =
blanchet@33192
   199
          Const (@{const_name Pair}, Ts' ---> T')
blanchet@33192
   200
          $ do_term T1' T1 t1 $ do_term T2' T2 t2
blanchet@33192
   201
        | do_term T' T t =
blanchet@33192
   202
          if T = T' then t
blanchet@33232
   203
          else raise TYPE ("Nitpick_Model.typecast_fun.do_term", [T, T'], [])
blanchet@33192
   204
    in if T1' = T1 andalso T2' = T2 then t else do_fun T1' T2' T1 T2 t end
blanchet@33232
   205
  | typecast_fun T' _ _ _ = raise TYPE ("Nitpick_Model.typecast_fun", [T'], [])
blanchet@33192
   206
blanchet@33192
   207
(* term -> string *)
blanchet@33192
   208
fun truth_const_sort_key @{const True} = "0"
blanchet@33192
   209
  | truth_const_sort_key @{const False} = "2"
blanchet@33192
   210
  | truth_const_sort_key _ = "1"
blanchet@33192
   211
blanchet@33192
   212
(* typ -> term list -> term *)
blanchet@33192
   213
fun mk_tuple (Type ("*", [T1, T2])) ts =
blanchet@33192
   214
    HOLogic.mk_prod (mk_tuple T1 ts,
blanchet@33192
   215
        mk_tuple T2 (List.drop (ts, length (HOLogic.flatten_tupleT T1))))
blanchet@33192
   216
  | mk_tuple _ (t :: _) = t
blanchet@33192
   217
blanchet@33192
   218
(* string * string * string * string -> scope -> nut list -> nut list
blanchet@33192
   219
   -> nut list -> nut NameTable.table -> Kodkod.raw_bound list -> typ -> typ
blanchet@33192
   220
   -> rep -> int list list -> term *)
blanchet@33192
   221
fun reconstruct_term (maybe_name, base_name, step_name, abs_name)
blanchet@33192
   222
        ({ext_ctxt as {thy, ctxt, ...}, card_assigns, datatypes, ofs, ...}
blanchet@33192
   223
         : scope) sel_names rel_table bounds =
blanchet@33192
   224
  let
blanchet@33192
   225
    val for_auto = (maybe_name = "")
blanchet@33192
   226
    (* bool -> typ -> typ -> (term * term) list -> term *)
blanchet@33192
   227
    fun make_set maybe_opt T1 T2 =
blanchet@33192
   228
      let
blanchet@33192
   229
        val empty_const = Const (@{const_name Set.empty}, T1 --> T2)
blanchet@33192
   230
        val insert_const = Const (@{const_name insert},
blanchet@33192
   231
                                  [T1, T1 --> T2] ---> T1 --> T2)
blanchet@33192
   232
        (* (term * term) list -> term *)
blanchet@33192
   233
        fun aux [] =
blanchet@33192
   234
            if maybe_opt andalso not (is_precise_type datatypes T1) then
blanchet@33192
   235
              insert_const $ Const (unrep, T1) $ empty_const
blanchet@33192
   236
            else
blanchet@33192
   237
              empty_const
blanchet@33192
   238
          | aux ((t1, t2) :: zs) =
blanchet@33192
   239
            aux zs |> t2 <> @{const False}
blanchet@33192
   240
                      ? curry (op $) (insert_const
blanchet@33192
   241
                                      $ (t1 |> t2 <> @{const True}
blanchet@33192
   242
                                               ? curry (op $)
blanchet@33192
   243
                                                       (Const (maybe_name,
blanchet@33192
   244
                                                               T1 --> T1))))
blanchet@33192
   245
      in aux end
blanchet@33192
   246
    (* typ -> typ -> typ -> (term * term) list -> term *)
blanchet@33192
   247
    fun make_map T1 T2 T2' =
blanchet@33192
   248
      let
blanchet@33192
   249
        val update_const = Const (@{const_name fun_upd},
blanchet@33192
   250
                                  [T1 --> T2, T1, T2] ---> T1 --> T2)
blanchet@33192
   251
        (* (term * term) list -> term *)
blanchet@33192
   252
        fun aux' [] = Const (@{const_name Map.empty}, T1 --> T2)
blanchet@33192
   253
          | aux' ((t1, t2) :: ps) =
blanchet@33192
   254
            (case t2 of
blanchet@33192
   255
               Const (@{const_name None}, _) => aux' ps
blanchet@33192
   256
             | _ => update_const $ aux' ps $ t1 $ t2)
blanchet@33192
   257
        fun aux ps =
blanchet@33192
   258
          if not (is_precise_type datatypes T1) then
blanchet@33192
   259
            update_const $ aux' ps $ Const (unrep, T1)
blanchet@33192
   260
            $ (Const (@{const_name Some}, T2' --> T2) $ Const (unknown, T2'))
blanchet@33192
   261
          else
blanchet@33192
   262
            aux' ps
blanchet@33192
   263
      in aux end
blanchet@33192
   264
    (* typ list -> term -> term *)
blanchet@33192
   265
    fun setify_mapify_funs Ts t =
blanchet@33192
   266
      (case fastype_of1 (Ts, t) of
blanchet@33192
   267
         Type ("fun", [T1, T2]) =>
blanchet@33192
   268
         if is_plain_fun t then
blanchet@33192
   269
           case T2 of
blanchet@33192
   270
             @{typ bool} =>
blanchet@33192
   271
             let
blanchet@33192
   272
               val (maybe_opt, ts_pair) =
blanchet@33192
   273
                 dest_plain_fun t ||> pairself (map (setify_mapify_funs Ts))
blanchet@33192
   274
             in
blanchet@33192
   275
               make_set maybe_opt T1 T2
blanchet@33192
   276
                        (sort_wrt (truth_const_sort_key o snd) (op ~~ ts_pair))
blanchet@33192
   277
             end
blanchet@33192
   278
           | Type (@{type_name option}, [T2']) =>
blanchet@33192
   279
             let
blanchet@33192
   280
               val ts_pair = snd (dest_plain_fun t)
blanchet@33192
   281
                             |> pairself (map (setify_mapify_funs Ts))
blanchet@33192
   282
             in make_map T1 T2 T2' (rev (op ~~ ts_pair)) end
blanchet@33192
   283
           | _ => raise SAME ()
blanchet@33192
   284
         else
blanchet@33192
   285
           raise SAME ()
blanchet@33192
   286
       | _ => raise SAME ())
blanchet@33192
   287
      handle SAME () =>
blanchet@33192
   288
             case t of
blanchet@33192
   289
               t1 $ t2 => setify_mapify_funs Ts t1 $ setify_mapify_funs Ts t2
blanchet@33192
   290
             | Abs (s, T, t') => Abs (s, T, setify_mapify_funs (T :: Ts) t')
blanchet@33192
   291
             | _ => t
blanchet@33192
   292
    (* bool -> typ -> typ -> typ -> term list -> term list -> term *)
blanchet@33192
   293
    fun make_fun maybe_opt T1 T2 T' ts1 ts2 =
blanchet@33192
   294
      ts1 ~~ ts2 |> T1 = @{typ bisim_iterator} ? rev
blanchet@33192
   295
                 |> make_plain_fun (maybe_opt andalso not for_auto) T1 T2
blanchet@33192
   296
                 |> unbox_term
blanchet@33192
   297
                 |> typecast_fun (unbox_type T') (unbox_type T1) (unbox_type T2)
blanchet@33192
   298
    (* (typ * int) list -> typ -> typ -> int -> term *)
blanchet@33192
   299
    fun term_for_atom seen (T as Type ("fun", [T1, T2])) T' j =
blanchet@33192
   300
        let
blanchet@33192
   301
          val k1 = card_of_type card_assigns T1
blanchet@33192
   302
          val k2 = card_of_type card_assigns T2
blanchet@33192
   303
        in
blanchet@33192
   304
          term_for_rep seen T T' (Vect (k1, Atom (k2, 0)))
blanchet@33192
   305
                       [nth_combination (replicate k1 (k2, 0)) j]
blanchet@33192
   306
          handle General.Subscript =>
blanchet@33232
   307
                 raise ARG ("Nitpick_Model.reconstruct_term.term_for_atom",
blanchet@33192
   308
                            signed_string_of_int j ^ " for " ^
blanchet@33192
   309
                            string_for_rep (Vect (k1, Atom (k2, 0))))
blanchet@33192
   310
        end
blanchet@33192
   311
      | term_for_atom seen (Type ("*", [T1, T2])) _ j =
blanchet@33192
   312
        let val k1 = card_of_type card_assigns T1 in
blanchet@33192
   313
          list_comb (HOLogic.pair_const T1 T2,
blanchet@33192
   314
                     map2 (fn T => term_for_atom seen T T) [T1, T2]
blanchet@33192
   315
                          [j div k1, j mod k1])
blanchet@33192
   316
        end
blanchet@33192
   317
      | term_for_atom seen @{typ prop} _ j =
blanchet@33192
   318
        HOLogic.mk_Trueprop (term_for_atom seen bool_T bool_T j)
blanchet@33192
   319
      | term_for_atom _ @{typ bool} _ j =
blanchet@33192
   320
        if j = 0 then @{const False} else @{const True}
blanchet@33192
   321
      | term_for_atom _ @{typ unit} _ _ = @{const Unity}
blanchet@33192
   322
      | term_for_atom seen T _ j =
blanchet@33192
   323
        if T = nat_T then
blanchet@33192
   324
          HOLogic.mk_number nat_T j
blanchet@33192
   325
        else if T = int_T then
blanchet@33192
   326
          HOLogic.mk_number int_T
blanchet@33192
   327
              (int_for_atom (card_of_type card_assigns int_T, 0) j)
blanchet@33192
   328
        else if is_fp_iterator_type T then
blanchet@33192
   329
          HOLogic.mk_number nat_T (card_of_type card_assigns T - j - 1)
blanchet@33192
   330
        else if T = @{typ bisim_iterator} then
blanchet@33192
   331
          HOLogic.mk_number nat_T j
blanchet@33192
   332
        else case datatype_spec datatypes T of
blanchet@33192
   333
          NONE => atom for_auto T j
blanchet@33558
   334
        | SOME {shallow = true, ...} => atom for_auto T j
blanchet@33558
   335
        | SOME {co, constrs, ...} =>
blanchet@33192
   336
          let
blanchet@33192
   337
            (* styp -> int list *)
blanchet@33192
   338
            fun tuples_for_const (s, T) =
blanchet@33192
   339
              tuple_list_for_name rel_table bounds (ConstName (s, T, Any))
blanchet@33192
   340
            (* unit -> indexname * typ *)
blanchet@33192
   341
            fun var () = ((atom_name "" T j, 0), T)
blanchet@33192
   342
            val discr_jsss = map (tuples_for_const o discr_for_constr o #const)
blanchet@33192
   343
                                 constrs
blanchet@33192
   344
            val real_j = j + offset_of_type ofs T
blanchet@33192
   345
            val constr_x as (constr_s, constr_T) =
blanchet@33192
   346
              get_first (fn (jss, {const, ...}) =>
blanchet@33192
   347
                            if [real_j] mem jss then SOME const else NONE)
blanchet@33192
   348
                        (discr_jsss ~~ constrs) |> the
blanchet@33192
   349
            val arg_Ts = curried_binder_types constr_T
blanchet@33192
   350
            val sel_xs = map (boxed_nth_sel_for_constr ext_ctxt constr_x)
blanchet@33192
   351
                             (index_seq 0 (length arg_Ts))
blanchet@33192
   352
            val sel_Rs =
blanchet@33192
   353
              map (fn x => get_first
blanchet@33192
   354
                               (fn ConstName (s', T', R) =>
blanchet@33192
   355
                                   if (s', T') = x then SOME R else NONE
blanchet@33232
   356
                                 | u => raise NUT ("Nitpick_Model.reconstruct_\
blanchet@33192
   357
                                                   \term.term_for_atom", [u]))
blanchet@33192
   358
                               sel_names |> the) sel_xs
blanchet@33192
   359
            val arg_Rs = map (snd o dest_Func) sel_Rs
blanchet@33192
   360
            val sel_jsss = map tuples_for_const sel_xs
blanchet@33192
   361
            val arg_jsss =
blanchet@33192
   362
              map (map_filter (fn js => if hd js = real_j then SOME (tl js)
blanchet@33192
   363
                                        else NONE)) sel_jsss
blanchet@33192
   364
            val uncur_arg_Ts = binder_types constr_T
blanchet@33192
   365
          in
blanchet@33192
   366
            if co andalso (T, j) mem seen then
blanchet@33192
   367
              Var (var ())
blanchet@33192
   368
            else
blanchet@33192
   369
              let
blanchet@33192
   370
                val seen = seen |> co ? cons (T, j)
blanchet@33192
   371
                val ts =
blanchet@33192
   372
                  if length arg_Ts = 0 then
blanchet@33192
   373
                    []
blanchet@33192
   374
                  else
blanchet@33192
   375
                    map3 (fn Ts => term_for_rep seen Ts Ts) arg_Ts arg_Rs
blanchet@33192
   376
                         arg_jsss
blanchet@33192
   377
                    |> mk_tuple (HOLogic.mk_tupleT uncur_arg_Ts)
blanchet@33192
   378
                    |> dest_n_tuple (length uncur_arg_Ts)
blanchet@33192
   379
                val t =
blanchet@33192
   380
                  if constr_s = @{const_name Abs_Frac} then
blanchet@33192
   381
                    let
blanchet@33192
   382
                      val num_T = body_type T
blanchet@33192
   383
                      (* int -> term *)
blanchet@33192
   384
                      val mk_num = HOLogic.mk_number num_T
blanchet@33192
   385
                    in
blanchet@33192
   386
                      case ts of
blanchet@33192
   387
                        [Const (@{const_name Pair}, _) $ t1 $ t2] =>
blanchet@33192
   388
                        (case snd (HOLogic.dest_number t1) of
blanchet@33192
   389
                           0 => mk_num 0
blanchet@33192
   390
                         | n1 => case HOLogic.dest_number t2 |> snd of
blanchet@33192
   391
                                   1 => mk_num n1
blanchet@33192
   392
                                 | n2 => Const (@{const_name HOL.divide},
blanchet@33192
   393
                                                [num_T, num_T] ---> num_T)
blanchet@33192
   394
                                         $ mk_num n1 $ mk_num n2)
blanchet@33232
   395
                      | _ => raise TERM ("Nitpick_Model.reconstruct_term.term_\
blanchet@33192
   396
                                         \for_atom (Abs_Frac)", ts)
blanchet@33192
   397
                    end
blanchet@33192
   398
                  else if not for_auto andalso is_abs_fun thy constr_x then
blanchet@33192
   399
                    Const (abs_name, constr_T) $ the_single ts
blanchet@33192
   400
                  else
blanchet@33192
   401
                    list_comb (Const constr_x, ts)
blanchet@33192
   402
              in
blanchet@33192
   403
                if co then
blanchet@33192
   404
                  let val var = var () in
blanchet@33192
   405
                    if exists_subterm (equal (Var var)) t then
blanchet@33192
   406
                      Const (@{const_name The}, (T --> bool_T) --> T)
blanchet@33192
   407
                      $ Abs ("\<omega>", T,
blanchet@33192
   408
                             Const (@{const_name "op ="}, [T, T] ---> bool_T)
blanchet@33192
   409
                             $ Bound 0 $ abstract_over (Var var, t))
blanchet@33192
   410
                    else
blanchet@33192
   411
                      t
blanchet@33192
   412
                  end
blanchet@33192
   413
                else
blanchet@33192
   414
                  t
blanchet@33192
   415
              end
blanchet@33192
   416
          end
blanchet@33192
   417
    (* (typ * int) list -> int -> rep -> typ -> typ -> typ -> int list
blanchet@33192
   418
       -> term *)
blanchet@33192
   419
    and term_for_vect seen k R T1 T2 T' js =
blanchet@33192
   420
      make_fun true T1 T2 T' (map (term_for_atom seen T1 T1) (index_seq 0 k))
blanchet@33192
   421
               (map (term_for_rep seen T2 T2 R o single)
blanchet@33192
   422
                    (batch_list (arity_of_rep R) js))
blanchet@33192
   423
    (* (typ * int) list -> typ -> typ -> rep -> int list list -> term *)
blanchet@33192
   424
    and term_for_rep seen T T' Unit [[]] = term_for_atom seen T T' 0
blanchet@33192
   425
      | term_for_rep seen T T' (R as Atom (k, j0)) [[j]] =
blanchet@33192
   426
        if j >= j0 andalso j < j0 + k then term_for_atom seen T T' (j - j0)
blanchet@33232
   427
        else raise REP ("Nitpick_Model.reconstruct_term.term_for_rep", [R])
blanchet@33192
   428
      | term_for_rep seen (Type ("*", [T1, T2])) _ (Struct [R1, R2]) [js] =
blanchet@33192
   429
        let
blanchet@33192
   430
          val arity1 = arity_of_rep R1
blanchet@33192
   431
          val (js1, js2) = chop arity1 js
blanchet@33192
   432
        in
blanchet@33192
   433
          list_comb (HOLogic.pair_const T1 T2,
blanchet@33192
   434
                     map3 (fn T => term_for_rep seen T T) [T1, T2] [R1, R2]
blanchet@33192
   435
                          [[js1], [js2]])
blanchet@33192
   436
        end
blanchet@33192
   437
      | term_for_rep seen (Type ("fun", [T1, T2])) T' (R as Vect (k, R')) [js] =
blanchet@33192
   438
        term_for_vect seen k R' T1 T2 T' js
blanchet@33192
   439
      | term_for_rep seen (Type ("fun", [T1, T2])) T' (Func (R1, Formula Neut))
blanchet@33192
   440
                     jss =
blanchet@33192
   441
        let
blanchet@33192
   442
          val jss1 = all_combinations_for_rep R1
blanchet@33192
   443
          val ts1 = map (term_for_rep seen T1 T1 R1 o single) jss1
blanchet@33192
   444
          val ts2 =
blanchet@33192
   445
            map (fn js => term_for_rep seen T2 T2 (Atom (2, 0))
blanchet@33192
   446
                                       [[int_for_bool (js mem jss)]]) jss1
blanchet@33192
   447
        in make_fun false T1 T2 T' ts1 ts2 end
blanchet@33192
   448
      | term_for_rep seen (Type ("fun", [T1, T2])) T' (Func (R1, R2)) jss =
blanchet@33192
   449
        let
blanchet@33192
   450
          val arity1 = arity_of_rep R1
blanchet@33192
   451
          val jss1 = all_combinations_for_rep R1
blanchet@33192
   452
          val ts1 = map (term_for_rep seen T1 T1 R1 o single) jss1
blanchet@33192
   453
          val grouped_jss2 = AList.group (op =) (map (chop arity1) jss)
blanchet@33192
   454
          val ts2 = map (term_for_rep seen T2 T2 R2 o the_default []
blanchet@33192
   455
                         o AList.lookup (op =) grouped_jss2) jss1
blanchet@33192
   456
        in make_fun true T1 T2 T' ts1 ts2 end
blanchet@33192
   457
      | term_for_rep seen T T' (Opt R) jss =
blanchet@33192
   458
        if null jss then Const (unknown, T) else term_for_rep seen T T' R jss
blanchet@33192
   459
      | term_for_rep seen T _ R jss =
blanchet@33232
   460
        raise ARG ("Nitpick_Model.reconstruct_term.term_for_rep",
blanchet@33192
   461
                   Refute.string_of_typ T ^ " " ^ string_for_rep R ^ " " ^
blanchet@33192
   462
                   string_of_int (length jss))
blanchet@33192
   463
  in
blanchet@33192
   464
    (not for_auto ? setify_mapify_funs []) o unbox_term oooo term_for_rep []
blanchet@33192
   465
  end
blanchet@33192
   466
blanchet@33192
   467
(* scope -> nut list -> nut NameTable.table -> Kodkod.raw_bound list -> nut
blanchet@33192
   468
   -> term *)
blanchet@33192
   469
fun term_for_name scope sel_names rel_table bounds name =
blanchet@33192
   470
  let val T = type_of name in
blanchet@33192
   471
    tuple_list_for_name rel_table bounds name
blanchet@33192
   472
    |> reconstruct_term ("", "", "", "") scope sel_names rel_table bounds T T
blanchet@33192
   473
                        (rep_of name)
blanchet@33192
   474
  end
blanchet@33192
   475
blanchet@33192
   476
(* Proof.context
blanchet@33192
   477
   -> (string * string * string * string * string) * Proof.context *)
blanchet@33192
   478
fun add_wacky_syntax ctxt =
blanchet@33192
   479
  let
blanchet@33192
   480
    (* term -> string *)
blanchet@33192
   481
    val name_of = fst o dest_Const
blanchet@33192
   482
    val thy = ProofContext.theory_of ctxt |> Context.reject_draft
blanchet@33192
   483
    val (maybe_t, thy) =
blanchet@33202
   484
      Sign.declare_const ((@{binding nitpick_maybe}, @{typ "'a => 'a"}),
blanchet@33202
   485
                          Mixfix (maybe_mixfix, [1000], 1000)) thy
blanchet@33192
   486
    val (base_t, thy) =
blanchet@33202
   487
      Sign.declare_const ((@{binding nitpick_base}, @{typ "'a => 'a"}),
blanchet@33202
   488
                          Mixfix (base_mixfix, [1000], 1000)) thy
blanchet@33192
   489
    val (step_t, thy) =
blanchet@33202
   490
      Sign.declare_const ((@{binding nitpick_step}, @{typ "'a => 'a"}),
blanchet@33202
   491
                          Mixfix (step_mixfix, [1000], 1000)) thy
blanchet@33192
   492
    val (abs_t, thy) =
blanchet@33202
   493
      Sign.declare_const ((@{binding nitpick_abs}, @{typ "'a => 'b"}),
blanchet@33202
   494
                          Mixfix (abs_mixfix, [40], 40)) thy
blanchet@33192
   495
  in
blanchet@33192
   496
    ((name_of maybe_t, name_of base_t, name_of step_t, name_of abs_t),
blanchet@33192
   497
     ProofContext.transfer_syntax thy ctxt)
blanchet@33192
   498
  end
blanchet@33192
   499
blanchet@33192
   500
(* term -> term *)
blanchet@33192
   501
fun unfold_outer_the_binders (t as Const (@{const_name The}, _)
blanchet@33192
   502
                                   $ Abs (s, T, Const (@{const_name "op ="}, _)
blanchet@33192
   503
                                                $ Bound 0 $ t')) =
blanchet@33192
   504
    betapply (Abs (s, T, t'), t) |> unfold_outer_the_binders
blanchet@33192
   505
  | unfold_outer_the_binders t = t
blanchet@33192
   506
(* typ list -> int -> term * term -> bool *)
blanchet@33192
   507
fun bisimilar_values _ 0 _ = true
blanchet@33192
   508
  | bisimilar_values coTs max_depth (t1, t2) =
blanchet@33192
   509
    let val T = fastype_of t1 in
blanchet@33192
   510
      if exists_subtype (member (op =) coTs) T then
blanchet@33192
   511
        let
blanchet@33192
   512
          val ((head1, args1), (head2, args2)) =
blanchet@33192
   513
            pairself (strip_comb o unfold_outer_the_binders) (t1, t2)
blanchet@33192
   514
          val max_depth = max_depth - (if T mem coTs then 1 else 0)
blanchet@33192
   515
        in
blanchet@33192
   516
          head1 = head2
blanchet@33192
   517
          andalso forall (bisimilar_values coTs max_depth) (args1 ~~ args2)
blanchet@33192
   518
        end
blanchet@33192
   519
      else
blanchet@33192
   520
        t1 = t2
blanchet@33192
   521
    end
blanchet@33192
   522
blanchet@33192
   523
(* params -> scope -> (term option * int list) list -> styp list -> nut list
blanchet@33192
   524
  -> nut list -> nut list -> nut NameTable.table -> Kodkod.raw_bound list
blanchet@33192
   525
  -> Pretty.T * bool *)
blanchet@33192
   526
fun reconstruct_hol_model {show_skolems, show_datatypes, show_consts}
blanchet@33192
   527
        ({ext_ctxt as {thy, ctxt, max_bisim_depth, boxes, user_axioms, debug,
blanchet@33192
   528
                       wfs, destroy_constrs, specialize, skolemize,
blanchet@33192
   529
                       star_linear_preds, uncurry, fast_descrs, tac_timeout,
blanchet@33192
   530
                       evals, case_names, def_table, nondef_table, user_nondefs,
blanchet@33192
   531
                       simp_table, psimp_table, intro_table, ground_thm_table,
blanchet@33192
   532
                       ersatz_table, skolems, special_funs, unrolled_preds,
blanchet@33192
   533
                       wf_cache},
blanchet@33192
   534
         card_assigns, bisim_depth, datatypes, ofs} : scope) formats all_frees
blanchet@33192
   535
        free_names sel_names nonsel_names rel_table bounds =
blanchet@33192
   536
  let
blanchet@33192
   537
    val (wacky_names as (_, base_name, step_name, _), ctxt) =
blanchet@33192
   538
      add_wacky_syntax ctxt
blanchet@33192
   539
    val ext_ctxt =
blanchet@33192
   540
      {thy = thy, ctxt = ctxt, max_bisim_depth = max_bisim_depth, boxes = boxes,
blanchet@33192
   541
       wfs = wfs, user_axioms = user_axioms, debug = debug,
blanchet@33192
   542
       destroy_constrs = destroy_constrs, specialize = specialize,
blanchet@33192
   543
       skolemize = skolemize, star_linear_preds = star_linear_preds,
blanchet@33192
   544
       uncurry = uncurry, fast_descrs = fast_descrs, tac_timeout = tac_timeout,
blanchet@33192
   545
       evals = evals, case_names = case_names, def_table = def_table,
blanchet@33192
   546
       nondef_table = nondef_table, user_nondefs = user_nondefs,
blanchet@33192
   547
       simp_table = simp_table, psimp_table = psimp_table,
blanchet@33192
   548
       intro_table = intro_table, ground_thm_table = ground_thm_table,
blanchet@33192
   549
       ersatz_table = ersatz_table, skolems = skolems,
blanchet@33192
   550
       special_funs = special_funs, unrolled_preds = unrolled_preds,
blanchet@33192
   551
       wf_cache = wf_cache}
blanchet@33192
   552
    val scope = {ext_ctxt = ext_ctxt, card_assigns = card_assigns,
blanchet@33192
   553
                 bisim_depth = bisim_depth, datatypes = datatypes, ofs = ofs}
blanchet@33192
   554
    (* typ -> typ -> rep -> int list list -> term *)
blanchet@33192
   555
    val term_for_rep = reconstruct_term wacky_names scope sel_names rel_table
blanchet@33192
   556
                                        bounds
blanchet@33192
   557
    (* typ -> typ -> typ *)
blanchet@33192
   558
    fun nth_value_of_type T card n = term_for_rep T T (Atom (card, 0)) [[n]]
blanchet@33192
   559
    (* dtype_spec list -> dtype_spec -> bool *)
blanchet@33192
   560
    fun is_codatatype_wellformed (cos : dtype_spec list)
blanchet@33192
   561
                                 ({typ, card, ...} : dtype_spec) =
blanchet@33192
   562
      let
blanchet@33192
   563
        val ts = map (nth_value_of_type typ card) (index_seq 0 card)
blanchet@33192
   564
        val max_depth = Integer.sum (map #card cos)
blanchet@33192
   565
      in
blanchet@33192
   566
        forall (not o bisimilar_values (map #typ cos) max_depth)
blanchet@33192
   567
               (all_distinct_unordered_pairs_of ts)
blanchet@33192
   568
      end
blanchet@33192
   569
    (* string -> Pretty.T *)
blanchet@33192
   570
    fun pretty_for_assign name =
blanchet@33192
   571
      let
blanchet@33192
   572
        val (oper, (t1, T'), T) =
blanchet@33192
   573
          case name of
blanchet@33192
   574
            FreeName (s, T, _) =>
blanchet@33192
   575
            let val t = Free (s, unbox_type T) in
blanchet@33192
   576
              ("=", (t, format_term_type thy def_table formats t), T)
blanchet@33192
   577
            end
blanchet@33192
   578
          | ConstName (s, T, _) =>
blanchet@33192
   579
            (assign_operator_for_const (s, T),
blanchet@33192
   580
             user_friendly_const ext_ctxt (base_name, step_name) formats (s, T),
blanchet@33192
   581
             T)
blanchet@33232
   582
          | _ => raise NUT ("Nitpick_Model.reconstruct_hol_model.\
blanchet@33192
   583
                            \pretty_for_assign", [name])
blanchet@33192
   584
        val t2 = if rep_of name = Any then
blanchet@33192
   585
                   Const (@{const_name undefined}, T')
blanchet@33192
   586
                 else
blanchet@33192
   587
                   tuple_list_for_name rel_table bounds name
blanchet@33192
   588
                   |> term_for_rep T T' (rep_of name)
blanchet@33192
   589
      in
blanchet@33192
   590
        Pretty.block (Pretty.breaks
blanchet@33571
   591
            [setmp_show_all_types (Syntax.pretty_term ctxt) t1,
blanchet@33192
   592
             Pretty.str oper, Syntax.pretty_term ctxt t2])
blanchet@33192
   593
      end
blanchet@33192
   594
    (* dtype_spec -> Pretty.T *)
blanchet@33192
   595
    fun pretty_for_datatype ({typ, card, precise, ...} : dtype_spec) =
blanchet@33192
   596
      Pretty.block (Pretty.breaks
blanchet@33192
   597
          [Syntax.pretty_typ ctxt (unbox_type typ), Pretty.str "=",
blanchet@33192
   598
           Pretty.enum "," "{" "}"
blanchet@33192
   599
               (map (Syntax.pretty_term ctxt o nth_value_of_type typ card)
blanchet@33192
   600
                    (index_seq 0 card) @
blanchet@33192
   601
                (if precise then [] else [Pretty.str unrep]))])
blanchet@33192
   602
    (* typ -> dtype_spec list *)
blanchet@33192
   603
    fun integer_datatype T =
blanchet@33192
   604
      [{typ = T, card = card_of_type card_assigns T, co = false,
blanchet@33558
   605
        precise = false, shallow = false, constrs = []}]
blanchet@33232
   606
      handle TYPE ("Nitpick_HOL.card_of_type", _, _) => []
blanchet@33192
   607
    val (codatatypes, datatypes) =
blanchet@33558
   608
      datatypes |> filter_out #shallow
blanchet@33558
   609
                |> List.partition #co
blanchet@33558
   610
                ||> append (integer_datatype nat_T @ integer_datatype int_T)
blanchet@33192
   611
    val block_of_datatypes =
blanchet@33192
   612
      if show_datatypes andalso not (null datatypes) then
blanchet@33192
   613
        [Pretty.big_list ("Datatype" ^ plural_s_for_list datatypes ^ ":")
blanchet@33192
   614
                         (map pretty_for_datatype datatypes)]
blanchet@33192
   615
      else
blanchet@33192
   616
        []
blanchet@33192
   617
    val block_of_codatatypes =
blanchet@33192
   618
      if show_datatypes andalso not (null codatatypes) then
blanchet@33192
   619
        [Pretty.big_list ("Codatatype" ^ plural_s_for_list codatatypes ^ ":")
blanchet@33192
   620
                         (map pretty_for_datatype codatatypes)]
blanchet@33192
   621
      else
blanchet@33192
   622
        []
blanchet@33192
   623
    (* bool -> string -> nut list -> Pretty.T list *)
blanchet@33192
   624
    fun block_of_names show title names =
blanchet@33192
   625
      if show andalso not (null names) then
blanchet@33192
   626
        Pretty.str (title ^ plural_s_for_list names ^ ":")
blanchet@33192
   627
        :: map (Pretty.indent indent_size o pretty_for_assign)
blanchet@33192
   628
               (sort_wrt (original_name o nickname_of) names)
blanchet@33192
   629
      else
blanchet@33192
   630
        []
blanchet@33192
   631
    val (skolem_names, nonskolem_nonsel_names) =
blanchet@33192
   632
      List.partition is_skolem_name nonsel_names
blanchet@33192
   633
    val (eval_names, noneval_nonskolem_nonsel_names) =
blanchet@33192
   634
      List.partition (String.isPrefix eval_prefix o nickname_of)
blanchet@33192
   635
                     nonskolem_nonsel_names
blanchet@33192
   636
      ||> filter_out (equal @{const_name bisim_iterator_max} o nickname_of)
blanchet@33192
   637
    val free_names =
blanchet@33192
   638
      map (fn x as (s, T) =>
blanchet@33192
   639
              case filter (equal x o nickname_of pairf (unbox_type o type_of))
blanchet@33192
   640
                          free_names of
blanchet@33192
   641
                [name] => name
blanchet@33192
   642
              | [] => FreeName (s, T, Any)
blanchet@33232
   643
              | _ => raise TERM ("Nitpick_Model.reconstruct_hol_model",
blanchet@33192
   644
                                 [Const x])) all_frees
blanchet@33192
   645
    val chunks = block_of_names true "Free variable" free_names @
blanchet@33192
   646
                 block_of_names show_skolems "Skolem constant" skolem_names @
blanchet@33192
   647
                 block_of_names true "Evaluated term" eval_names @
blanchet@33192
   648
                 block_of_datatypes @ block_of_codatatypes @
blanchet@33192
   649
                 block_of_names show_consts "Constant"
blanchet@33192
   650
                                noneval_nonskolem_nonsel_names
blanchet@33192
   651
  in
blanchet@33192
   652
    (Pretty.chunks (if null chunks then [Pretty.str "Empty assignment"]
blanchet@33192
   653
                    else chunks),
blanchet@33192
   654
     bisim_depth >= 0
blanchet@33192
   655
     orelse forall (is_codatatype_wellformed codatatypes) codatatypes)
blanchet@33192
   656
  end
blanchet@33192
   657
blanchet@33192
   658
(* scope -> Time.time option -> nut list -> nut list -> nut NameTable.table
blanchet@33192
   659
   -> Kodkod.raw_bound list -> term -> bool option *)
blanchet@33192
   660
fun prove_hol_model (scope as {ext_ctxt as {thy, ctxt, ...}, card_assigns, ...})
blanchet@33192
   661
                    auto_timeout free_names sel_names rel_table bounds prop =
blanchet@33192
   662
  let
blanchet@33192
   663
    (* typ * int -> term *)
blanchet@33192
   664
    fun free_type_assm (T, k) =
blanchet@33192
   665
      let
blanchet@33192
   666
        (* int -> term *)
blanchet@33192
   667
        val atom = atom true T
blanchet@33192
   668
        fun equation_for_atom j = HOLogic.eq_const T $ Bound 0 $ atom j
blanchet@33192
   669
        val eqs = map equation_for_atom (index_seq 0 k)
blanchet@33192
   670
        val compreh_assm =
blanchet@33192
   671
          Const (@{const_name All}, (T --> bool_T) --> bool_T)
blanchet@33192
   672
              $ Abs ("x", T, foldl1 HOLogic.mk_disj eqs)
blanchet@33192
   673
        val distinct_assm = distinctness_formula T (map atom (index_seq 0 k))
blanchet@33192
   674
      in HOLogic.mk_conj (compreh_assm, distinct_assm) end
blanchet@33192
   675
    (* nut -> term *)
blanchet@33192
   676
    fun free_name_assm name =
blanchet@33192
   677
      HOLogic.mk_eq (Free (nickname_of name, type_of name),
blanchet@33192
   678
                     term_for_name scope sel_names rel_table bounds name)
blanchet@33192
   679
    val freeT_assms = map free_type_assm (filter (is_TFree o fst) card_assigns)
blanchet@33192
   680
    val model_assms = map free_name_assm free_names
blanchet@33192
   681
    val assm = List.foldr HOLogic.mk_conj @{const True}
blanchet@33192
   682
                          (freeT_assms @ model_assms)
blanchet@33192
   683
    (* bool -> bool *)
blanchet@33192
   684
    fun try_out negate =
blanchet@33192
   685
      let
blanchet@33192
   686
        val concl = (negate ? curry (op $) @{const Not})
blanchet@33192
   687
                    (ObjectLogic.atomize_term thy prop)
blanchet@33192
   688
        val goal = HOLogic.mk_Trueprop (HOLogic.mk_imp (assm, concl))
blanchet@33192
   689
                   |> map_types (map_type_tfree
blanchet@33192
   690
                          (fn (s, []) => TFree (s, HOLogic.typeS)
blanchet@33192
   691
                            | x => TFree x))
blanchet@33192
   692
                   |> cterm_of thy |> Goal.init
blanchet@33192
   693
      in
blanchet@33192
   694
        (goal |> SINGLE (DETERM_TIMEOUT auto_timeout
blanchet@33192
   695
                                        (auto_tac (clasimpset_of ctxt)))
blanchet@33192
   696
              |> the |> Goal.finish ctxt; true)
blanchet@33192
   697
        handle THM _ => false
blanchet@33192
   698
             | TimeLimit.TimeOut => false
blanchet@33192
   699
      end
blanchet@33192
   700
  in
blanchet@33192
   701
    if silence try_out false then SOME true
blanchet@33192
   702
    else if silence try_out true then SOME false
blanchet@33192
   703
    else NONE
blanchet@33192
   704
  end
blanchet@33192
   705
blanchet@33192
   706
end;