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