src/HOL/Tools/Sledgehammer/metis_tactics.ML
author blanchet
Tue Jun 29 09:05:37 2010 +0200 (2010-06-29)
changeset 37623 295f3a9b44b6
parent 37619 bcb19259f92a
child 37625 35eeb95c5bee
permissions -rw-r--r--
move functions not needed by Metis out of "Metis_Clauses"
blanchet@35826
     1
(*  Title:      HOL/Tools/Sledgehammer/metis_tactics.ML
wenzelm@23442
     2
    Author:     Kong W. Susanto and Lawrence C. Paulson, CU Computer Laboratory
wenzelm@23442
     3
    Copyright   Cambridge University 2007
wenzelm@23447
     4
wenzelm@29266
     5
HOL setup for the Metis prover.
wenzelm@23442
     6
*)
wenzelm@23442
     7
blanchet@35826
     8
signature METIS_TACTICS =
wenzelm@23442
     9
sig
wenzelm@32955
    10
  val trace: bool Unsynchronized.ref
wenzelm@24309
    11
  val type_lits: bool Config.T
wenzelm@24319
    12
  val metis_tac: Proof.context -> thm list -> int -> tactic
wenzelm@24319
    13
  val metisF_tac: Proof.context -> thm list -> int -> tactic
paulson@32532
    14
  val metisFT_tac: Proof.context -> thm list -> int -> tactic
wenzelm@24319
    15
  val setup: theory -> theory
wenzelm@23442
    16
end
wenzelm@23442
    17
blanchet@35826
    18
structure Metis_Tactics : METIS_TACTICS =
wenzelm@23442
    19
struct
wenzelm@23442
    20
blanchet@37574
    21
open Clausifier
blanchet@37578
    22
open Metis_Clauses
blanchet@35826
    23
blanchet@37516
    24
exception METIS of string * string
blanchet@37516
    25
wenzelm@32956
    26
val trace = Unsynchronized.ref false;
blanchet@35826
    27
fun trace_msg msg = if !trace then tracing (msg ()) else ();
wenzelm@32955
    28
wenzelm@36001
    29
val (type_lits, type_lits_setup) = Attrib.config_bool "metis_type_lits" (K true);
wenzelm@23442
    30
blanchet@35826
    31
datatype mode = FO | HO | FT  (* first-order, higher-order, fully-typed *)
paulson@32532
    32
wenzelm@32956
    33
(* ------------------------------------------------------------------------- *)
wenzelm@32956
    34
(* Useful Theorems                                                           *)
wenzelm@32956
    35
(* ------------------------------------------------------------------------- *)
wenzelm@33689
    36
val EXCLUDED_MIDDLE = @{lemma "P ==> ~ P ==> False" by (rule notE)}
wenzelm@36945
    37
val REFL_THM = Thm.incr_indexes 2 @{lemma "t ~= t ==> False" by simp}
wenzelm@33689
    38
val subst_em = @{lemma "s = t ==> P s ==> ~ P t ==> False" by simp}
wenzelm@33689
    39
val ssubst_em = @{lemma "s = t ==> P t ==> ~ P s ==> False" by simp}
wenzelm@23442
    40
wenzelm@32956
    41
(* ------------------------------------------------------------------------- *)
wenzelm@32956
    42
(* Useful Functions                                                          *)
wenzelm@32956
    43
(* ------------------------------------------------------------------------- *)
wenzelm@23442
    44
blanchet@37417
    45
(* Match untyped terms. *)
blanchet@37417
    46
fun untyped_aconv (Const (a, _)) (Const(b, _)) = (a = b)
blanchet@37417
    47
  | untyped_aconv (Free (a, _)) (Free (b, _)) = (a = b)
blanchet@37417
    48
  | untyped_aconv (Var ((a, _), _)) (Var ((b, _), _)) =
blanchet@37417
    49
    (a = b) (* The index is ignored, for some reason. *)
blanchet@37417
    50
  | untyped_aconv (Bound i) (Bound j) = (i = j)
blanchet@37417
    51
  | untyped_aconv (Abs (_, _, t)) (Abs (_, _, u)) = untyped_aconv t u
blanchet@37417
    52
  | untyped_aconv (t1 $ t2) (u1 $ u2) =
blanchet@37417
    53
    untyped_aconv t1 u1 andalso untyped_aconv t2 u2
blanchet@37417
    54
  | untyped_aconv _ _ = false
wenzelm@23442
    55
wenzelm@32956
    56
(* Finding the relative location of an untyped term within a list of terms *)
wenzelm@32956
    57
fun get_index lit =
wenzelm@32956
    58
  let val lit = Envir.eta_contract lit
blanchet@37498
    59
      fun get _ [] = raise Empty
wenzelm@32956
    60
        | get n (x::xs) = if untyped_aconv lit (Envir.eta_contract (HOLogic.dest_Trueprop x))
wenzelm@32956
    61
                          then n  else get (n+1) xs
wenzelm@32956
    62
  in get 1 end;
wenzelm@23442
    63
wenzelm@32956
    64
(* ------------------------------------------------------------------------- *)
wenzelm@32956
    65
(* HOL to FOL  (Isabelle to Metis)                                           *)
wenzelm@32956
    66
(* ------------------------------------------------------------------------- *)
wenzelm@23442
    67
wenzelm@32956
    68
fun fn_isa_to_met "equal" = "="
wenzelm@32956
    69
  | fn_isa_to_met x       = x;
wenzelm@23442
    70
wenzelm@32956
    71
fun metis_lit b c args = (b, (c, args));
wenzelm@23442
    72
blanchet@36169
    73
fun hol_type_to_fol (TyVar (x, _)) = Metis.Term.Var x
blanchet@36169
    74
  | hol_type_to_fol (TyFree (s, _)) = Metis.Term.Fn (s, [])
blanchet@36169
    75
  | hol_type_to_fol (TyConstr ((s, _), tps)) =
blanchet@36169
    76
    Metis.Term.Fn (s, map hol_type_to_fol tps);
wenzelm@23442
    77
wenzelm@32956
    78
(*These two functions insert type literals before the real literals. That is the
wenzelm@32956
    79
  opposite order from TPTP linkup, but maybe OK.*)
wenzelm@23442
    80
wenzelm@32956
    81
fun hol_term_to_fol_FO tm =
blanchet@35865
    82
  case strip_combterm_comb tm of
blanchet@36170
    83
      (CombConst ((c, _), _, tys), tms) =>
wenzelm@32956
    84
        let val tyargs = map hol_type_to_fol tys
wenzelm@32956
    85
            val args   = map hol_term_to_fol_FO tms
wenzelm@32956
    86
        in Metis.Term.Fn (c, tyargs @ args) end
blanchet@36170
    87
    | (CombVar ((v, _), _), []) => Metis.Term.Var v
blanchet@37402
    88
    | _ => raise Fail "hol_term_to_fol_FO";
wenzelm@23442
    89
blanchet@36170
    90
fun hol_term_to_fol_HO (CombVar ((s, _), _)) = Metis.Term.Var s
blanchet@36170
    91
  | hol_term_to_fol_HO (CombConst ((a, _), _, tylist)) =
wenzelm@32994
    92
      Metis.Term.Fn (fn_isa_to_met a, map hol_type_to_fol tylist)
blanchet@35865
    93
  | hol_term_to_fol_HO (CombApp (tm1, tm2)) =
wenzelm@32994
    94
       Metis.Term.Fn (".", map hol_term_to_fol_HO [tm1, tm2]);
wenzelm@23442
    95
wenzelm@32956
    96
(*The fully-typed translation, to avoid type errors*)
wenzelm@32956
    97
fun wrap_type (tm, ty) = Metis.Term.Fn("ti", [tm, hol_type_to_fol ty]);
wenzelm@32956
    98
blanchet@36170
    99
fun hol_term_to_fol_FT (CombVar ((s, _), ty)) = wrap_type (Metis.Term.Var s, ty)
blanchet@36170
   100
  | hol_term_to_fol_FT (CombConst((a, _), ty, _)) =
wenzelm@32956
   101
      wrap_type (Metis.Term.Fn(fn_isa_to_met a, []), ty)
blanchet@35865
   102
  | hol_term_to_fol_FT (tm as CombApp(tm1,tm2)) =
wenzelm@32956
   103
       wrap_type (Metis.Term.Fn(".", map hol_term_to_fol_FT [tm1,tm2]),
blanchet@35865
   104
                  type_of_combterm tm);
paulson@32532
   105
blanchet@35865
   106
fun hol_literal_to_fol FO (Literal (pol, tm)) =
blanchet@36170
   107
      let val (CombConst((p, _), _, tys), tms) = strip_combterm_comb tm
wenzelm@32956
   108
          val tylits = if p = "equal" then [] else map hol_type_to_fol tys
wenzelm@32956
   109
          val lits = map hol_term_to_fol_FO tms
wenzelm@32956
   110
      in metis_lit pol (fn_isa_to_met p) (tylits @ lits) end
blanchet@35865
   111
  | hol_literal_to_fol HO (Literal (pol, tm)) =
blanchet@35865
   112
     (case strip_combterm_comb tm of
blanchet@36170
   113
          (CombConst(("equal", _), _, _), tms) =>
wenzelm@32956
   114
            metis_lit pol "=" (map hol_term_to_fol_HO tms)
wenzelm@32956
   115
        | _ => metis_lit pol "{}" [hol_term_to_fol_HO tm])   (*hBOOL*)
blanchet@35865
   116
  | hol_literal_to_fol FT (Literal (pol, tm)) =
blanchet@35865
   117
     (case strip_combterm_comb tm of
blanchet@36170
   118
          (CombConst(("equal", _), _, _), tms) =>
wenzelm@32956
   119
            metis_lit pol "=" (map hol_term_to_fol_FT tms)
wenzelm@32956
   120
        | _ => metis_lit pol "{}" [hol_term_to_fol_FT tm])   (*hBOOL*);
wenzelm@23442
   121
blanchet@37399
   122
fun literals_of_hol_term thy mode t =
blanchet@35865
   123
      let val (lits, types_sorts) = literals_of_term thy t
wenzelm@32956
   124
      in  (map (hol_literal_to_fol mode) lits, types_sorts) end;
wenzelm@23442
   125
wenzelm@32956
   126
(*Sign should be "true" for conjecture type constraints, "false" for type lits in clauses.*)
blanchet@36556
   127
fun metis_of_type_literals pos (TyLitVar (s, (s', _))) =
blanchet@36556
   128
    metis_lit pos s [Metis.Term.Var s']
blanchet@36556
   129
  | metis_of_type_literals pos (TyLitFree (s, (s', _))) =
blanchet@36556
   130
    metis_lit pos s [Metis.Term.Fn (s',[])]
wenzelm@23442
   131
wenzelm@32994
   132
fun default_sort _ (TVar _) = false
wenzelm@33035
   133
  | default_sort ctxt (TFree (x, s)) = (s = the_default [] (Variable.def_sort ctxt (x, ~1)));
wenzelm@23442
   134
wenzelm@32956
   135
fun metis_of_tfree tf =
blanchet@36556
   136
  Metis.Thm.axiom (Metis.LiteralSet.singleton (metis_of_type_literals true tf));
paulson@24937
   137
blanchet@37399
   138
fun hol_thm_to_fol is_conjecture ctxt mode j skolem_somes th =
blanchet@37399
   139
  let
blanchet@37399
   140
    val thy = ProofContext.theory_of ctxt
blanchet@37399
   141
    val (skolem_somes, (mlits, types_sorts)) =
blanchet@37410
   142
     th |> prop_of |> conceal_skolem_somes j skolem_somes
blanchet@37399
   143
        ||> (HOLogic.dest_Trueprop #> literals_of_hol_term thy mode)
wenzelm@32956
   144
  in
wenzelm@32956
   145
      if is_conjecture then
blanchet@36556
   146
          (Metis.Thm.axiom (Metis.LiteralSet.fromList mlits),
blanchet@37399
   147
           type_literals_for_types types_sorts, skolem_somes)
wenzelm@32956
   148
      else
blanchet@36966
   149
        let val tylits = filter_out (default_sort ctxt) types_sorts
blanchet@36966
   150
                         |> type_literals_for_types
wenzelm@32956
   151
            val mtylits = if Config.get ctxt type_lits
blanchet@36556
   152
                          then map (metis_of_type_literals false) tylits else []
wenzelm@32956
   153
        in
blanchet@37399
   154
          (Metis.Thm.axiom (Metis.LiteralSet.fromList(mtylits @ mlits)), [],
blanchet@37399
   155
           skolem_somes)
wenzelm@32956
   156
        end
wenzelm@32956
   157
  end;
wenzelm@23442
   158
wenzelm@32956
   159
(* ARITY CLAUSE *)
wenzelm@23442
   160
blanchet@35865
   161
fun m_arity_cls (TConsLit (c,t,args)) =
blanchet@35865
   162
      metis_lit true (make_type_class c) [Metis.Term.Fn(t, map Metis.Term.Var args)]
blanchet@35865
   163
  | m_arity_cls (TVarLit (c,str))     =
blanchet@35865
   164
      metis_lit false (make_type_class c) [Metis.Term.Var str];
wenzelm@23442
   165
wenzelm@32956
   166
(*TrueI is returned as the Isabelle counterpart because there isn't any.*)
blanchet@35865
   167
fun arity_cls (ArityClause {conclLit, premLits, ...}) =
wenzelm@32956
   168
  (TrueI,
wenzelm@32956
   169
   Metis.Thm.axiom (Metis.LiteralSet.fromList (map m_arity_cls (conclLit :: premLits))));
wenzelm@23442
   170
wenzelm@32956
   171
(* CLASSREL CLAUSE *)
wenzelm@23442
   172
wenzelm@32956
   173
fun m_classrel_cls subclass superclass =
wenzelm@32956
   174
  [metis_lit false subclass [Metis.Term.Var "T"], metis_lit true superclass [Metis.Term.Var "T"]];
wenzelm@23442
   175
blanchet@35865
   176
fun classrel_cls (ClassrelClause {subclass, superclass, ...}) =
wenzelm@32956
   177
  (TrueI, Metis.Thm.axiom (Metis.LiteralSet.fromList (m_classrel_cls subclass superclass)));
wenzelm@23442
   178
wenzelm@32956
   179
(* ------------------------------------------------------------------------- *)
wenzelm@32956
   180
(* FOL to HOL  (Metis to Isabelle)                                           *)
wenzelm@32956
   181
(* ------------------------------------------------------------------------- *)
wenzelm@23442
   182
wenzelm@32956
   183
datatype term_or_type = Term of Term.term | Type of Term.typ;
wenzelm@23442
   184
wenzelm@32956
   185
fun terms_of [] = []
wenzelm@32956
   186
  | terms_of (Term t :: tts) = t :: terms_of tts
wenzelm@32956
   187
  | terms_of (Type _ :: tts) = terms_of tts;
wenzelm@23442
   188
wenzelm@32956
   189
fun types_of [] = []
wenzelm@32994
   190
  | types_of (Term (Term.Var ((a,idx), _)) :: tts) =
wenzelm@32956
   191
      if String.isPrefix "_" a then
wenzelm@32956
   192
          (*Variable generated by Metis, which might have been a type variable.*)
wenzelm@32994
   193
          TVar (("'" ^ a, idx), HOLogic.typeS) :: types_of tts
wenzelm@32956
   194
      else types_of tts
wenzelm@32956
   195
  | types_of (Term _ :: tts) = types_of tts
wenzelm@32956
   196
  | types_of (Type T :: tts) = T :: types_of tts;
wenzelm@23442
   197
wenzelm@32956
   198
fun apply_list rator nargs rands =
wenzelm@32956
   199
  let val trands = terms_of rands
wenzelm@32956
   200
  in  if length trands = nargs then Term (list_comb(rator, trands))
blanchet@37402
   201
      else raise Fail
wenzelm@32956
   202
        ("apply_list: wrong number of arguments: " ^ Syntax.string_of_term_global Pure.thy rator ^
wenzelm@32956
   203
          " expected " ^ Int.toString nargs ^
wenzelm@32956
   204
          " received " ^ commas (map (Syntax.string_of_term_global Pure.thy) trands))
wenzelm@32956
   205
  end;
wenzelm@23442
   206
wenzelm@24500
   207
fun infer_types ctxt =
wenzelm@24500
   208
  Syntax.check_terms (ProofContext.set_mode ProofContext.mode_pattern ctxt);
wenzelm@25713
   209
wenzelm@32956
   210
(*We use 1 rather than 0 because variable references in clauses may otherwise conflict
wenzelm@32956
   211
  with variable constraints in the goal...at least, type inference often fails otherwise.
wenzelm@32956
   212
  SEE ALSO axiom_inf below.*)
wenzelm@32956
   213
fun mk_var (w,T) = Term.Var((w,1), T);
wenzelm@23442
   214
wenzelm@32956
   215
(*include the default sort, if available*)
wenzelm@32956
   216
fun mk_tfree ctxt w =
wenzelm@32956
   217
  let val ww = "'" ^ w
wenzelm@33035
   218
  in  TFree(ww, the_default HOLogic.typeS (Variable.def_sort ctxt (ww, ~1)))  end;
wenzelm@23442
   219
wenzelm@32956
   220
(*Remove the "apply" operator from an HO term*)
wenzelm@32956
   221
fun strip_happ args (Metis.Term.Fn(".",[t,u])) = strip_happ (u::args) t
wenzelm@32956
   222
  | strip_happ args x = (x, args);
wenzelm@23442
   223
blanchet@36967
   224
fun make_tvar s = TVar (("'" ^ s, 0), HOLogic.typeS)
blanchet@36967
   225
wenzelm@32994
   226
fun fol_type_to_isa _ (Metis.Term.Var v) =
blanchet@35865
   227
     (case strip_prefix tvar_prefix v of
blanchet@35865
   228
          SOME w => make_tvar w
blanchet@35865
   229
        | NONE   => make_tvar v)
wenzelm@32956
   230
  | fol_type_to_isa ctxt (Metis.Term.Fn(x, tys)) =
blanchet@35865
   231
     (case strip_prefix tconst_prefix x of
blanchet@37572
   232
          SOME tc => Term.Type (invert_const tc, map (fol_type_to_isa ctxt) tys)
wenzelm@32956
   233
        | NONE    =>
blanchet@35865
   234
      case strip_prefix tfree_prefix x of
wenzelm@32956
   235
          SOME tf => mk_tfree ctxt tf
blanchet@37402
   236
        | NONE    => raise Fail ("fol_type_to_isa: " ^ x));
paulson@32532
   237
blanchet@37410
   238
fun reveal_skolem_somes skolem_somes =
blanchet@37498
   239
  map_aterms (fn t as Const (s, _) =>
blanchet@37410
   240
                 if String.isPrefix skolem_theory_name s then
blanchet@37410
   241
                   AList.lookup (op =) skolem_somes s
blanchet@37410
   242
                   |> the |> map_types Type_Infer.paramify_vars
blanchet@37410
   243
                 else
blanchet@37410
   244
                   t
blanchet@37410
   245
               | t => t)
blanchet@37399
   246
wenzelm@32956
   247
(*Maps metis terms to isabelle terms*)
blanchet@37399
   248
fun hol_term_from_fol_PT ctxt fol_tm =
wenzelm@32956
   249
  let val thy = ProofContext.theory_of ctxt
blanchet@37399
   250
      val _ = trace_msg (fn () => "hol_term_from_fol_PT: " ^
blanchet@37399
   251
                                  Metis.Term.toString fol_tm)
wenzelm@32956
   252
      fun tm_to_tt (Metis.Term.Var v) =
blanchet@35865
   253
             (case strip_prefix tvar_prefix v of
blanchet@35865
   254
                  SOME w => Type (make_tvar w)
wenzelm@32956
   255
                | NONE =>
blanchet@35865
   256
              case strip_prefix schematic_var_prefix v of
wenzelm@32956
   257
                  SOME w => Term (mk_var (w, HOLogic.typeT))
wenzelm@32956
   258
                | NONE   => Term (mk_var (v, HOLogic.typeT)) )
wenzelm@32956
   259
                    (*Var from Metis with a name like _nnn; possibly a type variable*)
wenzelm@32956
   260
        | tm_to_tt (Metis.Term.Fn ("{}", [arg])) = tm_to_tt arg   (*hBOOL*)
wenzelm@32956
   261
        | tm_to_tt (t as Metis.Term.Fn (".",_)) =
wenzelm@32956
   262
            let val (rator,rands) = strip_happ [] t
wenzelm@32956
   263
            in  case rator of
wenzelm@32956
   264
                    Metis.Term.Fn(fname,ts) => applic_to_tt (fname, ts @ rands)
wenzelm@32956
   265
                  | _ => case tm_to_tt rator of
wenzelm@32956
   266
                             Term t => Term (list_comb(t, terms_of (map tm_to_tt rands)))
blanchet@37402
   267
                           | _ => raise Fail "tm_to_tt: HO application"
wenzelm@32956
   268
            end
wenzelm@32956
   269
        | tm_to_tt (Metis.Term.Fn (fname, args)) = applic_to_tt (fname,args)
wenzelm@32956
   270
      and applic_to_tt ("=",ts) =
blanchet@35865
   271
            Term (list_comb(Const (@{const_name "op ="}, HOLogic.typeT), terms_of (map tm_to_tt ts)))
wenzelm@32956
   272
        | applic_to_tt (a,ts) =
blanchet@35865
   273
            case strip_prefix const_prefix a of
wenzelm@32956
   274
                SOME b =>
blanchet@35865
   275
                  let val c = invert_const b
blanchet@36909
   276
                      val ntypes = num_type_args thy c
wenzelm@32956
   277
                      val nterms = length ts - ntypes
wenzelm@32956
   278
                      val tts = map tm_to_tt ts
wenzelm@32956
   279
                      val tys = types_of (List.take(tts,ntypes))
blanchet@36909
   280
                  in if length tys = ntypes then
wenzelm@32956
   281
                         apply_list (Const (c, dummyT)) nterms (List.drop(tts,ntypes))
blanchet@37402
   282
                     else
blanchet@37402
   283
                       raise Fail ("Constant " ^ c ^ " expects " ^ Int.toString ntypes ^
blanchet@37402
   284
                                   " but gets " ^ Int.toString (length tys) ^
blanchet@37402
   285
                                   " type arguments\n" ^
blanchet@37402
   286
                                   cat_lines (map (Syntax.string_of_typ ctxt) tys) ^
blanchet@37402
   287
                                   " the terms are \n" ^
blanchet@37402
   288
                                   cat_lines (map (Syntax.string_of_term ctxt) (terms_of tts)))
wenzelm@32956
   289
                     end
wenzelm@32956
   290
              | NONE => (*Not a constant. Is it a type constructor?*)
blanchet@35865
   291
            case strip_prefix tconst_prefix a of
wenzelm@33227
   292
                SOME b =>
blanchet@37572
   293
                  Type (Term.Type (invert_const b, types_of (map tm_to_tt ts)))
wenzelm@32956
   294
              | NONE => (*Maybe a TFree. Should then check that ts=[].*)
blanchet@35865
   295
            case strip_prefix tfree_prefix a of
wenzelm@32956
   296
                SOME b => Type (mk_tfree ctxt b)
wenzelm@32956
   297
              | NONE => (*a fixed variable? They are Skolem functions.*)
blanchet@35865
   298
            case strip_prefix fixed_var_prefix a of
wenzelm@32956
   299
                SOME b =>
wenzelm@32956
   300
                  let val opr = Term.Free(b, HOLogic.typeT)
wenzelm@32956
   301
                  in  apply_list opr (length ts) (map tm_to_tt ts)  end
blanchet@37402
   302
              | NONE => raise Fail ("unexpected metis function: " ^ a)
blanchet@37399
   303
  in
blanchet@37399
   304
    case tm_to_tt fol_tm of
blanchet@37399
   305
      Term t => t
blanchet@37402
   306
    | _ => raise Fail "fol_tm_to_tt: Term expected"
blanchet@37399
   307
  end
wenzelm@23442
   308
wenzelm@32956
   309
(*Maps fully-typed metis terms to isabelle terms*)
blanchet@37399
   310
fun hol_term_from_fol_FT ctxt fol_tm =
blanchet@37399
   311
  let val _ = trace_msg (fn () => "hol_term_from_fol_FT: " ^
blanchet@37399
   312
                                  Metis.Term.toString fol_tm)
wenzelm@32994
   313
      fun cvt (Metis.Term.Fn ("ti", [Metis.Term.Var v, _])) =
blanchet@35865
   314
             (case strip_prefix schematic_var_prefix v of
wenzelm@32956
   315
                  SOME w =>  mk_var(w, dummyT)
wenzelm@32956
   316
                | NONE   => mk_var(v, dummyT))
wenzelm@32994
   317
        | cvt (Metis.Term.Fn ("ti", [Metis.Term.Fn ("=",[]), _])) =
wenzelm@32956
   318
            Const ("op =", HOLogic.typeT)
wenzelm@32956
   319
        | cvt (Metis.Term.Fn ("ti", [Metis.Term.Fn (x,[]), ty])) =
blanchet@35865
   320
           (case strip_prefix const_prefix x of
blanchet@35865
   321
                SOME c => Const (invert_const c, dummyT)
wenzelm@32956
   322
              | NONE => (*Not a constant. Is it a fixed variable??*)
blanchet@35865
   323
            case strip_prefix fixed_var_prefix x of
wenzelm@32956
   324
                SOME v => Free (v, fol_type_to_isa ctxt ty)
blanchet@37402
   325
              | NONE => raise Fail ("hol_term_from_fol_FT bad constant: " ^ x))
wenzelm@32956
   326
        | cvt (Metis.Term.Fn ("ti", [Metis.Term.Fn (".",[tm1,tm2]), _])) =
wenzelm@32956
   327
            cvt tm1 $ cvt tm2
wenzelm@32956
   328
        | cvt (Metis.Term.Fn (".",[tm1,tm2])) = (*untyped application*)
wenzelm@32956
   329
            cvt tm1 $ cvt tm2
wenzelm@32956
   330
        | cvt (Metis.Term.Fn ("{}", [arg])) = cvt arg   (*hBOOL*)
wenzelm@32956
   331
        | cvt (Metis.Term.Fn ("=", [tm1,tm2])) =
blanchet@35865
   332
            list_comb(Const (@{const_name "op ="}, HOLogic.typeT), map cvt [tm1,tm2])
wenzelm@32956
   333
        | cvt (t as Metis.Term.Fn (x, [])) =
blanchet@35865
   334
           (case strip_prefix const_prefix x of
blanchet@35865
   335
                SOME c => Const (invert_const c, dummyT)
wenzelm@32956
   336
              | NONE => (*Not a constant. Is it a fixed variable??*)
blanchet@35865
   337
            case strip_prefix fixed_var_prefix x of
wenzelm@32956
   338
                SOME v => Free (v, dummyT)
blanchet@37399
   339
              | NONE => (trace_msg (fn () => "hol_term_from_fol_FT bad const: " ^ x);
blanchet@37399
   340
                  hol_term_from_fol_PT ctxt t))
blanchet@37399
   341
        | cvt t = (trace_msg (fn () => "hol_term_from_fol_FT bad term: " ^ Metis.Term.toString t);
blanchet@37399
   342
            hol_term_from_fol_PT ctxt t)
blanchet@37399
   343
  in fol_tm |> cvt end
paulson@32532
   344
blanchet@37399
   345
fun hol_term_from_fol FT = hol_term_from_fol_FT
blanchet@37399
   346
  | hol_term_from_fol _ = hol_term_from_fol_PT
paulson@32532
   347
blanchet@37399
   348
fun hol_terms_from_fol ctxt mode skolem_somes fol_tms =
blanchet@37498
   349
  let val ts = map (hol_term_from_fol mode ctxt) fol_tms
wenzelm@32956
   350
      val _ = trace_msg (fn () => "  calling type inference:")
wenzelm@32956
   351
      val _ = app (fn t => trace_msg (fn () => Syntax.string_of_term ctxt t)) ts
blanchet@37410
   352
      val ts' = ts |> map (reveal_skolem_somes skolem_somes) |> infer_types ctxt
wenzelm@32956
   353
      val _ = app (fn t => trace_msg
wenzelm@32956
   354
                    (fn () => "  final term: " ^ Syntax.string_of_term ctxt t ^
wenzelm@32956
   355
                              "  of type  " ^ Syntax.string_of_typ ctxt (type_of t)))
wenzelm@32956
   356
                  ts'
wenzelm@32956
   357
  in  ts'  end;
wenzelm@23442
   358
blanchet@35865
   359
fun mk_not (Const (@{const_name Not}, _) $ b) = b
wenzelm@32956
   360
  | mk_not b = HOLogic.mk_not b;
wenzelm@23442
   361
wenzelm@32956
   362
val metis_eq = Metis.Term.Fn ("=", []);
paulson@32532
   363
wenzelm@32956
   364
(* ------------------------------------------------------------------------- *)
wenzelm@32956
   365
(* FOL step Inference Rules                                                  *)
wenzelm@32956
   366
(* ------------------------------------------------------------------------- *)
wenzelm@23442
   367
wenzelm@32956
   368
(*for debugging only*)
wenzelm@32956
   369
fun print_thpair (fth,th) =
wenzelm@32956
   370
  (trace_msg (fn () => "=============================================");
wenzelm@32956
   371
   trace_msg (fn () => "Metis: " ^ Metis.Thm.toString fth);
wenzelm@32956
   372
   trace_msg (fn () => "Isabelle: " ^ Display.string_of_thm_without_context th));
wenzelm@23442
   373
wenzelm@32956
   374
fun lookth thpairs (fth : Metis.Thm.thm) =
wenzelm@33035
   375
  the (AList.lookup (uncurry Metis.Thm.equal) thpairs fth)
blanchet@37402
   376
  handle Option =>
blanchet@37402
   377
         raise Fail ("Failed to find a Metis theorem " ^ Metis.Thm.toString fth);
wenzelm@23442
   378
wenzelm@32956
   379
fun is_TrueI th = Thm.eq_thm(TrueI,th);
wenzelm@23442
   380
wenzelm@32956
   381
fun cterm_incr_types thy idx = cterm_of thy o (map_types (Logic.incr_tvar idx));
paulson@24974
   382
wenzelm@32956
   383
fun inst_excluded_middle thy i_atm =
wenzelm@32956
   384
  let val th = EXCLUDED_MIDDLE
wenzelm@32956
   385
      val [vx] = Term.add_vars (prop_of th) []
wenzelm@32956
   386
      val substs = [(cterm_of thy (Var vx), cterm_of thy i_atm)]
wenzelm@32956
   387
  in  cterm_instantiate substs th  end;
wenzelm@23442
   388
wenzelm@32956
   389
(* INFERENCE RULE: AXIOM *)
wenzelm@36945
   390
fun axiom_inf thpairs th = Thm.incr_indexes 1 (lookth thpairs th);
wenzelm@32956
   391
    (*This causes variables to have an index of 1 by default. SEE ALSO mk_var above.*)
wenzelm@23442
   392
wenzelm@32956
   393
(* INFERENCE RULE: ASSUME *)
blanchet@37399
   394
fun assume_inf ctxt mode skolem_somes atm =
wenzelm@32956
   395
  inst_excluded_middle
wenzelm@32956
   396
    (ProofContext.theory_of ctxt)
blanchet@37399
   397
    (singleton (hol_terms_from_fol ctxt mode skolem_somes) (Metis.Term.Fn atm))
wenzelm@23442
   398
wenzelm@32956
   399
(* INFERENCE RULE: INSTANTIATE (Subst). Type instantiations are ignored. Trying to reconstruct
wenzelm@32956
   400
   them admits new possibilities of errors, e.g. concerning sorts. Instead we try to arrange
wenzelm@32956
   401
   that new TVars are distinct and that types can be inferred from terms.*)
blanchet@37399
   402
fun inst_inf ctxt mode skolem_somes thpairs fsubst th =
wenzelm@32956
   403
  let val thy = ProofContext.theory_of ctxt
wenzelm@32956
   404
      val i_th   = lookth thpairs th
wenzelm@32956
   405
      val i_th_vars = Term.add_vars (prop_of i_th) []
wenzelm@33035
   406
      fun find_var x = the (List.find (fn ((a,_),_) => a=x) i_th_vars)
wenzelm@32956
   407
      fun subst_translation (x,y) =
wenzelm@32956
   408
            let val v = find_var x
blanchet@37410
   409
                (* We call "reveal_skolem_somes" and "infer_types" below. *)
blanchet@37399
   410
                val t = hol_term_from_fol mode ctxt y
wenzelm@32956
   411
            in  SOME (cterm_of thy (Var v), t)  end
wenzelm@32956
   412
            handle Option =>
wenzelm@32956
   413
                (trace_msg (fn() => "List.find failed for the variable " ^ x ^
wenzelm@32956
   414
                                       " in " ^ Display.string_of_thm ctxt i_th);
wenzelm@32956
   415
                 NONE)
wenzelm@32956
   416
      fun remove_typeinst (a, t) =
blanchet@35865
   417
            case strip_prefix schematic_var_prefix a of
wenzelm@32956
   418
                SOME b => SOME (b, t)
blanchet@35865
   419
              | NONE   => case strip_prefix tvar_prefix a of
wenzelm@32956
   420
                SOME _ => NONE          (*type instantiations are forbidden!*)
wenzelm@32956
   421
              | NONE   => SOME (a,t)    (*internal Metis var?*)
wenzelm@32956
   422
      val _ = trace_msg (fn () => "  isa th: " ^ Display.string_of_thm ctxt i_th)
wenzelm@32956
   423
      val substs = map_filter remove_typeinst (Metis.Subst.toList fsubst)
wenzelm@32956
   424
      val (vars,rawtms) = ListPair.unzip (map_filter subst_translation substs)
blanchet@37410
   425
      val tms = rawtms |> map (reveal_skolem_somes skolem_somes)
blanchet@37399
   426
                       |> infer_types ctxt
wenzelm@32956
   427
      val ctm_of = cterm_incr_types thy (1 + Thm.maxidx_of i_th)
wenzelm@32956
   428
      val substs' = ListPair.zip (vars, map ctm_of tms)
wenzelm@32956
   429
      val _ = trace_msg (fn () =>
wenzelm@32956
   430
        cat_lines ("subst_translations:" ::
wenzelm@32956
   431
          (substs' |> map (fn (x, y) =>
wenzelm@32956
   432
            Syntax.string_of_term ctxt (term_of x) ^ " |-> " ^
wenzelm@32956
   433
            Syntax.string_of_term ctxt (term_of y)))));
blanchet@37399
   434
  in cterm_instantiate substs' i_th end
blanchet@37516
   435
  handle THM (msg, _, _) => raise METIS ("inst_inf", msg)
blanchet@37516
   436
       | ERROR msg => raise METIS ("inst_inf", msg)
wenzelm@23442
   437
wenzelm@32956
   438
(* INFERENCE RULE: RESOLVE *)
wenzelm@25713
   439
wenzelm@32956
   440
(*Like RSN, but we rename apart only the type variables. Vars here typically have an index
wenzelm@32956
   441
  of 1, and the use of RSN would increase this typically to 3. Instantiations of those Vars
wenzelm@32956
   442
  could then fail. See comment on mk_var.*)
wenzelm@32956
   443
fun resolve_inc_tyvars(tha,i,thb) =
blanchet@37548
   444
  let
blanchet@37548
   445
      val tha = Drule.incr_type_indexes (1 + Thm.maxidx_of thb) tha
wenzelm@32956
   446
      val ths = Seq.list_of (Thm.bicompose false (false,tha,nprems_of tha) i thb)
wenzelm@32956
   447
  in
wenzelm@32956
   448
      case distinct Thm.eq_thm ths of
wenzelm@32956
   449
        [th] => th
wenzelm@32956
   450
      | _ => raise THM ("resolve_inc_tyvars: unique result expected", i, [tha,thb])
blanchet@37548
   451
  end
blanchet@37548
   452
  handle TERM (msg, _) => raise METIS ("resolve_inc_tyvars", msg)
wenzelm@23442
   453
blanchet@37399
   454
fun resolve_inf ctxt mode skolem_somes thpairs atm th1 th2 =
wenzelm@32956
   455
  let
wenzelm@32956
   456
    val i_th1 = lookth thpairs th1 and i_th2 = lookth thpairs th2
wenzelm@32956
   457
    val _ = trace_msg (fn () => "  isa th1 (pos): " ^ Display.string_of_thm ctxt i_th1)
wenzelm@32956
   458
    val _ = trace_msg (fn () => "  isa th2 (neg): " ^ Display.string_of_thm ctxt i_th2)
wenzelm@32956
   459
  in
wenzelm@32956
   460
    if is_TrueI i_th1 then i_th2 (*Trivial cases where one operand is type info*)
wenzelm@32956
   461
    else if is_TrueI i_th2 then i_th1
wenzelm@32956
   462
    else
wenzelm@32956
   463
      let
blanchet@37399
   464
        val i_atm = singleton (hol_terms_from_fol ctxt mode skolem_somes)
blanchet@37399
   465
                              (Metis.Term.Fn atm)
wenzelm@32956
   466
        val _ = trace_msg (fn () => "  atom: " ^ Syntax.string_of_term ctxt i_atm)
wenzelm@32956
   467
        val prems_th1 = prems_of i_th1
wenzelm@32956
   468
        val prems_th2 = prems_of i_th2
wenzelm@32956
   469
        val index_th1 = get_index (mk_not i_atm) prems_th1
blanchet@37402
   470
              handle Empty => raise Fail "Failed to find literal in th1"
wenzelm@32956
   471
        val _ = trace_msg (fn () => "  index_th1: " ^ Int.toString index_th1)
wenzelm@32956
   472
        val index_th2 = get_index i_atm prems_th2
blanchet@37402
   473
              handle Empty => raise Fail "Failed to find literal in th2"
wenzelm@32956
   474
        val _ = trace_msg (fn () => "  index_th2: " ^ Int.toString index_th2)
wenzelm@32956
   475
    in  resolve_inc_tyvars (Meson.select_literal index_th1 i_th1, index_th2, i_th2)  end
wenzelm@32956
   476
  end;
wenzelm@23442
   477
wenzelm@32956
   478
(* INFERENCE RULE: REFL *)
wenzelm@32956
   479
val refl_x = cterm_of @{theory} (Var (hd (Term.add_vars (prop_of REFL_THM) [])));
wenzelm@32956
   480
val refl_idx = 1 + Thm.maxidx_of REFL_THM;
wenzelm@25713
   481
blanchet@37399
   482
fun refl_inf ctxt mode skolem_somes t =
wenzelm@32956
   483
  let val thy = ProofContext.theory_of ctxt
blanchet@37399
   484
      val i_t = singleton (hol_terms_from_fol ctxt mode skolem_somes) t
wenzelm@32956
   485
      val _ = trace_msg (fn () => "  term: " ^ Syntax.string_of_term ctxt i_t)
wenzelm@32956
   486
      val c_t = cterm_incr_types thy refl_idx i_t
wenzelm@32956
   487
  in  cterm_instantiate [(refl_x, c_t)] REFL_THM  end;
wenzelm@23442
   488
blanchet@35865
   489
fun get_ty_arg_size _ (Const (@{const_name "op ="}, _)) = 0  (*equality has no type arguments*)
blanchet@36909
   490
  | get_ty_arg_size thy (Const (c, _)) = (num_type_args thy c handle TYPE _ => 0)
wenzelm@32994
   491
  | get_ty_arg_size _ _ = 0;
wenzelm@23442
   492
wenzelm@32956
   493
(* INFERENCE RULE: EQUALITY *)
blanchet@37399
   494
fun equality_inf ctxt mode skolem_somes (pos, atm) fp fr =
wenzelm@32956
   495
  let val thy = ProofContext.theory_of ctxt
wenzelm@32956
   496
      val m_tm = Metis.Term.Fn atm
blanchet@37399
   497
      val [i_atm,i_tm] = hol_terms_from_fol ctxt mode skolem_somes [m_tm, fr]
wenzelm@32956
   498
      val _ = trace_msg (fn () => "sign of the literal: " ^ Bool.toString pos)
wenzelm@32994
   499
      fun replace_item_list lx 0 (_::ls) = lx::ls
wenzelm@32956
   500
        | replace_item_list lx i (l::ls) = l :: replace_item_list lx (i-1) ls
wenzelm@32956
   501
      fun path_finder_FO tm [] = (tm, Term.Bound 0)
wenzelm@32956
   502
        | path_finder_FO tm (p::ps) =
blanchet@35865
   503
            let val (tm1,args) = strip_comb tm
wenzelm@32956
   504
                val adjustment = get_ty_arg_size thy tm1
wenzelm@32956
   505
                val p' = if adjustment > p then p else p-adjustment
wenzelm@32956
   506
                val tm_p = List.nth(args,p')
blanchet@37516
   507
                  handle Subscript => raise METIS ("equality_inf", Int.toString p ^ " adj " ^
wenzelm@32956
   508
                    Int.toString adjustment  ^ " term " ^  Syntax.string_of_term ctxt tm)
wenzelm@32956
   509
                val _ = trace_msg (fn () => "path_finder: " ^ Int.toString p ^
wenzelm@32956
   510
                                      "  " ^ Syntax.string_of_term ctxt tm_p)
wenzelm@32956
   511
                val (r,t) = path_finder_FO tm_p ps
wenzelm@32956
   512
            in
wenzelm@32956
   513
                (r, list_comb (tm1, replace_item_list t p' args))
wenzelm@32956
   514
            end
wenzelm@32956
   515
      fun path_finder_HO tm [] = (tm, Term.Bound 0)
wenzelm@32956
   516
        | path_finder_HO (t$u) (0::ps) = (fn(x,y) => (x, y$u)) (path_finder_HO t ps)
wenzelm@32994
   517
        | path_finder_HO (t$u) (_::ps) = (fn(x,y) => (x, t$y)) (path_finder_HO u ps)
blanchet@37402
   518
        | path_finder_HO tm ps =
blanchet@37402
   519
          raise Fail ("equality_inf, path_finder_HO: path = " ^
blanchet@37402
   520
                      space_implode " " (map Int.toString ps) ^
blanchet@37402
   521
                      " isa-term: " ^  Syntax.string_of_term ctxt tm)
wenzelm@32956
   522
      fun path_finder_FT tm [] _ = (tm, Term.Bound 0)
wenzelm@32994
   523
        | path_finder_FT tm (0::ps) (Metis.Term.Fn ("ti", [t1, _])) =
wenzelm@32956
   524
            path_finder_FT tm ps t1
wenzelm@32994
   525
        | path_finder_FT (t$u) (0::ps) (Metis.Term.Fn (".", [t1, _])) =
wenzelm@32956
   526
            (fn(x,y) => (x, y$u)) (path_finder_FT t ps t1)
wenzelm@32994
   527
        | path_finder_FT (t$u) (1::ps) (Metis.Term.Fn (".", [_, t2])) =
wenzelm@32956
   528
            (fn(x,y) => (x, t$y)) (path_finder_FT u ps t2)
blanchet@37402
   529
        | path_finder_FT tm ps t =
blanchet@37402
   530
          raise Fail ("equality_inf, path_finder_FT: path = " ^
blanchet@37402
   531
                      space_implode " " (map Int.toString ps) ^
blanchet@37402
   532
                      " isa-term: " ^  Syntax.string_of_term ctxt tm ^
blanchet@37402
   533
                      " fol-term: " ^ Metis.Term.toString t)
wenzelm@32956
   534
      fun path_finder FO tm ps _ = path_finder_FO tm ps
blanchet@35865
   535
        | path_finder HO (tm as Const(@{const_name "op ="},_) $ _ $ _) (p::ps) _ =
wenzelm@32956
   536
             (*equality: not curried, as other predicates are*)
wenzelm@32956
   537
             if p=0 then path_finder_HO tm (0::1::ps)  (*select first operand*)
wenzelm@32956
   538
             else path_finder_HO tm (p::ps)        (*1 selects second operand*)
wenzelm@32994
   539
        | path_finder HO tm (_ :: ps) (Metis.Term.Fn ("{}", [_])) =
wenzelm@32956
   540
             path_finder_HO tm ps      (*if not equality, ignore head to skip hBOOL*)
blanchet@35865
   541
        | path_finder FT (tm as Const(@{const_name "op ="}, _) $ _ $ _) (p::ps)
wenzelm@32956
   542
                            (Metis.Term.Fn ("=", [t1,t2])) =
wenzelm@32956
   543
             (*equality: not curried, as other predicates are*)
wenzelm@32956
   544
             if p=0 then path_finder_FT tm (0::1::ps)
wenzelm@32956
   545
                          (Metis.Term.Fn (".", [Metis.Term.Fn (".", [metis_eq,t1]), t2]))
wenzelm@32956
   546
                          (*select first operand*)
wenzelm@32956
   547
             else path_finder_FT tm (p::ps)
wenzelm@32956
   548
                   (Metis.Term.Fn (".", [metis_eq,t2]))
wenzelm@32956
   549
                   (*1 selects second operand*)
wenzelm@32994
   550
        | path_finder FT tm (_ :: ps) (Metis.Term.Fn ("{}", [t1])) = path_finder_FT tm ps t1
wenzelm@32956
   551
             (*if not equality, ignore head to skip the hBOOL predicate*)
wenzelm@32956
   552
        | path_finder FT tm ps t = path_finder_FT tm ps t  (*really an error case!*)
blanchet@35865
   553
      fun path_finder_lit ((nt as Const (@{const_name Not}, _)) $ tm_a) idx =
wenzelm@32956
   554
            let val (tm, tm_rslt) = path_finder mode tm_a idx m_tm
wenzelm@32956
   555
            in (tm, nt $ tm_rslt) end
wenzelm@32956
   556
        | path_finder_lit tm_a idx = path_finder mode tm_a idx m_tm
wenzelm@32956
   557
      val (tm_subst, body) = path_finder_lit i_atm fp
wenzelm@32956
   558
      val tm_abs = Term.Abs("x", Term.type_of tm_subst, body)
wenzelm@32956
   559
      val _ = trace_msg (fn () => "abstraction: " ^ Syntax.string_of_term ctxt tm_abs)
wenzelm@32956
   560
      val _ = trace_msg (fn () => "i_tm: " ^ Syntax.string_of_term ctxt i_tm)
wenzelm@32956
   561
      val _ = trace_msg (fn () => "located term: " ^ Syntax.string_of_term ctxt tm_subst)
wenzelm@32956
   562
      val imax = maxidx_of_term (i_tm $ tm_abs $ tm_subst)  (*ill typed but gives right max*)
wenzelm@36945
   563
      val subst' = Thm.incr_indexes (imax+1) (if pos then subst_em else ssubst_em)
wenzelm@32956
   564
      val _ = trace_msg (fn () => "subst' " ^ Display.string_of_thm ctxt subst')
wenzelm@32956
   565
      val eq_terms = map (pairself (cterm_of thy))
wenzelm@33227
   566
        (ListPair.zip (OldTerm.term_vars (prop_of subst'), [tm_abs, tm_subst, i_tm]))
wenzelm@32956
   567
  in  cterm_instantiate eq_terms subst'  end;
wenzelm@23442
   568
wenzelm@32956
   569
val factor = Seq.hd o distinct_subgoals_tac;
paulson@28528
   570
blanchet@37399
   571
fun step ctxt mode skolem_somes thpairs p =
blanchet@37399
   572
  case p of
blanchet@37399
   573
    (fol_th, Metis.Proof.Axiom _) => factor (axiom_inf thpairs fol_th)
blanchet@37399
   574
  | (_, Metis.Proof.Assume f_atm) => assume_inf ctxt mode skolem_somes f_atm
blanchet@37399
   575
  | (_, Metis.Proof.Subst (f_subst, f_th1)) =>
blanchet@37399
   576
    factor (inst_inf ctxt mode skolem_somes thpairs f_subst f_th1)
blanchet@37399
   577
  | (_, Metis.Proof.Resolve(f_atm, f_th1, f_th2)) =>
blanchet@37399
   578
    factor (resolve_inf ctxt mode skolem_somes thpairs f_atm f_th1 f_th2)
blanchet@37399
   579
  | (_, Metis.Proof.Refl f_tm) => refl_inf ctxt mode skolem_somes f_tm
blanchet@37399
   580
  | (_, Metis.Proof.Equality (f_lit, f_p, f_r)) =>
blanchet@37399
   581
    equality_inf ctxt mode skolem_somes f_lit f_p f_r
wenzelm@23442
   582
blanchet@35865
   583
fun real_literal (_, (c, _)) = not (String.isPrefix class_prefix c);
wenzelm@23442
   584
blanchet@37402
   585
(* FIXME: use "fold" instead *)
blanchet@37399
   586
fun translate _ _ _ thpairs [] = thpairs
blanchet@37399
   587
  | translate ctxt mode skolem_somes thpairs ((fol_th, inf) :: infpairs) =
wenzelm@32956
   588
      let val _ = trace_msg (fn () => "=============================================")
wenzelm@32956
   589
          val _ = trace_msg (fn () => "METIS THM: " ^ Metis.Thm.toString fol_th)
wenzelm@32956
   590
          val _ = trace_msg (fn () => "INFERENCE: " ^ Metis.Proof.inferenceToString inf)
blanchet@37399
   591
          val th = Meson.flexflex_first_order (step ctxt mode skolem_somes
blanchet@37399
   592
                                                    thpairs (fol_th, inf))
wenzelm@32956
   593
          val _ = trace_msg (fn () => "ISABELLE THM: " ^ Display.string_of_thm ctxt th)
wenzelm@32956
   594
          val _ = trace_msg (fn () => "=============================================")
wenzelm@32994
   595
          val n_metis_lits =
wenzelm@32994
   596
            length (filter real_literal (Metis.LiteralSet.toList (Metis.Thm.clause fol_th)))
wenzelm@32956
   597
      in
wenzelm@32956
   598
          if nprems_of th = n_metis_lits then ()
blanchet@37516
   599
          else raise METIS ("translate", "Proof reconstruction has gone wrong.");
blanchet@37399
   600
          translate ctxt mode skolem_somes ((fol_th, th) :: thpairs) infpairs
wenzelm@32956
   601
      end;
wenzelm@23442
   602
wenzelm@32956
   603
(*Determining which axiom clauses are actually used*)
wenzelm@32956
   604
fun used_axioms axioms (th, Metis.Proof.Axiom _) = SOME (lookth axioms th)
wenzelm@32994
   605
  | used_axioms _ _ = NONE;
paulson@24855
   606
wenzelm@32956
   607
(* ------------------------------------------------------------------------- *)
wenzelm@32956
   608
(* Translation of HO Clauses                                                 *)
wenzelm@32956
   609
(* ------------------------------------------------------------------------- *)
wenzelm@23442
   610
blanchet@37479
   611
fun cnf_helper_theorem thy raw th =
blanchet@37479
   612
  if raw then th else the_single (cnf_axiom thy th)
wenzelm@23442
   613
wenzelm@32956
   614
fun type_ext thy tms =
blanchet@35865
   615
  let val subs = tfree_classes_of_terms tms
blanchet@35865
   616
      val supers = tvar_classes_of_terms tms
blanchet@35865
   617
      and tycons = type_consts_of_terms thy tms
blanchet@35865
   618
      val (supers', arity_clauses) = make_arity_clauses thy tycons supers
blanchet@35865
   619
      val classrel_clauses = make_classrel_clauses thy subs supers'
wenzelm@32956
   620
  in  map classrel_cls classrel_clauses @ map arity_cls arity_clauses
wenzelm@32956
   621
  end;
wenzelm@23442
   622
wenzelm@32956
   623
(* ------------------------------------------------------------------------- *)
wenzelm@32956
   624
(* Logic maps manage the interface between HOL and first-order logic.        *)
wenzelm@32956
   625
(* ------------------------------------------------------------------------- *)
wenzelm@23442
   626
wenzelm@32956
   627
type logic_map =
blanchet@35865
   628
  {axioms: (Metis.Thm.thm * thm) list,
blanchet@37399
   629
   tfrees: type_literal list,
blanchet@37410
   630
   skolem_somes: (string * term) list}
wenzelm@23442
   631
wenzelm@32994
   632
fun const_in_metis c (pred, tm_list) =
wenzelm@32956
   633
  let
wenzelm@32994
   634
    fun in_mterm (Metis.Term.Var _) = false
wenzelm@32956
   635
      | in_mterm (Metis.Term.Fn (".", tm_list)) = exists in_mterm tm_list
wenzelm@32956
   636
      | in_mterm (Metis.Term.Fn (nm, tm_list)) = c=nm orelse exists in_mterm tm_list
wenzelm@32994
   637
  in  c = pred orelse exists in_mterm tm_list  end;
wenzelm@23442
   638
wenzelm@32956
   639
(*Extract TFree constraints from context to include as conjecture clauses*)
wenzelm@32956
   640
fun init_tfrees ctxt =
blanchet@36966
   641
  let fun add ((a,i),s) Ts = if i = ~1 then TFree(a,s) :: Ts else Ts in
blanchet@36966
   642
    Vartab.fold add (#2 (Variable.constraints_of ctxt)) []
blanchet@36966
   643
    |> type_literals_for_types
blanchet@36556
   644
  end;
paulson@24937
   645
wenzelm@32956
   646
(*transform isabelle type / arity clause to metis clause *)
wenzelm@32956
   647
fun add_type_thm [] lmap = lmap
blanchet@37399
   648
  | add_type_thm ((ith, mth) :: cls) {axioms, tfrees, skolem_somes} =
blanchet@37399
   649
      add_type_thm cls {axioms = (mth, ith) :: axioms, tfrees = tfrees,
blanchet@37399
   650
                        skolem_somes = skolem_somes}
wenzelm@23442
   651
wenzelm@32956
   652
(*Insert non-logical axioms corresponding to all accumulated TFrees*)
blanchet@37399
   653
fun add_tfrees {axioms, tfrees, skolem_somes} : logic_map =
blanchet@37399
   654
     {axioms = map (rpair TrueI o metis_of_tfree) (distinct (op =) tfrees) @
blanchet@37399
   655
               axioms,
blanchet@37399
   656
      tfrees = tfrees, skolem_somes = skolem_somes}
wenzelm@25713
   657
wenzelm@32956
   658
fun string_of_mode FO = "FO"
wenzelm@32956
   659
  | string_of_mode HO = "HO"
wenzelm@32956
   660
  | string_of_mode FT = "FT"
paulson@32532
   661
blanchet@37479
   662
val helpers =
blanchet@37479
   663
  [("c_COMBI", (false, @{thms COMBI_def})),
blanchet@37479
   664
   ("c_COMBK", (false, @{thms COMBK_def})),
blanchet@37479
   665
   ("c_COMBB", (false, @{thms COMBB_def})),
blanchet@37479
   666
   ("c_COMBC", (false, @{thms COMBC_def})),
blanchet@37479
   667
   ("c_COMBS", (false, @{thms COMBS_def})),
blanchet@37479
   668
   ("c_fequal", (false, @{thms fequal_imp_equal equal_imp_fequal})),
blanchet@37479
   669
   ("c_True", (true, @{thms True_or_False})),
blanchet@37479
   670
   ("c_False", (true, @{thms True_or_False})),
blanchet@37479
   671
   ("c_If", (true, @{thms if_True if_False True_or_False}))]
blanchet@37479
   672
blanchet@37623
   673
fun is_quasi_fol_clause thy =
blanchet@37623
   674
  Meson.is_fol_term thy o snd o conceal_skolem_somes ~1 [] o prop_of
blanchet@37623
   675
wenzelm@32956
   676
(* Function to generate metis clauses, including comb and type clauses *)
wenzelm@32956
   677
fun build_map mode0 ctxt cls ths =
wenzelm@32956
   678
  let val thy = ProofContext.theory_of ctxt
wenzelm@32956
   679
      (*The modes FO and FT are sticky. HO can be downgraded to FO.*)
wenzelm@32956
   680
      fun set_mode FO = FO
blanchet@37399
   681
        | set_mode HO =
blanchet@37623
   682
          if forall (is_quasi_fol_clause thy) (cls @ ths) then FO else HO
wenzelm@32956
   683
        | set_mode FT = FT
wenzelm@32956
   684
      val mode = set_mode mode0
wenzelm@32956
   685
      (*transform isabelle clause to metis clause *)
blanchet@37399
   686
      fun add_thm is_conjecture ith {axioms, tfrees, skolem_somes} : logic_map =
blanchet@37399
   687
        let
blanchet@37399
   688
          val (mth, tfree_lits, skolem_somes) =
blanchet@37399
   689
            hol_thm_to_fol is_conjecture ctxt mode (length axioms) skolem_somes
blanchet@37399
   690
                           ith
wenzelm@32956
   691
        in
wenzelm@32956
   692
           {axioms = (mth, Meson.make_meta_clause ith) :: axioms,
blanchet@37399
   693
            tfrees = union (op =) tfree_lits tfrees,
blanchet@37399
   694
            skolem_somes = skolem_somes}
wenzelm@32956
   695
        end;
blanchet@37498
   696
      val lmap = {axioms = [], tfrees = init_tfrees ctxt, skolem_somes = []}
blanchet@37498
   697
                 |> fold (add_thm true) cls
blanchet@37498
   698
                 |> add_tfrees
blanchet@37498
   699
                 |> fold (add_thm false) ths
wenzelm@32956
   700
      val clause_lists = map (Metis.Thm.clause o #1) (#axioms lmap)
blanchet@37479
   701
      fun is_used c =
blanchet@37479
   702
        exists (Metis.LiteralSet.exists (const_in_metis c o #2)) clause_lists
blanchet@37399
   703
      val lmap =
blanchet@37479
   704
        if mode = FO then
blanchet@37479
   705
          lmap
blanchet@37479
   706
        else
blanchet@37479
   707
          let
blanchet@37479
   708
            val helper_ths =
blanchet@37479
   709
              helpers |> filter (is_used o fst)
blanchet@37479
   710
                      |> maps (fn (_, (raw, thms)) =>
blanchet@37479
   711
                                  if mode = FT orelse not raw then
blanchet@37479
   712
                                    map (cnf_helper_theorem @{theory} raw) thms
blanchet@37479
   713
                                  else
blanchet@37479
   714
                                    [])
blanchet@37479
   715
          in lmap |> fold (add_thm false) helper_ths end
blanchet@37410
   716
  in (mode, add_type_thm (type_ext thy (map prop_of (cls @ ths))) lmap) end
wenzelm@23442
   717
wenzelm@32956
   718
fun refute cls =
wenzelm@32956
   719
    Metis.Resolution.loop (Metis.Resolution.new Metis.Resolution.default cls);
wenzelm@23442
   720
wenzelm@32956
   721
fun is_false t = t aconv (HOLogic.mk_Trueprop HOLogic.false_const);
wenzelm@23442
   722
wenzelm@32956
   723
fun common_thm ths1 ths2 = exists (member Thm.eq_thm ths1) (map Meson.make_meta_clause ths2);
paulson@24855
   724
blanchet@37573
   725
blanchet@37516
   726
(* Main function to start Metis proof and reconstruction *)
wenzelm@32956
   727
fun FOL_SOLVE mode ctxt cls ths0 =
wenzelm@32956
   728
  let val thy = ProofContext.theory_of ctxt
blanchet@35826
   729
      val th_cls_pairs =
blanchet@35865
   730
        map (fn th => (Thm.get_name_hint th, cnf_axiom thy th)) ths0
wenzelm@32956
   731
      val ths = maps #2 th_cls_pairs
wenzelm@32956
   732
      val _ = trace_msg (fn () => "FOL_SOLVE: CONJECTURE CLAUSES")
wenzelm@32956
   733
      val _ = app (fn th => trace_msg (fn () => Display.string_of_thm ctxt th)) cls
wenzelm@32956
   734
      val _ = trace_msg (fn () => "THEOREM CLAUSES")
wenzelm@32956
   735
      val _ = app (fn th => trace_msg (fn () => Display.string_of_thm ctxt th)) ths
blanchet@37399
   736
      val (mode, {axioms, tfrees, skolem_somes}) = build_map mode ctxt cls ths
wenzelm@32956
   737
      val _ = if null tfrees then ()
wenzelm@32956
   738
              else (trace_msg (fn () => "TFREE CLAUSES");
blanchet@37573
   739
                    app (fn TyLitFree (s, (s', _)) =>
blanchet@37573
   740
                            trace_msg (fn _ => s ^ "(" ^ s' ^ ")")) tfrees)
wenzelm@32956
   741
      val _ = trace_msg (fn () => "CLAUSES GIVEN TO METIS")
wenzelm@32956
   742
      val thms = map #1 axioms
wenzelm@32956
   743
      val _ = app (fn th => trace_msg (fn () => Metis.Thm.toString th)) thms
wenzelm@32956
   744
      val _ = trace_msg (fn () => "mode = " ^ string_of_mode mode)
wenzelm@32956
   745
      val _ = trace_msg (fn () => "START METIS PROVE PROCESS")
wenzelm@32956
   746
  in
wenzelm@33317
   747
      case filter (is_false o prop_of) cls of
wenzelm@32956
   748
          false_th::_ => [false_th RS @{thm FalseE}]
wenzelm@32956
   749
        | [] =>
wenzelm@32956
   750
      case refute thms of
wenzelm@32956
   751
          Metis.Resolution.Contradiction mth =>
wenzelm@32956
   752
            let val _ = trace_msg (fn () => "METIS RECONSTRUCTION START: " ^
wenzelm@32956
   753
                          Metis.Thm.toString mth)
wenzelm@32956
   754
                val ctxt' = fold Variable.declare_constraints (map prop_of cls) ctxt
wenzelm@32956
   755
                             (*add constraints arising from converting goal to clause form*)
wenzelm@32956
   756
                val proof = Metis.Proof.proof mth
blanchet@37399
   757
                val result = translate ctxt' mode skolem_somes axioms proof
wenzelm@32956
   758
                and used = map_filter (used_axioms axioms) proof
wenzelm@32956
   759
                val _ = trace_msg (fn () => "METIS COMPLETED...clauses actually used:")
wenzelm@32956
   760
                val _ = app (fn th => trace_msg (fn () => Display.string_of_thm ctxt th)) used
wenzelm@33305
   761
                val unused = th_cls_pairs |> map_filter (fn (name, cls) =>
wenzelm@33305
   762
                  if common_thm used cls then NONE else SOME name)
wenzelm@32956
   763
            in
blanchet@36383
   764
                if not (null cls) andalso not (common_thm used cls) then
blanchet@36383
   765
                  warning "Metis: The assumptions are inconsistent."
blanchet@36383
   766
                else
blanchet@36383
   767
                  ();
blanchet@36383
   768
                if not (null unused) then
blanchet@36230
   769
                  warning ("Metis: Unused theorems: " ^ commas_quote unused
blanchet@36230
   770
                           ^ ".")
blanchet@36230
   771
                else
blanchet@36230
   772
                  ();
wenzelm@32956
   773
                case result of
wenzelm@32956
   774
                    (_,ith)::_ =>
blanchet@36230
   775
                        (trace_msg (fn () => "Success: " ^ Display.string_of_thm ctxt ith);
wenzelm@32956
   776
                         [ith])
blanchet@36230
   777
                  | _ => (trace_msg (fn () => "Metis: No result");
blanchet@37516
   778
                          raise METIS ("FOL_SOLVE", ""))
wenzelm@32956
   779
            end
wenzelm@32956
   780
        | Metis.Resolution.Satisfiable _ =>
wenzelm@32956
   781
            (trace_msg (fn () => "Metis: No first-order proof with the lemmas supplied");
blanchet@37516
   782
             raise METIS ("FOL_SOLVE", ""))
wenzelm@32956
   783
  end;
wenzelm@23442
   784
blanchet@37516
   785
fun generic_metis_tac mode ctxt ths i st0 =
wenzelm@32956
   786
  let val _ = trace_msg (fn () =>
wenzelm@32956
   787
        "Metis called with theorems " ^ cat_lines (map (Display.string_of_thm ctxt) ths))
wenzelm@32956
   788
  in
blanchet@37516
   789
    if exists_type type_has_topsort (prop_of st0) then
blanchet@37516
   790
      (warning ("Metis: Proof state contains the universal sort {}"); Seq.empty)
wenzelm@35568
   791
    else
blanchet@36401
   792
      (Meson.MESON (maps neg_clausify)
blanchet@37516
   793
                   (fn cls => resolve_tac (FOL_SOLVE mode ctxt cls ths) 1)
blanchet@37619
   794
                   ctxt i) st0
blanchet@37516
   795
     handle ERROR msg => raise METIS ("generic_metis_tac", msg)
wenzelm@32956
   796
  end
blanchet@37516
   797
  handle METIS (loc, msg) =>
blanchet@37516
   798
         if mode = HO then
blanchet@37516
   799
           (warning ("Metis: Falling back on \"metisFT\".");
blanchet@37516
   800
            generic_metis_tac FT ctxt ths i st0)
blanchet@37516
   801
         else if msg = "" then
blanchet@37516
   802
           Seq.empty
blanchet@37516
   803
         else
blanchet@37516
   804
           raise error ("Metis (" ^ loc ^ "): " ^ msg)
wenzelm@23442
   805
blanchet@37516
   806
val metis_tac = generic_metis_tac HO
blanchet@37516
   807
val metisF_tac = generic_metis_tac FO
blanchet@37516
   808
val metisFT_tac = generic_metis_tac FT
wenzelm@23442
   809
blanchet@37516
   810
fun method name mode =
blanchet@37516
   811
  Method.setup name (Attrib.thms >> (fn ths => fn ctxt =>
blanchet@37516
   812
    SIMPLE_METHOD' (CHANGED_PROP o generic_metis_tac mode ctxt ths)))
wenzelm@23442
   813
wenzelm@32956
   814
val setup =
blanchet@37516
   815
  type_lits_setup
blanchet@37516
   816
  #> method @{binding metis} HO "Metis for FOL/HOL problems"
blanchet@37516
   817
  #> method @{binding metisF} FO "Metis for FOL problems"
blanchet@37516
   818
  #> method @{binding metisFT} FT
blanchet@37516
   819
            "Metis for FOL/HOL problems with fully-typed translation"
wenzelm@23442
   820
wenzelm@23442
   821
end;