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