src/HOL/Tools/Sledgehammer/sledgehammer_hol_clause.ML
author blanchet
Tue Jun 15 16:42:09 2010 +0200 (2010-06-15 ago)
changeset 37436 2d76997730a6
parent 37414 d0cea0796295
child 37479 f6b1ee5b420b
permissions -rw-r--r--
found missing beta-eta-contraction
blanchet@36375
     1
(*  Title:      HOL/Tools/Sledgehammer/sledgehammer_hol_clause.ML
wenzelm@33311
     2
    Author:     Jia Meng, NICTA
blanchet@36375
     3
    Author:     Jasmin Blanchette, TU Muenchen
mengj@17998
     4
wenzelm@24311
     5
FOL clauses translated from HOL formulae.
mengj@17998
     6
*)
mengj@17998
     7
blanchet@35826
     8
signature SLEDGEHAMMER_HOL_CLAUSE =
wenzelm@24311
     9
sig
blanchet@36170
    10
  type name = Sledgehammer_FOL_Clause.name
blanchet@36393
    11
  type name_pool = Sledgehammer_FOL_Clause.name_pool
blanchet@35865
    12
  type kind = Sledgehammer_FOL_Clause.kind
blanchet@35865
    13
  type fol_type = Sledgehammer_FOL_Clause.fol_type
blanchet@35865
    14
  type classrel_clause = Sledgehammer_FOL_Clause.classrel_clause
blanchet@35865
    15
  type arity_clause = Sledgehammer_FOL_Clause.arity_clause
wenzelm@24311
    16
  type axiom_name = string
wenzelm@24311
    17
  type polarity = bool
blanchet@35865
    18
  type hol_clause_id = int
blanchet@35865
    19
wenzelm@24311
    20
  datatype combterm =
blanchet@36170
    21
    CombConst of name * fol_type * fol_type list (* Const and Free *) |
blanchet@36170
    22
    CombVar of name * fol_type |
blanchet@35865
    23
    CombApp of combterm * combterm
wenzelm@24311
    24
  datatype literal = Literal of polarity * combterm
blanchet@35865
    25
  datatype hol_clause =
blanchet@35865
    26
    HOLClause of {clause_id: hol_clause_id, axiom_name: axiom_name, th: thm,
blanchet@35865
    27
                  kind: kind, literals: literal list, ctypes_sorts: typ list}
blanchet@35865
    28
blanchet@35865
    29
  val type_of_combterm : combterm -> fol_type
blanchet@35865
    30
  val strip_combterm_comb : combterm -> combterm * combterm list
blanchet@35865
    31
  val literals_of_term : theory -> term -> literal list * typ list
blanchet@37410
    32
  val conceal_skolem_somes :
blanchet@37410
    33
    int -> (string * term) list -> term -> (string * term) list * term
blanchet@35865
    34
  exception TRIVIAL
blanchet@35865
    35
  val make_conjecture_clauses : bool -> theory -> thm list -> hol_clause list
blanchet@35865
    36
  val make_axiom_clauses : bool -> theory ->
blanchet@35865
    37
       (thm * (axiom_name * hol_clause_id)) list -> (axiom_name * hol_clause) list
blanchet@36909
    38
  val type_wrapper_name : string
blanchet@37399
    39
  val get_helper_clauses :
blanchet@37399
    40
    bool -> theory -> bool -> hol_clause list
blanchet@37399
    41
      -> (thm * (axiom_name * hol_clause_id)) list -> hol_clause list
blanchet@36235
    42
  val write_tptp_file : bool -> bool -> bool -> Path.T ->
blanchet@35865
    43
    hol_clause list * hol_clause list * hol_clause list * hol_clause list *
blanchet@36402
    44
    classrel_clause list * arity_clause list -> name_pool option * int
blanchet@36235
    45
  val write_dfg_file : bool -> bool -> Path.T ->
blanchet@35865
    46
    hol_clause list * hol_clause list * hol_clause list * hol_clause list *
blanchet@36402
    47
    classrel_clause list * arity_clause list -> name_pool option * int
wenzelm@24311
    48
end
mengj@17998
    49
blanchet@35826
    50
structure Sledgehammer_HOL_Clause : SLEDGEHAMMER_HOL_CLAUSE =
mengj@17998
    51
struct
mengj@17998
    52
blanchet@36167
    53
open Sledgehammer_Util
blanchet@35865
    54
open Sledgehammer_FOL_Clause
blanchet@35865
    55
open Sledgehammer_Fact_Preprocessor
paulson@22825
    56
wenzelm@33035
    57
fun min_arity_of const_min_arity c = the_default 0 (Symtab.lookup const_min_arity c);
paulson@22064
    58
paulson@22825
    59
(*True if the constant ever appears outside of the top-level position in literals.
paulson@22825
    60
  If false, the constant always receives all of its arguments and is used as a predicate.*)
blanchet@36235
    61
fun needs_hBOOL explicit_apply const_needs_hBOOL c =
blanchet@36235
    62
  explicit_apply orelse
wenzelm@33035
    63
    the_default false (Symtab.lookup const_needs_hBOOL c);
paulson@22064
    64
mengj@19198
    65
mengj@17998
    66
(******************************************************)
mengj@17998
    67
(* data types for typed combinator expressions        *)
mengj@17998
    68
(******************************************************)
mengj@17998
    69
mengj@17998
    70
type axiom_name = string;
mengj@17998
    71
type polarity = bool;
blanchet@35865
    72
type hol_clause_id = int;
mengj@17998
    73
blanchet@35865
    74
datatype combterm =
blanchet@36170
    75
  CombConst of name * fol_type * fol_type list (* Const and Free *) |
blanchet@36170
    76
  CombVar of name * fol_type |
blanchet@35865
    77
  CombApp of combterm * combterm
wenzelm@24311
    78
mengj@17998
    79
datatype literal = Literal of polarity * combterm;
mengj@17998
    80
blanchet@35865
    81
datatype hol_clause =
blanchet@35865
    82
  HOLClause of {clause_id: hol_clause_id, axiom_name: axiom_name, th: thm,
blanchet@35865
    83
                kind: kind, literals: literal list, ctypes_sorts: typ list};
mengj@17998
    84
mengj@17998
    85
mengj@17998
    86
(*********************************************************************)
mengj@17998
    87
(* convert a clause with type Term.term to a clause with type clause *)
mengj@17998
    88
(*********************************************************************)
mengj@17998
    89
blanchet@36170
    90
fun isFalse (Literal (pol, CombConst ((c, _), _, _))) =
blanchet@35865
    91
      (pol andalso c = "c_False") orelse (not pol andalso c = "c_True")
mengj@17998
    92
  | isFalse _ = false;
mengj@17998
    93
blanchet@36170
    94
fun isTrue (Literal (pol, CombConst ((c, _), _, _))) =
mengj@17998
    95
      (pol andalso c = "c_True") orelse
mengj@17998
    96
      (not pol andalso c = "c_False")
mengj@17998
    97
  | isTrue _ = false;
wenzelm@24311
    98
blanchet@35865
    99
fun isTaut (HOLClause {literals,...}) = exists isTrue literals;
mengj@17998
   100
immler@30151
   101
fun type_of dfg (Type (a, Ts)) =
blanchet@36169
   102
    let val (folTypes,ts) = types_of dfg Ts in
blanchet@36169
   103
      (TyConstr (`(make_fixed_type_const dfg) a, folTypes), ts)
blanchet@36169
   104
    end
blanchet@36169
   105
  | type_of _ (tp as TFree (a, _)) = (TyFree (`make_fixed_type_var a), [tp])
blanchet@36169
   106
  | type_of _ (tp as TVar (x, _)) =
blanchet@36169
   107
    (TyVar (make_schematic_type_var x, string_of_indexname x), [tp])
immler@30151
   108
and types_of dfg Ts =
immler@30151
   109
      let val (folTyps,ts) = ListPair.unzip (map (type_of dfg) Ts)
blanchet@35865
   110
      in  (folTyps, union_all ts)  end;
mengj@17998
   111
mengj@17998
   112
(* same as above, but no gathering of sort information *)
immler@30151
   113
fun simp_type_of dfg (Type (a, Ts)) =
blanchet@36169
   114
      TyConstr (`(make_fixed_type_const dfg) a, map (simp_type_of dfg) Ts)
blanchet@36169
   115
  | simp_type_of _ (TFree (a, _)) = TyFree (`make_fixed_type_var a)
blanchet@36169
   116
  | simp_type_of _ (TVar (x, _)) =
blanchet@36169
   117
    TyVar (make_schematic_type_var x, string_of_indexname x);
mengj@18440
   118
mengj@18356
   119
mengj@17998
   120
(* convert a Term.term (with combinators) into a combterm, also accummulate sort info *)
blanchet@37399
   121
fun combterm_of dfg thy (Const (c, T)) =
blanchet@37399
   122
      let
blanchet@37399
   123
        val (tp, ts) = type_of dfg T
blanchet@37399
   124
        val tvar_list =
blanchet@37410
   125
          (if String.isPrefix skolem_theory_name c then
blanchet@37399
   126
             [] |> Term.add_tvarsT T |> map TVar
blanchet@37399
   127
           else
blanchet@37399
   128
             (c, T) |> Sign.const_typargs thy)
blanchet@37399
   129
          |> map (simp_type_of dfg)
blanchet@37399
   130
        val c' = CombConst (`(make_fixed_const dfg) c, tp, tvar_list)
paulson@22078
   131
      in  (c',ts)  end
blanchet@37399
   132
  | combterm_of dfg _ (Free(v, T)) =
blanchet@37399
   133
      let val (tp,ts) = type_of dfg T
blanchet@36170
   134
          val v' = CombConst (`make_fixed_var v, tp, [])
paulson@22078
   135
      in  (v',ts)  end
blanchet@37399
   136
  | combterm_of dfg _ (Var(v, T)) =
blanchet@37399
   137
      let val (tp,ts) = type_of dfg T
blanchet@36170
   138
          val v' = CombVar ((make_schematic_var v, string_of_indexname v), tp)
paulson@22078
   139
      in  (v',ts)  end
immler@30151
   140
  | combterm_of dfg thy (P $ Q) =
immler@30151
   141
      let val (P',tsP) = combterm_of dfg thy P
immler@30151
   142
          val (Q',tsQ) = combterm_of dfg thy Q
haftmann@33042
   143
      in  (CombApp(P',Q'), union (op =) tsP tsQ)  end
blanchet@37399
   144
  | combterm_of _ _ (t as Abs _) = raise CLAUSE ("HOL clause", t);
mengj@17998
   145
blanchet@35865
   146
fun predicate_of dfg thy ((@{const Not} $ P), polarity) = predicate_of dfg thy (P, not polarity)
immler@30151
   147
  | predicate_of dfg thy (t,polarity) = (combterm_of dfg thy (Envir.eta_contract t), polarity);
mengj@17998
   148
blanchet@35865
   149
fun literals_of_term1 dfg thy args (@{const Trueprop} $ P) = literals_of_term1 dfg thy args P
blanchet@35865
   150
  | literals_of_term1 dfg thy args (@{const "op |"} $ P $ Q) =
immler@30151
   151
      literals_of_term1 dfg thy (literals_of_term1 dfg thy args P) Q
immler@30151
   152
  | literals_of_term1 dfg thy (lits,ts) P =
immler@30151
   153
      let val ((pred,ts'),pol) = predicate_of dfg thy (P,true)
paulson@21509
   154
      in
haftmann@33042
   155
          (Literal(pol,pred)::lits, union (op =) ts ts')
paulson@21509
   156
      end;
mengj@17998
   157
immler@30151
   158
fun literals_of_term_dfg dfg thy P = literals_of_term1 dfg thy ([],[]) P;
immler@30151
   159
val literals_of_term = literals_of_term_dfg false;
mengj@17998
   160
blanchet@37399
   161
fun skolem_name i j num_T_args =
blanchet@37399
   162
  skolem_prefix ^ (space_implode "_" (map Int.toString [i, j, num_T_args])) ^
blanchet@37399
   163
  skolem_infix ^ "g"
blanchet@37399
   164
blanchet@37410
   165
fun conceal_skolem_somes i skolem_somes t =
blanchet@37410
   166
  if exists_Const (curry (op =) @{const_name skolem_id} o fst) t then
blanchet@37399
   167
    let
blanchet@37399
   168
      fun aux skolem_somes
blanchet@37410
   169
              (t as (Const (@{const_name skolem_id}, Type (_, [_, T])) $ _)) =
blanchet@37399
   170
          let
blanchet@37399
   171
            val (skolem_somes, s) =
blanchet@37399
   172
              if i = ~1 then
blanchet@37399
   173
                (skolem_somes, @{const_name undefined})
blanchet@37410
   174
              else case AList.find (op aconv) skolem_somes t of
blanchet@37399
   175
                s :: _ => (skolem_somes, s)
blanchet@37436
   176
              | [] =>
blanchet@37399
   177
                let
blanchet@37410
   178
                  val s = skolem_theory_name ^ "." ^
blanchet@37399
   179
                          skolem_name i (length skolem_somes)
blanchet@37399
   180
                                        (length (Term.add_tvarsT T []))
blanchet@37410
   181
                in ((s, t) :: skolem_somes, s) end
blanchet@37410
   182
          in (skolem_somes, Const (s, T)) end
blanchet@37399
   183
        | aux skolem_somes (t1 $ t2) =
blanchet@37399
   184
          let
blanchet@37399
   185
            val (skolem_somes, t1) = aux skolem_somes t1
blanchet@37399
   186
            val (skolem_somes, t2) = aux skolem_somes t2
blanchet@37399
   187
          in (skolem_somes, t1 $ t2) end
blanchet@37399
   188
        | aux skolem_somes (Abs (s, T, t')) =
blanchet@37399
   189
          let val (skolem_somes, t') = aux skolem_somes t' in
blanchet@37399
   190
            (skolem_somes, Abs (s, T, t'))
blanchet@37399
   191
          end
blanchet@37399
   192
        | aux skolem_somes t = (skolem_somes, t)
blanchet@37399
   193
    in aux skolem_somes t end
blanchet@37399
   194
  else
blanchet@37399
   195
    (skolem_somes, t)
blanchet@37399
   196
blanchet@35865
   197
(* Trivial problem, which resolution cannot handle (empty clause) *)
blanchet@35865
   198
exception TRIVIAL;
wenzelm@28835
   199
mengj@17998
   200
(* making axiom and conjecture clauses *)
blanchet@37399
   201
fun make_clause dfg thy (clause_id, axiom_name, kind, th) skolem_somes =
blanchet@37399
   202
  let
blanchet@37399
   203
    val (skolem_somes, t) =
blanchet@37410
   204
      th |> prop_of |> conceal_skolem_somes clause_id skolem_somes
blanchet@37399
   205
    val (lits, ctypes_sorts) = literals_of_term_dfg dfg thy t
blanchet@37399
   206
  in
blanchet@37399
   207
    if forall isFalse lits then
blanchet@37399
   208
      raise TRIVIAL
blanchet@37399
   209
    else
blanchet@37399
   210
      (skolem_somes,
blanchet@37399
   211
       HOLClause {clause_id = clause_id, axiom_name = axiom_name, th = th,
blanchet@37399
   212
                  kind = kind, literals = lits, ctypes_sorts = ctypes_sorts})
blanchet@36218
   213
  end
mengj@19354
   214
blanchet@37399
   215
fun add_axiom_clause dfg thy (th, (name, id)) (skolem_somes, clss) =
blanchet@37399
   216
  let
blanchet@37399
   217
    val (skolem_somes, cls) =
blanchet@37399
   218
      make_clause dfg thy (id, name, Axiom, th) skolem_somes
blanchet@37399
   219
  in (skolem_somes, clss |> not (isTaut cls) ? cons (name, cls)) end
blanchet@37399
   220
blanchet@36218
   221
fun make_axiom_clauses dfg thy clauses =
blanchet@37399
   222
  ([], []) |> fold (add_axiom_clause dfg thy) clauses |> snd
mengj@19354
   223
blanchet@37399
   224
fun make_conjecture_clauses dfg thy =
blanchet@37399
   225
  let
blanchet@37399
   226
    fun aux _ _ [] = []
blanchet@37399
   227
      | aux n skolem_somes (th :: ths) =
blanchet@37399
   228
        let
blanchet@37399
   229
          val (skolem_somes, cls) =
blanchet@37399
   230
            make_clause dfg thy (n, "conjecture", Conjecture, th) skolem_somes
blanchet@37399
   231
        in cls :: aux (n + 1) skolem_somes ths end
blanchet@37399
   232
  in aux 0 [] end
mengj@17998
   233
mengj@17998
   234
(**********************************************************************)
mengj@17998
   235
(* convert clause into ATP specific formats:                          *)
mengj@17998
   236
(* TPTP used by Vampire and E                                         *)
mengj@19720
   237
(* DFG used by SPASS                                                  *)
mengj@17998
   238
(**********************************************************************)
mengj@17998
   239
paulson@22078
   240
(*Result of a function type; no need to check that the argument type matches.*)
blanchet@36909
   241
fun result_type (TyConstr (_, [_, tp2])) = tp2
blanchet@36909
   242
  | result_type _ = raise Fail "non-function type"
paulson@22078
   243
wenzelm@32994
   244
fun type_of_combterm (CombConst (_, tp, _)) = tp
wenzelm@32994
   245
  | type_of_combterm (CombVar (_, tp)) = tp
wenzelm@32994
   246
  | type_of_combterm (CombApp (t1, _)) = result_type (type_of_combterm t1);
mengj@17998
   247
paulson@22064
   248
(*gets the head of a combinator application, along with the list of arguments*)
blanchet@35865
   249
fun strip_combterm_comb u =
paulson@22078
   250
    let fun stripc (CombApp(t,u), ts) = stripc (t, u::ts)
paulson@22064
   251
        |   stripc  x =  x
paulson@22064
   252
    in  stripc(u,[])  end;
paulson@22064
   253
blanchet@36909
   254
val type_wrapper_name = "ti"
paulson@22851
   255
blanchet@36235
   256
fun head_needs_hBOOL explicit_apply const_needs_hBOOL
blanchet@36235
   257
                     (CombConst ((c, _), _, _)) =
blanchet@36235
   258
    needs_hBOOL explicit_apply const_needs_hBOOL c
blanchet@36235
   259
  | head_needs_hBOOL _ _ _ = true
paulson@22851
   260
blanchet@36170
   261
fun wrap_type full_types (s, ty) pool =
blanchet@36170
   262
  if full_types then
blanchet@36170
   263
    let val (s', pool) = string_of_fol_type ty pool in
blanchet@36909
   264
      (type_wrapper_name ^ paren_pack [s, s'], pool)
blanchet@36170
   265
    end
blanchet@36170
   266
  else
blanchet@36170
   267
    (s, pool)
blanchet@36170
   268
blanchet@36235
   269
fun wrap_type_if full_types explicit_apply cnh (head, s, tp) =
blanchet@36235
   270
  if head_needs_hBOOL explicit_apply cnh head then
blanchet@36235
   271
    wrap_type full_types (s, tp)
blanchet@36235
   272
  else
blanchet@36235
   273
    pair s
wenzelm@24311
   274
blanchet@35865
   275
fun apply ss = "hAPP" ^ paren_pack ss;
paulson@22851
   276
paulson@22064
   277
fun rev_apply (v, []) = v
paulson@22851
   278
  | rev_apply (v, arg::args) = apply [rev_apply (v, args), arg];
paulson@22064
   279
paulson@22064
   280
fun string_apply (v, args) = rev_apply (v, rev args);
paulson@22064
   281
blanchet@36170
   282
(* Apply an operator to the argument strings, using either the "apply" operator
blanchet@36170
   283
   or direct function application. *)
blanchet@36170
   284
fun string_of_application full_types cma (CombConst ((s, s'), _, tvars), args)
blanchet@36170
   285
                          pool =
blanchet@36170
   286
    let
blanchet@36170
   287
      val s = if s = "equal" then "c_fequal" else s
blanchet@36170
   288
      val nargs = min_arity_of cma s
blanchet@36170
   289
      val args1 = List.take (args, nargs)
blanchet@36170
   290
        handle Subscript =>
blanchet@36170
   291
               raise Fail (quote s ^ " has arity " ^ Int.toString nargs ^
blanchet@36170
   292
                           " but is applied to " ^ commas (map quote args))
blanchet@36170
   293
      val args2 = List.drop (args, nargs)
blanchet@36170
   294
      val (targs, pool) = if full_types then ([], pool)
blanchet@36170
   295
                          else pool_map string_of_fol_type tvars pool
blanchet@36170
   296
      val (s, pool) = nice_name (s, s') pool
blanchet@36170
   297
    in (string_apply (s ^ paren_pack (args1 @ targs), args2), pool) end
blanchet@36170
   298
  | string_of_application _ _ (CombVar (name, _), args) pool =
blanchet@36170
   299
    nice_name name pool |>> (fn s => string_apply (s, args))
wenzelm@24311
   300
blanchet@36235
   301
fun string_of_combterm (params as (full_types, explicit_apply, cma, cnh)) t
blanchet@36235
   302
                       pool =
blanchet@36170
   303
  let
blanchet@36170
   304
    val (head, args) = strip_combterm_comb t
blanchet@36170
   305
    val (ss, pool) = pool_map (string_of_combterm params) args pool
blanchet@36170
   306
    val (s, pool) = string_of_application full_types cma (head, ss) pool
blanchet@36235
   307
  in
blanchet@36235
   308
    wrap_type_if full_types explicit_apply cnh (head, s, type_of_combterm t)
blanchet@36235
   309
                 pool
blanchet@36235
   310
  end
mengj@18356
   311
paulson@22064
   312
(*Boolean-valued terms are here converted to literals.*)
blanchet@36170
   313
fun boolify params c =
blanchet@36170
   314
  string_of_combterm params c #>> prefix "hBOOL" o paren_pack o single
paulson@22064
   315
blanchet@36235
   316
fun string_of_predicate (params as (_, explicit_apply, _, cnh)) t =
paulson@22064
   317
  case t of
blanchet@36170
   318
    (CombApp (CombApp (CombConst (("equal", _), _, _), t1), t2)) =>
blanchet@36170
   319
    (* DFG only: new TPTP prefers infix equality *)
blanchet@36170
   320
    pool_map (string_of_combterm params) [t1, t2]
blanchet@36170
   321
    #>> prefix "equal" o paren_pack
blanchet@36170
   322
  | _ =>
blanchet@36170
   323
    case #1 (strip_combterm_comb t) of
blanchet@36170
   324
      CombConst ((s, _), _, _) =>
blanchet@36235
   325
      (if needs_hBOOL explicit_apply cnh s then boolify else string_of_combterm)
blanchet@36235
   326
          params t
blanchet@36170
   327
    | _ => boolify params t
mengj@18356
   328
mengj@17998
   329
blanchet@36170
   330
(*** TPTP format ***)
mengj@19720
   331
blanchet@36170
   332
fun tptp_of_equality params pos (t1, t2) =
blanchet@36170
   333
  pool_map (string_of_combterm params) [t1, t2]
blanchet@36170
   334
  #>> space_implode (if pos then " = " else " != ")
wenzelm@24311
   335
blanchet@36170
   336
fun tptp_literal params
blanchet@36170
   337
        (Literal (pos, CombApp (CombApp (CombConst (("equal", _), _, _), t1),
blanchet@36170
   338
                                         t2))) =
blanchet@36170
   339
    tptp_of_equality params pos (t1, t2)
blanchet@36170
   340
  | tptp_literal params (Literal (pos, pred)) =
blanchet@36170
   341
    string_of_predicate params pred #>> tptp_sign pos
blanchet@36170
   342
 
blanchet@36170
   343
(* Given a clause, returns its literals paired with a list of literals
blanchet@36170
   344
   concerning TFrees; the latter should only occur in conjecture clauses. *)
blanchet@36556
   345
fun tptp_type_literals params pos (HOLClause {literals, ctypes_sorts, ...})
blanchet@36556
   346
                       pool =
blanchet@36556
   347
  let
blanchet@36556
   348
    val (lits, pool) = pool_map (tptp_literal params) literals pool
blanchet@36556
   349
    val (tylits, pool) = pool_map (tptp_of_type_literal pos)
blanchet@36966
   350
                                  (type_literals_for_types ctypes_sorts) pool
blanchet@36556
   351
  in ((lits, tylits), pool) end
wenzelm@24311
   352
blanchet@36170
   353
fun tptp_clause params (cls as HOLClause {axiom_name, clause_id, kind, ...})
blanchet@36170
   354
                pool =
blanchet@36170
   355
let
blanchet@36170
   356
    val ((lits, tylits), pool) =
blanchet@36170
   357
      tptp_type_literals params (kind = Conjecture) cls pool
paulson@24937
   358
  in
blanchet@36170
   359
    ((gen_tptp_cls (clause_id, axiom_name, kind, lits, tylits), tylits), pool)
blanchet@36170
   360
  end
mengj@17998
   361
mengj@17998
   362
blanchet@36170
   363
(*** DFG format ***)
paulson@21561
   364
blanchet@36170
   365
fun dfg_literal params (Literal (pos, pred)) =
blanchet@36170
   366
  string_of_predicate params pred #>> dfg_sign pos
mengj@19720
   367
blanchet@36170
   368
fun dfg_type_literals params pos (HOLClause {literals, ctypes_sorts, ...}) =
blanchet@36170
   369
  pool_map (dfg_literal params) literals
blanchet@36966
   370
  #>> rpair (map (dfg_of_type_literal pos)
blanchet@36966
   371
                 (type_literals_for_types ctypes_sorts))
mengj@19720
   372
blanchet@36170
   373
fun get_uvars (CombConst _) vars pool = (vars, pool)
blanchet@36170
   374
  | get_uvars (CombVar (name, _)) vars pool =
blanchet@36170
   375
    nice_name name pool |>> (fn var => var :: vars)
blanchet@36170
   376
  | get_uvars (CombApp (P, Q)) vars pool =
blanchet@36170
   377
    let val (vars, pool) = get_uvars P vars pool in get_uvars Q vars pool end
mengj@19720
   378
blanchet@36170
   379
fun get_uvars_l (Literal (_, c)) = get_uvars c [];
mengj@19720
   380
blanchet@36170
   381
fun dfg_vars (HOLClause {literals, ...}) =
blanchet@36170
   382
  pool_map get_uvars_l literals #>> union_all
wenzelm@24311
   383
blanchet@36170
   384
fun dfg_clause params (cls as HOLClause {axiom_name, clause_id, kind,
blanchet@36170
   385
                                         ctypes_sorts, ...}) pool =
blanchet@36170
   386
  let
blanchet@36170
   387
    val ((lits, tylits), pool) =
blanchet@36170
   388
      dfg_type_literals params (kind = Conjecture) cls pool
blanchet@36170
   389
    val (vars, pool) = dfg_vars cls pool
blanchet@36170
   390
    val tvars = get_tvar_strs ctypes_sorts
paulson@24937
   391
  in
blanchet@36170
   392
    ((gen_dfg_cls (clause_id, axiom_name, kind, lits, tylits, tvars @ vars),
blanchet@36170
   393
      tylits), pool)
blanchet@36170
   394
  end
paulson@24937
   395
mengj@19720
   396
paulson@22064
   397
(** For DFG format: accumulate function and predicate declarations **)
mengj@19720
   398
blanchet@36218
   399
fun add_types tvars = fold add_fol_type_funcs tvars
mengj@19720
   400
blanchet@36235
   401
fun add_decls (full_types, explicit_apply, cma, cnh)
blanchet@36565
   402
              (CombConst ((c, _), ctp, tvars)) (funcs, preds) =
blanchet@36565
   403
      (if c = "equal" then
blanchet@36565
   404
         (add_types tvars funcs, preds)
blanchet@36565
   405
       else
blanchet@36565
   406
         let val arity = min_arity_of cma c
blanchet@36565
   407
             val ntys = if not full_types then length tvars else 0
blanchet@36565
   408
             val addit = Symtab.update(c, arity + ntys)
blanchet@36565
   409
         in
blanchet@36565
   410
             if needs_hBOOL explicit_apply cnh c then
blanchet@36565
   411
               (add_types tvars (addit funcs), preds)
blanchet@36565
   412
             else
blanchet@36565
   413
               (add_types tvars funcs, addit preds)
blanchet@36565
   414
         end) |>> full_types ? add_fol_type_funcs ctp
blanchet@36218
   415
  | add_decls _ (CombVar (_, ctp)) (funcs, preds) =
blanchet@36218
   416
      (add_fol_type_funcs ctp funcs, preds)
blanchet@36218
   417
  | add_decls params (CombApp (P, Q)) decls =
blanchet@36218
   418
      decls |> add_decls params P |> add_decls params Q
mengj@19720
   419
blanchet@36218
   420
fun add_literal_decls params (Literal (_, c)) = add_decls params c
mengj@19720
   421
blanchet@36218
   422
fun add_clause_decls params (HOLClause {literals, ...}) decls =
blanchet@36218
   423
    fold (add_literal_decls params) literals decls
wenzelm@27187
   424
    handle Symtab.DUP a => error ("function " ^ a ^ " has multiple arities")
mengj@19720
   425
blanchet@37414
   426
fun decls_of_clauses (params as (full_types, explicit_apply, _, _)) clauses
blanchet@37414
   427
                     arity_clauses =
blanchet@37414
   428
  let
blanchet@37414
   429
    val functab =
blanchet@37414
   430
      init_functab
blanchet@37414
   431
      |> fold Symtab.update [(type_wrapper_name, 2), ("hAPP", 2),
blanchet@37414
   432
                             ("tc_bool", 0)]
blanchet@36218
   433
      val predtab = Symtab.empty |> Symtab.update ("hBOOL", 1)
blanchet@36218
   434
      val (functab, predtab) =
blanchet@36218
   435
        (functab, predtab) |> fold (add_clause_decls params) clauses
blanchet@36218
   436
                           |>> fold add_arity_clause_funcs arity_clauses
blanchet@36218
   437
  in (Symtab.dest functab, Symtab.dest predtab) end
mengj@19720
   438
blanchet@36218
   439
fun add_clause_preds (HOLClause {ctypes_sorts, ...}) preds =
blanchet@36218
   440
  fold add_type_sort_preds ctypes_sorts preds
wenzelm@27187
   441
  handle Symtab.DUP a => error ("predicate " ^ a ^ " has multiple arities")
paulson@21398
   442
paulson@21398
   443
(*Higher-order clauses have only the predicates hBOOL and type classes.*)
wenzelm@24311
   444
fun preds_of_clauses clauses clsrel_clauses arity_clauses =
blanchet@36218
   445
  Symtab.empty
blanchet@36218
   446
  |> fold add_clause_preds clauses
blanchet@36218
   447
  |> fold add_arity_clause_preds arity_clauses
blanchet@36218
   448
  |> fold add_classrel_clause_preds clsrel_clauses
blanchet@36218
   449
  |> Symtab.dest
mengj@18440
   450
mengj@18440
   451
(**********************************************************************)
mengj@19198
   452
(* write clauses to files                                             *)
mengj@19198
   453
(**********************************************************************)
mengj@19198
   454
paulson@21573
   455
val init_counters =
blanchet@35865
   456
  Symtab.make [("c_COMBI", 0), ("c_COMBK", 0), ("c_COMBB", 0), ("c_COMBC", 0),
blanchet@35865
   457
               ("c_COMBS", 0)];
wenzelm@24311
   458
blanchet@36218
   459
fun count_combterm (CombConst ((c, _), _, _)) =
blanchet@36218
   460
    Symtab.map_entry c (Integer.add 1)
blanchet@36218
   461
  | count_combterm (CombVar _) = I
blanchet@36218
   462
  | count_combterm (CombApp (t1, t2)) = count_combterm t1 #> count_combterm t2
paulson@21573
   463
blanchet@36218
   464
fun count_literal (Literal (_, t)) = count_combterm t
paulson@21573
   465
blanchet@36218
   466
fun count_clause (HOLClause {literals, ...}) = fold count_literal literals
paulson@21573
   467
blanchet@36228
   468
fun cnf_helper_thms thy = cnf_rules_pairs thy o map (`Thm.get_name_hint)
mengj@20644
   469
blanchet@37399
   470
fun get_helper_clauses dfg thy isFO conjectures axcls =
blanchet@35865
   471
  if isFO then
blanchet@35865
   472
    []
paulson@23386
   473
  else
immler@31752
   474
    let
blanchet@37399
   475
        val axclauses = map snd (make_axiom_clauses dfg thy axcls)
blanchet@37399
   476
        val ct = init_counters
blanchet@37399
   477
                 |> fold (fold count_clause) [conjectures, axclauses]
wenzelm@33035
   478
        fun needed c = the (Symtab.lookup ct c) > 0
wenzelm@24311
   479
        val IK = if needed "c_COMBI" orelse needed "c_COMBK"
blanchet@35865
   480
                 then cnf_helper_thms thy [@{thm COMBI_def}, @{thm COMBK_def}]
wenzelm@24311
   481
                 else []
wenzelm@24311
   482
        val BC = if needed "c_COMBB" orelse needed "c_COMBC"
blanchet@35865
   483
                 then cnf_helper_thms thy [@{thm COMBB_def}, @{thm COMBC_def}]
paulson@21135
   484
                 else []
blanchet@35865
   485
        val S = if needed "c_COMBS" then cnf_helper_thms thy [@{thm COMBS_def}]
wenzelm@24311
   486
                else []
blanchet@35865
   487
        val other = cnf_helper_thms thy [@{thm fequal_imp_equal},
blanchet@35865
   488
                                         @{thm equal_imp_fequal}]
blanchet@37399
   489
    in map snd (make_axiom_clauses dfg thy (other @ IK @ BC @ S)) end
mengj@20791
   490
paulson@22064
   491
(*Find the minimal arity of each function mentioned in the term. Also, note which uses
paulson@22064
   492
  are not at top level, to see if hBOOL is needed.*)
immler@30150
   493
fun count_constants_term toplev t (const_min_arity, const_needs_hBOOL) =
blanchet@35865
   494
  let val (head, args) = strip_combterm_comb t
paulson@22064
   495
      val n = length args
blanchet@36233
   496
      val (const_min_arity, const_needs_hBOOL) =
blanchet@36233
   497
        (const_min_arity, const_needs_hBOOL)
blanchet@36233
   498
        |> fold (count_constants_term false) args
paulson@22064
   499
  in
paulson@22064
   500
      case head of
blanchet@36170
   501
          CombConst ((a, _),_,_) => (*predicate or function version of "equal"?*)
wenzelm@24311
   502
            let val a = if a="equal" andalso not toplev then "c_fequal" else a
wenzelm@24311
   503
            in
blanchet@36233
   504
              (const_min_arity |> Symtab.map_default (a, n) (Integer.min n),
blanchet@36233
   505
               const_needs_hBOOL |> not toplev ? Symtab.update (a, true))
wenzelm@24311
   506
            end
wenzelm@32994
   507
        | _ => (const_min_arity, const_needs_hBOOL)
paulson@22064
   508
  end;
paulson@22064
   509
paulson@22064
   510
(*A literal is a top-level term*)
immler@30150
   511
fun count_constants_lit (Literal (_,t)) (const_min_arity, const_needs_hBOOL) =
immler@30150
   512
  count_constants_term true t (const_min_arity, const_needs_hBOOL);
paulson@22064
   513
blanchet@35865
   514
fun count_constants_clause (HOLClause {literals, ...})
blanchet@35865
   515
                           (const_min_arity, const_needs_hBOOL) =
immler@30150
   516
  fold count_constants_lit literals (const_min_arity, const_needs_hBOOL);
paulson@22064
   517
blanchet@36235
   518
fun display_arity explicit_apply const_needs_hBOOL (c,n) =
blanchet@35865
   519
  trace_msg (fn () => "Constant: " ^ c ^
blanchet@35826
   520
                " arity:\t" ^ Int.toString n ^
blanchet@36235
   521
                (if needs_hBOOL explicit_apply const_needs_hBOOL c then
blanchet@36235
   522
                   " needs hBOOL"
blanchet@36235
   523
                 else
blanchet@36235
   524
                   ""))
paulson@22064
   525
blanchet@36235
   526
fun count_constants explicit_apply
blanchet@36235
   527
                    (conjectures, _, extra_clauses, helper_clauses, _, _) =
blanchet@36235
   528
  if not explicit_apply then
immler@30150
   529
     let val (const_min_arity, const_needs_hBOOL) =
immler@30150
   530
          fold count_constants_clause conjectures (Symtab.empty, Symtab.empty)
immler@31865
   531
       |> fold count_constants_clause extra_clauses
immler@30149
   532
       |> fold count_constants_clause helper_clauses
blanchet@36481
   533
     val _ = app (display_arity explicit_apply const_needs_hBOOL)
blanchet@36481
   534
                 (Symtab.dest (const_min_arity))
immler@30150
   535
     in (const_min_arity, const_needs_hBOOL) end
immler@30150
   536
  else (Symtab.empty, Symtab.empty);
paulson@22064
   537
blanchet@36218
   538
fun header () =
blanchet@36218
   539
  "% This file was generated by Isabelle (most likely Sledgehammer)\n" ^
blanchet@36218
   540
  "% " ^ timestamp () ^ "\n"
blanchet@36218
   541
blanchet@35865
   542
(* TPTP format *)
immler@31749
   543
blanchet@36235
   544
fun write_tptp_file readable_names full_types explicit_apply file clauses =
immler@31409
   545
  let
blanchet@36167
   546
    fun section _ [] = []
blanchet@36393
   547
      | section name ss =
blanchet@36393
   548
        "\n% " ^ name ^ plural_s (length ss) ^ " (" ^ Int.toString (length ss) ^
blanchet@36393
   549
        ")\n" :: ss
blanchet@36222
   550
    val pool = empty_name_pool readable_names
immler@31865
   551
    val (conjectures, axclauses, _, helper_clauses,
immler@31865
   552
      classrel_clauses, arity_clauses) = clauses
blanchet@36235
   553
    val (cma, cnh) = count_constants explicit_apply clauses
blanchet@36235
   554
    val params = (full_types, explicit_apply, cma, cnh)
blanchet@36170
   555
    val ((conjecture_clss, tfree_litss), pool) =
blanchet@36170
   556
      pool_map (tptp_clause params) conjectures pool |>> ListPair.unzip
blanchet@36218
   557
    val tfree_clss = map tptp_tfree_clause (fold (union (op =)) tfree_litss [])
blanchet@36170
   558
    val (ax_clss, pool) = pool_map (apfst fst oo tptp_clause params) axclauses
blanchet@36170
   559
                                   pool
blanchet@36170
   560
    val classrel_clss = map tptp_classrel_clause classrel_clauses
blanchet@36170
   561
    val arity_clss = map tptp_arity_clause arity_clauses
blanchet@36170
   562
    val (helper_clss, pool) = pool_map (apfst fst oo tptp_clause params)
blanchet@36170
   563
                                       helper_clauses pool
blanchet@36402
   564
    val conjecture_offset =
blanchet@36402
   565
      length ax_clss + length classrel_clss + length arity_clss
blanchet@36402
   566
      + length helper_clss
blanchet@36393
   567
    val _ =
blanchet@36393
   568
      File.write_list file
blanchet@36393
   569
          (header () ::
blanchet@36393
   570
           section "Relevant fact" ax_clss @
blanchet@36402
   571
           section "Class relationship" classrel_clss @
blanchet@36402
   572
           section "Arity declaration" arity_clss @
blanchet@36393
   573
           section "Helper fact" helper_clss @
blanchet@36393
   574
           section "Conjecture" conjecture_clss @
blanchet@36402
   575
           section "Type variable" tfree_clss)
blanchet@36402
   576
  in (pool, conjecture_offset) end
mengj@19720
   577
blanchet@35865
   578
(* DFG format *)
mengj@19720
   579
blanchet@36966
   580
fun dfg_tfree_predicate s = (first_field "(" s |> the |> fst, 1)
blanchet@36966
   581
blanchet@36235
   582
fun write_dfg_file full_types explicit_apply file clauses =
immler@31409
   583
  let
blanchet@36219
   584
    (* Some of the helper functions below are not name-pool-aware. However,
blanchet@36219
   585
       there's no point in adding name pool support if the DFG format is on its
blanchet@36219
   586
       way out anyway. *)
blanchet@36219
   587
    val pool = NONE
immler@31865
   588
    val (conjectures, axclauses, _, helper_clauses,
immler@31865
   589
      classrel_clauses, arity_clauses) = clauses
blanchet@36235
   590
    val (cma, cnh) = count_constants explicit_apply clauses
blanchet@36235
   591
    val params = (full_types, explicit_apply, cma, cnh)
blanchet@36170
   592
    val ((conjecture_clss, tfree_litss), pool) =
blanchet@36170
   593
      pool_map (dfg_clause params) conjectures pool |>> ListPair.unzip
blanchet@36966
   594
    val tfree_lits = union_all tfree_litss
blanchet@36966
   595
    val problem_name = Path.implode (Path.base file)
blanchet@36170
   596
    val (axstrs, pool) = pool_map (apfst fst oo dfg_clause params) axclauses pool
blanchet@36966
   597
    val tfree_clss = map dfg_tfree_clause tfree_lits
blanchet@36966
   598
    val tfree_preds = map dfg_tfree_predicate tfree_lits
blanchet@36170
   599
    val (helper_clauses_strs, pool) =
blanchet@36170
   600
      pool_map (apfst fst oo dfg_clause params) helper_clauses pool
blanchet@37414
   601
    val (funcs, cl_preds) =
blanchet@37414
   602
      decls_of_clauses params (helper_clauses @ conjectures @ axclauses) arity_clauses
blanchet@36966
   603
    val ty_preds = preds_of_clauses axclauses classrel_clauses arity_clauses
blanchet@36966
   604
    val preds = tfree_preds @ cl_preds @ ty_preds
blanchet@36402
   605
    val conjecture_offset =
blanchet@36402
   606
      length axclauses + length classrel_clauses + length arity_clauses
blanchet@36402
   607
      + length helper_clauses
blanchet@36393
   608
    val _ =
blanchet@36393
   609
      File.write_list file
blanchet@36393
   610
          (header () ::
blanchet@36393
   611
           string_of_start problem_name ::
blanchet@36393
   612
           string_of_descrip problem_name ::
blanchet@36393
   613
           string_of_symbols (string_of_funcs funcs)
blanchet@36966
   614
                             (string_of_preds preds) ::
blanchet@36393
   615
           "list_of_clauses(axioms, cnf).\n" ::
blanchet@36393
   616
           axstrs @
blanchet@36393
   617
           map dfg_classrel_clause classrel_clauses @
blanchet@36393
   618
           map dfg_arity_clause arity_clauses @
blanchet@36393
   619
           helper_clauses_strs @
blanchet@36393
   620
           ["end_of_list.\n\nlist_of_clauses(conjectures, cnf).\n"] @
blanchet@36402
   621
           conjecture_clss @
blanchet@36393
   622
           tfree_clss @
blanchet@36393
   623
           ["end_of_list.\n\n",
blanchet@36393
   624
            "end_problem.\n"])
blanchet@36402
   625
  in (pool, conjecture_offset) end
mengj@19720
   626
wenzelm@33311
   627
end;