src/HOL/Tools/res_atp.ML
author mengj
Sat Nov 11 23:58:46 2006 +0100 (2006-11-11)
changeset 21311 3556301c18cd
parent 21290 33b6bb5d6ab8
child 21373 18f519614978
permissions -rw-r--r--
Added in is_fol_thms.
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)= 
haftmann@20854
   250
      if is_hol_pred tp then (upgrade_lg HOL lg, insert (op =) t seen) else (lg,insert (op =) t seen) 
mengj@19194
   251
  | pred_lg (t as Free(P,tp)) (lg,seen) =
haftmann@20854
   252
      if is_hol_pred tp then (upgrade_lg HOL lg, insert (op =) t seen) else (lg,insert (op =) t seen)
haftmann@20854
   253
  | pred_lg (t as Var(_,_)) (lg,seen) = (upgrade_lg HOL lg, insert (op =) t seen)
mengj@19194
   254
  | pred_lg P _ = raise PRED_LG(P);
mengj@19194
   255
mengj@19194
   256
mengj@19194
   257
fun lit_lg (Const("Not",_) $ P) (lg,seen) = lit_lg P (lg,seen)
mengj@19194
   258
  | lit_lg P (lg,seen) =
paulson@20457
   259
      let val (pred,args) = strip_comb P
paulson@20457
   260
	  val (lg',seen') = if pred mem seen then (lg,seen) 
paulson@20457
   261
			    else pred_lg pred (lg,seen)
paulson@20457
   262
      in
paulson@20457
   263
	if is_fol_logic lg' then ()
paulson@20457
   264
	else Output.debug ("Found a HOL predicate: " ^ Display.raw_string_of_term pred);
mengj@19194
   265
	term_lg args (lg',seen')
paulson@20457
   266
      end;
mengj@19194
   267
mengj@19194
   268
fun lits_lg [] (lg,seen) = (lg,seen)
mengj@19194
   269
  | lits_lg (lit::lits) (FOL,seen) =
paulson@20457
   270
      let val (lg,seen') = lit_lg lit (FOL,seen)
paulson@20457
   271
      in
paulson@20457
   272
	if is_fol_logic lg then ()
paulson@20457
   273
	else Output.debug ("Found a HOL literal: " ^ Display.raw_string_of_term lit);
mengj@19227
   274
	lits_lg lits (lg,seen')
paulson@20457
   275
      end
mengj@19194
   276
  | lits_lg lits (lg,seen) = (lg,seen);
mengj@19194
   277
mengj@19227
   278
fun dest_disj_aux (Const ("op |", _) $ t $ t') disjs = 
mengj@19227
   279
    dest_disj_aux t (dest_disj_aux t' disjs)
mengj@19227
   280
  | dest_disj_aux t disjs = t::disjs;
mengj@19227
   281
mengj@19227
   282
fun dest_disj t = dest_disj_aux t [];
mengj@19227
   283
mengj@19194
   284
fun logic_of_clause tm (lg,seen) =
mengj@19194
   285
    let val tm' = HOLogic.dest_Trueprop tm
mengj@19227
   286
	val disjs = dest_disj tm'
mengj@19194
   287
    in
mengj@19194
   288
	lits_lg disjs (lg,seen)
mengj@19194
   289
    end;
mengj@19194
   290
mengj@19194
   291
fun logic_of_clauses [] (lg,seen) = (lg,seen)
mengj@19194
   292
  | logic_of_clauses (cls::clss) (FOL,seen) =
mengj@19227
   293
    let val (lg,seen') = logic_of_clause cls (FOL,seen)
wenzelm@19641
   294
	val _ =
wenzelm@19641
   295
          if is_fol_logic lg then ()
paulson@19746
   296
          else Output.debug ("Found a HOL clause: " ^ Display.raw_string_of_term cls)
mengj@19227
   297
    in
mengj@19227
   298
	logic_of_clauses clss (lg,seen')
mengj@19227
   299
    end
mengj@19194
   300
  | logic_of_clauses (cls::clss) (lg,seen) = (lg,seen);
mengj@19194
   301
mengj@19194
   302
fun problem_logic_goals_aux [] (lg,seen) = lg
mengj@19194
   303
  | problem_logic_goals_aux (subgoal::subgoals) (lg,seen) = 
mengj@19194
   304
    problem_logic_goals_aux subgoals (logic_of_clauses subgoal (lg,seen));
mengj@19194
   305
    
mengj@19194
   306
fun problem_logic_goals subgoals = problem_logic_goals_aux subgoals (FOL,[]);
mengj@19194
   307
mengj@21311
   308
fun is_fol_thms ths = ((fst(logic_of_clauses (map prop_of ths) (FOL,[]))) = FOL);
mengj@21311
   309
mengj@19768
   310
(***************************************************************)
mengj@19768
   311
(* Retrieving and filtering lemmas                             *)
mengj@19768
   312
(***************************************************************)
mengj@19768
   313
mengj@19768
   314
(*** white list and black list of lemmas ***)
mengj@19768
   315
mengj@19768
   316
(*The rule subsetI is frequently omitted by the relevance filter.*)
mengj@19768
   317
val whitelist = ref [subsetI]; 
mengj@19768
   318
paulson@20444
   319
(*Names of theorems and theorem lists to be banned. The final numeric suffix of
paulson@20444
   320
  theorem lists is first removed.
paulson@20444
   321
paulson@20444
   322
  These theorems typically produce clauses that are prolific (match too many equality or
mengj@19768
   323
  membership literals) and relate to seldom-used facts. Some duplicate other rules.
mengj@19768
   324
  FIXME: this blacklist needs to be maintained using theory data and added to using
mengj@19768
   325
  an attribute.*)
mengj@19768
   326
val blacklist = ref
paulson@20526
   327
  ["Datatype.prod.size",
paulson@21132
   328
   "Datatype.unit.exhaust", (*"unit" thms cause unsound proofs; unit.nchotomy is caught automatically*)
paulson@21224
   329
   "Datatype.unit.induct", 
paulson@20372
   330
   "Datatype.unit.inducts",
paulson@20526
   331
   "Datatype.unit.split_asm", 
paulson@20372
   332
   "Datatype.unit.split",
paulson@20444
   333
   "Datatype.unit.splits",
mengj@19768
   334
   "Divides.dvd_0_left_iff",
mengj@19768
   335
   "Finite_Set.card_0_eq",
mengj@19768
   336
   "Finite_Set.card_infinite",
mengj@19768
   337
   "Finite_Set.Max_ge",
mengj@19768
   338
   "Finite_Set.Max_in",
mengj@19768
   339
   "Finite_Set.Max_le_iff",
mengj@19768
   340
   "Finite_Set.Max_less_iff",
mengj@19768
   341
   "Finite_Set.max.f_below_strict_below.below_f_conv", (*duplicates in Orderings.*)
mengj@19768
   342
   "Finite_Set.max.f_below_strict_below.strict_below_f_conv", (*duplicates in Orderings.*)
mengj@19768
   343
   "Finite_Set.Min_ge_iff",
mengj@19768
   344
   "Finite_Set.Min_gr_iff",
mengj@19768
   345
   "Finite_Set.Min_in",
mengj@19768
   346
   "Finite_Set.Min_le",
mengj@19768
   347
   "Finite_Set.min_max.below_inf_sup_Inf_Sup.inf_Sup_absorb", 
mengj@19768
   348
   "Finite_Set.min_max.below_inf_sup_Inf_Sup.sup_Inf_absorb", 
mengj@19768
   349
   "Finite_Set.min.f_below_strict_below.below_f_conv",        (*duplicates in Orderings.*)
mengj@19768
   350
   "Finite_Set.min.f_below_strict_below.strict_below_f_conv", (*duplicates in Orderings.*)
paulson@20526
   351
   "Fun.vimage_image_eq",   (*involves an existential quantifier*)
paulson@20526
   352
   "HOL.split_if_asm",     (*splitting theorem*)
paulson@20457
   353
   "HOL.split_if",         (*splitting theorem*)
paulson@20526
   354
   "IntDef.abs_split",
mengj@19768
   355
   "IntDef.Integ.Abs_Integ_inject",
mengj@19768
   356
   "IntDef.Integ.Abs_Integ_inverse",
mengj@19768
   357
   "IntDiv.zdvd_0_left",
mengj@19768
   358
   "List.append_eq_append_conv",
mengj@19768
   359
   "List.hd_Cons_tl",   (*Says everything is [] or Cons. Probably prolific.*)
mengj@19768
   360
   "List.in_listsD",
mengj@19768
   361
   "List.in_listsI",
mengj@19768
   362
   "List.lists.Cons",
mengj@19768
   363
   "List.listsE",
mengj@19768
   364
   "Nat.less_one", (*not directional? obscure*)
mengj@19768
   365
   "Nat.not_gr0",
mengj@19768
   366
   "Nat.one_eq_mult_iff", (*duplicate by symmetry*)
wenzelm@21243
   367
   "Nat.of_nat_0_eq_iff",
wenzelm@21243
   368
   "Nat.of_nat_eq_0_iff",
wenzelm@21243
   369
   "Nat.of_nat_le_0_iff",
mengj@19768
   370
   "NatSimprocs.divide_le_0_iff_number_of",  (*too many clauses*)
mengj@19768
   371
   "NatSimprocs.divide_less_0_iff_number_of",
mengj@19768
   372
   "NatSimprocs.equation_minus_iff_1",  (*not directional*)
mengj@19768
   373
   "NatSimprocs.equation_minus_iff_number_of", (*not directional*)
mengj@19768
   374
   "NatSimprocs.le_minus_iff_1", (*not directional*)
mengj@19768
   375
   "NatSimprocs.le_minus_iff_number_of",  (*not directional*)
mengj@19768
   376
   "NatSimprocs.less_minus_iff_1", (*not directional*)
mengj@19768
   377
   "NatSimprocs.less_minus_iff_number_of", (*not directional*)
mengj@19768
   378
   "NatSimprocs.minus_equation_iff_number_of", (*not directional*)
mengj@19768
   379
   "NatSimprocs.minus_le_iff_1", (*not directional*)
mengj@19768
   380
   "NatSimprocs.minus_le_iff_number_of", (*not directional*)
mengj@19768
   381
   "NatSimprocs.minus_less_iff_1", (*not directional*)
mengj@19768
   382
   "NatSimprocs.mult_le_cancel_left_number_of", (*excessive case analysis*)
mengj@19768
   383
   "NatSimprocs.mult_le_cancel_right_number_of", (*excessive case analysis*)
mengj@19768
   384
   "NatSimprocs.mult_less_cancel_left_number_of", (*excessive case analysis*)
mengj@19768
   385
   "NatSimprocs.mult_less_cancel_right_number_of", (*excessive case analysis*)
mengj@19768
   386
   "NatSimprocs.zero_le_divide_iff_number_of", (*excessive case analysis*)
mengj@19768
   387
   "NatSimprocs.zero_less_divide_iff_number_of",
mengj@19768
   388
   "OrderedGroup.abs_0_eq", (*duplicate by symmetry*)
mengj@19768
   389
   "OrderedGroup.diff_eq_0_iff_eq", (*prolific?*)
mengj@19768
   390
   "OrderedGroup.join_0_eq_0",
mengj@19768
   391
   "OrderedGroup.meet_0_eq_0",
mengj@19768
   392
   "OrderedGroup.pprt_eq_0",   (*obscure*)
mengj@19768
   393
   "OrderedGroup.pprt_eq_id",   (*obscure*)
mengj@19768
   394
   "OrderedGroup.pprt_mono",   (*obscure*)
paulson@20526
   395
   "Orderings.split_max",      (*splitting theorem*)
paulson@20457
   396
   "Orderings.split_min",      (*splitting theorem*)
mengj@19768
   397
   "Parity.even_nat_power",   (*obscure, somewhat prolilfic*)
mengj@19768
   398
   "Parity.power_eq_0_iff_number_of",
mengj@19768
   399
   "Parity.power_le_zero_eq_number_of",   (*obscure and prolific*)
mengj@19768
   400
   "Parity.power_less_zero_eq_number_of",
mengj@19768
   401
   "Parity.zero_le_power_eq_number_of",   (*obscure and prolific*)
mengj@19768
   402
   "Parity.zero_less_power_eq_number_of",   (*obscure and prolific*)
mengj@19768
   403
   "Power.zero_less_power_abs_iff",
paulson@20526
   404
   "Product_Type.split_eta_SetCompr",   (*involves an existential quantifier*)
paulson@20457
   405
   "Product_Type.split_paired_Ball_Sigma",     (*splitting theorem*)
paulson@20457
   406
   "Product_Type.split_paired_Bex_Sigma",      (*splitting theorem*)
paulson@20526
   407
   "Product_Type.split_split_asm",             (*splitting theorem*)
paulson@20457
   408
   "Product_Type.split_split",                 (*splitting theorem*)
paulson@20526
   409
   "Product_Type.unit_abs_eta_conv",
paulson@20526
   410
   "Product_Type.unit_induct",
mengj@19768
   411
   "Relation.diagI",
paulson@20526
   412
   "Relation.Domain_def",   (*involves an existential quantifier*)
paulson@20526
   413
   "Relation.Image_def",   (*involves an existential quantifier*)
mengj@19768
   414
   "Relation.ImageI",
mengj@19768
   415
   "Ring_and_Field.divide_cancel_left", (*fields are seldom used & often prolific*)
mengj@19768
   416
   "Ring_and_Field.divide_cancel_right",
mengj@19768
   417
   "Ring_and_Field.divide_divide_eq_left",
mengj@19768
   418
   "Ring_and_Field.divide_divide_eq_right",
mengj@19768
   419
   "Ring_and_Field.divide_eq_0_iff",
mengj@19768
   420
   "Ring_and_Field.divide_eq_1_iff",
mengj@19768
   421
   "Ring_and_Field.divide_eq_eq_1",
mengj@19768
   422
   "Ring_and_Field.divide_le_0_1_iff",
mengj@19768
   423
   "Ring_and_Field.divide_le_eq_1_neg",  (*obscure and prolific*)
mengj@19768
   424
   "Ring_and_Field.divide_le_eq_1_pos",  (*obscure and prolific*)
mengj@19768
   425
   "Ring_and_Field.divide_less_0_1_iff",
mengj@19768
   426
   "Ring_and_Field.divide_less_eq_1_neg",  (*obscure and prolific*)
mengj@19768
   427
   "Ring_and_Field.divide_less_eq_1_pos",  (*obscure and prolific*)
mengj@19768
   428
   "Ring_and_Field.eq_divide_eq_1", (*duplicate by symmetry*)
mengj@19768
   429
   "Ring_and_Field.field_mult_cancel_left",
mengj@19768
   430
   "Ring_and_Field.field_mult_cancel_right",
mengj@19768
   431
   "Ring_and_Field.inverse_le_iff_le_neg",
mengj@19768
   432
   "Ring_and_Field.inverse_le_iff_le",
mengj@19768
   433
   "Ring_and_Field.inverse_less_iff_less_neg",
mengj@19768
   434
   "Ring_and_Field.inverse_less_iff_less",
mengj@19768
   435
   "Ring_and_Field.le_divide_eq_1_neg", (*obscure and prolific*)
mengj@19768
   436
   "Ring_and_Field.le_divide_eq_1_pos", (*obscure and prolific*)
mengj@19768
   437
   "Ring_and_Field.less_divide_eq_1_neg", (*obscure and prolific*)
mengj@19768
   438
   "Ring_and_Field.less_divide_eq_1_pos", (*obscure and prolific*)
mengj@19768
   439
   "Ring_and_Field.one_eq_divide_iff",  (*duplicate by symmetry*)
paulson@20444
   440
   "Set.ball_simps", "Set.bex_simps",   (*quantifier rewriting: useless*)
paulson@20526
   441
   "Set.Collect_bex_eq",   (*involves an existential quantifier*)
paulson@20526
   442
   "Set.Collect_ex_eq",   (*involves an existential quantifier*)
mengj@19768
   443
   "Set.Diff_eq_empty_iff", (*redundant with paramodulation*)
mengj@19768
   444
   "Set.Diff_insert0",
paulson@20526
   445
   "Set.disjoint_insert",
paulson@20526
   446
   "Set.empty_Union_conv",   (*redundant with paramodulation*)
paulson@20526
   447
   "Set.full_SetCompr_eq",   (*involves an existential quantifier*)
paulson@20526
   448
   "Set.image_Collect",      (*involves an existential quantifier*)
paulson@20526
   449
   "Set.image_def",          (*involves an existential quantifier*)
paulson@20526
   450
   "Set.insert_disjoint",
paulson@20526
   451
   "Set.Int_UNIV",  (*redundant with paramodulation*)
paulson@20526
   452
   "Set.Inter_iff", (*We already have InterI, InterE*)
paulson@20526
   453
   "Set.Inter_UNIV_conv",
mengj@19768
   454
   "Set.psubsetE",    (*too prolific and obscure*)
mengj@19768
   455
   "Set.psubsetI",
mengj@19768
   456
   "Set.singleton_insert_inj_eq'",
mengj@19768
   457
   "Set.singleton_insert_inj_eq",
mengj@19768
   458
   "Set.singletonD",  (*these two duplicate some "insert" lemmas*)
mengj@19768
   459
   "Set.singletonI",
mengj@19768
   460
   "Set.Un_empty", (*redundant with paramodulation*)
paulson@20526
   461
   "Set.UNION_def",   (*involves an existential quantifier*)
mengj@19768
   462
   "Set.Union_empty_conv", (*redundant with paramodulation*)
mengj@19768
   463
   "Set.Union_iff",              (*We already have UnionI, UnionE*)
mengj@19768
   464
   "SetInterval.atLeastAtMost_iff", (*obscure and prolific*)
mengj@19768
   465
   "SetInterval.atLeastLessThan_iff", (*obscure and prolific*)
mengj@19768
   466
   "SetInterval.greaterThanAtMost_iff", (*obscure and prolific*)
mengj@19768
   467
   "SetInterval.greaterThanLessThan_iff", (*obscure and prolific*)
mengj@19768
   468
   "SetInterval.ivl_subset"];  (*excessive case analysis*)
mengj@19768
   469
mengj@19768
   470
mengj@19768
   471
(*These might be prolific but are probably OK, and min and max are basic.
mengj@19768
   472
   "Orderings.max_less_iff_conj", 
mengj@19768
   473
   "Orderings.min_less_iff_conj",
mengj@19768
   474
   "Orderings.min_max.below_inf.below_inf_conv",
mengj@19768
   475
   "Orderings.min_max.below_sup.above_sup_conv",
mengj@19768
   476
Very prolific and somewhat obscure:
mengj@19768
   477
   "Set.InterD",
mengj@19768
   478
   "Set.UnionI",
mengj@19768
   479
*)
mengj@19768
   480
mengj@19768
   481
(*** retrieve lemmas from clasimpset and atpset, may filter them ***)
mengj@19768
   482
mengj@19768
   483
(*Hashing to detect duplicate and variant clauses, e.g. from the [iff] attribute*)
mengj@19768
   484
mengj@19768
   485
exception HASH_CLAUSE and HASH_STRING;
mengj@19768
   486
mengj@19768
   487
(*Catches (for deletion) theorems automatically generated from other theorems*)
mengj@19768
   488
fun insert_suffixed_names ht x = 
mengj@19768
   489
     (Polyhash.insert ht (x^"_iff1", ()); 
mengj@19768
   490
      Polyhash.insert ht (x^"_iff2", ()); 
mengj@19768
   491
      Polyhash.insert ht (x^"_dest", ())); 
mengj@19768
   492
paulson@20444
   493
(*Are all characters in this string digits?*)
paulson@20444
   494
fun all_numeric s = null (String.tokens Char.isDigit s);
paulson@20444
   495
paulson@20444
   496
(*Delete a suffix of the form _\d+*)
paulson@20444
   497
fun delete_numeric_suffix s =
paulson@20444
   498
  case rev (String.fields (fn c => c = #"_") s) of
paulson@20444
   499
      last::rest => 
paulson@20444
   500
          if all_numeric last 
webertj@20446
   501
          then [s, space_implode "_" (rev rest)]
paulson@20444
   502
          else [s]
paulson@20444
   503
    | [] => [s];
paulson@20444
   504
paulson@20457
   505
fun banned_thmlist s =
paulson@20457
   506
  (Sign.base_name s) mem_string ["induct","inducts","split","splits","split_asm"];
paulson@20457
   507
paulson@20757
   508
(*Reject theorems with names like "List.filter.filter_list_def" or
paulson@20823
   509
  "Accessible_Part.acc.defs", as these are definitions arising from packages.
paulson@20823
   510
  FIXME: this will also block definitions within locales*)
paulson@20757
   511
fun is_package_def a =
paulson@20823
   512
   length (NameSpace.unpack a) > 2 andalso 
paulson@20823
   513
   String.isSuffix "_def" a  orelse  String.isSuffix "_defs" a;
paulson@20757
   514
mengj@19768
   515
fun make_banned_test xs = 
mengj@19768
   516
  let val ht = Polyhash.mkTable (Polyhash.hash_string, op =)
mengj@19768
   517
                                (6000, HASH_STRING)
paulson@20757
   518
      fun banned_aux s = 
paulson@20757
   519
            isSome (Polyhash.peek ht s) orelse banned_thmlist s orelse is_package_def s
paulson@20457
   520
      fun banned s = exists banned_aux (delete_numeric_suffix s)
mengj@19768
   521
  in  app (fn x => Polyhash.insert ht (x,())) (!blacklist);
mengj@19768
   522
      app (insert_suffixed_names ht) (!blacklist @ xs); 
mengj@19768
   523
      banned
mengj@19768
   524
  end;
mengj@19768
   525
mengj@19768
   526
(** a hash function from Term.term to int, and also a hash table **)
mengj@19768
   527
val xor_words = List.foldl Word.xorb 0w0;
mengj@19768
   528
mengj@19768
   529
fun hashw_term ((Const(c,_)), w) = Polyhash.hashw_string (c,w)
paulson@20661
   530
  | hashw_term ((Free(a,_)), w) = Polyhash.hashw_string (a,w)
mengj@19768
   531
  | hashw_term ((Var(_,_)), w) = w
paulson@20661
   532
  | hashw_term ((Bound i), w) = Polyhash.hashw_int(i,w)
mengj@19768
   533
  | hashw_term ((Abs(_,_,t)), w) = hashw_term (t, w)
mengj@19768
   534
  | hashw_term ((P$Q), w) = hashw_term (Q, (hashw_term (P, w)));
mengj@19768
   535
paulson@21070
   536
fun hash_literal (Const("Not",_)$P) = Word.notb(hashw_term(P,0w0))
paulson@21070
   537
  | hash_literal P = hashw_term(P,0w0);
mengj@19768
   538
mengj@19768
   539
mengj@19768
   540
fun get_literals (Const("Trueprop",_)$P) lits = get_literals P lits
mengj@19768
   541
  | get_literals (Const("op |",_)$P$Q) lits = get_literals Q (get_literals P lits)
mengj@19768
   542
  | get_literals lit lits = (lit::lits);
mengj@19768
   543
paulson@20457
   544
fun hash_term t = Word.toIntX (xor_words (map hash_literal (get_literals t [])));
mengj@19768
   545
mengj@19768
   546
fun equal_thm (thm1,thm2) = Term.aconv(prop_of thm1, prop_of thm2);
paulson@20457
   547
mengj@19768
   548
(*Create a hash table for clauses, of the given size*)
mengj@19768
   549
fun mk_clause_table n =
paulson@20457
   550
      Polyhash.mkTable (hash_term o prop_of, equal_thm)
mengj@19768
   551
                       (n, HASH_CLAUSE);
mengj@19768
   552
paulson@20457
   553
(*Use a hash table to eliminate duplicates from xs. Argument is a list of
paulson@20868
   554
  (thm * (string * int)) tuples. The theorems are hashed into the table. *)
paulson@20457
   555
fun make_unique xs = 
paulson@20868
   556
  let val ht = mk_clause_table 7000
paulson@20457
   557
  in
paulson@21070
   558
      Output.debug("make_unique gets " ^ Int.toString (length xs) ^ " clauses");
paulson@20868
   559
      app (ignore o Polyhash.peekInsert ht) xs;  
paulson@20868
   560
      Polyhash.listItems ht
paulson@20457
   561
  end;
mengj@19768
   562
paulson@20868
   563
(*Remove existing axiom clauses from the conjecture clauses, as this can dramatically
paulson@20868
   564
  boost an ATP's performance (for some reason)*)
paulson@20868
   565
fun subtract_cls c_clauses ax_clauses = 
paulson@20868
   566
  let val ht = mk_clause_table 2200
paulson@20868
   567
      fun known x = isSome (Polyhash.peek ht x)
paulson@20868
   568
  in
paulson@20868
   569
      app (ignore o Polyhash.peekInsert ht) ax_clauses;  
paulson@20868
   570
      filter (not o known) c_clauses 
paulson@20868
   571
  end;
mengj@19768
   572
paulson@20868
   573
(*Filter axiom clauses, but keep supplied clauses and clauses in whitelist. 
paulson@20868
   574
  Duplicates are removed later.*)
paulson@20457
   575
fun get_relevant_clauses thy cls_thms white_cls goals =
paulson@20868
   576
  white_cls @ (ReduceAxiomsN.relevance_filter thy cls_thms goals);
paulson@20457
   577
mengj@19768
   578
fun display_thms [] = ()
mengj@19768
   579
  | display_thms ((name,thm)::nthms) = 
mengj@19768
   580
      let val nthm = name ^ ": " ^ (string_of_thm thm)
mengj@19768
   581
      in Output.debug nthm; display_thms nthms  end;
mengj@19768
   582
 
paulson@21224
   583
fun all_valid_thms ctxt =
paulson@21224
   584
  PureThy.thms_containing (ProofContext.theory_of ctxt) ([], []) @
paulson@21224
   585
  filter (ProofContext.valid_thms ctxt)
paulson@21224
   586
    (FactIndex.find (ProofContext.fact_index_of ctxt) ([], []));
paulson@21224
   587
paulson@21224
   588
fun multi_name a (th, (n,pairs)) = 
paulson@21224
   589
  (n+1, (a ^ "(" ^ Int.toString n ^ ")", th) :: pairs)
paulson@21224
   590
paulson@21290
   591
fun add_multi_names ((a, []), pairs) = pairs
paulson@21290
   592
  | add_multi_names ((a, [th]), pairs) = (a,th)::pairs
paulson@21290
   593
  | add_multi_names ((a, ths), pairs) = #2 (foldl (multi_name a) (1,pairs) ths);
paulson@21224
   594
paulson@21290
   595
fun is_multi (a, ths) = length ths > 1 orelse String.isSuffix ".axioms" a;
paulson@21290
   596
paulson@21290
   597
(*The single theorems go BEFORE the multiple ones*)
paulson@21290
   598
fun name_thm_pairs ctxt = 
paulson@21290
   599
  let val (mults,singles) = List.partition is_multi (all_valid_thms ctxt)
paulson@21290
   600
  in  foldl add_multi_names (foldl add_multi_names [] mults) singles  end;
paulson@21224
   601
paulson@21224
   602
fun check_named ("",th) = (warning ("No name for theorem " ^ string_of_thm th); false)
paulson@21224
   603
  | check_named (_,th) = true;
paulson@19894
   604
mengj@19768
   605
(* get lemmas from claset, simpset, atpset and extra supplied rules *)
mengj@19768
   606
fun get_clasimp_atp_lemmas ctxt user_thms = 
paulson@19894
   607
  let val included_thms =
paulson@19894
   608
	if !include_all 
paulson@20457
   609
	then (tap (fn ths => Output.debug
paulson@20457
   610
	             ("Including all " ^ Int.toString (length ths) ^ " theorems")) 
paulson@21224
   611
	          (name_thm_pairs ctxt))
paulson@19894
   612
	else 
paulson@19894
   613
	let val claset_thms =
paulson@19894
   614
		if !include_claset then ResAxioms.claset_rules_of_ctxt ctxt
paulson@19894
   615
		else []
paulson@19894
   616
	    val simpset_thms = 
paulson@19894
   617
		if !include_simpset then ResAxioms.simpset_rules_of_ctxt ctxt
paulson@19894
   618
		else []
paulson@19894
   619
	    val atpset_thms =
paulson@19894
   620
		if !include_atpset then ResAxioms.atpset_rules_of_ctxt ctxt
paulson@19894
   621
		else []
paulson@19894
   622
	    val _ = if !Output.show_debug_msgs 
paulson@19894
   623
		    then (Output.debug "ATP theorems: "; display_thms atpset_thms) 
paulson@19894
   624
		    else ()		 
paulson@19894
   625
	in  claset_thms @ simpset_thms @ atpset_thms  end
paulson@21224
   626
      val user_rules = filter check_named 
paulson@21224
   627
                         (map (ResAxioms.pairname)
paulson@21224
   628
			   (if null user_thms then !whitelist else user_thms))
paulson@19894
   629
  in
paulson@21224
   630
      (filter check_named included_thms, user_rules)
paulson@19894
   631
  end;
mengj@19768
   632
paulson@20457
   633
(*Remove lemmas that are banned from the backlist. Also remove duplicates. *)
mengj@19768
   634
fun blacklist_filter thms = 
paulson@19894
   635
  if !run_blacklist_filter then 
paulson@21070
   636
      let val _ = Output.debug("blacklist filter gets " ^ Int.toString (length thms) ^ " theorems")
paulson@21070
   637
          val banned = make_banned_test (map #1 thms)
paulson@19894
   638
	  fun ok (a,_) = not (banned a)
paulson@21070
   639
	  val okthms = filter ok thms
paulson@21070
   640
          val _ = Output.debug("...and returns " ^ Int.toString (length okthms))
paulson@21070
   641
      in  okthms end
paulson@19894
   642
  else thms;
mengj@19768
   643
paulson@21290
   644
(***************************************************************)
paulson@21290
   645
(* Type Classes Present in the Axiom or Conjecture Clauses     *)
paulson@21290
   646
(***************************************************************)
paulson@21290
   647
paulson@21290
   648
fun setinsert (x,s) = Symtab.update (x,()) s;
paulson@21290
   649
paulson@21290
   650
fun add_classes (sorts, cset) = foldl setinsert cset (List.concat sorts);
paulson@21290
   651
paulson@21290
   652
(*Remove this trivial type class*)
paulson@21290
   653
fun delete_type cset = Symtab.delete_safe "HOL.type" cset;
paulson@21290
   654
paulson@21290
   655
fun tvar_classes_of_terms ts =
paulson@21290
   656
  let val sorts_list = map (map #2 o term_tvars) ts
paulson@21290
   657
  in  Symtab.keys (delete_type (foldl add_classes Symtab.empty sorts_list))  end;
paulson@21290
   658
paulson@21290
   659
fun tfree_classes_of_terms ts =
paulson@21290
   660
  let val sorts_list = map (map #2 o term_tfrees) ts
paulson@21290
   661
  in  Symtab.keys (delete_type (foldl add_classes Symtab.empty sorts_list))  end;
paulson@20526
   662
mengj@19194
   663
(***************************************************************)
mengj@19194
   664
(* ATP invocation methods setup                                *)
mengj@19194
   665
(***************************************************************)
mengj@19194
   666
mengj@19194
   667
fun cnf_hyps_thms ctxt = 
wenzelm@20224
   668
    let val ths = Assumption.prems_of ctxt
wenzelm@19617
   669
    in fold (fold (insert Thm.eq_thm) o ResAxioms.skolem_thm) ths [] end;
mengj@19194
   670
paulson@20526
   671
(*Translation mode can be auto-detected, or forced to be first-order or higher-order*)
mengj@19194
   672
datatype mode = Auto | Fol | Hol;
mengj@19194
   673
paulson@19450
   674
val linkup_logic_mode = ref Auto;
paulson@19205
   675
paulson@20526
   676
(*Ensures that no higher-order theorems "leak out"*)
paulson@20526
   677
fun restrict_to_logic logic cls =
wenzelm@20532
   678
  if is_fol_logic logic then filter (Meson.is_fol_term o prop_of o fst) cls 
paulson@20526
   679
	                else cls;
paulson@20526
   680
mengj@20131
   681
fun tptp_writer logic goals filename (axioms,classrels,arities) user_lemmas =
paulson@19445
   682
    if is_fol_logic logic 
paulson@19445
   683
    then ResClause.tptp_write_file goals filename (axioms, classrels, arities)
mengj@20131
   684
    else ResHolClause.tptp_write_file goals filename (axioms, classrels, arities) user_lemmas;
paulson@19445
   685
mengj@20131
   686
fun dfg_writer logic goals filename (axioms,classrels,arities) user_lemmas =
paulson@19445
   687
    if is_fol_logic logic 
paulson@19445
   688
    then ResClause.dfg_write_file goals filename (axioms, classrels, arities)
mengj@20131
   689
    else ResHolClause.dfg_write_file goals filename (axioms, classrels, arities) user_lemmas;
mengj@19194
   690
paulson@20022
   691
(*Called by the oracle-based methods declared in res_atp_methods.ML*)
mengj@19722
   692
fun write_subgoal_file dfg mode ctxt conjectures user_thms n =
mengj@19442
   693
    let val conj_cls = make_clauses conjectures 
paulson@20444
   694
                         |> ResAxioms.assume_abstract_list |> Meson.finish_cnf
mengj@19442
   695
	val hyp_cls = cnf_hyps_thms ctxt
mengj@19194
   696
	val goal_cls = conj_cls@hyp_cls
paulson@20526
   697
	val logic = case mode of 
paulson@20526
   698
                            Auto => problem_logic_goals [map prop_of goal_cls]
paulson@20526
   699
			  | Fol => FOL
paulson@20526
   700
			  | Hol => HOL
paulson@19894
   701
	val (included_thms,user_rules) = get_clasimp_atp_lemmas ctxt user_thms
paulson@20457
   702
	val cla_simp_atp_clauses = included_thms |> blacklist_filter
paulson@20868
   703
	                             |> ResAxioms.cnf_rules_pairs |> make_unique 
paulson@20526
   704
                                     |> restrict_to_logic logic 
mengj@19768
   705
	val user_cls = ResAxioms.cnf_rules_pairs user_rules
paulson@20457
   706
	val thy = ProofContext.theory_of ctxt
paulson@20457
   707
	val axclauses = get_relevant_clauses thy cla_simp_atp_clauses
paulson@20868
   708
	                            user_cls (map prop_of goal_cls) |> make_unique
paulson@20526
   709
	val keep_types = if is_fol_logic logic then !fol_keep_types else is_typed_hol ()
paulson@21290
   710
        val subs = tfree_classes_of_terms (map prop_of goal_cls)
paulson@21290
   711
        and supers = tvar_classes_of_terms (map (prop_of o #1) axclauses)
paulson@21290
   712
        (*TFrees in conjecture clauses; TVars in axiom clauses*)
paulson@21290
   713
        val classrel_clauses = 
paulson@21290
   714
              if keep_types then ResClause.make_classrel_clauses thy subs supers
paulson@21290
   715
              else []
mengj@19194
   716
	val arity_clauses = if keep_types then ResClause.arity_clause_thy thy else []
mengj@19722
   717
        val writer = if dfg then dfg_writer else tptp_writer 
paulson@20757
   718
	and file = atp_input_file()
paulson@20757
   719
	and user_lemmas_names = map #1 user_rules
mengj@19194
   720
    in
paulson@20757
   721
	writer logic goal_cls file (axclauses,classrel_clauses,arity_clauses) user_lemmas_names;
paulson@20757
   722
	Output.debug ("Writing to " ^ file);
paulson@20757
   723
	file
mengj@19194
   724
    end;
mengj@19194
   725
mengj@19194
   726
mengj@19194
   727
(**** remove tmp files ****)
mengj@19194
   728
fun cond_rm_tmp file = 
paulson@20870
   729
    if !Output.show_debug_msgs orelse !destdir <> "" then Output.debug "ATP input kept..." 
paulson@20870
   730
    else OS.FileSys.remove file;
mengj@19194
   731
mengj@19194
   732
mengj@19194
   733
(****** setup ATPs as Isabelle methods ******)
mengj@19194
   734
fun atp_meth' tac ths ctxt = 
mengj@19194
   735
    Method.SIMPLE_METHOD' HEADGOAL
mengj@19194
   736
    (tac ctxt ths);
mengj@19194
   737
mengj@19194
   738
fun atp_meth tac ths ctxt = 
mengj@19194
   739
    let val thy = ProofContext.theory_of ctxt
mengj@19194
   740
	val _ = ResClause.init thy
mengj@19194
   741
	val _ = ResHolClause.init thy
mengj@19194
   742
    in
mengj@19194
   743
	atp_meth' tac ths ctxt
mengj@19194
   744
    end;
mengj@19194
   745
mengj@19194
   746
fun atp_method tac = Method.thms_ctxt_args (atp_meth tac);
mengj@19194
   747
mengj@19194
   748
(***************************************************************)
mengj@19194
   749
(* automatic ATP invocation                                    *)
mengj@19194
   750
(***************************************************************)
mengj@19194
   751
paulson@17306
   752
(* call prover with settings and problem file for the current subgoal *)
paulson@17764
   753
fun watcher_call_provers sign sg_terms (childin, childout, pid) =
wenzelm@16802
   754
  let
paulson@17422
   755
    fun make_atp_list [] n = []
paulson@17717
   756
      | make_atp_list (sg_term::xs) n =
wenzelm@16802
   757
          let
paulson@17717
   758
            val probfile = prob_pathname n
paulson@17690
   759
            val time = Int.toString (!time_limit)
wenzelm@16802
   760
          in
wenzelm@18680
   761
            Output.debug ("problem file in watcher_call_provers is " ^ probfile);
paulson@17764
   762
            (*options are separated by Watcher.setting_sep, currently #"%"*)
paulson@17306
   763
            if !prover = "spass"
wenzelm@16802
   764
            then
paulson@19445
   765
              let val spass = helper_path "SPASS_HOME" "SPASS"
paulson@19445
   766
                  val sopts =
paulson@19445
   767
   "-Auto%-SOS=1%-PGiven=0%-PProblem=0%-Splits=0%-FullRed=0%-DocProof%-TimeLimit=" ^ time
paulson@19445
   768
              in 
paulson@19445
   769
                  ("spass", spass, sopts, probfile) :: make_atp_list xs (n+1)
wenzelm@16802
   770
              end
paulson@17306
   771
            else if !prover = "vampire"
quigley@17235
   772
	    then 
paulson@17819
   773
              let val vampire = helper_path "VAMPIRE_HOME" "vampire"
paulson@21132
   774
                  val vopts = "--mode casc%-t " ^ time  (*what about -m 100000?*)
wenzelm@16802
   775
              in
paulson@19445
   776
                  ("vampire", vampire, vopts, probfile) :: make_atp_list xs (n+1)
wenzelm@16802
   777
              end
paulson@17306
   778
      	     else if !prover = "E"
paulson@17306
   779
      	     then
paulson@17819
   780
	       let val Eprover = helper_path "E_HOME" "eproof"
paulson@17306
   781
	       in
paulson@19445
   782
		  ("E", Eprover, 
paulson@21224
   783
		     "--tptp-in%-l5%-xAutoDev%-tAutoDev%--silent%--cpu-limit=" ^ time, probfile) ::
paulson@19445
   784
		   make_atp_list xs (n+1)
paulson@17306
   785
	       end
paulson@17306
   786
	     else error ("Invalid prover name: " ^ !prover)
wenzelm@16802
   787
          end
paulson@15452
   788
paulson@17422
   789
    val atp_list = make_atp_list sg_terms 1
wenzelm@16802
   790
  in
wenzelm@16802
   791
    Watcher.callResProvers(childout,atp_list);
wenzelm@18680
   792
    Output.debug "Sent commands to watcher!"
wenzelm@16802
   793
  end
paulson@20022
   794
  
paulson@20022
   795
fun trace_array fname =
paulson@20995
   796
  let val path = File.unpack_platform_path fname
paulson@20022
   797
  in  Array.app (File.append path o (fn s => s ^ "\n"))  end;
quigley@16357
   798
paulson@20457
   799
(*Converting a subgoal into negated conjecture clauses*)
paulson@20457
   800
fun neg_clauses th n =
paulson@20457
   801
  let val tacs = [rtac ccontr, ObjectLogic.atomize_tac, skolemize_tac]
paulson@20457
   802
      val st = Seq.hd (EVERY' tacs n th)
paulson@20457
   803
      val negs = Option.valOf (metahyps_thms n st)
paulson@20457
   804
  in make_clauses negs |> ResAxioms.assume_abstract_list |> Meson.finish_cnf end;
paulson@20457
   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
mengj@19194
   812
      val _ = Output.debug ("number of subgoals = " ^ Int.toString (length goals))
paulson@17717
   813
      val thy = ProofContext.theory_of ctxt
paulson@20457
   814
      fun get_neg_subgoals [] _ = []
paulson@20526
   815
        | get_neg_subgoals (gl::gls) n = neg_clauses th n :: get_neg_subgoals gls (n+1)
paulson@20526
   816
      val goal_cls = get_neg_subgoals goals 1
paulson@20457
   817
      val logic = case !linkup_logic_mode of
paulson@20526
   818
		Auto => problem_logic_goals (map ((map prop_of)) goal_cls)
paulson@20457
   819
	      | Fol => FOL
paulson@20457
   820
	      | Hol => HOL
paulson@20526
   821
      val (included_thms,white_thms) = get_clasimp_atp_lemmas ctxt []
paulson@20526
   822
      val included_cls = included_thms |> blacklist_filter
paulson@20868
   823
                                       |> ResAxioms.cnf_rules_pairs |> make_unique 
paulson@20526
   824
                                       |> restrict_to_logic logic 
paulson@21070
   825
      val _ = Output.debug ("clauses = " ^ Int.toString(length included_cls))
paulson@20526
   826
      val white_cls = ResAxioms.cnf_rules_pairs white_thms
paulson@20526
   827
      (*clauses relevant to goal gl*)
paulson@20526
   828
      val axcls_list = map (fn gl => get_relevant_clauses thy included_cls white_cls [gl])
paulson@20526
   829
                           goals
paulson@21070
   830
      val _ = app (fn axcls => Output.debug ("filtered clauses = " ^ Int.toString(length axcls)))
paulson@21070
   831
                  axcls_list
paulson@20457
   832
      val keep_types = if is_fol_logic logic then !ResClause.keep_types 
paulson@20457
   833
                       else is_typed_hol ()
paulson@20457
   834
      val arity_clauses = if keep_types then ResClause.arity_clause_thy thy 
paulson@20457
   835
                          else []
wenzelm@18680
   836
      val _ = Output.debug ("arity clauses = " ^ Int.toString (length arity_clauses))
mengj@19718
   837
      val writer = if !prover = "spass" then dfg_writer else tptp_writer 
paulson@20526
   838
      fun write_all [] [] _ = []
paulson@20526
   839
	| write_all (ccls::ccls_list) (axcls::axcls_list) k =
paulson@20868
   840
            let val fname = probfile k
paulson@20868
   841
                val axcls = make_unique axcls
paulson@20868
   842
                val ccls = subtract_cls ccls axcls
paulson@21290
   843
                val subs = tfree_classes_of_terms (map prop_of ccls)
paulson@21290
   844
                and supers = tvar_classes_of_terms (map (prop_of o #1) axcls)
paulson@21290
   845
                (*TFrees in conjecture clauses; TVars in axiom clauses*)
paulson@21290
   846
                val classrel_clauses = 
paulson@21290
   847
                      if keep_types then ResClause.make_classrel_clauses thy subs supers
paulson@21290
   848
                      else []
paulson@21290
   849
                val _ = Output.debug ("classrel clauses = " ^ Int.toString (length classrel_clauses))
paulson@20868
   850
                val clnames = writer logic ccls fname (axcls,classrel_clauses,arity_clauses) []
paulson@20870
   851
                val thm_names = Array.fromList clnames
paulson@20870
   852
                val _ = if !Output.show_debug_msgs 
paulson@20870
   853
                        then trace_array (fname ^ "_thm_names") thm_names else ()
paulson@20870
   854
            in  (thm_names,fname) :: write_all ccls_list axcls_list (k+1)  end
paulson@20870
   855
      val (thm_names_list, filenames) = ListPair.unzip (write_all goal_cls axcls_list 1)
mengj@19194
   856
  in
paulson@20870
   857
      (filenames, thm_names_list)
mengj@19194
   858
  end;
quigley@15644
   859
paulson@17775
   860
val last_watcher_pid = ref (NONE : (TextIO.instream * TextIO.outstream * 
paulson@17775
   861
                                    Posix.Process.pid * string list) option);
paulson@17775
   862
paulson@17775
   863
fun kill_last_watcher () =
paulson@17775
   864
    (case !last_watcher_pid of 
paulson@17775
   865
         NONE => ()
paulson@19445
   866
       | SOME (_, _, pid, files) => 
wenzelm@18680
   867
	  (Output.debug ("Killing old watcher, pid = " ^ string_of_pid pid);
paulson@17775
   868
	   Watcher.killWatcher pid;  
paulson@20870
   869
	   ignore (map (try cond_rm_tmp) files)))
wenzelm@18680
   870
     handle OS.SysErr _ => Output.debug "Attempt to kill watcher failed";
paulson@17525
   871
paulson@17525
   872
(*writes out the current clasimpset to a tptp file;
paulson@17525
   873
  turns off xsymbol at start of function, restoring it at end    *)
paulson@20954
   874
fun isar_atp_body (ctxt, th) =
paulson@17717
   875
  if Thm.no_prems th then ()
wenzelm@16802
   876
  else
wenzelm@16802
   877
    let
paulson@17775
   878
      val _ = kill_last_watcher()
paulson@20870
   879
      val (files,thm_names_list) = write_problem_files prob_pathname (ctxt,th)
paulson@20870
   880
      val (childin, childout, pid) = Watcher.createWatcher (th, thm_names_list)
paulson@15608
   881
    in
paulson@17772
   882
      last_watcher_pid := SOME (childin, childout, pid, files);
wenzelm@18680
   883
      Output.debug ("problem files: " ^ space_implode ", " files); 
wenzelm@18680
   884
      Output.debug ("pid: " ^ string_of_pid pid);
paulson@17717
   885
      watcher_call_provers (sign_of_thm th) (Thm.prems_of th) (childin, childout, pid)
paulson@20954
   886
    end;
paulson@20954
   887
paulson@20954
   888
val isar_atp = setmp print_mode [] isar_atp_body;
paulson@20954
   889
paulson@20954
   890
(*For ML scripts, and primarily, for debugging*)
paulson@20954
   891
fun callatp () = 
paulson@20954
   892
  let val th = topthm()
paulson@20954
   893
      val ctxt = ProofContext.init (theory_of_thm th)
paulson@20954
   894
  in  isar_atp_body (ctxt, th)  end;
paulson@15608
   895
paulson@17422
   896
val isar_atp_writeonly = setmp print_mode [] 
paulson@17717
   897
      (fn (ctxt,th) =>
paulson@17717
   898
       if Thm.no_prems th then ()
paulson@17717
   899
       else 
paulson@20022
   900
         let val probfile = if Thm.nprems_of th = 1 then probfile_nosuffix 
paulson@20022
   901
          	            else prob_pathname
paulson@20022
   902
         in ignore (write_problem_files probfile (ctxt,th)) end);
paulson@15452
   903
quigley@16357
   904
wenzelm@16802
   905
(** the Isar toplevel hook **)
wenzelm@16802
   906
paulson@19205
   907
fun invoke_atp_ml (ctxt, goal) =
paulson@19205
   908
  let val thy = ProofContext.theory_of ctxt;
wenzelm@16802
   909
  in
wenzelm@18680
   910
    Output.debug ("subgoals in isar_atp:\n" ^ 
paulson@19205
   911
		  Pretty.string_of (ProofContext.pretty_term ctxt
paulson@19205
   912
		    (Logic.mk_conjunction_list (Thm.prems_of goal))));
wenzelm@18680
   913
    Output.debug ("current theory: " ^ Context.theory_name thy);
paulson@20419
   914
    inc hook_count;
wenzelm@18680
   915
    Output.debug ("in hook for time: " ^ Int.toString (!hook_count));
paulson@16925
   916
    ResClause.init thy;
mengj@19194
   917
    ResHolClause.init thy;
paulson@21132
   918
    if !time_limit > 0 then isar_atp (ctxt, goal)
paulson@21132
   919
    else (warning "Writing problem file only"; isar_atp_writeonly (ctxt, goal))
paulson@19205
   920
  end;
paulson@19205
   921
paulson@19205
   922
val invoke_atp = Toplevel.no_timing o Toplevel.unknown_proof o Toplevel.keep
paulson@19205
   923
 (fn state =>
paulson@19205
   924
  let val (ctxt, (_, goal)) = Proof.get_goal (Toplevel.proof_of state)
paulson@19205
   925
  in  invoke_atp_ml (ctxt, goal)  end);
quigley@16357
   926
paulson@17091
   927
val call_atpP =
paulson@17746
   928
  OuterSyntax.command 
paulson@17091
   929
    "ProofGeneral.call_atp" 
paulson@17091
   930
    "call automatic theorem provers" 
paulson@17091
   931
    OuterKeyword.diag
paulson@19205
   932
    (Scan.succeed invoke_atp);
paulson@17091
   933
paulson@17091
   934
val _ = OuterSyntax.add_parsers [call_atpP];
paulson@17091
   935
paulson@15347
   936
end;