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