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