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