src/HOL/Tools/res_atp.ML
author wenzelm
Tue May 08 15:01:30 2007 +0200 (2007-05-08)
changeset 22865 da52c2bd66ae
parent 22824 51bb2f6ecc4a
child 22989 3bcbe6187027
permissions -rw-r--r--
renamed call_atp to sledgehammer;
mengj@19194
     1
(*  Author: Jia Meng, Cambridge University Computer Laboratory, NICTA
paulson@15608
     2
    ID: $Id$
paulson@15608
     3
    Copyright 2004 University of Cambridge
paulson@15347
     4
paulson@15347
     5
ATPs with TPTP format input.
paulson@15347
     6
*)
paulson@15452
     7
wenzelm@16802
     8
signature RES_ATP =
wenzelm@16802
     9
sig
paulson@17306
    10
  val prover: string ref
wenzelm@16802
    11
  val custom_spass: string list ref
paulson@17484
    12
  val destdir: string ref
paulson@17849
    13
  val helper_path: string -> string -> string
paulson@17484
    14
  val problem_name: string ref
paulson@17690
    15
  val time_limit: int ref
paulson@21224
    16
  val set_prover: string -> unit
wenzelm@21588
    17
mengj@19194
    18
  datatype mode = Auto | Fol | Hol
paulson@19450
    19
  val linkup_logic_mode : mode ref
mengj@19722
    20
  val write_subgoal_file: bool -> mode -> Proof.context -> thm list -> thm list -> int -> string
mengj@19194
    21
  val vampire_time: int ref
mengj@19194
    22
  val eprover_time: int ref
mengj@19722
    23
  val spass_time: int ref
mengj@19194
    24
  val run_vampire: int -> unit
mengj@19194
    25
  val run_eprover: int -> unit
mengj@19722
    26
  val run_spass: int -> unit
mengj@19194
    27
  val vampireLimit: unit -> int
mengj@19194
    28
  val eproverLimit: unit -> int
mengj@19722
    29
  val spassLimit: unit -> int
wenzelm@20289
    30
  val atp_method: (Proof.context -> thm list -> int -> tactic) ->
wenzelm@20289
    31
    Method.src -> Proof.context -> Proof.method
mengj@19194
    32
  val cond_rm_tmp: string -> unit
paulson@20246
    33
  val include_all: bool ref
mengj@19194
    34
  val run_relevance_filter: bool ref
mengj@19768
    35
  val run_blacklist_filter: bool ref
paulson@20372
    36
  val blacklist: string list ref
paulson@19894
    37
  val add_all : unit -> unit
mengj@19227
    38
  val add_claset : unit -> unit
mengj@19227
    39
  val add_simpset : unit -> unit
mengj@19227
    40
  val add_clasimp : unit -> unit
mengj@19227
    41
  val add_atpset : unit -> unit
paulson@19894
    42
  val rm_all : unit -> unit
mengj@19227
    43
  val rm_claset : unit -> unit
mengj@19227
    44
  val rm_simpset : unit -> unit
mengj@19227
    45
  val rm_atpset : unit -> unit
mengj@19227
    46
  val rm_clasimp : unit -> unit
mengj@21311
    47
  val is_fol_thms : thm list -> bool
paulson@15347
    48
end;
paulson@15347
    49
wenzelm@22865
    50
structure ResAtp: RES_ATP =
paulson@15347
    51
struct
paulson@15347
    52
wenzelm@22130
    53
fun timestamp s = Output.debug (fn () => ("At " ^ Time.toString (Time.now()) ^ ": " ^ s));
paulson@21070
    54
mengj@19194
    55
(********************************************************************)
mengj@19194
    56
(* some settings for both background automatic ATP calling procedure*)
mengj@19194
    57
(* and also explicit ATP invocation methods                         *)
mengj@19194
    58
(********************************************************************)
mengj@19194
    59
mengj@19194
    60
(*** background linkup ***)
wenzelm@21588
    61
val call_atp = ref false;
quigley@17150
    62
val hook_count = ref 0;
paulson@21224
    63
val time_limit = ref 60;
wenzelm@21588
    64
val prover = ref "";
paulson@21224
    65
wenzelm@21588
    66
fun set_prover atp =
paulson@21224
    67
  case String.map Char.toLower atp of
wenzelm@21588
    68
      "e" =>
paulson@21290
    69
          (ReduceAxiomsN.max_new := 100;
paulson@21224
    70
           ReduceAxiomsN.theory_const := false;
paulson@21224
    71
           prover := "E")
wenzelm@21588
    72
    | "spass" =>
paulson@21224
    73
          (ReduceAxiomsN.max_new := 40;
paulson@21224
    74
           ReduceAxiomsN.theory_const := true;
paulson@21224
    75
           prover := "spass")
wenzelm@21588
    76
    | "vampire" =>
paulson@21224
    77
          (ReduceAxiomsN.max_new := 60;
paulson@21224
    78
           ReduceAxiomsN.theory_const := false;
paulson@21224
    79
           prover := "vampire")
paulson@21224
    80
    | _ => error ("No such prover: " ^ atp);
paulson@21224
    81
paulson@21224
    82
val _ = set_prover "E"; (* use E as the default prover *)
paulson@21224
    83
paulson@17305
    84
val custom_spass =   (*specialized options for SPASS*)
paulson@17690
    85
      ref ["-Auto=0","-FullRed=0","-IORe","-IOFc","-RTaut","-RFSub","-RBSub"];
paulson@17484
    86
val destdir = ref "";   (*Empty means write files to /tmp*)
paulson@17484
    87
val problem_name = ref "prob";
paulson@17484
    88
paulson@17819
    89
(*Return the path to a "helper" like SPASS or tptp2X, first checking that
wenzelm@21588
    90
  it exists.  FIXME: modify to use Path primitives and move to some central place.*)
paulson@17819
    91
fun helper_path evar base =
paulson@17819
    92
  case getenv evar of
paulson@17819
    93
      "" => error  ("Isabelle environment variable " ^ evar ^ " not defined")
wenzelm@21588
    94
    | home =>
paulson@17819
    95
        let val path = home ^ "/" ^ base
wenzelm@21858
    96
        in  if File.exists (File.explode_platform_path path) then path
wenzelm@21588
    97
            else error ("Could not find the file " ^ path)
wenzelm@21588
    98
        end;
paulson@17819
    99
wenzelm@21588
   100
fun probfile_nosuffix _ =
paulson@17484
   101
  if !destdir = "" then File.platform_path (File.tmp_path (Path.basic (!problem_name)))
wenzelm@21858
   102
  else if File.exists (File.explode_platform_path (!destdir))
paulson@17484
   103
  then !destdir ^ "/" ^ !problem_name
paulson@17484
   104
  else error ("No such directory: " ^ !destdir);
quigley@15644
   105
paulson@17717
   106
fun prob_pathname n = probfile_nosuffix n ^ "_" ^ Int.toString n;
paulson@17717
   107
mengj@19194
   108
mengj@19194
   109
(*** ATP methods ***)
mengj@19194
   110
val vampire_time = ref 60;
mengj@19194
   111
val eprover_time = ref 60;
mengj@19722
   112
val spass_time = ref 60;
mengj@19722
   113
wenzelm@21588
   114
fun run_vampire time =
mengj@19194
   115
    if (time >0) then vampire_time:= time
mengj@19194
   116
    else vampire_time:=60;
mengj@19194
   117
wenzelm@21588
   118
fun run_eprover time =
mengj@19194
   119
    if (time > 0) then eprover_time:= time
mengj@19194
   120
    else eprover_time:=60;
mengj@19194
   121
wenzelm@21588
   122
fun run_spass time =
mengj@19722
   123
    if (time > 0) then spass_time:=time
mengj@19722
   124
    else spass_time:=60;
mengj@19722
   125
mengj@19722
   126
mengj@19194
   127
fun vampireLimit () = !vampire_time;
mengj@19194
   128
fun eproverLimit () = !eprover_time;
mengj@19722
   129
fun spassLimit () = !spass_time;
mengj@19194
   130
mengj@19194
   131
fun atp_input_file () =
wenzelm@21588
   132
    let val file = !problem_name
mengj@19194
   133
    in
wenzelm@21588
   134
        if !destdir = "" then File.platform_path (File.tmp_path (Path.basic file))
wenzelm@21858
   135
        else if File.exists (File.explode_platform_path (!destdir))
wenzelm@21588
   136
        then !destdir ^ "/" ^ file
wenzelm@21588
   137
        else error ("No such directory: " ^ !destdir)
mengj@19194
   138
    end;
mengj@19194
   139
paulson@20868
   140
val include_all = ref true;
mengj@19194
   141
val include_simpset = ref false;
wenzelm@21588
   142
val include_claset = ref false;
mengj@19194
   143
val include_atpset = ref true;
paulson@20246
   144
paulson@20246
   145
(*Tests show that follow_defs gives VERY poor results with "include_all"*)
paulson@20246
   146
fun add_all() = (include_all:=true; ReduceAxiomsN.follow_defs := false);
paulson@20246
   147
fun rm_all() = include_all:=false;
paulson@20246
   148
paulson@20246
   149
fun add_simpset() = include_simpset:=true;
paulson@20246
   150
fun rm_simpset() = include_simpset:=false;
paulson@20246
   151
paulson@20246
   152
fun add_claset() = include_claset:=true;
paulson@20246
   153
fun rm_claset() = include_claset:=false;
paulson@20246
   154
paulson@20246
   155
fun add_clasimp() = (include_simpset:=true;include_claset:=true);
paulson@20246
   156
fun rm_clasimp() = (include_simpset:=false;include_claset:=false);
paulson@20246
   157
paulson@20246
   158
fun add_atpset() = include_atpset:=true;
paulson@20246
   159
fun rm_atpset() = include_atpset:=false;
mengj@19194
   160
mengj@19194
   161
mengj@19194
   162
(**** relevance filter ****)
paulson@20457
   163
val run_relevance_filter = ReduceAxiomsN.run_relevance_filter;
mengj@19768
   164
val run_blacklist_filter = ref true;
mengj@19194
   165
mengj@19194
   166
(******************************************************************)
mengj@19194
   167
(* detect whether a given problem (clauses) is FOL/HOL/HOLC/HOLCS *)
mengj@19194
   168
(******************************************************************)
mengj@19194
   169
mengj@19194
   170
datatype logic = FOL | HOL | HOLC | HOLCS;
mengj@19194
   171
mengj@19194
   172
fun string_of_logic FOL = "FOL"
mengj@19194
   173
  | string_of_logic HOL = "HOL"
mengj@19194
   174
  | string_of_logic HOLC = "HOLC"
mengj@19194
   175
  | string_of_logic HOLCS = "HOLCS";
mengj@19194
   176
mengj@19194
   177
fun is_fol_logic FOL = true
mengj@19194
   178
  | is_fol_logic  _ = false
mengj@19194
   179
mengj@19194
   180
(*HOLCS will not occur here*)
mengj@19194
   181
fun upgrade_lg HOLC _ = HOLC
mengj@19194
   182
  | upgrade_lg HOL HOLC = HOLC
mengj@19194
   183
  | upgrade_lg HOL _ = HOL
wenzelm@21588
   184
  | upgrade_lg FOL lg = lg;
mengj@19194
   185
mengj@19194
   186
(* check types *)
mengj@19451
   187
fun has_bool_hfn (Type("bool",_)) = true
mengj@19451
   188
  | has_bool_hfn (Type("fun",_)) = true
mengj@19451
   189
  | has_bool_hfn (Type(_, Ts)) = exists has_bool_hfn Ts
mengj@19451
   190
  | has_bool_hfn _ = false;
mengj@19194
   191
mengj@19451
   192
fun is_hol_fn tp =
mengj@19194
   193
    let val (targs,tr) = strip_type tp
mengj@19194
   194
    in
wenzelm@21588
   195
        exists (has_bool_hfn) (tr::targs)
mengj@19194
   196
    end;
mengj@19194
   197
mengj@19451
   198
fun is_hol_pred tp =
mengj@19451
   199
    let val (targs,tr) = strip_type tp
mengj@19451
   200
    in
wenzelm@21588
   201
        exists (has_bool_hfn) targs
mengj@19451
   202
    end;
mengj@19194
   203
mengj@19194
   204
exception FN_LG of term;
mengj@19194
   205
wenzelm@21588
   206
fun fn_lg (t as Const(f,tp)) (lg,seen) =
wenzelm@21588
   207
    if is_hol_fn tp then (upgrade_lg HOL lg, insert (op =) t seen) else (lg, insert (op =) t seen)
wenzelm@21588
   208
  | fn_lg (t as Free(f,tp)) (lg,seen) =
wenzelm@21588
   209
    if is_hol_fn tp then (upgrade_lg HOL lg, insert (op =) t seen) else (lg, insert (op =) t seen)
mengj@19194
   210
  | fn_lg (t as Var(f,tp)) (lg,seen) =
haftmann@20854
   211
    if is_hol_fn tp then (upgrade_lg HOL lg,insert (op =) t seen) else (lg,insert (op =) t seen)
haftmann@20854
   212
  | fn_lg (t as Abs(_,_,_)) (lg,seen) = (upgrade_lg HOLC lg,insert (op =) t seen)
wenzelm@21588
   213
  | fn_lg f _ = raise FN_LG(f);
mengj@19194
   214
mengj@19194
   215
mengj@19194
   216
fun term_lg [] (lg,seen) = (lg,seen)
mengj@19194
   217
  | term_lg (tm::tms) (FOL,seen) =
paulson@20457
   218
      let val (f,args) = strip_comb tm
wenzelm@21588
   219
          val (lg',seen') = if f mem seen then (FOL,seen)
wenzelm@21588
   220
                            else fn_lg f (FOL,seen)
paulson@20457
   221
      in
wenzelm@21588
   222
        if is_fol_logic lg' then ()
wenzelm@22130
   223
        else Output.debug (fn () => ("Found a HOL term: " ^ Display.raw_string_of_term f));
paulson@20457
   224
        term_lg (args@tms) (lg',seen')
paulson@20457
   225
      end
mengj@19194
   226
  | term_lg _ (lg,seen) = (lg,seen)
mengj@19194
   227
mengj@19194
   228
exception PRED_LG of term;
mengj@19194
   229
wenzelm@21588
   230
fun pred_lg (t as Const(P,tp)) (lg,seen)=
wenzelm@21588
   231
      if is_hol_pred tp then (upgrade_lg HOL lg, insert (op =) t seen)
wenzelm@21588
   232
      else (lg,insert (op =) t seen)
mengj@19194
   233
  | pred_lg (t as Free(P,tp)) (lg,seen) =
wenzelm@21588
   234
      if is_hol_pred tp then (upgrade_lg HOL lg, insert (op =) t seen)
paulson@21470
   235
      else (lg,insert (op =) t seen)
haftmann@20854
   236
  | pred_lg (t as Var(_,_)) (lg,seen) = (upgrade_lg HOL lg, insert (op =) t seen)
mengj@19194
   237
  | pred_lg P _ = raise PRED_LG(P);
mengj@19194
   238
mengj@19194
   239
mengj@19194
   240
fun lit_lg (Const("Not",_) $ P) (lg,seen) = lit_lg P (lg,seen)
mengj@19194
   241
  | lit_lg P (lg,seen) =
paulson@20457
   242
      let val (pred,args) = strip_comb P
wenzelm@21588
   243
          val (lg',seen') = if pred mem seen then (lg,seen)
wenzelm@21588
   244
                            else pred_lg pred (lg,seen)
paulson@20457
   245
      in
wenzelm@21588
   246
        if is_fol_logic lg' then ()
wenzelm@22130
   247
        else Output.debug (fn () => ("Found a HOL predicate: " ^ Display.raw_string_of_term pred));
wenzelm@21588
   248
        term_lg args (lg',seen')
paulson@20457
   249
      end;
mengj@19194
   250
mengj@19194
   251
fun lits_lg [] (lg,seen) = (lg,seen)
mengj@19194
   252
  | lits_lg (lit::lits) (FOL,seen) =
paulson@20457
   253
      let val (lg,seen') = lit_lg lit (FOL,seen)
paulson@20457
   254
      in
wenzelm@21588
   255
        if is_fol_logic lg then ()
wenzelm@22130
   256
        else Output.debug (fn () => ("Found a HOL literal: " ^ Display.raw_string_of_term lit));
wenzelm@21588
   257
        lits_lg lits (lg,seen')
paulson@20457
   258
      end
mengj@19194
   259
  | lits_lg lits (lg,seen) = (lg,seen);
mengj@19194
   260
paulson@21470
   261
fun dest_disj_aux (Const("Trueprop",_) $ t) disjs = dest_disj_aux t disjs
paulson@21470
   262
  | dest_disj_aux (Const ("op |", _) $ t $ t') disjs = dest_disj_aux t (dest_disj_aux t' disjs)
mengj@19227
   263
  | dest_disj_aux t disjs = t::disjs;
mengj@19227
   264
mengj@19227
   265
fun dest_disj t = dest_disj_aux t [];
mengj@19227
   266
paulson@21470
   267
fun logic_of_clause tm = lits_lg (dest_disj tm);
mengj@19194
   268
mengj@19194
   269
fun logic_of_clauses [] (lg,seen) = (lg,seen)
mengj@19194
   270
  | logic_of_clauses (cls::clss) (FOL,seen) =
mengj@19227
   271
    let val (lg,seen') = logic_of_clause cls (FOL,seen)
wenzelm@21588
   272
        val _ =
wenzelm@19641
   273
          if is_fol_logic lg then ()
wenzelm@22130
   274
          else Output.debug (fn () => ("Found a HOL clause: " ^ Display.raw_string_of_term cls))
mengj@19227
   275
    in
wenzelm@21588
   276
        logic_of_clauses clss (lg,seen')
mengj@19227
   277
    end
mengj@19194
   278
  | logic_of_clauses (cls::clss) (lg,seen) = (lg,seen);
mengj@19194
   279
mengj@19194
   280
fun problem_logic_goals_aux [] (lg,seen) = lg
wenzelm@21588
   281
  | problem_logic_goals_aux (subgoal::subgoals) (lg,seen) =
mengj@19194
   282
    problem_logic_goals_aux subgoals (logic_of_clauses subgoal (lg,seen));
wenzelm@21588
   283
mengj@19194
   284
fun problem_logic_goals subgoals = problem_logic_goals_aux subgoals (FOL,[]);
mengj@19194
   285
mengj@21311
   286
fun is_fol_thms ths = ((fst(logic_of_clauses (map prop_of ths) (FOL,[]))) = FOL);
mengj@21311
   287
mengj@19768
   288
(***************************************************************)
mengj@19768
   289
(* Retrieving and filtering lemmas                             *)
mengj@19768
   290
(***************************************************************)
mengj@19768
   291
mengj@19768
   292
(*** white list and black list of lemmas ***)
mengj@19768
   293
mengj@19768
   294
(*The rule subsetI is frequently omitted by the relevance filter.*)
wenzelm@21588
   295
val whitelist = ref [subsetI];
wenzelm@21588
   296
paulson@22382
   297
(*Names of theorems and theorem lists to be blacklisted.
paulson@20444
   298
paulson@20444
   299
  These theorems typically produce clauses that are prolific (match too many equality or
mengj@19768
   300
  membership literals) and relate to seldom-used facts. Some duplicate other rules.
mengj@19768
   301
  FIXME: this blacklist needs to be maintained using theory data and added to using
mengj@19768
   302
  an attribute.*)
mengj@19768
   303
val blacklist = ref
paulson@20526
   304
  ["Datatype.prod.size",
mengj@19768
   305
   "Divides.dvd_0_left_iff",
mengj@19768
   306
   "Finite_Set.card_0_eq",
mengj@19768
   307
   "Finite_Set.card_infinite",
mengj@19768
   308
   "Finite_Set.Max_ge",
mengj@19768
   309
   "Finite_Set.Max_in",
mengj@19768
   310
   "Finite_Set.Max_le_iff",
mengj@19768
   311
   "Finite_Set.Max_less_iff",
mengj@19768
   312
   "Finite_Set.max.f_below_strict_below.below_f_conv", (*duplicates in Orderings.*)
mengj@19768
   313
   "Finite_Set.max.f_below_strict_below.strict_below_f_conv", (*duplicates in Orderings.*)
mengj@19768
   314
   "Finite_Set.Min_ge_iff",
mengj@19768
   315
   "Finite_Set.Min_gr_iff",
mengj@19768
   316
   "Finite_Set.Min_in",
mengj@19768
   317
   "Finite_Set.Min_le",
mengj@19768
   318
   "Finite_Set.min.f_below_strict_below.below_f_conv",        (*duplicates in Orderings.*)
mengj@19768
   319
   "Finite_Set.min.f_below_strict_below.strict_below_f_conv", (*duplicates in Orderings.*)
paulson@20526
   320
   "Fun.vimage_image_eq",   (*involves an existential quantifier*)
paulson@20526
   321
   "HOL.split_if_asm",     (*splitting theorem*)
paulson@20457
   322
   "HOL.split_if",         (*splitting theorem*)
paulson@22193
   323
   "HOL.All_def",          (*far worse than useless!!*)
paulson@20526
   324
   "IntDef.abs_split",
mengj@19768
   325
   "IntDef.Integ.Abs_Integ_inject",
mengj@19768
   326
   "IntDef.Integ.Abs_Integ_inverse",
mengj@19768
   327
   "IntDiv.zdvd_0_left",
mengj@19768
   328
   "List.append_eq_append_conv",
mengj@19768
   329
   "List.hd_Cons_tl",   (*Says everything is [] or Cons. Probably prolific.*)
mengj@19768
   330
   "List.in_listsD",
mengj@19768
   331
   "List.in_listsI",
mengj@19768
   332
   "List.lists.Cons",
mengj@19768
   333
   "List.listsE",
mengj@19768
   334
   "Nat.less_one", (*not directional? obscure*)
mengj@19768
   335
   "Nat.not_gr0",
mengj@19768
   336
   "Nat.one_eq_mult_iff", (*duplicate by symmetry*)
wenzelm@21243
   337
   "Nat.of_nat_0_eq_iff",
wenzelm@21243
   338
   "Nat.of_nat_eq_0_iff",
wenzelm@21243
   339
   "Nat.of_nat_le_0_iff",
mengj@19768
   340
   "NatSimprocs.divide_le_0_iff_number_of",  (*too many clauses*)
mengj@19768
   341
   "NatSimprocs.divide_less_0_iff_number_of",
mengj@19768
   342
   "NatSimprocs.equation_minus_iff_1",  (*not directional*)
mengj@19768
   343
   "NatSimprocs.equation_minus_iff_number_of", (*not directional*)
mengj@19768
   344
   "NatSimprocs.le_minus_iff_1", (*not directional*)
mengj@19768
   345
   "NatSimprocs.le_minus_iff_number_of",  (*not directional*)
mengj@19768
   346
   "NatSimprocs.less_minus_iff_1", (*not directional*)
mengj@19768
   347
   "NatSimprocs.less_minus_iff_number_of", (*not directional*)
mengj@19768
   348
   "NatSimprocs.minus_equation_iff_number_of", (*not directional*)
mengj@19768
   349
   "NatSimprocs.minus_le_iff_1", (*not directional*)
mengj@19768
   350
   "NatSimprocs.minus_le_iff_number_of", (*not directional*)
mengj@19768
   351
   "NatSimprocs.minus_less_iff_1", (*not directional*)
mengj@19768
   352
   "NatSimprocs.mult_le_cancel_left_number_of", (*excessive case analysis*)
mengj@19768
   353
   "NatSimprocs.mult_le_cancel_right_number_of", (*excessive case analysis*)
mengj@19768
   354
   "NatSimprocs.mult_less_cancel_left_number_of", (*excessive case analysis*)
mengj@19768
   355
   "NatSimprocs.mult_less_cancel_right_number_of", (*excessive case analysis*)
mengj@19768
   356
   "NatSimprocs.zero_le_divide_iff_number_of", (*excessive case analysis*)
mengj@19768
   357
   "NatSimprocs.zero_less_divide_iff_number_of",
mengj@19768
   358
   "OrderedGroup.abs_0_eq", (*duplicate by symmetry*)
mengj@19768
   359
   "OrderedGroup.diff_eq_0_iff_eq", (*prolific?*)
haftmann@22422
   360
   "OrderedGroup.sup_0_eq_0",
haftmann@22422
   361
   "OrderedGroup.inf_0_eq_0",
mengj@19768
   362
   "OrderedGroup.pprt_eq_0",   (*obscure*)
mengj@19768
   363
   "OrderedGroup.pprt_eq_id",   (*obscure*)
mengj@19768
   364
   "OrderedGroup.pprt_mono",   (*obscure*)
paulson@20526
   365
   "Orderings.split_max",      (*splitting theorem*)
paulson@20457
   366
   "Orderings.split_min",      (*splitting theorem*)
mengj@19768
   367
   "Power.zero_less_power_abs_iff",
paulson@20526
   368
   "Product_Type.split_eta_SetCompr",   (*involves an existential quantifier*)
paulson@20457
   369
   "Product_Type.split_paired_Ball_Sigma",     (*splitting theorem*)
paulson@20457
   370
   "Product_Type.split_paired_Bex_Sigma",      (*splitting theorem*)
paulson@20526
   371
   "Product_Type.split_split_asm",             (*splitting theorem*)
paulson@20457
   372
   "Product_Type.split_split",                 (*splitting theorem*)
paulson@20526
   373
   "Product_Type.unit_abs_eta_conv",
paulson@20526
   374
   "Product_Type.unit_induct",
mengj@19768
   375
   "Relation.diagI",
paulson@20526
   376
   "Relation.Domain_def",   (*involves an existential quantifier*)
paulson@20526
   377
   "Relation.Image_def",   (*involves an existential quantifier*)
mengj@19768
   378
   "Relation.ImageI",
mengj@19768
   379
   "Ring_and_Field.divide_cancel_left", (*fields are seldom used & often prolific*)
mengj@19768
   380
   "Ring_and_Field.divide_cancel_right",
mengj@19768
   381
   "Ring_and_Field.divide_divide_eq_left",
mengj@19768
   382
   "Ring_and_Field.divide_divide_eq_right",
mengj@19768
   383
   "Ring_and_Field.divide_eq_0_iff",
mengj@19768
   384
   "Ring_and_Field.divide_eq_1_iff",
mengj@19768
   385
   "Ring_and_Field.divide_eq_eq_1",
mengj@19768
   386
   "Ring_and_Field.divide_le_0_1_iff",
mengj@19768
   387
   "Ring_and_Field.divide_le_eq_1_neg",  (*obscure and prolific*)
mengj@19768
   388
   "Ring_and_Field.divide_le_eq_1_pos",  (*obscure and prolific*)
mengj@19768
   389
   "Ring_and_Field.divide_less_0_1_iff",
mengj@19768
   390
   "Ring_and_Field.divide_less_eq_1_neg",  (*obscure and prolific*)
mengj@19768
   391
   "Ring_and_Field.divide_less_eq_1_pos",  (*obscure and prolific*)
mengj@19768
   392
   "Ring_and_Field.eq_divide_eq_1", (*duplicate by symmetry*)
mengj@19768
   393
   "Ring_and_Field.field_mult_cancel_left",
mengj@19768
   394
   "Ring_and_Field.field_mult_cancel_right",
mengj@19768
   395
   "Ring_and_Field.inverse_le_iff_le_neg",
mengj@19768
   396
   "Ring_and_Field.inverse_le_iff_le",
mengj@19768
   397
   "Ring_and_Field.inverse_less_iff_less_neg",
mengj@19768
   398
   "Ring_and_Field.inverse_less_iff_less",
mengj@19768
   399
   "Ring_and_Field.le_divide_eq_1_neg", (*obscure and prolific*)
mengj@19768
   400
   "Ring_and_Field.le_divide_eq_1_pos", (*obscure and prolific*)
mengj@19768
   401
   "Ring_and_Field.less_divide_eq_1_neg", (*obscure and prolific*)
mengj@19768
   402
   "Ring_and_Field.less_divide_eq_1_pos", (*obscure and prolific*)
mengj@19768
   403
   "Ring_and_Field.one_eq_divide_iff",  (*duplicate by symmetry*)
paulson@22382
   404
   "Set.ball_simps", "Set.bex_simps",  (*quantifier rewriting: useless*)
paulson@20526
   405
   "Set.Collect_bex_eq",   (*involves an existential quantifier*)
paulson@20526
   406
   "Set.Collect_ex_eq",   (*involves an existential quantifier*)
mengj@19768
   407
   "Set.Diff_eq_empty_iff", (*redundant with paramodulation*)
mengj@19768
   408
   "Set.Diff_insert0",
paulson@20526
   409
   "Set.empty_Union_conv",   (*redundant with paramodulation*)
paulson@20526
   410
   "Set.full_SetCompr_eq",   (*involves an existential quantifier*)
paulson@22193
   411
   "Set.image_Collect",      (*involves Collect and a boolean variable...*)
paulson@20526
   412
   "Set.image_def",          (*involves an existential quantifier*)
paulson@22382
   413
   "Set.disjoint_insert", "Set.insert_disjoint",
paulson@20526
   414
   "Set.Int_UNIV",  (*redundant with paramodulation*)
paulson@22382
   415
   "Set.Inter_UNIV_conv",
paulson@20526
   416
   "Set.Inter_iff", (*We already have InterI, InterE*)
mengj@19768
   417
   "Set.psubsetE",    (*too prolific and obscure*)
mengj@19768
   418
   "Set.psubsetI",
mengj@19768
   419
   "Set.singleton_insert_inj_eq'",
mengj@19768
   420
   "Set.singleton_insert_inj_eq",
mengj@19768
   421
   "Set.singletonD",  (*these two duplicate some "insert" lemmas*)
mengj@19768
   422
   "Set.singletonI",
mengj@19768
   423
   "Set.Un_empty", (*redundant with paramodulation*)
paulson@20526
   424
   "Set.UNION_def",   (*involves an existential quantifier*)
mengj@19768
   425
   "Set.Union_empty_conv", (*redundant with paramodulation*)
mengj@19768
   426
   "Set.Union_iff",              (*We already have UnionI, UnionE*)
mengj@19768
   427
   "SetInterval.atLeastAtMost_iff", (*obscure and prolific*)
mengj@19768
   428
   "SetInterval.atLeastLessThan_iff", (*obscure and prolific*)
mengj@19768
   429
   "SetInterval.greaterThanAtMost_iff", (*obscure and prolific*)
mengj@19768
   430
   "SetInterval.greaterThanLessThan_iff", (*obscure and prolific*)
mengj@19768
   431
   "SetInterval.ivl_subset"];  (*excessive case analysis*)
mengj@19768
   432
mengj@19768
   433
(*These might be prolific but are probably OK, and min and max are basic.
wenzelm@21588
   434
   "Orderings.max_less_iff_conj",
mengj@19768
   435
   "Orderings.min_less_iff_conj",
mengj@19768
   436
   "Orderings.min_max.below_inf.below_inf_conv",
mengj@19768
   437
   "Orderings.min_max.below_sup.above_sup_conv",
mengj@19768
   438
Very prolific and somewhat obscure:
mengj@19768
   439
   "Set.InterD",
mengj@19768
   440
   "Set.UnionI",
mengj@19768
   441
*)
mengj@19768
   442
mengj@19768
   443
(*** retrieve lemmas from clasimpset and atpset, may filter them ***)
mengj@19768
   444
mengj@19768
   445
(*Hashing to detect duplicate and variant clauses, e.g. from the [iff] attribute*)
mengj@19768
   446
paulson@22382
   447
fun setinsert (x,s) = Symtab.update (x,()) s;
mengj@19768
   448
paulson@20757
   449
(*Reject theorems with names like "List.filter.filter_list_def" or
paulson@21690
   450
  "Accessible_Part.acc.defs", as these are definitions arising from packages.*)
paulson@20757
   451
fun is_package_def a =
wenzelm@21858
   452
  let val names = NameSpace.explode a
paulson@21690
   453
  in
paulson@21690
   454
     length names > 2 andalso
paulson@21690
   455
     not (hd names = "local") andalso
paulson@21690
   456
     String.isSuffix "_def" a  orelse  String.isSuffix "_defs" a
paulson@21690
   457
  end;
paulson@20757
   458
mengj@19768
   459
(** a hash function from Term.term to int, and also a hash table **)
mengj@19768
   460
val xor_words = List.foldl Word.xorb 0w0;
mengj@19768
   461
mengj@19768
   462
fun hashw_term ((Const(c,_)), w) = Polyhash.hashw_string (c,w)
paulson@20661
   463
  | hashw_term ((Free(a,_)), w) = Polyhash.hashw_string (a,w)
mengj@19768
   464
  | hashw_term ((Var(_,_)), w) = w
paulson@20661
   465
  | hashw_term ((Bound i), w) = Polyhash.hashw_int(i,w)
mengj@19768
   466
  | hashw_term ((Abs(_,_,t)), w) = hashw_term (t, w)
mengj@19768
   467
  | hashw_term ((P$Q), w) = hashw_term (Q, (hashw_term (P, w)));
mengj@19768
   468
paulson@21070
   469
fun hash_literal (Const("Not",_)$P) = Word.notb(hashw_term(P,0w0))
paulson@21070
   470
  | hash_literal P = hashw_term(P,0w0);
mengj@19768
   471
paulson@21470
   472
fun hash_term t = Word.toIntX (xor_words (map hash_literal (dest_disj t)));
mengj@19768
   473
mengj@19768
   474
fun equal_thm (thm1,thm2) = Term.aconv(prop_of thm1, prop_of thm2);
paulson@20457
   475
paulson@22382
   476
exception HASH_CLAUSE;
paulson@22382
   477
mengj@19768
   478
(*Create a hash table for clauses, of the given size*)
mengj@19768
   479
fun mk_clause_table n =
paulson@20457
   480
      Polyhash.mkTable (hash_term o prop_of, equal_thm)
mengj@19768
   481
                       (n, HASH_CLAUSE);
mengj@19768
   482
paulson@20457
   483
(*Use a hash table to eliminate duplicates from xs. Argument is a list of
paulson@20868
   484
  (thm * (string * int)) tuples. The theorems are hashed into the table. *)
wenzelm@21588
   485
fun make_unique xs =
paulson@20868
   486
  let val ht = mk_clause_table 7000
paulson@20457
   487
  in
wenzelm@22130
   488
      Output.debug (fn () => ("make_unique gets " ^ Int.toString (length xs) ^ " clauses"));
wenzelm@21588
   489
      app (ignore o Polyhash.peekInsert ht) xs;
paulson@20868
   490
      Polyhash.listItems ht
paulson@20457
   491
  end;
mengj@19768
   492
paulson@20868
   493
(*Remove existing axiom clauses from the conjecture clauses, as this can dramatically
paulson@20868
   494
  boost an ATP's performance (for some reason)*)
wenzelm@21588
   495
fun subtract_cls c_clauses ax_clauses =
paulson@20868
   496
  let val ht = mk_clause_table 2200
paulson@20868
   497
      fun known x = isSome (Polyhash.peek ht x)
paulson@20868
   498
  in
wenzelm@21588
   499
      app (ignore o Polyhash.peekInsert ht) ax_clauses;
wenzelm@21588
   500
      filter (not o known) c_clauses
paulson@20868
   501
  end;
mengj@19768
   502
wenzelm@21588
   503
(*Filter axiom clauses, but keep supplied clauses and clauses in whitelist.
paulson@20868
   504
  Duplicates are removed later.*)
paulson@20457
   505
fun get_relevant_clauses thy cls_thms white_cls goals =
paulson@20868
   506
  white_cls @ (ReduceAxiomsN.relevance_filter thy cls_thms goals);
paulson@20457
   507
paulson@21224
   508
fun all_valid_thms ctxt =
paulson@22382
   509
  let
wenzelm@22865
   510
    val banned_tab = foldl setinsert Symtab.empty (!blacklist)
paulson@22382
   511
    fun blacklisted s = !run_blacklist_filter andalso
paulson@22382
   512
                        (isSome (Symtab.lookup banned_tab s) orelse is_package_def s)
paulson@22382
   513
paulson@22382
   514
    fun extern_valid space (name, ths) =
paulson@22382
   515
      let
paulson@22382
   516
        val is_valid = ProofContext.valid_thms ctxt;
paulson@22382
   517
        val xname = NameSpace.extern space name;
paulson@22382
   518
      in
paulson@22382
   519
        if blacklisted name then I
paulson@22382
   520
        else if is_valid (xname, ths) then cons (xname, ths)
paulson@22382
   521
        else if is_valid (name, ths) then cons (name, ths)
paulson@22382
   522
        else I
paulson@22382
   523
      end;
paulson@22382
   524
    val thy = ProofContext.theory_of ctxt;
paulson@22382
   525
    val all_thys = thy :: Theory.ancestors_of thy;
paulson@22382
   526
paulson@22382
   527
    fun dest_valid (space, tab) = Symtab.fold (extern_valid space) tab [];
paulson@22382
   528
  in
paulson@22382
   529
    maps (dest_valid o PureThy.theorems_of) all_thys @
paulson@22382
   530
    fold (extern_valid (#1 (ProofContext.theorems_of ctxt)))
paulson@22382
   531
      (FactIndex.find (ProofContext.fact_index_of ctxt) ([], [])) []
paulson@22382
   532
  end;
paulson@21224
   533
wenzelm@21588
   534
fun multi_name a (th, (n,pairs)) =
paulson@21224
   535
  (n+1, (a ^ "(" ^ Int.toString n ^ ")", th) :: pairs)
paulson@21224
   536
paulson@22382
   537
fun add_single_names ((a, []), pairs) = pairs
paulson@22382
   538
  | add_single_names ((a, [th]), pairs) = (a,th)::pairs
paulson@22382
   539
  | add_single_names ((a, ths), pairs) = #2 (foldl (multi_name a) (1,pairs) ths);
paulson@21431
   540
paulson@21470
   541
val multi_base_blacklist =
paulson@21470
   542
  ["defs","select_defs","update_defs","induct","inducts","split","splits","split_asm"];
paulson@21470
   543
paulson@22382
   544
(*Ignore blacklisted basenames*)
wenzelm@21588
   545
fun add_multi_names ((a, ths), pairs) =
paulson@22382
   546
  if (Sign.base_name a) mem_string multi_base_blacklist  then pairs
paulson@22382
   547
  else add_single_names ((a, ths), pairs);
paulson@21224
   548
paulson@21290
   549
fun is_multi (a, ths) = length ths > 1 orelse String.isSuffix ".axioms" a;
paulson@21290
   550
paulson@21290
   551
(*The single theorems go BEFORE the multiple ones*)
wenzelm@21588
   552
fun name_thm_pairs ctxt =
paulson@21290
   553
  let val (mults,singles) = List.partition is_multi (all_valid_thms ctxt)
paulson@22382
   554
  in  foldl add_single_names  (foldl add_multi_names [] mults) singles end;
paulson@21224
   555
paulson@21224
   556
fun check_named ("",th) = (warning ("No name for theorem " ^ string_of_thm th); false)
paulson@21224
   557
  | check_named (_,th) = true;
paulson@19894
   558
paulson@22193
   559
fun display_thm (name,th) = Output.debug (fn () => name ^ ": " ^ string_of_thm th);
paulson@22193
   560
mengj@19768
   561
(* get lemmas from claset, simpset, atpset and extra supplied rules *)
wenzelm@21588
   562
fun get_clasimp_atp_lemmas ctxt user_thms =
paulson@19894
   563
  let val included_thms =
wenzelm@21588
   564
        if !include_all
wenzelm@21588
   565
        then (tap (fn ths => Output.debug
wenzelm@22130
   566
                     (fn () => ("Including all " ^ Int.toString (length ths) ^ " theorems")))
wenzelm@21588
   567
                  (name_thm_pairs ctxt))
wenzelm@21588
   568
        else
wenzelm@21588
   569
        let val claset_thms =
wenzelm@21588
   570
                if !include_claset then ResAxioms.claset_rules_of ctxt
wenzelm@21588
   571
                else []
wenzelm@21588
   572
            val simpset_thms =
wenzelm@21588
   573
                if !include_simpset then ResAxioms.simpset_rules_of ctxt
wenzelm@21588
   574
                else []
wenzelm@21588
   575
            val atpset_thms =
wenzelm@21588
   576
                if !include_atpset then ResAxioms.atpset_rules_of ctxt
wenzelm@21588
   577
                else []
paulson@22193
   578
            val _ = (Output.debug (fn () => "ATP theorems: ");  app display_thm atpset_thms)
wenzelm@21588
   579
        in  claset_thms @ simpset_thms @ atpset_thms  end
wenzelm@21588
   580
      val user_rules = filter check_named
paulson@22382
   581
                         (map ResAxioms.pairname
wenzelm@21588
   582
                           (if null user_thms then !whitelist else user_thms))
paulson@19894
   583
  in
paulson@21224
   584
      (filter check_named included_thms, user_rules)
paulson@19894
   585
  end;
mengj@19768
   586
paulson@21290
   587
(***************************************************************)
paulson@21290
   588
(* Type Classes Present in the Axiom or Conjecture Clauses     *)
paulson@21290
   589
(***************************************************************)
paulson@21290
   590
paulson@21290
   591
fun add_classes (sorts, cset) = foldl setinsert cset (List.concat sorts);
paulson@21290
   592
paulson@21290
   593
(*Remove this trivial type class*)
paulson@21290
   594
fun delete_type cset = Symtab.delete_safe "HOL.type" cset;
paulson@21290
   595
paulson@21290
   596
fun tvar_classes_of_terms ts =
paulson@21290
   597
  let val sorts_list = map (map #2 o term_tvars) ts
paulson@21290
   598
  in  Symtab.keys (delete_type (foldl add_classes Symtab.empty sorts_list))  end;
paulson@21290
   599
paulson@21290
   600
fun tfree_classes_of_terms ts =
paulson@21290
   601
  let val sorts_list = map (map #2 o term_tfrees) ts
paulson@21290
   602
  in  Symtab.keys (delete_type (foldl add_classes Symtab.empty sorts_list))  end;
paulson@20526
   603
paulson@21373
   604
(*fold type constructors*)
paulson@21373
   605
fun fold_type_consts f (Type (a, Ts)) x = fold (fold_type_consts f) Ts (f (a,x))
paulson@21373
   606
  | fold_type_consts f T x = x;
paulson@21373
   607
paulson@21373
   608
val add_type_consts_in_type = fold_type_consts setinsert;
paulson@21373
   609
paulson@21397
   610
(*Type constructors used to instantiate overloaded constants are the only ones needed.*)
paulson@21397
   611
fun add_type_consts_in_term thy =
paulson@21397
   612
  let val const_typargs = Sign.const_typargs thy
paulson@21397
   613
      fun add_tcs (Const cT) x = fold add_type_consts_in_type (const_typargs cT) x
paulson@21397
   614
        | add_tcs (Abs (_, T, u)) x = add_tcs u x
paulson@21397
   615
        | add_tcs (t $ u) x = add_tcs t (add_tcs u x)
paulson@21397
   616
        | add_tcs _ x = x
paulson@21397
   617
  in  add_tcs  end
paulson@21373
   618
paulson@21397
   619
fun type_consts_of_terms thy ts =
paulson@21397
   620
  Symtab.keys (fold (add_type_consts_in_term thy) ts Symtab.empty);
paulson@21373
   621
paulson@21373
   622
mengj@19194
   623
(***************************************************************)
mengj@19194
   624
(* ATP invocation methods setup                                *)
mengj@19194
   625
(***************************************************************)
mengj@19194
   626
wenzelm@21588
   627
fun cnf_hyps_thms ctxt =
wenzelm@20224
   628
    let val ths = Assumption.prems_of ctxt
wenzelm@19617
   629
    in fold (fold (insert Thm.eq_thm) o ResAxioms.skolem_thm) ths [] end;
mengj@19194
   630
paulson@20526
   631
(*Translation mode can be auto-detected, or forced to be first-order or higher-order*)
mengj@19194
   632
datatype mode = Auto | Fol | Hol;
mengj@19194
   633
paulson@19450
   634
val linkup_logic_mode = ref Auto;
paulson@19205
   635
paulson@20526
   636
(*Ensures that no higher-order theorems "leak out"*)
paulson@22382
   637
fun restrict_to_logic thy logic cls =
paulson@22382
   638
  if is_fol_logic logic then filter (Meson.is_fol_term thy o prop_of o fst) cls
wenzelm@21588
   639
                        else cls;
paulson@20526
   640
paulson@21470
   641
(**** Predicates to detect unwanted clauses (prolific or likely to cause unsoundness) ****)
paulson@21470
   642
paulson@21470
   643
(** Too general means, positive equality literal with a variable X as one operand,
paulson@21470
   644
  when X does not occur properly in the other operand. This rules out clearly
paulson@21470
   645
  inconsistent clauses such as V=a|V=b, though it by no means guarantees soundness. **)
wenzelm@21588
   646
paulson@21470
   647
fun occurs ix =
paulson@21470
   648
    let fun occ(Var (jx,_)) = (ix=jx)
paulson@21470
   649
          | occ(t1$t2)      = occ t1 orelse occ t2
paulson@21470
   650
          | occ(Abs(_,_,t)) = occ t
paulson@21470
   651
          | occ _           = false
paulson@21470
   652
    in occ end;
paulson@21470
   653
paulson@21470
   654
fun is_recordtype T = not (null (RecordPackage.dest_recTs T));
paulson@21470
   655
paulson@21470
   656
(*Unwanted equalities include
paulson@21470
   657
  (1) those between a variable that does not properly occur in the second operand,
paulson@21470
   658
  (2) those between a variable and a record, since these seem to be prolific "cases" thms
wenzelm@21588
   659
*)
paulson@21470
   660
fun too_general_eqterms (Var (ix,T), t) = not (occurs ix t) orelse is_recordtype T
paulson@21470
   661
  | too_general_eqterms _ = false;
paulson@21470
   662
paulson@21470
   663
fun too_general_equality (Const ("op =", _) $ x $ y) =
paulson@21470
   664
      too_general_eqterms (x,y) orelse too_general_eqterms(y,x)
paulson@21470
   665
  | too_general_equality _ = false;
paulson@21470
   666
paulson@21470
   667
(* tautologous? *)
paulson@21470
   668
fun is_taut (Const ("Trueprop", _) $ Const ("True", _)) = true
paulson@21470
   669
  | is_taut _ = false;
paulson@21470
   670
paulson@21431
   671
(*True if the term contains a variable whose (atomic) type is in the given list.*)
wenzelm@21588
   672
fun has_typed_var tycons =
paulson@21431
   673
  let fun var_tycon (Var (_, Type(a,_))) = a mem_string tycons
paulson@21431
   674
        | var_tycon _ = false
paulson@21431
   675
  in  exists var_tycon o term_vars  end;
paulson@21431
   676
paulson@22217
   677
(*Clauses are forbidden to contain variables of these types. The typical reason is that
paulson@22217
   678
  they lead to unsoundness. Note that "unit" satisfies numerous equations like ?X=().
paulson@22217
   679
  The resulting clause will have no type constraint, yielding false proofs. Even "bool"
paulson@22217
   680
  leads to many unsound proofs, though (obviously) only for higher-order problems.*)
paulson@22217
   681
val unwanted_types = ref ["Product_Type.unit","bool"];
paulson@22217
   682
paulson@21470
   683
fun unwanted t =
paulson@22217
   684
    is_taut t orelse has_typed_var (!unwanted_types) t orelse
paulson@21470
   685
    forall too_general_equality (dest_disj t);
paulson@21470
   686
paulson@21431
   687
(*Clauses containing variables of type "unit" or "bool" are unlikely to be useful and
paulson@21431
   688
  likely to lead to unsound proofs.*)
paulson@22217
   689
fun remove_unwanted_clauses cls = filter (not o unwanted o prop_of o fst) cls;
paulson@21431
   690
mengj@20131
   691
fun tptp_writer logic goals filename (axioms,classrels,arities) user_lemmas =
wenzelm@21588
   692
    if is_fol_logic logic
paulson@19445
   693
    then ResClause.tptp_write_file goals filename (axioms, classrels, arities)
mengj@20131
   694
    else ResHolClause.tptp_write_file goals filename (axioms, classrels, arities) user_lemmas;
paulson@19445
   695
mengj@20131
   696
fun dfg_writer logic goals filename (axioms,classrels,arities) user_lemmas =
wenzelm@21588
   697
    if is_fol_logic logic
paulson@19445
   698
    then ResClause.dfg_write_file goals filename (axioms, classrels, arities)
mengj@20131
   699
    else ResHolClause.dfg_write_file goals filename (axioms, classrels, arities) user_lemmas;
mengj@19194
   700
paulson@20022
   701
(*Called by the oracle-based methods declared in res_atp_methods.ML*)
mengj@19722
   702
fun write_subgoal_file dfg mode ctxt conjectures user_thms n =
wenzelm@21588
   703
    let val conj_cls = make_clauses conjectures
paulson@22731
   704
                         |> ResAxioms.assume_abstract_list "subgoal" |> Meson.finish_cnf
wenzelm@21588
   705
        val hyp_cls = cnf_hyps_thms ctxt
wenzelm@21588
   706
        val goal_cls = conj_cls@hyp_cls
wenzelm@21588
   707
        val goal_tms = map prop_of goal_cls
paulson@22382
   708
        val thy = ProofContext.theory_of ctxt
wenzelm@21588
   709
        val logic = case mode of
paulson@21431
   710
                            Auto => problem_logic_goals [goal_tms]
wenzelm@21588
   711
                          | Fol => FOL
wenzelm@21588
   712
                          | Hol => HOL
wenzelm@21588
   713
        val (included_thms,user_rules) = get_clasimp_atp_lemmas ctxt user_thms
wenzelm@22865
   714
        val cla_simp_atp_clauses = included_thms
wenzelm@21588
   715
                                     |> ResAxioms.cnf_rules_pairs |> make_unique
paulson@22382
   716
                                     |> restrict_to_logic thy logic
paulson@21470
   717
                                     |> remove_unwanted_clauses
wenzelm@21588
   718
        val user_cls = ResAxioms.cnf_rules_pairs user_rules
wenzelm@21588
   719
        val axclauses = make_unique (get_relevant_clauses thy cla_simp_atp_clauses user_cls goal_tms)
paulson@21431
   720
        val subs = tfree_classes_of_terms goal_tms
paulson@21373
   721
        and axtms = map (prop_of o #1) axclauses
paulson@21373
   722
        val supers = tvar_classes_of_terms axtms
paulson@21431
   723
        and tycons = type_consts_of_terms thy (goal_tms@axtms)
paulson@21290
   724
        (*TFrees in conjecture clauses; TVars in axiom clauses*)
paulson@22645
   725
        val (supers',arity_clauses) = ResClause.make_arity_clauses thy tycons supers
paulson@22645
   726
        val classrel_clauses = ResClause.make_classrel_clauses thy subs supers'
wenzelm@21588
   727
        val writer = if dfg then dfg_writer else tptp_writer
wenzelm@21588
   728
        and file = atp_input_file()
wenzelm@21588
   729
        and user_lemmas_names = map #1 user_rules
mengj@19194
   730
    in
wenzelm@21588
   731
        writer logic goal_cls file (axclauses,classrel_clauses,arity_clauses) user_lemmas_names;
wenzelm@22130
   732
        Output.debug (fn () => "Writing to " ^ file);
wenzelm@21588
   733
        file
mengj@19194
   734
    end;
mengj@19194
   735
mengj@19194
   736
mengj@19194
   737
(**** remove tmp files ****)
wenzelm@21588
   738
fun cond_rm_tmp file =
wenzelm@22130
   739
    if !Output.debugging orelse !destdir <> ""
wenzelm@22130
   740
    then Output.debug (fn () => "ATP input kept...")
paulson@20870
   741
    else OS.FileSys.remove file;
mengj@19194
   742
mengj@19194
   743
mengj@19194
   744
(****** setup ATPs as Isabelle methods ******)
mengj@19194
   745
wenzelm@21588
   746
fun atp_meth tac ths ctxt =
mengj@19194
   747
    let val thy = ProofContext.theory_of ctxt
wenzelm@21588
   748
        val _ = ResClause.init thy
wenzelm@21588
   749
        val _ = ResHolClause.init thy
wenzelm@21588
   750
    in Method.SIMPLE_METHOD' (tac ctxt ths) end;
mengj@19194
   751
mengj@19194
   752
fun atp_method tac = Method.thms_ctxt_args (atp_meth tac);
mengj@19194
   753
mengj@19194
   754
(***************************************************************)
mengj@19194
   755
(* automatic ATP invocation                                    *)
mengj@19194
   756
(***************************************************************)
mengj@19194
   757
paulson@17306
   758
(* call prover with settings and problem file for the current subgoal *)
paulson@17764
   759
fun watcher_call_provers sign sg_terms (childin, childout, pid) =
wenzelm@16802
   760
  let
paulson@17422
   761
    fun make_atp_list [] n = []
paulson@17717
   762
      | make_atp_list (sg_term::xs) n =
wenzelm@16802
   763
          let
paulson@17717
   764
            val probfile = prob_pathname n
paulson@17690
   765
            val time = Int.toString (!time_limit)
wenzelm@16802
   766
          in
wenzelm@22130
   767
            Output.debug (fn () => "problem file in watcher_call_provers is " ^ probfile);
paulson@17764
   768
            (*options are separated by Watcher.setting_sep, currently #"%"*)
paulson@17306
   769
            if !prover = "spass"
wenzelm@16802
   770
            then
paulson@19445
   771
              let val spass = helper_path "SPASS_HOME" "SPASS"
paulson@19445
   772
                  val sopts =
paulson@19445
   773
   "-Auto%-SOS=1%-PGiven=0%-PProblem=0%-Splits=0%-FullRed=0%-DocProof%-TimeLimit=" ^ time
wenzelm@21588
   774
              in
paulson@19445
   775
                  ("spass", spass, sopts, probfile) :: make_atp_list xs (n+1)
wenzelm@16802
   776
              end
paulson@17306
   777
            else if !prover = "vampire"
wenzelm@21588
   778
            then
paulson@17819
   779
              let val vampire = helper_path "VAMPIRE_HOME" "vampire"
paulson@21132
   780
                  val vopts = "--mode casc%-t " ^ time  (*what about -m 100000?*)
wenzelm@16802
   781
              in
paulson@19445
   782
                  ("vampire", vampire, vopts, probfile) :: make_atp_list xs (n+1)
wenzelm@16802
   783
              end
wenzelm@21588
   784
             else if !prover = "E"
wenzelm@21588
   785
             then
wenzelm@21588
   786
               let val Eprover = helper_path "E_HOME" "eproof"
wenzelm@21588
   787
               in
wenzelm@21588
   788
                  ("E", Eprover,
paulson@21900
   789
                     "--tstp-in%--tstp-out%-l5%-xAutoDev%-tAutoDev%--silent%--cpu-limit=" ^ time, probfile) ::
wenzelm@21588
   790
                   make_atp_list xs (n+1)
wenzelm@21588
   791
               end
wenzelm@21588
   792
             else error ("Invalid prover name: " ^ !prover)
wenzelm@16802
   793
          end
paulson@15452
   794
paulson@17422
   795
    val atp_list = make_atp_list sg_terms 1
wenzelm@16802
   796
  in
wenzelm@16802
   797
    Watcher.callResProvers(childout,atp_list);
wenzelm@22130
   798
    Output.debug (fn () => "Sent commands to watcher!")
wenzelm@16802
   799
  end
wenzelm@21588
   800
paulson@22193
   801
(*For debugging the generated set of theorem names*)
paulson@21888
   802
fun trace_vector fname =
paulson@22193
   803
  let val path = File.explode_platform_path (fname ^ "_thm_names")
paulson@21888
   804
  in  Vector.app (File.append path o (fn s => s ^ "\n"))  end;
quigley@16357
   805
paulson@20022
   806
(*We write out problem files for each subgoal. Argument probfile generates filenames,
paulson@18986
   807
  and allows the suppression of the suffix "_1" in problem-generation mode.
paulson@18986
   808
  FIXME: does not cope with &&, and it isn't easy because one could have multiple
paulson@18986
   809
  subgoals, each involving &&.*)
paulson@20022
   810
fun write_problem_files probfile (ctxt,th)  =
paulson@18753
   811
  let val goals = Thm.prems_of th
wenzelm@22130
   812
      val _ = Output.debug (fn () => "number of subgoals = " ^ Int.toString (length goals))
paulson@17717
   813
      val thy = ProofContext.theory_of ctxt
paulson@20457
   814
      fun get_neg_subgoals [] _ = []
wenzelm@22865
   815
        | get_neg_subgoals (gl::gls) n = #1 (ResAxioms.neg_conjecture_clauses th n) ::
paulson@21999
   816
                                         get_neg_subgoals gls (n+1)
paulson@20526
   817
      val goal_cls = get_neg_subgoals goals 1
paulson@20457
   818
      val logic = case !linkup_logic_mode of
wenzelm@21588
   819
                Auto => problem_logic_goals (map ((map prop_of)) goal_cls)
wenzelm@21588
   820
              | Fol => FOL
wenzelm@21588
   821
              | Hol => HOL
paulson@20526
   822
      val (included_thms,white_thms) = get_clasimp_atp_lemmas ctxt []
paulson@22382
   823
      val included_cls = included_thms |> ResAxioms.cnf_rules_pairs |> make_unique
paulson@22382
   824
                                       |> restrict_to_logic thy logic
paulson@21470
   825
                                       |> remove_unwanted_clauses
wenzelm@22130
   826
      val _ = Output.debug (fn () => "included clauses = " ^ Int.toString(length included_cls))
paulson@20526
   827
      val white_cls = ResAxioms.cnf_rules_pairs white_thms
paulson@20526
   828
      (*clauses relevant to goal gl*)
mengj@21563
   829
      val axcls_list = map (fn ngcls => get_relevant_clauses thy included_cls white_cls (map prop_of ngcls)) goal_cls
wenzelm@22130
   830
      val _ = app (fn axcls => Output.debug (fn () => "filtered clauses = " ^ Int.toString(length axcls)))
paulson@21070
   831
                  axcls_list
wenzelm@21588
   832
      val writer = if !prover = "spass" then dfg_writer else tptp_writer
paulson@20526
   833
      fun write_all [] [] _ = []
wenzelm@21588
   834
        | write_all (ccls::ccls_list) (axcls::axcls_list) k =
paulson@20868
   835
            let val fname = probfile k
paulson@22217
   836
                val _ = Output.debug (fn () => "About to write file " ^ fname)
paulson@20868
   837
                val axcls = make_unique axcls
paulson@22217
   838
                val _ = Output.debug (fn () => "Conjecture Clauses (before duplicate removal)")
paulson@22217
   839
                val _ = app (fn th => Output.debug (fn _ => string_of_thm th)) ccls
paulson@20868
   840
                val ccls = subtract_cls ccls axcls
paulson@22217
   841
                val _ = Output.debug (fn () => "Conjecture Clauses (AFTER duplicate removal)")
paulson@22217
   842
                val _ = app (fn th => Output.debug (fn _ => string_of_thm th)) ccls
paulson@21431
   843
                val ccltms = map prop_of ccls
paulson@21373
   844
                and axtms = map (prop_of o #1) axcls
paulson@21431
   845
                val subs = tfree_classes_of_terms ccltms
paulson@21431
   846
                and supers = tvar_classes_of_terms axtms
paulson@21431
   847
                and tycons = type_consts_of_terms thy (ccltms@axtms)
paulson@21290
   848
                (*TFrees in conjecture clauses; TVars in axiom clauses*)
paulson@22645
   849
                val (supers',arity_clauses) = ResClause.make_arity_clauses thy tycons supers
paulson@22645
   850
                val _ = Output.debug (fn () => "arity clauses = " ^ Int.toString (length arity_clauses))
paulson@22645
   851
                val classrel_clauses = ResClause.make_classrel_clauses thy subs supers'
wenzelm@22130
   852
                val _ = Output.debug (fn () => "classrel clauses = " ^ Int.toString (length classrel_clauses))
paulson@20868
   853
                val clnames = writer logic ccls fname (axcls,classrel_clauses,arity_clauses) []
paulson@21888
   854
                val thm_names = Vector.fromList clnames
paulson@22193
   855
                val _ = if !Output.debugging then trace_vector fname thm_names else ()
paulson@20870
   856
            in  (thm_names,fname) :: write_all ccls_list axcls_list (k+1)  end
paulson@20870
   857
      val (thm_names_list, filenames) = ListPair.unzip (write_all goal_cls axcls_list 1)
mengj@19194
   858
  in
paulson@20870
   859
      (filenames, thm_names_list)
mengj@19194
   860
  end;
quigley@15644
   861
wenzelm@21588
   862
val last_watcher_pid = ref (NONE : (TextIO.instream * TextIO.outstream *
paulson@17775
   863
                                    Posix.Process.pid * string list) option);
paulson@17775
   864
paulson@17775
   865
fun kill_last_watcher () =
wenzelm@21588
   866
    (case !last_watcher_pid of
paulson@17775
   867
         NONE => ()
wenzelm@21588
   868
       | SOME (_, _, pid, files) =>
wenzelm@22130
   869
          (Output.debug (fn () => "Killing old watcher, pid = " ^ string_of_pid pid);
wenzelm@21588
   870
           Watcher.killWatcher pid;
wenzelm@21588
   871
           ignore (map (try cond_rm_tmp) files)))
wenzelm@22130
   872
     handle OS.SysErr _ => Output.debug (fn () => "Attempt to kill watcher failed");
paulson@17525
   873
paulson@21980
   874
(*writes out the current problems and calls ATPs*)
paulson@21980
   875
fun isar_atp (ctxt, th) =
paulson@17717
   876
  if Thm.no_prems th then ()
wenzelm@16802
   877
  else
wenzelm@16802
   878
    let
paulson@17775
   879
      val _ = kill_last_watcher()
paulson@20870
   880
      val (files,thm_names_list) = write_problem_files prob_pathname (ctxt,th)
paulson@22012
   881
      val (childin, childout, pid) = Watcher.createWatcher (ctxt, th, thm_names_list)
paulson@15608
   882
    in
paulson@17772
   883
      last_watcher_pid := SOME (childin, childout, pid, files);
wenzelm@22130
   884
      Output.debug (fn () => "problem files: " ^ space_implode ", " files);
wenzelm@22130
   885
      Output.debug (fn () => "pid: " ^ string_of_pid pid);
wenzelm@22578
   886
      watcher_call_provers (Thm.theory_of_thm th) (Thm.prems_of th) (childin, childout, pid)
paulson@20954
   887
    end;
paulson@20954
   888
paulson@20954
   889
(*For ML scripts, and primarily, for debugging*)
wenzelm@21588
   890
fun callatp () =
paulson@20954
   891
  let val th = topthm()
paulson@20954
   892
      val ctxt = ProofContext.init (theory_of_thm th)
paulson@21980
   893
  in  isar_atp (ctxt, th)  end;
paulson@15608
   894
wenzelm@21588
   895
val isar_atp_writeonly = setmp print_mode []
paulson@17717
   896
      (fn (ctxt,th) =>
paulson@17717
   897
       if Thm.no_prems th then ()
wenzelm@21588
   898
       else
wenzelm@21588
   899
         let val probfile = if Thm.nprems_of th = 1 then probfile_nosuffix
wenzelm@21588
   900
                            else prob_pathname
paulson@20022
   901
         in ignore (write_problem_files probfile (ctxt,th)) end);
paulson@15452
   902
quigley@16357
   903
wenzelm@22865
   904
(** the Isar toplevel command **)
wenzelm@16802
   905
wenzelm@22865
   906
fun sledgehammer state =
wenzelm@22865
   907
  let
wenzelm@22865
   908
    val (ctxt, (_, goal)) = Proof.get_goal (Toplevel.proof_of state);
wenzelm@22865
   909
    val thy = ProofContext.theory_of ctxt;
wenzelm@16802
   910
  in
wenzelm@22130
   911
    Output.debug (fn () => "subgoals in isar_atp:\n" ^
wenzelm@21588
   912
                  Pretty.string_of (ProofContext.pretty_term ctxt
wenzelm@21588
   913
                    (Logic.mk_conjunction_list (Thm.prems_of goal))));
wenzelm@22130
   914
    Output.debug (fn () => "current theory: " ^ Context.theory_name thy);
paulson@20419
   915
    inc hook_count;
wenzelm@22130
   916
    Output.debug (fn () => "in hook for time: " ^ Int.toString (!hook_count));
paulson@16925
   917
    ResClause.init thy;
mengj@19194
   918
    ResHolClause.init thy;
paulson@21132
   919
    if !time_limit > 0 then isar_atp (ctxt, goal)
wenzelm@22865
   920
    else (warning ("Writing problem file only: " ^ !problem_name);
paulson@22193
   921
          isar_atp_writeonly (ctxt, goal))
paulson@19205
   922
  end;
paulson@19205
   923
wenzelm@22865
   924
val _ = OuterSyntax.add_parsers
wenzelm@22865
   925
  [OuterSyntax.command "sledgehammer" "call automatic theorem provers" OuterKeyword.diag
wenzelm@22865
   926
    (Scan.succeed (Toplevel.no_timing o Toplevel.unknown_proof o Toplevel.keep sledgehammer))];
paulson@17091
   927
paulson@15347
   928
end;