src/HOL/Tools/Nitpick/nitpick_model.ML
author blanchet
Thu Aug 05 20:17:50 2010 +0200 (2010-08-05)
changeset 38209 3d1d928dce50
parent 38207 792b78e355e7
child 38240 a44d108a8d39
permissions -rw-r--r--
added "whack"
blanchet@33982
     1
(*  Title:      HOL/Tools/Nitpick/nitpick_model.ML
blanchet@33192
     2
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@34982
     3
    Copyright   2009, 2010
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@33705
    10
  type styp = Nitpick_Util.styp
blanchet@33232
    11
  type scope = Nitpick_Scope.scope
blanchet@33232
    12
  type rep = Nitpick_Rep.rep
blanchet@33232
    13
  type nut = Nitpick_Nut.nut
blanchet@33192
    14
blanchet@36390
    15
  type params =
blanchet@36390
    16
    {show_datatypes: bool,
blanchet@36390
    17
     show_consts: bool}
blanchet@36390
    18
blanchet@35712
    19
  type term_postprocessor =
blanchet@35712
    20
    Proof.context -> string -> (typ -> term list) -> typ -> term -> term
blanchet@33192
    21
blanchet@33192
    22
  structure NameTable : TABLE
blanchet@33192
    23
blanchet@35712
    24
  val irrelevant : string
blanchet@35712
    25
  val unknown : string
blanchet@37261
    26
  val unrep : unit -> string
blanchet@35711
    27
  val register_term_postprocessor :
blanchet@35711
    28
    typ -> term_postprocessor -> theory -> theory
blanchet@35711
    29
  val unregister_term_postprocessor : typ -> theory -> theory
blanchet@33192
    30
  val tuple_list_for_name :
blanchet@33192
    31
    nut NameTable.table -> Kodkod.raw_bound list -> nut -> int list list
blanchet@35712
    32
  val dest_plain_fun : term -> bool * (term list * term list)
blanchet@33192
    33
  val reconstruct_hol_model :
blanchet@37260
    34
    params -> scope -> (term option * int list) list
blanchet@38170
    35
    -> (typ option * string list) list -> styp list -> styp list -> nut list
blanchet@38170
    36
    -> nut list -> nut list -> nut NameTable.table -> Kodkod.raw_bound list
blanchet@33192
    37
    -> Pretty.T * bool
blanchet@33192
    38
  val prove_hol_model :
blanchet@33192
    39
    scope -> Time.time option -> nut list -> nut list -> nut NameTable.table
blanchet@33192
    40
    -> Kodkod.raw_bound list -> term -> bool option
blanchet@33192
    41
end;
blanchet@33192
    42
blanchet@33232
    43
structure Nitpick_Model : NITPICK_MODEL =
blanchet@33192
    44
struct
blanchet@33192
    45
blanchet@33232
    46
open Nitpick_Util
blanchet@33232
    47
open Nitpick_HOL
blanchet@33232
    48
open Nitpick_Scope
blanchet@33232
    49
open Nitpick_Peephole
blanchet@33232
    50
open Nitpick_Rep
blanchet@33232
    51
open Nitpick_Nut
blanchet@33192
    52
blanchet@34126
    53
structure KK = Kodkod
blanchet@34126
    54
blanchet@36390
    55
type params =
blanchet@36390
    56
  {show_datatypes: bool,
blanchet@36390
    57
   show_consts: bool}
blanchet@33192
    58
blanchet@35712
    59
type term_postprocessor =
blanchet@35712
    60
  Proof.context -> string -> (typ -> term list) -> typ -> term -> term
blanchet@35711
    61
blanchet@35711
    62
structure Data = Theory_Data(
blanchet@35711
    63
  type T = (typ * term_postprocessor) list
blanchet@35711
    64
  val empty = []
blanchet@35711
    65
  val extend = I
krauss@36607
    66
  fun merge (x, y) = AList.merge (op =) (K true) (x, y))
blanchet@35711
    67
blanchet@37261
    68
fun xsym s s' () = if print_mode_active Symbol.xsymbolsN then s else s'
blanchet@37261
    69
blanchet@35712
    70
val irrelevant = "_"
blanchet@33192
    71
val unknown = "?"
blanchet@37261
    72
val unrep = xsym "\<dots>" "..."
blanchet@37261
    73
val maybe_mixfix = xsym "_\<^sup>?" "_?"
blanchet@37261
    74
val base_mixfix = xsym "_\<^bsub>base\<^esub>" "_.base"
blanchet@37261
    75
val step_mixfix = xsym "_\<^bsub>step\<^esub>" "_.step"
blanchet@37261
    76
val abs_mixfix = xsym "\<guillemotleft>_\<guillemotright>" "\"_\""
blanchet@35718
    77
val arg_var_prefix = "x"
blanchet@37261
    78
val cyclic_co_val_name = xsym "\<omega>" "w"
blanchet@37261
    79
val cyclic_const_prefix = xsym "\<xi>" "X"
blanchet@37261
    80
fun cyclic_type_name () = nitpick_prefix ^ cyclic_const_prefix ()
blanchet@34982
    81
val opt_flag = nitpick_prefix ^ "opt"
blanchet@34982
    82
val non_opt_flag = nitpick_prefix ^ "non_opt"
blanchet@33192
    83
blanchet@35076
    84
type atom_pool = ((string * int) * int list) list
blanchet@35076
    85
blanchet@35718
    86
fun add_wacky_syntax ctxt =
blanchet@35718
    87
  let
blanchet@35718
    88
    val name_of = fst o dest_Const
blanchet@35718
    89
    val thy = ProofContext.theory_of ctxt |> Context.reject_draft
blanchet@35718
    90
    val (maybe_t, thy) =
blanchet@35718
    91
      Sign.declare_const ((@{binding nitpick_maybe}, @{typ "'a => 'a"}),
blanchet@37261
    92
                          Mixfix (maybe_mixfix (), [1000], 1000)) thy
blanchet@35718
    93
    val (abs_t, thy) =
blanchet@35718
    94
      Sign.declare_const ((@{binding nitpick_abs}, @{typ "'a => 'b"}),
blanchet@37261
    95
                          Mixfix (abs_mixfix (), [40], 40)) thy
blanchet@35718
    96
    val (base_t, thy) =
blanchet@35718
    97
      Sign.declare_const ((@{binding nitpick_base}, @{typ "'a => 'a"}),
blanchet@37261
    98
                          Mixfix (base_mixfix (), [1000], 1000)) thy
blanchet@35718
    99
    val (step_t, thy) =
blanchet@35718
   100
      Sign.declare_const ((@{binding nitpick_step}, @{typ "'a => 'a"}),
blanchet@37261
   101
                          Mixfix (step_mixfix (), [1000], 1000)) thy
blanchet@35718
   102
  in
blanchet@35718
   103
    (pairself (pairself name_of) ((maybe_t, abs_t), (base_t, step_t)),
blanchet@35718
   104
     ProofContext.transfer_syntax thy ctxt)
blanchet@35718
   105
  end
blanchet@35718
   106
blanchet@35718
   107
(** Term reconstruction **)
blanchet@35718
   108
blanchet@37260
   109
fun nth_atom_number pool T j =
blanchet@37260
   110
  case AList.lookup (op =) (!pool) T of
blanchet@37260
   111
    SOME js =>
blanchet@37260
   112
    (case find_index (curry (op =) j) js of
blanchet@37260
   113
       ~1 => (Unsynchronized.change pool (cons (T, j :: js));
blanchet@37260
   114
              length js + 1)
blanchet@37260
   115
     | n => length js - n)
blanchet@37260
   116
  | NONE => (Unsynchronized.change pool (cons (T, [j])); 1)
blanchet@37260
   117
fun atom_suffix s =
blanchet@37260
   118
  nat_subscript
blanchet@37260
   119
  #> (s <> "" andalso Symbol.is_ascii_digit (List.last (explode s)))
blanchet@33884
   120
     ? prefix "\<^isub>,"
blanchet@37260
   121
fun nth_atom_name thy atomss pool prefix T j =
blanchet@37260
   122
  let
blanchet@37260
   123
    val ss = these (triple_lookup (type_match thy) atomss T)
blanchet@37260
   124
    val m = nth_atom_number pool T j
blanchet@37260
   125
  in
blanchet@37260
   126
    if m <= length ss then
blanchet@37260
   127
      nth ss (m - 1)
blanchet@37260
   128
    else case T of
blanchet@37260
   129
      Type (s, _) =>
blanchet@37260
   130
      let val s' = shortest_name s in
blanchet@37260
   131
        prefix ^
blanchet@37260
   132
        (if String.isPrefix "\\" s' then s' else substring (s', 0, 1)) ^
blanchet@37260
   133
        atom_suffix s m
blanchet@37260
   134
      end
blanchet@37260
   135
    | TFree (s, _) => prefix ^ perhaps (try (unprefix "'")) s ^ atom_suffix s m
blanchet@37260
   136
    | _ => raise TYPE ("Nitpick_Model.nth_atom_name", [T], [])
blanchet@37260
   137
  end
blanchet@37260
   138
fun nth_atom thy atomss pool for_auto T j =
blanchet@33192
   139
  if for_auto then
blanchet@37260
   140
    Free (nth_atom_name thy atomss pool (hd (space_explode "." nitpick_prefix))
blanchet@37260
   141
                        T j, T)
blanchet@33192
   142
  else
blanchet@37260
   143
    Const (nth_atom_name thy atomss pool "" T j, T)
blanchet@33192
   144
blanchet@35177
   145
fun extract_real_number (Const (@{const_name divide}, _) $ t1 $ t2) =
blanchet@34126
   146
    real (snd (HOLogic.dest_number t1)) / real (snd (HOLogic.dest_number t2))
blanchet@34126
   147
  | extract_real_number t = real (snd (HOLogic.dest_number t))
blanchet@34124
   148
fun nice_term_ord (Abs (_, _, t1), Abs (_, _, t2)) = nice_term_ord (t1, t2)
blanchet@34126
   149
  | nice_term_ord tp = Real.compare (pairself extract_real_number tp)
blanchet@34124
   150
    handle TERM ("dest_number", _) =>
blanchet@34126
   151
           case tp of
blanchet@34124
   152
             (t11 $ t12, t21 $ t22) =>
blanchet@34124
   153
             (case nice_term_ord (t11, t21) of
blanchet@34124
   154
                EQUAL => nice_term_ord (t12, t22)
blanchet@34124
   155
              | ord => ord)
wenzelm@35408
   156
           | _ => Term_Ord.fast_term_ord tp
blanchet@34124
   157
blanchet@35711
   158
fun register_term_postprocessor T p = Data.map (cons (T, p))
blanchet@35711
   159
fun unregister_term_postprocessor T = Data.map (AList.delete (op =) T)
blanchet@35711
   160
blanchet@33192
   161
fun tuple_list_for_name rel_table bounds name =
blanchet@33192
   162
  the (AList.lookup (op =) bounds (the_rel rel_table name)) handle NUT _ => [[]]
blanchet@33192
   163
blanchet@35665
   164
fun unarize_unbox_etc_term (Const (@{const_name FinFun}, _) $ t1) =
blanchet@35665
   165
    unarize_unbox_etc_term t1
blanchet@35665
   166
  | unarize_unbox_etc_term (Const (@{const_name FunBox}, _) $ t1) =
blanchet@35665
   167
    unarize_unbox_etc_term t1
blanchet@35665
   168
  | unarize_unbox_etc_term
blanchet@35665
   169
        (Const (@{const_name PairBox},
blanchet@35665
   170
                Type (@{type_name fun}, [T1, Type (@{type_name fun}, [T2, _])]))
blanchet@35665
   171
         $ t1 $ t2) =
blanchet@35665
   172
    let val Ts = map uniterize_unarize_unbox_etc_type [T1, T2] in
blanchet@38190
   173
      Const (@{const_name Pair}, Ts ---> Type (@{type_name prod}, Ts))
blanchet@35665
   174
      $ unarize_unbox_etc_term t1 $ unarize_unbox_etc_term t2
blanchet@33192
   175
    end
blanchet@35665
   176
  | unarize_unbox_etc_term (Const (s, T)) =
blanchet@35665
   177
    Const (s, uniterize_unarize_unbox_etc_type T)
blanchet@35665
   178
  | unarize_unbox_etc_term (t1 $ t2) =
blanchet@35665
   179
    unarize_unbox_etc_term t1 $ unarize_unbox_etc_term t2
blanchet@35665
   180
  | unarize_unbox_etc_term (Free (s, T)) =
blanchet@35665
   181
    Free (s, uniterize_unarize_unbox_etc_type T)
blanchet@35665
   182
  | unarize_unbox_etc_term (Var (x, T)) =
blanchet@35665
   183
    Var (x, uniterize_unarize_unbox_etc_type T)
blanchet@35665
   184
  | unarize_unbox_etc_term (Bound j) = Bound j
blanchet@35665
   185
  | unarize_unbox_etc_term (Abs (s, T, t')) =
blanchet@35665
   186
    Abs (s, uniterize_unarize_unbox_etc_type T, unarize_unbox_etc_term t')
blanchet@33192
   187
blanchet@38190
   188
fun factor_out_types (T1 as Type (@{type_name prod}, [T11, T12]))
blanchet@38190
   189
                     (T2 as Type (@{type_name prod}, [T21, T22])) =
blanchet@33192
   190
    let val (n1, n2) = pairself num_factors_in_type (T11, T21) in
blanchet@33192
   191
      if n1 = n2 then
blanchet@33192
   192
        let
blanchet@33192
   193
          val ((T11', opt_T12'), (T21', opt_T22')) = factor_out_types T12 T22
blanchet@33192
   194
        in
blanchet@38190
   195
          ((Type (@{type_name prod}, [T11, T11']), opt_T12'),
blanchet@38190
   196
           (Type (@{type_name prod}, [T21, T21']), opt_T22'))
blanchet@33192
   197
        end
blanchet@33192
   198
      else if n1 < n2 then
blanchet@33192
   199
        case factor_out_types T1 T21 of
blanchet@33192
   200
          (p1, (T21', NONE)) => (p1, (T21', SOME T22))
blanchet@33192
   201
        | (p1, (T21', SOME T22')) =>
blanchet@38190
   202
          (p1, (T21', SOME (Type (@{type_name prod}, [T22', T22]))))
blanchet@33192
   203
      else
blanchet@33192
   204
        swap (factor_out_types T2 T1)
blanchet@33192
   205
    end
blanchet@38190
   206
  | factor_out_types (Type (@{type_name prod}, [T11, T12])) T2 =
blanchet@35665
   207
    ((T11, SOME T12), (T2, NONE))
blanchet@38190
   208
  | factor_out_types T1 (Type (@{type_name prod}, [T21, T22])) =
blanchet@35665
   209
    ((T1, NONE), (T21, SOME T22))
blanchet@33192
   210
  | factor_out_types T1 T2 = ((T1, NONE), (T2, NONE))
blanchet@33192
   211
blanchet@33192
   212
fun make_plain_fun maybe_opt T1 T2 =
blanchet@33192
   213
  let
blanchet@33192
   214
    fun aux T1 T2 [] =
blanchet@34982
   215
        Const (if maybe_opt then opt_flag else non_opt_flag, T1 --> T2)
blanchet@35712
   216
      | aux T1 T2 ((t1, t2) :: tps) =
blanchet@34124
   217
        Const (@{const_name fun_upd}, (T1 --> T2) --> T1 --> T2 --> T1 --> T2)
blanchet@35712
   218
        $ aux T1 T2 tps $ t1 $ t2
blanchet@33192
   219
  in aux T1 T2 o rev end
blanchet@34982
   220
fun is_plain_fun (Const (s, _)) = (s = opt_flag orelse s = non_opt_flag)
blanchet@33192
   221
  | is_plain_fun (Const (@{const_name fun_upd}, _) $ t0 $ _ $ _) =
blanchet@33192
   222
    is_plain_fun t0
blanchet@33192
   223
  | is_plain_fun _ = false
blanchet@33192
   224
val dest_plain_fun =
blanchet@33192
   225
  let
blanchet@35712
   226
    fun aux (Abs (_, _, Const (s, _))) = (s <> irrelevant, ([], []))
blanchet@35712
   227
      | aux (Const (s, _)) = (s <> non_opt_flag, ([], []))
blanchet@33192
   228
      | aux (Const (@{const_name fun_upd}, _) $ t0 $ t1 $ t2) =
blanchet@35712
   229
        let val (maybe_opt, (ts1, ts2)) = aux t0 in
blanchet@35712
   230
          (maybe_opt, (t1 :: ts1, t2 :: ts2))
blanchet@35712
   231
        end
blanchet@33232
   232
      | aux t = raise TERM ("Nitpick_Model.dest_plain_fun", [t])
blanchet@33192
   233
  in apsnd (pairself rev) o aux end
blanchet@33192
   234
blanchet@33565
   235
fun break_in_two T T1 T2 t =
blanchet@33565
   236
  let
blanchet@33565
   237
    val ps = HOLogic.flat_tupleT_paths T
blanchet@33565
   238
    val cut = length (HOLogic.strip_tupleT T1)
blanchet@33565
   239
    val (ps1, ps2) = pairself HOLogic.flat_tupleT_paths (T1, T2)
blanchet@33565
   240
    val (ts1, ts2) = t |> HOLogic.strip_ptuple ps |> chop cut
blanchet@33565
   241
  in (HOLogic.mk_ptuple ps1 T1 ts1, HOLogic.mk_ptuple ps2 T2 ts2) end
blanchet@38190
   242
fun pair_up (Type (@{type_name prod}, [T1', T2']))
blanchet@33192
   243
            (t1 as Const (@{const_name Pair},
blanchet@35665
   244
                          Type (@{type_name fun},
blanchet@35665
   245
                                [_, Type (@{type_name fun}, [_, T1])]))
blanchet@35665
   246
             $ t11 $ t12) t2 =
blanchet@33192
   247
    if T1 = T1' then HOLogic.mk_prod (t1, t2)
blanchet@33192
   248
    else HOLogic.mk_prod (t11, pair_up T2' t12 t2)
blanchet@33192
   249
  | pair_up _ t1 t2 = HOLogic.mk_prod (t1, t2)
blanchet@33192
   250
fun multi_pair_up T1 t1 (ts2, ts3) = map2 (pair o pair_up T1 t1) ts2 ts3
blanchet@33192
   251
blanchet@35665
   252
fun typecast_fun (Type (@{type_name fun}, [T1', T2'])) T1 T2 t =
blanchet@33192
   253
    let
blanchet@33565
   254
      fun do_curry T1 T1a T1b T2 t =
blanchet@33192
   255
        let
blanchet@35712
   256
          val (maybe_opt, tsp) = dest_plain_fun t
blanchet@35712
   257
          val tps =
blanchet@35712
   258
            tsp |>> map (break_in_two T1 T1a T1b)
blanchet@35712
   259
                |> uncurry (map2 (fn (t1a, t1b) => fn t2 => (t1a, (t1b, t2))))
blanchet@35712
   260
                |> AList.coalesce (op =)
blanchet@35712
   261
                |> map (apsnd (make_plain_fun maybe_opt T1b T2))
blanchet@35712
   262
        in make_plain_fun maybe_opt T1a (T1b --> T2) tps end
blanchet@33192
   263
      and do_uncurry T1 T2 t =
blanchet@33192
   264
        let
blanchet@33192
   265
          val (maybe_opt, tsp) = dest_plain_fun t
blanchet@35712
   266
          val tps =
blanchet@33192
   267
            tsp |> op ~~
blanchet@33192
   268
                |> maps (fn (t1, t2) =>
blanchet@33192
   269
                            multi_pair_up T1 t1 (snd (dest_plain_fun t2)))
blanchet@35712
   270
        in make_plain_fun maybe_opt T1 T2 tps end
blanchet@33192
   271
      and do_arrow T1' T2' _ _ (Const (s, _)) = Const (s, T1' --> T2')
blanchet@33192
   272
        | do_arrow T1' T2' T1 T2
blanchet@33192
   273
                   (Const (@{const_name fun_upd}, _) $ t0 $ t1 $ t2) =
blanchet@33192
   274
          Const (@{const_name fun_upd},
blanchet@34124
   275
                 (T1' --> T2') --> T1' --> T2' --> T1' --> T2')
blanchet@33192
   276
          $ do_arrow T1' T2' T1 T2 t0 $ do_term T1' T1 t1 $ do_term T2' T2 t2
blanchet@33192
   277
        | do_arrow _ _ _ _ t =
blanchet@33232
   278
          raise TERM ("Nitpick_Model.typecast_fun.do_arrow", [t])
blanchet@33192
   279
      and do_fun T1' T2' T1 T2 t =
blanchet@33192
   280
        case factor_out_types T1' T1 of
blanchet@33192
   281
          ((_, NONE), (_, NONE)) => t |> do_arrow T1' T2' T1 T2
blanchet@33192
   282
        | ((_, NONE), (T1a, SOME T1b)) =>
blanchet@33565
   283
          t |> do_curry T1 T1a T1b T2 |> do_arrow T1' T2' T1a (T1b --> T2)
blanchet@33192
   284
        | ((T1a', SOME T1b'), (_, NONE)) =>
blanchet@33192
   285
          t |> do_arrow T1a' (T1b' --> T2') T1 T2 |> do_uncurry T1' T2'
blanchet@33232
   286
        | _ => raise TYPE ("Nitpick_Model.typecast_fun.do_fun", [T1, T1'], [])
blanchet@35665
   287
      and do_term (Type (@{type_name fun}, [T1', T2']))
blanchet@35665
   288
                  (Type (@{type_name fun}, [T1, T2])) t =
blanchet@33192
   289
          do_fun T1' T2' T1 T2 t
blanchet@38190
   290
        | do_term (T' as Type (@{type_name prod}, Ts' as [T1', T2']))
blanchet@38190
   291
                  (Type (@{type_name prod}, [T1, T2]))
blanchet@33192
   292
                  (Const (@{const_name Pair}, _) $ t1 $ t2) =
blanchet@33192
   293
          Const (@{const_name Pair}, Ts' ---> T')
blanchet@33192
   294
          $ do_term T1' T1 t1 $ do_term T2' T2 t2
blanchet@33192
   295
        | do_term T' T t =
blanchet@33192
   296
          if T = T' then t
blanchet@33232
   297
          else raise TYPE ("Nitpick_Model.typecast_fun.do_term", [T, T'], [])
blanchet@33192
   298
    in if T1' = T1 andalso T2' = T2 then t else do_fun T1' T2' T1 T2 t end
blanchet@34998
   299
  | typecast_fun T' _ _ _ =
blanchet@34998
   300
    raise TYPE ("Nitpick_Model.typecast_fun", [T'], [])
blanchet@33192
   301
blanchet@33192
   302
fun truth_const_sort_key @{const True} = "0"
blanchet@33192
   303
  | truth_const_sort_key @{const False} = "2"
blanchet@33192
   304
  | truth_const_sort_key _ = "1"
blanchet@33192
   305
blanchet@38190
   306
fun mk_tuple (Type (@{type_name prod}, [T1, T2])) ts =
blanchet@33192
   307
    HOLogic.mk_prod (mk_tuple T1 ts,
blanchet@33192
   308
        mk_tuple T2 (List.drop (ts, length (HOLogic.flatten_tupleT T1))))
blanchet@33192
   309
  | mk_tuple _ (t :: _) = t
blanchet@34124
   310
  | mk_tuple T [] = raise TYPE ("Nitpick_Model.mk_tuple", [T], [])
blanchet@33192
   311
blanchet@35711
   312
fun varified_type_match thy (candid_T, pat_T) =
wenzelm@35845
   313
  strict_type_match thy (candid_T, Logic.varifyT_global pat_T)
blanchet@35711
   314
blanchet@35712
   315
fun all_values_of_type pool wacky_names (scope as {card_assigns, ...} : scope)
blanchet@37260
   316
                       atomss sel_names rel_table bounds card T =
blanchet@35712
   317
  let
blanchet@35712
   318
    val card = if card = 0 then card_of_type card_assigns T else card
blanchet@35712
   319
    fun nth_value_of_type n =
blanchet@35712
   320
      let
blanchet@35712
   321
        fun term unfold =
blanchet@37262
   322
          reconstruct_term true unfold pool wacky_names scope atomss sel_names
blanchet@37260
   323
                           rel_table bounds T T (Atom (card, 0)) [[n]]
blanchet@35712
   324
      in
blanchet@35712
   325
        case term false of
blanchet@35712
   326
          t as Const (s, _) =>
blanchet@37261
   327
          if String.isPrefix (cyclic_const_prefix ()) s then
blanchet@35712
   328
            HOLogic.mk_eq (t, term true)
blanchet@35712
   329
          else
blanchet@35712
   330
            t
blanchet@35712
   331
        | t => t
blanchet@35712
   332
      end
blanchet@35712
   333
  in index_seq 0 card |> map nth_value_of_type |> sort nice_term_ord end
blanchet@37262
   334
and reconstruct_term maybe_opt unfold pool
blanchet@37262
   335
        (wacky_names as ((maybe_name, abs_name), _))
blanchet@37256
   336
        (scope as {hol_ctxt as {thy, ctxt, stds, ...}, binarize, card_assigns,
blanchet@37260
   337
                   bits, datatypes, ofs, ...})
blanchet@37260
   338
        atomss sel_names rel_table bounds =
blanchet@33192
   339
  let
blanchet@33192
   340
    val for_auto = (maybe_name = "")
blanchet@34124
   341
    fun value_of_bits jss =
blanchet@34124
   342
      let
blanchet@34124
   343
        val j0 = offset_of_type ofs @{typ unsigned_bit}
blanchet@34124
   344
        val js = map (Integer.add (~ j0) o the_single) jss
blanchet@34124
   345
      in
blanchet@34124
   346
        fold (fn j => Integer.add (reasonable_power 2 j |> j = bits ? op ~))
blanchet@34124
   347
             js 0
blanchet@34124
   348
      end
blanchet@35712
   349
    val all_values =
blanchet@37260
   350
      all_values_of_type pool wacky_names scope atomss sel_names rel_table
blanchet@37260
   351
                         bounds 0
blanchet@35712
   352
    fun postprocess_term (Type (@{type_name fun}, _)) = I
blanchet@35712
   353
      | postprocess_term T =
blanchet@35712
   354
        if null (Data.get thy) then
blanchet@35712
   355
          I
blanchet@35712
   356
        else case AList.lookup (varified_type_match thy) (Data.get thy) T of
blanchet@35712
   357
          SOME postproc => postproc ctxt maybe_name all_values T
blanchet@35712
   358
        | NONE => I
blanchet@35712
   359
    fun postprocess_subterms Ts (t1 $ t2) =
blanchet@35712
   360
        let val t = postprocess_subterms Ts t1 $ postprocess_subterms Ts t2 in
blanchet@35712
   361
          postprocess_term (fastype_of1 (Ts, t)) t
blanchet@35712
   362
        end
blanchet@35712
   363
      | postprocess_subterms Ts (Abs (s, T, t')) =
blanchet@35712
   364
        Abs (s, T, postprocess_subterms (T :: Ts) t')
blanchet@35712
   365
      | postprocess_subterms Ts t = postprocess_term (fastype_of1 (Ts, t)) t
blanchet@35388
   366
    fun make_set maybe_opt T1 T2 tps =
blanchet@33192
   367
      let
wenzelm@35402
   368
        val empty_const = Const (@{const_abbrev Set.empty}, T1 --> T2)
blanchet@33192
   369
        val insert_const = Const (@{const_name insert},
blanchet@34124
   370
                                  T1 --> (T1 --> T2) --> T1 --> T2)
blanchet@33192
   371
        fun aux [] =
blanchet@35385
   372
            if maybe_opt andalso not (is_complete_type datatypes false T1) then
blanchet@37261
   373
              insert_const $ Const (unrep (), T1) $ empty_const
blanchet@33192
   374
            else
blanchet@33192
   375
              empty_const
blanchet@33192
   376
          | aux ((t1, t2) :: zs) =
blanchet@35388
   377
            aux zs
blanchet@35388
   378
            |> t2 <> @{const False}
blanchet@35388
   379
               ? curry (op $)
blanchet@35388
   380
                       (insert_const
blanchet@35388
   381
                        $ (t1 |> t2 <> @{const True}
blanchet@35388
   382
                                 ? curry (op $)
blanchet@35388
   383
                                         (Const (maybe_name, T1 --> T1))))
blanchet@35388
   384
      in
blanchet@35388
   385
        if forall (fn (_, t) => t <> @{const True} andalso t <> @{const False})
blanchet@35388
   386
                  tps then
blanchet@35388
   387
          Const (unknown, T1 --> T2)
blanchet@35388
   388
        else
blanchet@35388
   389
          aux tps
blanchet@35388
   390
      end
blanchet@35665
   391
    fun make_map maybe_opt T1 T2 T2' =
blanchet@33192
   392
      let
blanchet@33192
   393
        val update_const = Const (@{const_name fun_upd},
blanchet@34124
   394
                                  (T1 --> T2) --> T1 --> T2 --> T1 --> T2)
wenzelm@35402
   395
        fun aux' [] = Const (@{const_abbrev Map.empty}, T1 --> T2)
blanchet@35712
   396
          | aux' ((t1, t2) :: tps) =
blanchet@33192
   397
            (case t2 of
blanchet@35712
   398
               Const (@{const_name None}, _) => aux' tps
blanchet@35712
   399
             | _ => update_const $ aux' tps $ t1 $ t2)
blanchet@35712
   400
        fun aux tps =
blanchet@35665
   401
          if maybe_opt andalso not (is_complete_type datatypes false T1) then
blanchet@37261
   402
            update_const $ aux' tps $ Const (unrep (), T1)
blanchet@33192
   403
            $ (Const (@{const_name Some}, T2' --> T2) $ Const (unknown, T2'))
blanchet@33192
   404
          else
blanchet@35712
   405
            aux' tps
blanchet@33192
   406
      in aux end
blanchet@34982
   407
    fun polish_funs Ts t =
blanchet@33192
   408
      (case fastype_of1 (Ts, t) of
blanchet@35665
   409
         Type (@{type_name fun}, [T1, T2]) =>
blanchet@33192
   410
         if is_plain_fun t then
blanchet@33192
   411
           case T2 of
blanchet@33192
   412
             @{typ bool} =>
blanchet@33192
   413
             let
blanchet@33192
   414
               val (maybe_opt, ts_pair) =
blanchet@34982
   415
                 dest_plain_fun t ||> pairself (map (polish_funs Ts))
blanchet@33192
   416
             in
blanchet@33192
   417
               make_set maybe_opt T1 T2
blanchet@33192
   418
                        (sort_wrt (truth_const_sort_key o snd) (op ~~ ts_pair))
blanchet@33192
   419
             end
blanchet@33192
   420
           | Type (@{type_name option}, [T2']) =>
blanchet@33192
   421
             let
blanchet@35665
   422
               val (maybe_opt, ts_pair) =
blanchet@35665
   423
                 dest_plain_fun t ||> pairself (map (polish_funs Ts))
blanchet@35665
   424
             in make_map maybe_opt T1 T2 T2' (rev (op ~~ ts_pair)) end
blanchet@33192
   425
           | _ => raise SAME ()
blanchet@33192
   426
         else
blanchet@33192
   427
           raise SAME ()
blanchet@33192
   428
       | _ => raise SAME ())
blanchet@33192
   429
      handle SAME () =>
blanchet@33192
   430
             case t of
blanchet@34982
   431
               (t1 as Const (@{const_name fun_upd}, _) $ t11 $ _)
blanchet@34982
   432
               $ (t2 as Const (s, _)) =>
blanchet@34982
   433
               if s = unknown then polish_funs Ts t11
blanchet@34982
   434
               else polish_funs Ts t1 $ polish_funs Ts t2
blanchet@34982
   435
             | t1 $ t2 => polish_funs Ts t1 $ polish_funs Ts t2
blanchet@34982
   436
             | Abs (s, T, t') => Abs (s, T, polish_funs (T :: Ts) t')
blanchet@35665
   437
             | Const (s, Type (@{type_name fun}, [T1, T2])) =>
blanchet@34982
   438
               if s = opt_flag orelse s = non_opt_flag then
blanchet@35712
   439
                 Abs ("x", T1,
blanchet@35712
   440
                      Const (if is_complete_type datatypes false T1 then
blanchet@35712
   441
                               irrelevant
blanchet@35712
   442
                             else
blanchet@35712
   443
                               unknown, T2))
blanchet@34982
   444
               else
blanchet@34982
   445
                 t
blanchet@34982
   446
             | t => t
blanchet@33192
   447
    fun make_fun maybe_opt T1 T2 T' ts1 ts2 =
blanchet@34126
   448
      ts1 ~~ ts2 |> sort (nice_term_ord o pairself fst)
blanchet@34998
   449
                 |> make_plain_fun maybe_opt T1 T2
blanchet@35665
   450
                 |> unarize_unbox_etc_term
blanchet@35665
   451
                 |> typecast_fun (uniterize_unarize_unbox_etc_type T')
blanchet@35665
   452
                                 (uniterize_unarize_unbox_etc_type T1)
blanchet@35665
   453
                                 (uniterize_unarize_unbox_etc_type T2)
blanchet@35665
   454
    fun term_for_atom seen (T as Type (@{type_name fun}, [T1, T2])) T' j _ =
blanchet@33192
   455
        let
blanchet@33192
   456
          val k1 = card_of_type card_assigns T1
blanchet@33192
   457
          val k2 = card_of_type card_assigns T2
blanchet@33192
   458
        in
blanchet@35665
   459
          term_for_rep true seen T T' (Vect (k1, Atom (k2, 0)))
blanchet@33192
   460
                       [nth_combination (replicate k1 (k2, 0)) j]
blanchet@33192
   461
          handle General.Subscript =>
blanchet@33232
   462
                 raise ARG ("Nitpick_Model.reconstruct_term.term_for_atom",
blanchet@33192
   463
                            signed_string_of_int j ^ " for " ^
blanchet@33192
   464
                            string_for_rep (Vect (k1, Atom (k2, 0))))
blanchet@33192
   465
        end
blanchet@38190
   466
      | term_for_atom seen (Type (@{type_name prod}, [T1, T2])) _ j k =
blanchet@35075
   467
        let
blanchet@35075
   468
          val k1 = card_of_type card_assigns T1
blanchet@35075
   469
          val k2 = k div k1
blanchet@35075
   470
        in
blanchet@33192
   471
          list_comb (HOLogic.pair_const T1 T2,
blanchet@35075
   472
                     map3 (fn T => term_for_atom seen T T) [T1, T2]
blanchet@35075
   473
                          [j div k2, j mod k2] [k1, k2]) (* ### k2 or k1? FIXME *)
blanchet@33192
   474
        end
blanchet@35075
   475
      | term_for_atom seen @{typ prop} _ j k =
blanchet@35075
   476
        HOLogic.mk_Trueprop (term_for_atom seen bool_T bool_T j k)
blanchet@35075
   477
      | term_for_atom _ @{typ bool} _ j _ =
blanchet@33192
   478
        if j = 0 then @{const False} else @{const True}
blanchet@35075
   479
      | term_for_atom seen T _ j k =
blanchet@35220
   480
        if T = nat_T andalso is_standard_datatype thy stds nat_T then
blanchet@33192
   481
          HOLogic.mk_number nat_T j
blanchet@33192
   482
        else if T = int_T then
blanchet@35075
   483
          HOLogic.mk_number int_T (int_for_atom (k, 0) j)
blanchet@33192
   484
        else if is_fp_iterator_type T then
blanchet@35075
   485
          HOLogic.mk_number nat_T (k - j - 1)
blanchet@33192
   486
        else if T = @{typ bisim_iterator} then
blanchet@33192
   487
          HOLogic.mk_number nat_T j
blanchet@33192
   488
        else case datatype_spec datatypes T of
blanchet@37260
   489
          NONE => nth_atom thy atomss pool for_auto T j
blanchet@37260
   490
        | SOME {deep = false, ...} => nth_atom thy atomss pool for_auto T j
blanchet@35179
   491
        | SOME {co, standard, constrs, ...} =>
blanchet@33192
   492
          let
blanchet@33192
   493
            fun tuples_for_const (s, T) =
blanchet@33192
   494
              tuple_list_for_name rel_table bounds (ConstName (s, T, Any))
blanchet@35180
   495
            fun cyclic_atom () =
blanchet@37261
   496
              nth_atom thy atomss pool for_auto (Type (cyclic_type_name (), []))
blanchet@37261
   497
                       j
blanchet@37260
   498
            fun cyclic_var () =
blanchet@37260
   499
              Var ((nth_atom_name thy atomss pool "" T j, 0), T)
blanchet@33192
   500
            val discr_jsss = map (tuples_for_const o discr_for_constr o #const)
blanchet@33192
   501
                                 constrs
blanchet@33192
   502
            val real_j = j + offset_of_type ofs T
blanchet@33192
   503
            val constr_x as (constr_s, constr_T) =
blanchet@33192
   504
              get_first (fn (jss, {const, ...}) =>
blanchet@34121
   505
                            if member (op =) jss [real_j] then SOME const
blanchet@34121
   506
                            else NONE)
blanchet@33192
   507
                        (discr_jsss ~~ constrs) |> the
blanchet@33192
   508
            val arg_Ts = curried_binder_types constr_T
blanchet@35190
   509
            val sel_xs =
blanchet@35190
   510
              map (binarized_and_boxed_nth_sel_for_constr hol_ctxt binarize
blanchet@35190
   511
                                                          constr_x)
blanchet@35190
   512
                  (index_seq 0 (length arg_Ts))
blanchet@33192
   513
            val sel_Rs =
blanchet@33192
   514
              map (fn x => get_first
blanchet@33192
   515
                               (fn ConstName (s', T', R) =>
blanchet@33192
   516
                                   if (s', T') = x then SOME R else NONE
blanchet@33232
   517
                                 | u => raise NUT ("Nitpick_Model.reconstruct_\
blanchet@33192
   518
                                                   \term.term_for_atom", [u]))
blanchet@33192
   519
                               sel_names |> the) sel_xs
blanchet@33192
   520
            val arg_Rs = map (snd o dest_Func) sel_Rs
blanchet@33192
   521
            val sel_jsss = map tuples_for_const sel_xs
blanchet@33192
   522
            val arg_jsss =
blanchet@33192
   523
              map (map_filter (fn js => if hd js = real_j then SOME (tl js)
blanchet@33192
   524
                                        else NONE)) sel_jsss
blanchet@33192
   525
            val uncur_arg_Ts = binder_types constr_T
blanchet@35179
   526
            val maybe_cyclic = co orelse not standard
blanchet@33192
   527
          in
blanchet@35180
   528
            if maybe_cyclic andalso not (null seen) andalso
blanchet@35188
   529
               member (op =) (seen |> unfold ? (fst o split_last)) (T, j) then
blanchet@35180
   530
              cyclic_var ()
blanchet@34124
   531
            else if constr_s = @{const_name Word} then
blanchet@34124
   532
              HOLogic.mk_number
blanchet@34124
   533
                  (if T = @{typ "unsigned_bit word"} then nat_T else int_T)
blanchet@34124
   534
                  (value_of_bits (the_single arg_jsss))
blanchet@33192
   535
            else
blanchet@33192
   536
              let
blanchet@35179
   537
                val seen = seen |> maybe_cyclic ? cons (T, j)
blanchet@33192
   538
                val ts =
blanchet@33192
   539
                  if length arg_Ts = 0 then
blanchet@33192
   540
                    []
blanchet@33192
   541
                  else
blanchet@35665
   542
                    map3 (fn Ts =>
blanchet@35665
   543
                             term_for_rep (constr_s <> @{const_name FinFun})
blanchet@35665
   544
                                          seen Ts Ts) arg_Ts arg_Rs arg_jsss
blanchet@33192
   545
                    |> mk_tuple (HOLogic.mk_tupleT uncur_arg_Ts)
blanchet@33192
   546
                    |> dest_n_tuple (length uncur_arg_Ts)
blanchet@33192
   547
                val t =
blanchet@33192
   548
                  if constr_s = @{const_name Abs_Frac} then
blanchet@35711
   549
                    case ts of
blanchet@35711
   550
                      [Const (@{const_name Pair}, _) $ t1 $ t2] =>
blanchet@35711
   551
                      frac_from_term_pair (body_type T) t1 t2
blanchet@35711
   552
                    | _ => raise TERM ("Nitpick_Model.reconstruct_term.\
blanchet@35711
   553
                                       \term_for_atom (Abs_Frac)", ts)
blanchet@34936
   554
                  else if not for_auto andalso
blanchet@37256
   555
                          (is_abs_fun ctxt constr_x orelse
blanchet@34936
   556
                           constr_s = @{const_name Quot}) then
blanchet@33192
   557
                    Const (abs_name, constr_T) $ the_single ts
blanchet@33192
   558
                  else
blanchet@33192
   559
                    list_comb (Const constr_x, ts)
blanchet@33192
   560
              in
blanchet@35179
   561
                if maybe_cyclic then
blanchet@35180
   562
                  let val var = cyclic_var () in
blanchet@35188
   563
                    if unfold andalso not standard andalso
blanchet@35180
   564
                       length seen = 1 andalso
blanchet@37261
   565
                       exists_subterm
blanchet@37261
   566
                           (fn Const (s, _) =>
blanchet@37261
   567
                               String.isPrefix (cyclic_const_prefix ()) s
blanchet@37261
   568
                             | t' => t' = var) t then
blanchet@35188
   569
                      subst_atomic [(var, cyclic_atom ())] t
blanchet@35180
   570
                    else if exists_subterm (curry (op =) var) t then
blanchet@35179
   571
                      if co then
blanchet@35179
   572
                        Const (@{const_name The}, (T --> bool_T) --> T)
blanchet@37261
   573
                        $ Abs (cyclic_co_val_name (), T,
blanchet@35179
   574
                               Const (@{const_name "op ="}, T --> T --> bool_T)
blanchet@35180
   575
                               $ Bound 0 $ abstract_over (var, t))
blanchet@35179
   576
                      else
blanchet@35180
   577
                        cyclic_atom ()
blanchet@33192
   578
                    else
blanchet@33192
   579
                      t
blanchet@33192
   580
                  end
blanchet@33192
   581
                else
blanchet@33192
   582
                  t
blanchet@33192
   583
              end
blanchet@33192
   584
          end
blanchet@33192
   585
    and term_for_vect seen k R T1 T2 T' js =
blanchet@35075
   586
      make_fun true T1 T2 T'
blanchet@35075
   587
               (map (fn j => term_for_atom seen T1 T1 j k) (index_seq 0 k))
blanchet@35665
   588
               (map (term_for_rep true seen T2 T2 R o single)
blanchet@33192
   589
                    (batch_list (arity_of_rep R) js))
blanchet@38190
   590
    and term_for_rep _ seen T T' (R as Atom (k, j0)) [[j]] =
blanchet@35075
   591
        if j >= j0 andalso j < j0 + k then term_for_atom seen T T' (j - j0) k
blanchet@33232
   592
        else raise REP ("Nitpick_Model.reconstruct_term.term_for_rep", [R])
blanchet@38190
   593
      | term_for_rep _ seen (Type (@{type_name prod}, [T1, T2])) _
blanchet@35665
   594
                     (Struct [R1, R2]) [js] =
blanchet@33192
   595
        let
blanchet@33192
   596
          val arity1 = arity_of_rep R1
blanchet@33192
   597
          val (js1, js2) = chop arity1 js
blanchet@33192
   598
        in
blanchet@33192
   599
          list_comb (HOLogic.pair_const T1 T2,
blanchet@35665
   600
                     map3 (fn T => term_for_rep true seen T T) [T1, T2] [R1, R2]
blanchet@33192
   601
                          [[js1], [js2]])
blanchet@33192
   602
        end
blanchet@35665
   603
      | term_for_rep _ seen (Type (@{type_name fun}, [T1, T2])) T'
blanchet@35665
   604
                     (Vect (k, R')) [js] =
blanchet@33192
   605
        term_for_vect seen k R' T1 T2 T' js
blanchet@37170
   606
      | term_for_rep maybe_opt seen (Type (@{type_name fun}, [T1, T2])) T'
blanchet@35665
   607
                     (Func (R1, Formula Neut)) jss =
blanchet@33192
   608
        let
blanchet@33192
   609
          val jss1 = all_combinations_for_rep R1
blanchet@35665
   610
          val ts1 = map (term_for_rep true seen T1 T1 R1 o single) jss1
blanchet@33192
   611
          val ts2 =
blanchet@35665
   612
            map (fn js => term_for_rep true seen T2 T2 (Atom (2, 0))
blanchet@35385
   613
                                       [[int_from_bool (member (op =) jss js)]])
blanchet@34121
   614
                jss1
blanchet@37170
   615
        in make_fun maybe_opt T1 T2 T' ts1 ts2 end
blanchet@35665
   616
      | term_for_rep maybe_opt seen (Type (@{type_name fun}, [T1, T2])) T'
blanchet@35665
   617
                     (Func (R1, R2)) jss =
blanchet@33192
   618
        let
blanchet@33192
   619
          val arity1 = arity_of_rep R1
blanchet@33192
   620
          val jss1 = all_combinations_for_rep R1
blanchet@35665
   621
          val ts1 = map (term_for_rep false seen T1 T1 R1 o single) jss1
blanchet@33192
   622
          val grouped_jss2 = AList.group (op =) (map (chop arity1) jss)
blanchet@35665
   623
          val ts2 = map (term_for_rep false seen T2 T2 R2 o the_default []
blanchet@33192
   624
                         o AList.lookup (op =) grouped_jss2) jss1
blanchet@35665
   625
        in make_fun maybe_opt T1 T2 T' ts1 ts2 end
blanchet@35665
   626
      | term_for_rep _ seen T T' (Opt R) jss =
blanchet@35665
   627
        if null jss then Const (unknown, T)
blanchet@35665
   628
        else term_for_rep true seen T T' R jss
blanchet@35665
   629
      | term_for_rep _ _ T _ R jss =
blanchet@33232
   630
        raise ARG ("Nitpick_Model.reconstruct_term.term_for_rep",
blanchet@37260
   631
                   Syntax.string_of_typ ctxt T ^ " " ^ string_for_rep R ^ " " ^
blanchet@33192
   632
                   string_of_int (length jss))
blanchet@35712
   633
  in
blanchet@35712
   634
    postprocess_subterms [] o polish_funs [] o unarize_unbox_etc_term
blanchet@37262
   635
    oooo term_for_rep maybe_opt []
blanchet@35712
   636
  end
blanchet@33192
   637
blanchet@35718
   638
(** Constant postprocessing **)
blanchet@35718
   639
blanchet@35718
   640
fun dest_n_tuple_type 1 T = [T]
blanchet@35718
   641
  | dest_n_tuple_type n (Type (_, [T1, T2])) =
blanchet@35718
   642
    T1 :: dest_n_tuple_type (n - 1) T2
blanchet@35718
   643
  | dest_n_tuple_type _ T =
blanchet@35718
   644
    raise TYPE ("Nitpick_Model.dest_n_tuple_type", [T], [])
blanchet@35718
   645
blanchet@35718
   646
fun const_format thy def_table (x as (s, T)) =
blanchet@35718
   647
  if String.isPrefix unrolled_prefix s then
blanchet@35718
   648
    const_format thy def_table (original_name s, range_type T)
blanchet@35718
   649
  else if String.isPrefix skolem_prefix s then
blanchet@35718
   650
    let
blanchet@35718
   651
      val k = unprefix skolem_prefix s
blanchet@35718
   652
              |> strip_first_name_sep |> fst |> space_explode "@"
blanchet@35718
   653
              |> hd |> Int.fromString |> the
blanchet@35718
   654
    in [k, num_binder_types T - k] end
blanchet@35718
   655
  else if original_name s <> s then
blanchet@35718
   656
    [num_binder_types T]
blanchet@35718
   657
  else case def_of_const thy def_table x of
blanchet@35718
   658
    SOME t' => if fixpoint_kind_of_rhs t' <> NoFp then
blanchet@35718
   659
                 let val k = length (strip_abs_vars t') in
blanchet@35718
   660
                   [k, num_binder_types T - k]
blanchet@35718
   661
                 end
blanchet@35718
   662
               else
blanchet@35718
   663
                 [num_binder_types T]
blanchet@35718
   664
  | NONE => [num_binder_types T]
blanchet@35718
   665
fun intersect_formats _ [] = []
blanchet@35718
   666
  | intersect_formats [] _ = []
blanchet@35718
   667
  | intersect_formats ks1 ks2 =
blanchet@35718
   668
    let val ((ks1', k1), (ks2', k2)) = pairself split_last (ks1, ks2) in
blanchet@35718
   669
      intersect_formats (ks1' @ (if k1 > k2 then [k1 - k2] else []))
blanchet@35718
   670
                        (ks2' @ (if k2 > k1 then [k2 - k1] else [])) @
blanchet@35718
   671
      [Int.min (k1, k2)]
blanchet@35718
   672
    end
blanchet@35718
   673
blanchet@35718
   674
fun lookup_format thy def_table formats t =
blanchet@35718
   675
  case AList.lookup (fn (SOME x, SOME y) =>
blanchet@35718
   676
                        (term_match thy) (x, y) | _ => false)
blanchet@35718
   677
                    formats (SOME t) of
blanchet@35718
   678
    SOME format => format
blanchet@35718
   679
  | NONE => let val format = the (AList.lookup (op =) formats NONE) in
blanchet@35718
   680
              case t of
blanchet@35718
   681
                Const x => intersect_formats format
blanchet@35718
   682
                                             (const_format thy def_table x)
blanchet@35718
   683
              | _ => format
blanchet@35718
   684
            end
blanchet@35718
   685
blanchet@35718
   686
fun format_type default_format format T =
blanchet@35718
   687
  let
blanchet@35718
   688
    val T = uniterize_unarize_unbox_etc_type T
blanchet@35718
   689
    val format = format |> filter (curry (op <) 0)
blanchet@35718
   690
  in
blanchet@35718
   691
    if forall (curry (op =) 1) format then
blanchet@35718
   692
      T
blanchet@35718
   693
    else
blanchet@35718
   694
      let
blanchet@35718
   695
        val (binder_Ts, body_T) = strip_type T
blanchet@35718
   696
        val batched =
blanchet@35718
   697
          binder_Ts
blanchet@35718
   698
          |> map (format_type default_format default_format)
blanchet@35718
   699
          |> rev |> chunk_list_unevenly (rev format)
blanchet@35718
   700
          |> map (HOLogic.mk_tupleT o rev)
blanchet@35718
   701
      in List.foldl (op -->) body_T batched end
blanchet@35718
   702
  end
blanchet@35718
   703
fun format_term_type thy def_table formats t =
blanchet@35718
   704
  format_type (the (AList.lookup (op =) formats NONE))
blanchet@35718
   705
              (lookup_format thy def_table formats t) (fastype_of t)
blanchet@35718
   706
blanchet@35718
   707
fun repair_special_format js m format =
blanchet@35718
   708
  m - 1 downto 0 |> chunk_list_unevenly (rev format)
blanchet@35718
   709
                 |> map (rev o filter_out (member (op =) js))
blanchet@35718
   710
                 |> filter_out null |> map length |> rev
blanchet@35718
   711
blanchet@35718
   712
fun user_friendly_const ({thy, evals, def_table, skolems, special_funs, ...}
blanchet@35718
   713
                         : hol_context) (base_name, step_name) formats =
blanchet@35718
   714
  let
blanchet@35718
   715
    val default_format = the (AList.lookup (op =) formats NONE)
blanchet@35718
   716
    fun do_const (x as (s, T)) =
blanchet@35718
   717
      (if String.isPrefix special_prefix s then
blanchet@35718
   718
         let
blanchet@35718
   719
           val do_term = map_aterms (fn Const x => fst (do_const x) | t' => t')
blanchet@35718
   720
           val (x' as (_, T'), js, ts) =
blanchet@35718
   721
             AList.find (op =) (!special_funs) (s, unarize_unbox_etc_type T)
blanchet@35718
   722
             |> the_single
blanchet@35718
   723
           val max_j = List.last js
blanchet@35718
   724
           val Ts = List.take (binder_types T', max_j + 1)
blanchet@35718
   725
           val missing_js = filter_out (member (op =) js) (0 upto max_j)
blanchet@35718
   726
           val missing_Ts = filter_indices missing_js Ts
blanchet@35718
   727
           fun nth_missing_var n =
blanchet@35718
   728
             ((arg_var_prefix ^ nat_subscript (n + 1), 0), nth missing_Ts n)
blanchet@35718
   729
           val missing_vars = map nth_missing_var (0 upto length missing_js - 1)
blanchet@35718
   730
           val vars = special_bounds ts @ missing_vars
blanchet@35718
   731
           val ts' =
blanchet@35718
   732
             map (fn j =>
blanchet@35718
   733
                     case AList.lookup (op =) (js ~~ ts) j of
blanchet@35718
   734
                       SOME t => do_term t
blanchet@35718
   735
                     | NONE =>
blanchet@35718
   736
                       Var (nth missing_vars
blanchet@35718
   737
                                (find_index (curry (op =) j) missing_js)))
blanchet@35718
   738
                 (0 upto max_j)
blanchet@35718
   739
           val t = do_const x' |> fst
blanchet@35718
   740
           val format =
blanchet@35718
   741
             case AList.lookup (fn (SOME t1, SOME t2) => term_match thy (t1, t2)
blanchet@35718
   742
                                 | _ => false) formats (SOME t) of
blanchet@35718
   743
               SOME format =>
blanchet@35718
   744
               repair_special_format js (num_binder_types T') format
blanchet@35718
   745
             | NONE =>
blanchet@35718
   746
               const_format thy def_table x'
blanchet@35718
   747
               |> repair_special_format js (num_binder_types T')
blanchet@35718
   748
               |> intersect_formats default_format
blanchet@35718
   749
         in
blanchet@35718
   750
           (list_comb (t, ts') |> fold_rev abs_var vars,
blanchet@35718
   751
            format_type default_format format T)
blanchet@35718
   752
         end
blanchet@35718
   753
       else if String.isPrefix uncurry_prefix s then
blanchet@35718
   754
         let
blanchet@35718
   755
           val (ss, s') = unprefix uncurry_prefix s
blanchet@35718
   756
                          |> strip_first_name_sep |>> space_explode "@"
blanchet@35718
   757
         in
blanchet@35718
   758
           if String.isPrefix step_prefix s' then
blanchet@35718
   759
             do_const (s', T)
blanchet@35718
   760
           else
blanchet@35718
   761
             let
blanchet@35718
   762
               val k = the (Int.fromString (hd ss))
blanchet@35718
   763
               val j = the (Int.fromString (List.last ss))
blanchet@35718
   764
               val (before_Ts, (tuple_T, rest_T)) =
blanchet@35718
   765
                 strip_n_binders j T ||> (strip_n_binders 1 #>> hd)
blanchet@35718
   766
               val T' = before_Ts ---> dest_n_tuple_type k tuple_T ---> rest_T
blanchet@35718
   767
             in do_const (s', T') end
blanchet@35718
   768
         end
blanchet@35718
   769
       else if String.isPrefix unrolled_prefix s then
blanchet@35718
   770
         let val t = Const (original_name s, range_type T) in
blanchet@35718
   771
           (lambda (Free (iter_var_prefix, nat_T)) t,
blanchet@35718
   772
            format_type default_format
blanchet@35718
   773
                        (lookup_format thy def_table formats t) T)
blanchet@35718
   774
         end
blanchet@35718
   775
       else if String.isPrefix base_prefix s then
blanchet@35718
   776
         (Const (base_name, T --> T) $ Const (unprefix base_prefix s, T),
blanchet@35718
   777
          format_type default_format default_format T)
blanchet@35718
   778
       else if String.isPrefix step_prefix s then
blanchet@35718
   779
         (Const (step_name, T --> T) $ Const (unprefix step_prefix s, T),
blanchet@35718
   780
          format_type default_format default_format T)
blanchet@35718
   781
       else if String.isPrefix quot_normal_prefix s then
blanchet@38207
   782
         let val t = Const (nitpick_prefix ^ "quotient normal form", T) in
blanchet@35718
   783
           (t, format_term_type thy def_table formats t)
blanchet@35718
   784
         end
blanchet@35718
   785
       else if String.isPrefix skolem_prefix s then
blanchet@35718
   786
         let
blanchet@35718
   787
           val ss = the (AList.lookup (op =) (!skolems) s)
blanchet@35718
   788
           val (Ts, Ts') = chop (length ss) (binder_types T)
blanchet@35718
   789
           val frees = map Free (ss ~~ Ts)
blanchet@35718
   790
           val s' = original_name s
blanchet@35718
   791
         in
blanchet@35718
   792
           (fold lambda frees (Const (s', Ts' ---> T)),
blanchet@35718
   793
            format_type default_format
blanchet@35718
   794
                        (lookup_format thy def_table formats (Const x)) T)
blanchet@35718
   795
         end
blanchet@35718
   796
       else if String.isPrefix eval_prefix s then
blanchet@35718
   797
         let
blanchet@35718
   798
           val t = nth evals (the (Int.fromString (unprefix eval_prefix s)))
blanchet@35718
   799
         in (t, format_term_type thy def_table formats t) end
blanchet@35718
   800
       else if s = @{const_name undefined_fast_The} then
blanchet@35718
   801
         (Const (nitpick_prefix ^ "The fallback", T),
blanchet@35718
   802
          format_type default_format
blanchet@35718
   803
                      (lookup_format thy def_table formats
blanchet@35718
   804
                           (Const (@{const_name The}, (T --> bool_T) --> T))) T)
blanchet@35718
   805
       else if s = @{const_name undefined_fast_Eps} then
blanchet@35718
   806
         (Const (nitpick_prefix ^ "Eps fallback", T),
blanchet@35718
   807
          format_type default_format
blanchet@35718
   808
                      (lookup_format thy def_table formats
blanchet@35718
   809
                           (Const (@{const_name Eps}, (T --> bool_T) --> T))) T)
blanchet@35718
   810
       else
blanchet@35718
   811
         let val t = Const (original_name s, T) in
blanchet@35718
   812
           (t, format_term_type thy def_table formats t)
blanchet@35718
   813
         end)
blanchet@35718
   814
      |>> map_types uniterize_unarize_unbox_etc_type
blanchet@35718
   815
      |>> shorten_names_in_term |>> Term.map_abs_vars shortest_name
blanchet@35718
   816
  in do_const end
blanchet@35718
   817
blanchet@35718
   818
fun assign_operator_for_const (s, T) =
blanchet@35718
   819
  if String.isPrefix ubfp_prefix s then
blanchet@37261
   820
    if is_fun_type T then xsym "\<subseteq>" "<=" ()
blanchet@37261
   821
    else xsym "\<le>" "<=" ()
blanchet@35718
   822
  else if String.isPrefix lbfp_prefix s then
blanchet@37261
   823
    if is_fun_type T then xsym "\<supseteq>" ">=" ()
blanchet@37261
   824
    else xsym "\<ge>" ">=" ()
blanchet@35718
   825
  else if original_name s <> s then
blanchet@35718
   826
    assign_operator_for_const (strip_first_name_sep s |> snd, T)
blanchet@35718
   827
  else
blanchet@35718
   828
    "="
blanchet@35718
   829
blanchet@35718
   830
(** Model reconstruction **)
blanchet@35718
   831
blanchet@33192
   832
fun unfold_outer_the_binders (t as Const (@{const_name The}, _)
blanchet@33192
   833
                                   $ Abs (s, T, Const (@{const_name "op ="}, _)
blanchet@33192
   834
                                                $ Bound 0 $ t')) =
blanchet@33192
   835
    betapply (Abs (s, T, t'), t) |> unfold_outer_the_binders
blanchet@33192
   836
  | unfold_outer_the_binders t = t
blanchet@33192
   837
fun bisimilar_values _ 0 _ = true
blanchet@33192
   838
  | bisimilar_values coTs max_depth (t1, t2) =
blanchet@33192
   839
    let val T = fastype_of t1 in
blanchet@33192
   840
      if exists_subtype (member (op =) coTs) T then
blanchet@33192
   841
        let
blanchet@33192
   842
          val ((head1, args1), (head2, args2)) =
blanchet@33192
   843
            pairself (strip_comb o unfold_outer_the_binders) (t1, t2)
blanchet@34121
   844
          val max_depth = max_depth - (if member (op =) coTs T then 1 else 0)
blanchet@33192
   845
        in
blanchet@34936
   846
          head1 = head2 andalso
blanchet@34936
   847
          forall (bisimilar_values coTs max_depth) (args1 ~~ args2)
blanchet@33192
   848
        end
blanchet@33192
   849
      else
blanchet@33192
   850
        t1 = t2
blanchet@33192
   851
    end
blanchet@33192
   852
blanchet@36390
   853
fun reconstruct_hol_model {show_datatypes, show_consts}
blanchet@35280
   854
        ({hol_ctxt = {thy, ctxt, max_bisim_depth, boxes, stds, wfs, user_axioms,
blanchet@38209
   855
                      debug, whacks, binary_ints, destroy_constrs, specialize,
blanchet@36389
   856
                      star_linear_preds, fast_descrs, tac_timeout, evals,
blanchet@36389
   857
                      case_names, def_table, nondef_table, user_nondefs,
blanchet@36388
   858
                      simp_table, psimp_table, choice_spec_table, intro_table,
blanchet@36388
   859
                      ground_thm_table, ersatz_table, skolems, special_funs,
blanchet@36388
   860
                      unrolled_preds, wf_cache, constr_cache},
blanchet@35190
   861
         binarize, card_assigns, bits, bisim_depth, datatypes, ofs} : scope)
blanchet@38170
   862
        formats atomss real_frees pseudo_frees free_names sel_names nonsel_names
blanchet@38170
   863
        rel_table bounds =
blanchet@33192
   864
  let
blanchet@35180
   865
    val pool = Unsynchronized.ref []
blanchet@35280
   866
    val (wacky_names as (_, base_step_names), ctxt) =
blanchet@33192
   867
      add_wacky_syntax ctxt
blanchet@35070
   868
    val hol_ctxt =
blanchet@33192
   869
      {thy = thy, ctxt = ctxt, max_bisim_depth = max_bisim_depth, boxes = boxes,
blanchet@34982
   870
       stds = stds, wfs = wfs, user_axioms = user_axioms, debug = debug,
blanchet@38209
   871
       whacks = whacks, binary_ints = binary_ints,
blanchet@38209
   872
       destroy_constrs = destroy_constrs, specialize = specialize,
blanchet@38209
   873
       star_linear_preds = star_linear_preds, fast_descrs = fast_descrs,
blanchet@38209
   874
       tac_timeout = tac_timeout, evals = evals, case_names = case_names,
blanchet@38209
   875
       def_table = def_table, nondef_table = nondef_table,
blanchet@38209
   876
       user_nondefs = user_nondefs, simp_table = simp_table,
blanchet@38209
   877
       psimp_table = psimp_table, choice_spec_table = choice_spec_table,
blanchet@38209
   878
       intro_table = intro_table, ground_thm_table = ground_thm_table,
blanchet@38209
   879
       ersatz_table = ersatz_table, skolems = skolems,
blanchet@38209
   880
       special_funs = special_funs, unrolled_preds = unrolled_preds,
blanchet@38209
   881
       wf_cache = wf_cache, constr_cache = constr_cache}
blanchet@36388
   882
    val scope =
blanchet@36388
   883
      {hol_ctxt = hol_ctxt, binarize = binarize, card_assigns = card_assigns,
blanchet@36388
   884
       bits = bits, bisim_depth = bisim_depth, datatypes = datatypes, ofs = ofs}
blanchet@37262
   885
    fun term_for_rep maybe_opt unfold =
blanchet@37262
   886
      reconstruct_term maybe_opt unfold pool wacky_names scope atomss
blanchet@37262
   887
                       sel_names rel_table bounds
blanchet@35180
   888
    fun nth_value_of_type card T n =
blanchet@37262
   889
      let
blanchet@37262
   890
        fun aux unfold = term_for_rep true unfold T T (Atom (card, 0)) [[n]]
blanchet@37262
   891
      in
blanchet@35188
   892
        case aux false of
blanchet@35188
   893
          t as Const (s, _) =>
blanchet@37261
   894
          if String.isPrefix (cyclic_const_prefix ()) s then
blanchet@35188
   895
            HOLogic.mk_eq (t, aux true)
blanchet@35188
   896
          else
blanchet@35188
   897
            t
blanchet@35188
   898
        | t => t
blanchet@35188
   899
      end
blanchet@35712
   900
    val all_values =
blanchet@37260
   901
      all_values_of_type pool wacky_names scope atomss sel_names rel_table
blanchet@37260
   902
                         bounds
blanchet@38126
   903
    fun is_codatatype_wellformed (cos : datatype_spec list)
blanchet@38126
   904
                                 ({typ, card, ...} : datatype_spec) =
blanchet@33192
   905
      let
blanchet@35712
   906
        val ts = all_values card typ
blanchet@33192
   907
        val max_depth = Integer.sum (map #card cos)
blanchet@33192
   908
      in
blanchet@33192
   909
        forall (not o bisimilar_values (map #typ cos) max_depth)
blanchet@33192
   910
               (all_distinct_unordered_pairs_of ts)
blanchet@33192
   911
      end
blanchet@33192
   912
    fun pretty_for_assign name =
blanchet@33192
   913
      let
blanchet@33192
   914
        val (oper, (t1, T'), T) =
blanchet@33192
   915
          case name of
blanchet@33192
   916
            FreeName (s, T, _) =>
blanchet@35665
   917
            let val t = Free (s, uniterize_unarize_unbox_etc_type T) in
blanchet@33192
   918
              ("=", (t, format_term_type thy def_table formats t), T)
blanchet@33192
   919
            end
blanchet@33192
   920
          | ConstName (s, T, _) =>
blanchet@33192
   921
            (assign_operator_for_const (s, T),
blanchet@35280
   922
             user_friendly_const hol_ctxt base_step_names formats (s, T), T)
blanchet@33232
   923
          | _ => raise NUT ("Nitpick_Model.reconstruct_hol_model.\
blanchet@33192
   924
                            \pretty_for_assign", [name])
blanchet@33192
   925
        val t2 = if rep_of name = Any then
blanchet@33192
   926
                   Const (@{const_name undefined}, T')
blanchet@33192
   927
                 else
blanchet@33192
   928
                   tuple_list_for_name rel_table bounds name
blanchet@37262
   929
                   |> term_for_rep (not (is_fully_representable_set name)) false
blanchet@37262
   930
                                   T T' (rep_of name)
blanchet@33192
   931
      in
blanchet@33192
   932
        Pretty.block (Pretty.breaks
blanchet@33571
   933
            [setmp_show_all_types (Syntax.pretty_term ctxt) t1,
blanchet@33192
   934
             Pretty.str oper, Syntax.pretty_term ctxt t2])
blanchet@33192
   935
      end
blanchet@38126
   936
    fun pretty_for_datatype ({typ, card, complete, ...} : datatype_spec) =
blanchet@33192
   937
      Pretty.block (Pretty.breaks
blanchet@38189
   938
          (pretty_for_type ctxt typ ::
blanchet@35665
   939
           (case typ of
blanchet@35665
   940
              Type (@{type_name fin_fun}, _) => [Pretty.str "[finite]"]
blanchet@35665
   941
            | Type (@{type_name fun_box}, _) => [Pretty.str "[boxed]"]
blanchet@35665
   942
            | Type (@{type_name pair_box}, _) => [Pretty.str "[boxed]"]
blanchet@35665
   943
            | _ => []) @
blanchet@35665
   944
           [Pretty.str "=",
blanchet@35665
   945
            Pretty.enum "," "{" "}"
blanchet@35712
   946
                (map (Syntax.pretty_term ctxt) (all_values card typ) @
blanchet@35665
   947
                 (if fun_from_pair complete false then []
blanchet@37261
   948
                  else [Pretty.str (unrep ())]))]))
blanchet@33192
   949
    fun integer_datatype T =
blanchet@33192
   950
      [{typ = T, card = card_of_type card_assigns T, co = false,
blanchet@38126
   951
        standard = true, self_rec = true, complete = (false, false),
blanchet@38126
   952
        concrete = (true, true), deep = true, constrs = []}]
blanchet@33232
   953
      handle TYPE ("Nitpick_HOL.card_of_type", _, _) => []
blanchet@33192
   954
    val (codatatypes, datatypes) =
blanchet@34982
   955
      datatypes |> filter #deep |> List.partition #co
blanchet@35220
   956
                ||> append (integer_datatype int_T
blanchet@35220
   957
                            |> is_standard_datatype thy stds nat_T
blanchet@35220
   958
                               ? append (integer_datatype nat_T))
blanchet@33192
   959
    val block_of_datatypes =
blanchet@33192
   960
      if show_datatypes andalso not (null datatypes) then
blanchet@33192
   961
        [Pretty.big_list ("Datatype" ^ plural_s_for_list datatypes ^ ":")
blanchet@33192
   962
                         (map pretty_for_datatype datatypes)]
blanchet@33192
   963
      else
blanchet@33192
   964
        []
blanchet@33192
   965
    val block_of_codatatypes =
blanchet@33192
   966
      if show_datatypes andalso not (null codatatypes) then
blanchet@33192
   967
        [Pretty.big_list ("Codatatype" ^ plural_s_for_list codatatypes ^ ":")
blanchet@33192
   968
                         (map pretty_for_datatype codatatypes)]
blanchet@33192
   969
      else
blanchet@33192
   970
        []
blanchet@33192
   971
    fun block_of_names show title names =
blanchet@33192
   972
      if show andalso not (null names) then
blanchet@33192
   973
        Pretty.str (title ^ plural_s_for_list names ^ ":")
blanchet@33192
   974
        :: map (Pretty.indent indent_size o pretty_for_assign)
blanchet@33192
   975
               (sort_wrt (original_name o nickname_of) names)
blanchet@33192
   976
      else
blanchet@33192
   977
        []
blanchet@38170
   978
    fun free_name_for_term keep_all (x as (s, T)) =
blanchet@38170
   979
      case filter (curry (op =) x
blanchet@38170
   980
                   o pairf nickname_of (uniterize_unarize_unbox_etc_type
blanchet@38170
   981
                                        o type_of)) free_names of
blanchet@38170
   982
        [name] => SOME name
blanchet@38170
   983
      | [] => if keep_all then SOME (FreeName (s, T, Any)) else NONE
blanchet@38170
   984
      | _ => raise TERM ("Nitpick_Model.reconstruct_hol_model.\
blanchet@38170
   985
                         \free_name_for_term", [Const x])
blanchet@33192
   986
    val (skolem_names, nonskolem_nonsel_names) =
blanchet@33192
   987
      List.partition is_skolem_name nonsel_names
blanchet@33192
   988
    val (eval_names, noneval_nonskolem_nonsel_names) =
blanchet@33192
   989
      List.partition (String.isPrefix eval_prefix o nickname_of)
blanchet@33192
   990
                     nonskolem_nonsel_names
blanchet@35665
   991
      ||> filter_out (member (op =) [@{const_name bisim},
blanchet@35665
   992
                                     @{const_name bisim_iterator_max}]
blanchet@34121
   993
                      o nickname_of)
blanchet@38170
   994
      ||> append (map_filter (free_name_for_term false) pseudo_frees)
blanchet@38170
   995
    val real_free_names = map_filter (free_name_for_term true) real_frees
blanchet@38170
   996
    val chunks = block_of_names true "Free variable" real_free_names @
blanchet@36390
   997
                 block_of_names true "Skolem constant" skolem_names @
blanchet@33192
   998
                 block_of_names true "Evaluated term" eval_names @
blanchet@33192
   999
                 block_of_datatypes @ block_of_codatatypes @
blanchet@33192
  1000
                 block_of_names show_consts "Constant"
blanchet@33192
  1001
                                noneval_nonskolem_nonsel_names
blanchet@33192
  1002
  in
blanchet@33192
  1003
    (Pretty.chunks (if null chunks then [Pretty.str "Empty assignment"]
blanchet@33192
  1004
                    else chunks),
blanchet@34936
  1005
     bisim_depth >= 0 orelse
blanchet@34936
  1006
     forall (is_codatatype_wellformed codatatypes) codatatypes)
blanchet@33192
  1007
  end
blanchet@33192
  1008
blanchet@37262
  1009
fun term_for_name pool scope atomss sel_names rel_table bounds name =
blanchet@37262
  1010
  let val T = type_of name in
blanchet@37262
  1011
    tuple_list_for_name rel_table bounds name
blanchet@37262
  1012
    |> reconstruct_term (not (is_fully_representable_set name)) false pool
blanchet@37262
  1013
                        (("", ""), ("", "")) scope atomss sel_names rel_table
blanchet@37262
  1014
                        bounds T T (rep_of name)
blanchet@37262
  1015
  end
blanchet@37262
  1016
blanchet@35280
  1017
fun prove_hol_model (scope as {hol_ctxt = {thy, ctxt, debug, ...},
blanchet@34998
  1018
                               card_assigns, ...})
blanchet@33192
  1019
                    auto_timeout free_names sel_names rel_table bounds prop =
blanchet@33192
  1020
  let
blanchet@35076
  1021
    val pool = Unsynchronized.ref []
blanchet@37260
  1022
    val atomss = [(NONE, [])]
blanchet@33192
  1023
    fun free_type_assm (T, k) =
blanchet@33192
  1024
      let
blanchet@37260
  1025
        fun atom j = nth_atom thy atomss pool true T j
blanchet@33192
  1026
        fun equation_for_atom j = HOLogic.eq_const T $ Bound 0 $ atom j
blanchet@33192
  1027
        val eqs = map equation_for_atom (index_seq 0 k)
blanchet@33192
  1028
        val compreh_assm =
blanchet@33192
  1029
          Const (@{const_name All}, (T --> bool_T) --> bool_T)
blanchet@33192
  1030
              $ Abs ("x", T, foldl1 HOLogic.mk_disj eqs)
blanchet@33192
  1031
        val distinct_assm = distinctness_formula T (map atom (index_seq 0 k))
blanchet@34998
  1032
      in s_conj (compreh_assm, distinct_assm) end
blanchet@33192
  1033
    fun free_name_assm name =
blanchet@33192
  1034
      HOLogic.mk_eq (Free (nickname_of name, type_of name),
blanchet@37260
  1035
                     term_for_name pool scope atomss sel_names rel_table bounds
blanchet@37260
  1036
                                   name)
blanchet@33192
  1037
    val freeT_assms = map free_type_assm (filter (is_TFree o fst) card_assigns)
blanchet@33192
  1038
    val model_assms = map free_name_assm free_names
blanchet@34998
  1039
    val assm = foldr1 s_conj (freeT_assms @ model_assms)
blanchet@33192
  1040
    fun try_out negate =
blanchet@33192
  1041
      let
blanchet@33192
  1042
        val concl = (negate ? curry (op $) @{const Not})
wenzelm@35625
  1043
                    (Object_Logic.atomize_term thy prop)
blanchet@34998
  1044
        val prop = HOLogic.mk_Trueprop (HOLogic.mk_imp (assm, concl))
blanchet@33192
  1045
                   |> map_types (map_type_tfree
blanchet@34998
  1046
                                     (fn (s, []) => TFree (s, HOLogic.typeS)
blanchet@34998
  1047
                                       | x => TFree x))
blanchet@34998
  1048
       val _ = if debug then
blanchet@34998
  1049
                 priority ((if negate then "Genuineness" else "Spuriousness") ^
blanchet@34998
  1050
                           " goal: " ^ Syntax.string_of_term ctxt prop ^ ".")
blanchet@34998
  1051
               else
blanchet@34998
  1052
                 ()
blanchet@34998
  1053
        val goal = prop |> cterm_of thy |> Goal.init
blanchet@33192
  1054
      in
blanchet@33192
  1055
        (goal |> SINGLE (DETERM_TIMEOUT auto_timeout
blanchet@33192
  1056
                                        (auto_tac (clasimpset_of ctxt)))
blanchet@33192
  1057
              |> the |> Goal.finish ctxt; true)
blanchet@33192
  1058
        handle THM _ => false
blanchet@33192
  1059
             | TimeLimit.TimeOut => false
blanchet@33192
  1060
      end
blanchet@33192
  1061
  in
blanchet@33705
  1062
    if try_out false then SOME true
blanchet@33705
  1063
    else if try_out true then SOME false
blanchet@33192
  1064
    else NONE
blanchet@33192
  1065
  end
blanchet@33192
  1066
blanchet@33192
  1067
end;