src/HOL/Tools/res_atp.ML
author mengj
Sun Jun 04 10:52:47 2006 +0200 (2006-06-04)
changeset 19768 9afd9b9c47d0
parent 19746 9ac97dc14214
child 19894 7c7e15b27145
permissions -rw-r--r--
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj@19194
     1
(*  Author: Jia Meng, Cambridge University Computer Laboratory, NICTA
paulson@15608
     2
    ID: $Id$
paulson@15608
     3
    Copyright 2004 University of Cambridge
paulson@15347
     4
paulson@15347
     5
ATPs with TPTP format input.
paulson@15347
     6
*)
paulson@15452
     7
wenzelm@16802
     8
signature RES_ATP =
wenzelm@16802
     9
sig
paulson@17306
    10
  val prover: string ref
wenzelm@16802
    11
  val custom_spass: string list ref
paulson@17484
    12
  val destdir: string ref
paulson@17849
    13
  val helper_path: string -> string -> string
paulson@17484
    14
  val problem_name: string ref
paulson@17690
    15
  val time_limit: int ref
mengj@19194
    16
   
mengj@19194
    17
  datatype mode = Auto | Fol | Hol
paulson@19450
    18
  val linkup_logic_mode : mode ref
mengj@19722
    19
  val write_subgoal_file: bool -> mode -> Proof.context -> thm list -> thm list -> int -> string
mengj@19194
    20
  val vampire_time: int ref
mengj@19194
    21
  val eprover_time: int ref
mengj@19722
    22
  val spass_time: int ref
mengj@19194
    23
  val run_vampire: int -> unit
mengj@19194
    24
  val run_eprover: int -> unit
mengj@19722
    25
  val run_spass: int -> unit
mengj@19194
    26
  val vampireLimit: unit -> int
mengj@19194
    27
  val eproverLimit: unit -> int
mengj@19722
    28
  val spassLimit: unit -> int
paulson@19205
    29
  val atp_method: (ProofContext.context -> thm list -> int -> Tactical.tactic) ->
mengj@19194
    30
		  Method.src -> ProofContext.context -> Method.method
mengj@19194
    31
  val cond_rm_tmp: string -> unit
mengj@19194
    32
  val keep_atp_input: bool ref
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
mengj@19194
    39
  val run_relevance_filter: bool ref
mengj@19768
    40
  val run_blacklist_filter: bool ref
paulson@19205
    41
  val invoke_atp_ml : ProofContext.context * thm -> unit
mengj@19227
    42
  val add_claset : unit -> unit
mengj@19227
    43
  val add_simpset : unit -> unit
mengj@19227
    44
  val add_clasimp : unit -> unit
mengj@19227
    45
  val add_atpset : unit -> unit
mengj@19227
    46
  val rm_claset : unit -> unit
mengj@19227
    47
  val rm_simpset : unit -> unit
mengj@19227
    48
  val rm_atpset : unit -> unit
mengj@19227
    49
  val rm_clasimp : unit -> unit
paulson@15347
    50
end;
paulson@15347
    51
paulson@19205
    52
structure ResAtp : RES_ATP =
paulson@15347
    53
struct
paulson@15347
    54
mengj@19194
    55
(********************************************************************)
mengj@19194
    56
(* some settings for both background automatic ATP calling procedure*)
mengj@19194
    57
(* and also explicit ATP invocation methods                         *)
mengj@19194
    58
(********************************************************************)
mengj@19194
    59
mengj@19194
    60
(*** background linkup ***)
mengj@19194
    61
val call_atp = ref false; 
quigley@17150
    62
val hook_count = ref 0;
paulson@18675
    63
val time_limit = ref 30;
paulson@17404
    64
val prover = ref "E";   (* use E as the default prover *)
paulson@17305
    65
val custom_spass =   (*specialized options for SPASS*)
paulson@17690
    66
      ref ["-Auto=0","-FullRed=0","-IORe","-IOFc","-RTaut","-RFSub","-RBSub"];
paulson@17484
    67
val destdir = ref "";   (*Empty means write files to /tmp*)
paulson@17484
    68
val problem_name = ref "prob";
paulson@17484
    69
paulson@17819
    70
(*Return the path to a "helper" like SPASS or tptp2X, first checking that
paulson@17819
    71
  it exists.  FIXME: modify to use Path primitives and move to some central place.*)  
paulson@17819
    72
fun helper_path evar base =
paulson@17819
    73
  case getenv evar of
paulson@17819
    74
      "" => error  ("Isabelle environment variable " ^ evar ^ " not defined")
paulson@17819
    75
    | home => 
paulson@17819
    76
        let val path = home ^ "/" ^ base
paulson@17819
    77
        in  if File.exists (File.unpack_platform_path path) then path 
paulson@17819
    78
	    else error ("Could not find the file " ^ path)
paulson@17819
    79
	end;  
paulson@17819
    80
paulson@17717
    81
fun probfile_nosuffix _ = 
paulson@17484
    82
  if !destdir = "" then File.platform_path (File.tmp_path (Path.basic (!problem_name)))
paulson@17484
    83
  else if File.exists (File.unpack_platform_path (!destdir))
paulson@17484
    84
  then !destdir ^ "/" ^ !problem_name
paulson@17484
    85
  else error ("No such directory: " ^ !destdir);
quigley@15644
    86
paulson@17717
    87
fun prob_pathname n = probfile_nosuffix n ^ "_" ^ Int.toString n;
paulson@17717
    88
mengj@19194
    89
mengj@19194
    90
(*** ATP methods ***)
mengj@19194
    91
val vampire_time = ref 60;
mengj@19194
    92
val eprover_time = ref 60;
mengj@19722
    93
val spass_time = ref 60;
mengj@19722
    94
mengj@19194
    95
fun run_vampire time =  
mengj@19194
    96
    if (time >0) then vampire_time:= time
mengj@19194
    97
    else vampire_time:=60;
mengj@19194
    98
mengj@19194
    99
fun run_eprover time = 
mengj@19194
   100
    if (time > 0) then eprover_time:= time
mengj@19194
   101
    else eprover_time:=60;
mengj@19194
   102
mengj@19722
   103
fun run_spass time = 
mengj@19722
   104
    if (time > 0) then spass_time:=time
mengj@19722
   105
    else spass_time:=60;
mengj@19722
   106
mengj@19722
   107
mengj@19194
   108
fun vampireLimit () = !vampire_time;
mengj@19194
   109
fun eproverLimit () = !eprover_time;
mengj@19722
   110
fun spassLimit () = !spass_time;
mengj@19194
   111
mengj@19194
   112
val keep_atp_input = ref false;
mengj@19194
   113
val fol_keep_types = ResClause.keep_types;
mengj@19194
   114
val hol_full_types = ResHolClause.full_types;
mengj@19194
   115
val hol_partial_types = ResHolClause.partial_types;
mengj@19194
   116
val hol_const_types_only = ResHolClause.const_types_only;
mengj@19194
   117
val hol_no_types = ResHolClause.no_types;
mengj@19194
   118
fun hol_typ_level () = ResHolClause.find_typ_level ();
mengj@19194
   119
fun is_typed_hol () = 
mengj@19194
   120
    let val tp_level = hol_typ_level()
mengj@19194
   121
    in
mengj@19194
   122
	not (tp_level = ResHolClause.T_NONE)
mengj@19194
   123
    end;
mengj@19194
   124
val include_combS = ResHolClause.include_combS;
mengj@19194
   125
val include_min_comb = ResHolClause.include_min_comb;
mengj@19194
   126
mengj@19194
   127
fun atp_input_file () =
mengj@19194
   128
    let val file = !problem_name 
mengj@19194
   129
    in
mengj@19194
   130
	if !destdir = "" then File.platform_path (File.tmp_path (Path.basic file))
mengj@19194
   131
	else if File.exists (File.unpack_platform_path (!destdir))
mengj@19194
   132
	then !destdir ^ "/" ^ file
mengj@19194
   133
	else error ("No such directory: " ^ !destdir)
mengj@19194
   134
    end;
mengj@19194
   135
mengj@19194
   136
val include_simpset = ref false;
mengj@19194
   137
val include_claset = ref false; 
mengj@19194
   138
val include_atpset = ref true;
mengj@19194
   139
val add_simpset = (fn () => include_simpset:=true);
mengj@19194
   140
val add_claset = (fn () => include_claset:=true);
mengj@19227
   141
val add_clasimp = (fn () => (include_simpset:=true;include_claset:=true));
mengj@19194
   142
val add_atpset = (fn () => include_atpset:=true);
mengj@19194
   143
val rm_simpset = (fn () => include_simpset:=false);
mengj@19194
   144
val rm_claset = (fn () => include_claset:=false);
mengj@19227
   145
val rm_clasimp = (fn () => (include_simpset:=false;include_claset:=false));
mengj@19194
   146
val rm_atpset = (fn () => include_atpset:=false);
mengj@19194
   147
mengj@19194
   148
mengj@19194
   149
(**** relevance filter ****)
mengj@19194
   150
val run_relevance_filter = ref true;
mengj@19768
   151
val run_blacklist_filter = ref true;
mengj@19194
   152
mengj@19194
   153
(******************************************************************)
mengj@19194
   154
(* detect whether a given problem (clauses) is FOL/HOL/HOLC/HOLCS *)
mengj@19194
   155
(******************************************************************)
mengj@19194
   156
mengj@19194
   157
datatype logic = FOL | HOL | HOLC | HOLCS;
mengj@19194
   158
mengj@19194
   159
fun string_of_logic FOL = "FOL"
mengj@19194
   160
  | string_of_logic HOL = "HOL"
mengj@19194
   161
  | string_of_logic HOLC = "HOLC"
mengj@19194
   162
  | string_of_logic HOLCS = "HOLCS";
mengj@19194
   163
mengj@19194
   164
mengj@19194
   165
fun is_fol_logic FOL = true
mengj@19194
   166
  | is_fol_logic  _ = false
mengj@19194
   167
mengj@19194
   168
mengj@19194
   169
(*HOLCS will not occur here*)
mengj@19194
   170
fun upgrade_lg HOLC _ = HOLC
mengj@19194
   171
  | upgrade_lg HOL HOLC = HOLC
mengj@19194
   172
  | upgrade_lg HOL _ = HOL
mengj@19194
   173
  | upgrade_lg FOL lg = lg; 
mengj@19194
   174
mengj@19194
   175
(* check types *)
mengj@19451
   176
fun has_bool_hfn (Type("bool",_)) = true
mengj@19451
   177
  | has_bool_hfn (Type("fun",_)) = true
mengj@19451
   178
  | has_bool_hfn (Type(_, Ts)) = exists has_bool_hfn Ts
mengj@19451
   179
  | has_bool_hfn _ = false;
mengj@19194
   180
mengj@19451
   181
fun is_hol_fn tp =
mengj@19194
   182
    let val (targs,tr) = strip_type tp
mengj@19194
   183
    in
mengj@19451
   184
	exists (has_bool_hfn) (tr::targs)
mengj@19194
   185
    end;
mengj@19194
   186
mengj@19451
   187
fun is_hol_pred tp =
mengj@19451
   188
    let val (targs,tr) = strip_type tp
mengj@19451
   189
    in
mengj@19451
   190
	exists (has_bool_hfn) targs
mengj@19451
   191
    end;
mengj@19194
   192
mengj@19194
   193
exception FN_LG of term;
mengj@19194
   194
mengj@19194
   195
fun fn_lg (t as Const(f,tp)) (lg,seen) = 
mengj@19451
   196
    if is_hol_fn tp then (upgrade_lg HOL lg, t ins seen) else (lg, t ins seen) 
mengj@19194
   197
  | fn_lg (t as Free(f,tp)) (lg,seen) = 
mengj@19451
   198
    if is_hol_fn tp then (upgrade_lg HOL lg, t ins seen) else (lg, t ins seen) 
mengj@19194
   199
  | fn_lg (t as Var(f,tp)) (lg,seen) =
mengj@19451
   200
    if is_hol_fn tp then (upgrade_lg HOL lg,t ins seen) else (lg,t ins seen)
mengj@19194
   201
  | fn_lg (t as Abs(_,_,_)) (lg,seen) = (upgrade_lg HOLC lg,t ins seen)
mengj@19194
   202
  | fn_lg f _ = raise FN_LG(f); 
mengj@19194
   203
mengj@19194
   204
mengj@19194
   205
fun term_lg [] (lg,seen) = (lg,seen)
mengj@19194
   206
  | term_lg (tm::tms) (FOL,seen) =
mengj@19194
   207
    let val (f,args) = strip_comb tm
mengj@19194
   208
	val (lg',seen') = if f mem seen then (FOL,seen) 
mengj@19194
   209
			  else fn_lg f (FOL,seen)
wenzelm@19641
   210
	val _ =
wenzelm@19641
   211
          if is_fol_logic lg' then ()
paulson@19746
   212
          else Output.debug ("Found a HOL term: " ^ Display.raw_string_of_term f)
mengj@19194
   213
	 in
mengj@19194
   214
	     term_lg (args@tms) (lg',seen')
mengj@19194
   215
    end
mengj@19194
   216
  | term_lg _ (lg,seen) = (lg,seen)
mengj@19194
   217
mengj@19194
   218
exception PRED_LG of term;
mengj@19194
   219
mengj@19194
   220
fun pred_lg (t as Const(P,tp)) (lg,seen)= 
mengj@19451
   221
    if is_hol_pred tp then (upgrade_lg HOL lg, t ins seen) else (lg,t ins seen) 
mengj@19194
   222
  | pred_lg (t as Free(P,tp)) (lg,seen) =
mengj@19451
   223
    if is_hol_pred tp then (upgrade_lg HOL lg, t ins seen) else (lg,t ins seen)
mengj@19194
   224
  | pred_lg (t as Var(_,_)) (lg,seen) = (upgrade_lg HOL lg, t ins seen)
mengj@19194
   225
  | pred_lg P _ = raise PRED_LG(P);
mengj@19194
   226
mengj@19194
   227
mengj@19194
   228
fun lit_lg (Const("Not",_) $ P) (lg,seen) = lit_lg P (lg,seen)
mengj@19194
   229
  | lit_lg P (lg,seen) =
mengj@19194
   230
    let val (pred,args) = strip_comb P
mengj@19194
   231
	val (lg',seen') = if pred mem seen then (lg,seen) 
mengj@19194
   232
			  else pred_lg pred (lg,seen)
wenzelm@19641
   233
	val _ =
wenzelm@19641
   234
          if is_fol_logic lg' then ()
paulson@19746
   235
          else Output.debug ("Found a HOL predicate: " ^ Display.raw_string_of_term pred)
mengj@19194
   236
    in
mengj@19194
   237
	term_lg args (lg',seen')
mengj@19194
   238
    end;
mengj@19194
   239
mengj@19194
   240
fun lits_lg [] (lg,seen) = (lg,seen)
mengj@19194
   241
  | lits_lg (lit::lits) (FOL,seen) =
mengj@19227
   242
    let val (lg,seen') = lit_lg lit (FOL,seen)
wenzelm@19641
   243
	val _ =
wenzelm@19641
   244
          if is_fol_logic lg then ()
paulson@19746
   245
          else Output.debug ("Found a HOL literal: " ^ Display.raw_string_of_term lit)
mengj@19227
   246
    in
mengj@19227
   247
	lits_lg lits (lg,seen')
mengj@19227
   248
    end
mengj@19194
   249
  | lits_lg lits (lg,seen) = (lg,seen);
mengj@19194
   250
mengj@19194
   251
mengj@19227
   252
fun dest_disj_aux (Const ("op |", _) $ t $ t') disjs = 
mengj@19227
   253
    dest_disj_aux t (dest_disj_aux t' disjs)
mengj@19227
   254
  | dest_disj_aux t disjs = t::disjs;
mengj@19227
   255
mengj@19227
   256
fun dest_disj t = dest_disj_aux t [];
mengj@19227
   257
mengj@19194
   258
fun logic_of_clause tm (lg,seen) =
mengj@19194
   259
    let val tm' = HOLogic.dest_Trueprop tm
mengj@19227
   260
	val disjs = dest_disj tm'
mengj@19194
   261
    in
mengj@19194
   262
	lits_lg disjs (lg,seen)
mengj@19194
   263
    end;
mengj@19194
   264
mengj@19194
   265
fun logic_of_clauses [] (lg,seen) = (lg,seen)
mengj@19194
   266
  | logic_of_clauses (cls::clss) (FOL,seen) =
mengj@19227
   267
    let val (lg,seen') = logic_of_clause cls (FOL,seen)
wenzelm@19641
   268
	val _ =
wenzelm@19641
   269
          if is_fol_logic lg then ()
paulson@19746
   270
          else Output.debug ("Found a HOL clause: " ^ Display.raw_string_of_term cls)
mengj@19227
   271
    in
mengj@19227
   272
	logic_of_clauses clss (lg,seen')
mengj@19227
   273
    end
mengj@19194
   274
  | logic_of_clauses (cls::clss) (lg,seen) = (lg,seen);
mengj@19194
   275
mengj@19194
   276
fun problem_logic_goals_aux [] (lg,seen) = lg
mengj@19194
   277
  | problem_logic_goals_aux (subgoal::subgoals) (lg,seen) = 
mengj@19194
   278
    problem_logic_goals_aux subgoals (logic_of_clauses subgoal (lg,seen));
mengj@19194
   279
    
mengj@19194
   280
fun problem_logic_goals subgoals = problem_logic_goals_aux subgoals (FOL,[]);
mengj@19194
   281
mengj@19768
   282
(***************************************************************)
mengj@19768
   283
(* Retrieving and filtering lemmas                             *)
mengj@19768
   284
(***************************************************************)
mengj@19768
   285
mengj@19768
   286
(*** white list and black list of lemmas ***)
mengj@19768
   287
mengj@19768
   288
(*The rule subsetI is frequently omitted by the relevance filter.*)
mengj@19768
   289
val whitelist = ref [subsetI]; 
mengj@19768
   290
mengj@19768
   291
(*In general, these produce clauses that are prolific (match too many equality or
mengj@19768
   292
  membership literals) and relate to seldom-used facts. Some duplicate other rules.
mengj@19768
   293
  FIXME: this blacklist needs to be maintained using theory data and added to using
mengj@19768
   294
  an attribute.*)
mengj@19768
   295
val blacklist = ref
mengj@19768
   296
  ["Datatype.prod.size",
mengj@19768
   297
   "Divides.dvd_0_left_iff",
mengj@19768
   298
   "Finite_Set.card_0_eq",
mengj@19768
   299
   "Finite_Set.card_infinite",
mengj@19768
   300
   "Finite_Set.Max_ge",
mengj@19768
   301
   "Finite_Set.Max_in",
mengj@19768
   302
   "Finite_Set.Max_le_iff",
mengj@19768
   303
   "Finite_Set.Max_less_iff",
mengj@19768
   304
   "Finite_Set.max.f_below_strict_below.below_f_conv", (*duplicates in Orderings.*)
mengj@19768
   305
   "Finite_Set.max.f_below_strict_below.strict_below_f_conv", (*duplicates in Orderings.*)
mengj@19768
   306
   "Finite_Set.Min_ge_iff",
mengj@19768
   307
   "Finite_Set.Min_gr_iff",
mengj@19768
   308
   "Finite_Set.Min_in",
mengj@19768
   309
   "Finite_Set.Min_le",
mengj@19768
   310
   "Finite_Set.min_max.below_inf_sup_Inf_Sup.inf_Sup_absorb", 
mengj@19768
   311
   "Finite_Set.min_max.below_inf_sup_Inf_Sup.sup_Inf_absorb", 
mengj@19768
   312
   "Finite_Set.min.f_below_strict_below.below_f_conv",        (*duplicates in Orderings.*)
mengj@19768
   313
   "Finite_Set.min.f_below_strict_below.strict_below_f_conv", (*duplicates in Orderings.*)
mengj@19768
   314
   "IntDef.Integ.Abs_Integ_inject",
mengj@19768
   315
   "IntDef.Integ.Abs_Integ_inverse",
mengj@19768
   316
   "IntDiv.zdvd_0_left",
mengj@19768
   317
   "List.append_eq_append_conv",
mengj@19768
   318
   "List.hd_Cons_tl",   (*Says everything is [] or Cons. Probably prolific.*)
mengj@19768
   319
   "List.in_listsD",
mengj@19768
   320
   "List.in_listsI",
mengj@19768
   321
   "List.lists.Cons",
mengj@19768
   322
   "List.listsE",
mengj@19768
   323
   "Nat.less_one", (*not directional? obscure*)
mengj@19768
   324
   "Nat.not_gr0",
mengj@19768
   325
   "Nat.one_eq_mult_iff", (*duplicate by symmetry*)
mengj@19768
   326
   "NatArith.of_nat_0_eq_iff",
mengj@19768
   327
   "NatArith.of_nat_eq_0_iff",
mengj@19768
   328
   "NatArith.of_nat_le_0_iff",
mengj@19768
   329
   "NatSimprocs.divide_le_0_iff_number_of",  (*too many clauses*)
mengj@19768
   330
   "NatSimprocs.divide_less_0_iff_number_of",
mengj@19768
   331
   "NatSimprocs.equation_minus_iff_1",  (*not directional*)
mengj@19768
   332
   "NatSimprocs.equation_minus_iff_number_of", (*not directional*)
mengj@19768
   333
   "NatSimprocs.le_minus_iff_1", (*not directional*)
mengj@19768
   334
   "NatSimprocs.le_minus_iff_number_of",  (*not directional*)
mengj@19768
   335
   "NatSimprocs.less_minus_iff_1", (*not directional*)
mengj@19768
   336
   "NatSimprocs.less_minus_iff_number_of", (*not directional*)
mengj@19768
   337
   "NatSimprocs.minus_equation_iff_number_of", (*not directional*)
mengj@19768
   338
   "NatSimprocs.minus_le_iff_1", (*not directional*)
mengj@19768
   339
   "NatSimprocs.minus_le_iff_number_of", (*not directional*)
mengj@19768
   340
   "NatSimprocs.minus_less_iff_1", (*not directional*)
mengj@19768
   341
   "NatSimprocs.mult_le_cancel_left_number_of", (*excessive case analysis*)
mengj@19768
   342
   "NatSimprocs.mult_le_cancel_right_number_of", (*excessive case analysis*)
mengj@19768
   343
   "NatSimprocs.mult_less_cancel_left_number_of", (*excessive case analysis*)
mengj@19768
   344
   "NatSimprocs.mult_less_cancel_right_number_of", (*excessive case analysis*)
mengj@19768
   345
   "NatSimprocs.zero_le_divide_iff_number_of", (*excessive case analysis*)
mengj@19768
   346
   "NatSimprocs.zero_less_divide_iff_number_of",
mengj@19768
   347
   "OrderedGroup.abs_0_eq", (*duplicate by symmetry*)
mengj@19768
   348
   "OrderedGroup.diff_eq_0_iff_eq", (*prolific?*)
mengj@19768
   349
   "OrderedGroup.join_0_eq_0",
mengj@19768
   350
   "OrderedGroup.meet_0_eq_0",
mengj@19768
   351
   "OrderedGroup.pprt_eq_0",   (*obscure*)
mengj@19768
   352
   "OrderedGroup.pprt_eq_id",   (*obscure*)
mengj@19768
   353
   "OrderedGroup.pprt_mono",   (*obscure*)
mengj@19768
   354
   "Parity.even_nat_power",   (*obscure, somewhat prolilfic*)
mengj@19768
   355
   "Parity.power_eq_0_iff_number_of",
mengj@19768
   356
   "Parity.power_le_zero_eq_number_of",   (*obscure and prolific*)
mengj@19768
   357
   "Parity.power_less_zero_eq_number_of",
mengj@19768
   358
   "Parity.zero_le_power_eq_number_of",   (*obscure and prolific*)
mengj@19768
   359
   "Parity.zero_less_power_eq_number_of",   (*obscure and prolific*)
mengj@19768
   360
   "Power.zero_less_power_abs_iff",
mengj@19768
   361
   "Relation.diagI",
mengj@19768
   362
   "Relation.ImageI",
mengj@19768
   363
   "Ring_and_Field.divide_cancel_left", (*fields are seldom used & often prolific*)
mengj@19768
   364
   "Ring_and_Field.divide_cancel_right",
mengj@19768
   365
   "Ring_and_Field.divide_divide_eq_left",
mengj@19768
   366
   "Ring_and_Field.divide_divide_eq_right",
mengj@19768
   367
   "Ring_and_Field.divide_eq_0_iff",
mengj@19768
   368
   "Ring_and_Field.divide_eq_1_iff",
mengj@19768
   369
   "Ring_and_Field.divide_eq_eq_1",
mengj@19768
   370
   "Ring_and_Field.divide_le_0_1_iff",
mengj@19768
   371
   "Ring_and_Field.divide_le_eq_1_neg",  (*obscure and prolific*)
mengj@19768
   372
   "Ring_and_Field.divide_le_eq_1_pos",  (*obscure and prolific*)
mengj@19768
   373
   "Ring_and_Field.divide_less_0_1_iff",
mengj@19768
   374
   "Ring_and_Field.divide_less_eq_1_neg",  (*obscure and prolific*)
mengj@19768
   375
   "Ring_and_Field.divide_less_eq_1_pos",  (*obscure and prolific*)
mengj@19768
   376
   "Ring_and_Field.eq_divide_eq_1", (*duplicate by symmetry*)
mengj@19768
   377
   "Ring_and_Field.field_mult_cancel_left",
mengj@19768
   378
   "Ring_and_Field.field_mult_cancel_right",
mengj@19768
   379
   "Ring_and_Field.inverse_le_iff_le_neg",
mengj@19768
   380
   "Ring_and_Field.inverse_le_iff_le",
mengj@19768
   381
   "Ring_and_Field.inverse_less_iff_less_neg",
mengj@19768
   382
   "Ring_and_Field.inverse_less_iff_less",
mengj@19768
   383
   "Ring_and_Field.le_divide_eq_1_neg", (*obscure and prolific*)
mengj@19768
   384
   "Ring_and_Field.le_divide_eq_1_pos", (*obscure and prolific*)
mengj@19768
   385
   "Ring_and_Field.less_divide_eq_1_neg", (*obscure and prolific*)
mengj@19768
   386
   "Ring_and_Field.less_divide_eq_1_pos", (*obscure and prolific*)
mengj@19768
   387
   "Ring_and_Field.one_eq_divide_iff",  (*duplicate by symmetry*)
mengj@19768
   388
   "Set.Diff_eq_empty_iff", (*redundant with paramodulation*)
mengj@19768
   389
   "Set.Diff_insert0",
mengj@19768
   390
   "Set.disjoint_insert_1",
mengj@19768
   391
   "Set.disjoint_insert_2",
mengj@19768
   392
   "Set.empty_Union_conv", (*redundant with paramodulation*)
mengj@19768
   393
   "Set.insert_disjoint_1",
mengj@19768
   394
   "Set.insert_disjoint_2",
mengj@19768
   395
   "Set.Int_UNIV", (*redundant with paramodulation*)
mengj@19768
   396
   "Set.Inter_iff",              (*We already have InterI, InterE*)
mengj@19768
   397
   "Set.Inter_UNIV_conv_1",
mengj@19768
   398
   "Set.Inter_UNIV_conv_2",
mengj@19768
   399
   "Set.psubsetE",    (*too prolific and obscure*)
mengj@19768
   400
   "Set.psubsetI",
mengj@19768
   401
   "Set.singleton_insert_inj_eq'",
mengj@19768
   402
   "Set.singleton_insert_inj_eq",
mengj@19768
   403
   "Set.singletonD",  (*these two duplicate some "insert" lemmas*)
mengj@19768
   404
   "Set.singletonI",
mengj@19768
   405
   "Set.Un_empty", (*redundant with paramodulation*)
mengj@19768
   406
   "Set.Union_empty_conv", (*redundant with paramodulation*)
mengj@19768
   407
   "Set.Union_iff",              (*We already have UnionI, UnionE*)
mengj@19768
   408
   "SetInterval.atLeastAtMost_iff", (*obscure and prolific*)
mengj@19768
   409
   "SetInterval.atLeastLessThan_iff", (*obscure and prolific*)
mengj@19768
   410
   "SetInterval.greaterThanAtMost_iff", (*obscure and prolific*)
mengj@19768
   411
   "SetInterval.greaterThanLessThan_iff", (*obscure and prolific*)
mengj@19768
   412
   "SetInterval.ivl_subset"];  (*excessive case analysis*)
mengj@19768
   413
mengj@19768
   414
mengj@19768
   415
(*These might be prolific but are probably OK, and min and max are basic.
mengj@19768
   416
   "Orderings.max_less_iff_conj", 
mengj@19768
   417
   "Orderings.min_less_iff_conj",
mengj@19768
   418
   "Orderings.min_max.below_inf.below_inf_conv",
mengj@19768
   419
   "Orderings.min_max.below_sup.above_sup_conv",
mengj@19768
   420
Very prolific and somewhat obscure:
mengj@19768
   421
   "Set.InterD",
mengj@19768
   422
   "Set.UnionI",
mengj@19768
   423
*)
mengj@19768
   424
mengj@19768
   425
(*** retrieve lemmas from clasimpset and atpset, may filter them ***)
mengj@19768
   426
mengj@19768
   427
(*The "name" of a theorem is its statement, if nothing else is available.*)
mengj@19768
   428
val plain_string_of_thm =
mengj@19768
   429
    setmp show_question_marks false 
mengj@19768
   430
      (setmp print_mode [] 
mengj@19768
   431
	(Pretty.setmp_margin 999 string_of_thm));
mengj@19768
   432
	
mengj@19768
   433
(*Returns the first substring enclosed in quotation marks, typically omitting 
mengj@19768
   434
  the [.] of meta-level assumptions.*)
mengj@19768
   435
val firstquoted = hd o (String.tokens (fn c => c = #"\""))
mengj@19768
   436
	
mengj@19768
   437
fun fake_thm_name th = 
mengj@19768
   438
    Context.theory_name (theory_of_thm th) ^ "." ^ firstquoted (plain_string_of_thm th);
mengj@19768
   439
mengj@19768
   440
fun put_name_pair ("",th) = (fake_thm_name th, th)
mengj@19768
   441
  | put_name_pair (a,th)  = (a,th);
mengj@19768
   442
mengj@19768
   443
(*Hashing to detect duplicate and variant clauses, e.g. from the [iff] attribute*)
mengj@19768
   444
mengj@19768
   445
exception HASH_CLAUSE and HASH_STRING;
mengj@19768
   446
mengj@19768
   447
(*Catches (for deletion) theorems automatically generated from other theorems*)
mengj@19768
   448
fun insert_suffixed_names ht x = 
mengj@19768
   449
     (Polyhash.insert ht (x^"_iff1", ()); 
mengj@19768
   450
      Polyhash.insert ht (x^"_iff2", ()); 
mengj@19768
   451
      Polyhash.insert ht (x^"_dest", ())); 
mengj@19768
   452
mengj@19768
   453
fun make_banned_test xs = 
mengj@19768
   454
  let val ht = Polyhash.mkTable (Polyhash.hash_string, op =)
mengj@19768
   455
                                (6000, HASH_STRING)
mengj@19768
   456
      fun banned s = isSome (Polyhash.peek ht s)
mengj@19768
   457
  in  app (fn x => Polyhash.insert ht (x,())) (!blacklist);
mengj@19768
   458
      app (insert_suffixed_names ht) (!blacklist @ xs); 
mengj@19768
   459
      banned
mengj@19768
   460
  end;
mengj@19768
   461
mengj@19768
   462
(** a hash function from Term.term to int, and also a hash table **)
mengj@19768
   463
val xor_words = List.foldl Word.xorb 0w0;
mengj@19768
   464
mengj@19768
   465
fun hashw_term ((Const(c,_)), w) = Polyhash.hashw_string (c,w)
mengj@19768
   466
  | hashw_term ((Free(_,_)), w) = w
mengj@19768
   467
  | hashw_term ((Var(_,_)), w) = w
mengj@19768
   468
  | hashw_term ((Bound _), w) = w
mengj@19768
   469
  | hashw_term ((Abs(_,_,t)), w) = hashw_term (t, w)
mengj@19768
   470
  | hashw_term ((P$Q), w) = hashw_term (Q, (hashw_term (P, w)));
mengj@19768
   471
mengj@19768
   472
fun hashw_pred (P,w) = 
mengj@19768
   473
    let val (p,args) = strip_comb P
mengj@19768
   474
    in
mengj@19768
   475
	List.foldl hashw_term w (p::args)
mengj@19768
   476
    end;
mengj@19768
   477
mengj@19768
   478
fun hash_literal (Const("Not",_)$P) = Word.notb(hashw_pred(P,0w0))
mengj@19768
   479
  | hash_literal P = hashw_pred(P,0w0);
mengj@19768
   480
mengj@19768
   481
mengj@19768
   482
fun get_literals (Const("Trueprop",_)$P) lits = get_literals P lits
mengj@19768
   483
  | get_literals (Const("op |",_)$P$Q) lits = get_literals Q (get_literals P lits)
mengj@19768
   484
  | get_literals lit lits = (lit::lits);
mengj@19768
   485
mengj@19768
   486
mengj@19768
   487
fun hash_term term = Word.toIntX (xor_words (map hash_literal (get_literals term [])));
mengj@19768
   488
mengj@19768
   489
fun hash_thm  thm = hash_term (prop_of thm);
mengj@19768
   490
mengj@19768
   491
fun equal_thm (thm1,thm2) = Term.aconv(prop_of thm1, prop_of thm2);
mengj@19768
   492
(*Create a hash table for clauses, of the given size*)
mengj@19768
   493
fun mk_clause_table n =
mengj@19768
   494
      Polyhash.mkTable (hash_thm, equal_thm)
mengj@19768
   495
                       (n, HASH_CLAUSE);
mengj@19768
   496
mengj@19768
   497
(*Use a hash table to eliminate duplicates from xs*)
mengj@19768
   498
fun make_unique ht xs = 
mengj@19768
   499
      (app (ignore o Polyhash.peekInsert ht) xs;  Polyhash.listItems ht);
mengj@19768
   500
mengj@19768
   501
fun mem_thm thm [] = false
mengj@19768
   502
  | mem_thm thm ((thm',name)::thms_names) = equal_thm (thm,thm') orelse mem_thm thm thms_names;
mengj@19768
   503
mengj@19768
   504
fun insert_thms [] thms_names = thms_names
mengj@19768
   505
  | insert_thms ((thm,name)::thms_names) thms_names' =
mengj@19768
   506
      if mem_thm thm thms_names' then insert_thms thms_names thms_names' 
mengj@19768
   507
      else insert_thms thms_names ((thm,name)::thms_names');
mengj@19768
   508
mengj@19768
   509
fun display_thms [] = ()
mengj@19768
   510
  | display_thms ((name,thm)::nthms) = 
mengj@19768
   511
      let val nthm = name ^ ": " ^ (string_of_thm thm)
mengj@19768
   512
      in Output.debug nthm; display_thms nthms  end;
mengj@19768
   513
 
mengj@19768
   514
mengj@19768
   515
(* get lemmas from claset, simpset, atpset and extra supplied rules *)
mengj@19768
   516
fun get_clasimp_atp_lemmas ctxt user_thms = 
mengj@19768
   517
    let val claset_thms =
mengj@19768
   518
	    if !include_claset then
mengj@19768
   519
		map put_name_pair (ResAxioms.claset_rules_of_ctxt ctxt)
mengj@19768
   520
	    else []
mengj@19768
   521
	val simpset_thms = 
mengj@19768
   522
	    if !include_simpset then 
mengj@19768
   523
		map put_name_pair (ResAxioms.simpset_rules_of_ctxt ctxt)
mengj@19768
   524
	    else []
mengj@19768
   525
	val atpset_thms =
mengj@19768
   526
	    if !include_atpset then
mengj@19768
   527
		map put_name_pair (ResAxioms.atpset_rules_of_ctxt ctxt)
mengj@19768
   528
	    else []
mengj@19768
   529
	val _ = if !Output.show_debug_msgs then (Output.debug "ATP theorems: "; display_thms atpset_thms) else ()		 
mengj@19768
   530
	val user_rules = 
mengj@19768
   531
	    case user_thms of  (*use whitelist if there are no user-supplied rules*)
mengj@19768
   532
		[] => map (put_name_pair o ResAxioms.pairname) (!whitelist)
mengj@19768
   533
	      | _  => map put_name_pair user_thms
mengj@19768
   534
    in
mengj@19768
   535
	(claset_thms, simpset_thms, atpset_thms, user_rules)
mengj@19768
   536
    end;
mengj@19768
   537
mengj@19768
   538
(* remove lemmas that are banned from the backlist *)
mengj@19768
   539
fun blacklist_filter thms = 
mengj@19768
   540
    if !run_blacklist_filter then 
mengj@19768
   541
	let val banned = make_banned_test (map #1 thms)
mengj@19768
   542
	    fun ok (a,_) = not (banned a)
mengj@19768
   543
	in
mengj@19768
   544
	    filter ok thms
mengj@19768
   545
	end
mengj@19768
   546
    else
mengj@19768
   547
	thms;
mengj@19768
   548
mengj@19768
   549
(* filter axiom clauses, but keep supplied clauses and clauses in whitelist *)
mengj@19768
   550
fun get_relevant_clauses ctxt cls_thms white_cls goals =
mengj@19768
   551
    let val cls_thms_list = make_unique (mk_clause_table 2200) (List.concat (white_cls@cls_thms))
mengj@19768
   552
	val relevant_cls_thms_list = if !run_relevance_filter then ReduceAxiomsN.relevance_filter (ProofContext.theory_of ctxt) cls_thms_list goals else cls_thms_list
mengj@19768
   553
    in
mengj@19768
   554
        insert_thms (List.concat white_cls) relevant_cls_thms_list 
mengj@19768
   555
    end;
mengj@19194
   556
mengj@19194
   557
(***************************************************************)
mengj@19194
   558
(* ATP invocation methods setup                                *)
mengj@19194
   559
(***************************************************************)
mengj@19194
   560
mengj@19194
   561
mengj@19194
   562
(**** prover-specific format: TPTP ****)
mengj@19194
   563
mengj@19194
   564
mengj@19194
   565
fun cnf_hyps_thms ctxt = 
mengj@19194
   566
    let val ths = ProofContext.prems_of ctxt
wenzelm@19617
   567
    in fold (fold (insert Thm.eq_thm) o ResAxioms.skolem_thm) ths [] end;
mengj@19194
   568
mengj@19194
   569
mengj@19194
   570
(**** write to files ****)
mengj@19194
   571
mengj@19194
   572
datatype mode = Auto | Fol | Hol;
mengj@19194
   573
paulson@19450
   574
val linkup_logic_mode = ref Auto;
paulson@19205
   575
mengj@19194
   576
fun tptp_writer logic goals filename (axioms,classrels,arities) =
paulson@19445
   577
    if is_fol_logic logic 
paulson@19445
   578
    then ResClause.tptp_write_file goals filename (axioms, classrels, arities)
mengj@19490
   579
    else ResHolClause.tptp_write_file goals filename (axioms, classrels, arities);
paulson@19445
   580
paulson@19445
   581
fun dfg_writer logic goals filename (axioms,classrels,arities) =
paulson@19445
   582
    if is_fol_logic logic 
paulson@19445
   583
    then ResClause.dfg_write_file goals filename (axioms, classrels, arities)
mengj@19718
   584
    else ResHolClause.dfg_write_file goals filename (axioms, classrels, arities);
mengj@19194
   585
mengj@19722
   586
fun write_subgoal_file dfg mode ctxt conjectures user_thms n =
mengj@19442
   587
    let val conj_cls = make_clauses conjectures 
mengj@19442
   588
	val hyp_cls = cnf_hyps_thms ctxt
mengj@19194
   589
	val goal_cls = conj_cls@hyp_cls
mengj@19768
   590
	val (cla_thms,simp_thms,atp_thms,user_rules) = get_clasimp_atp_lemmas ctxt (map ResAxioms.pairname user_thms)
mengj@19768
   591
	val rm_black_cls = blacklist_filter (cla_thms@simp_thms@atp_thms) 
mengj@19768
   592
	val cla_simp_atp_clauses = ResAxioms.cnf_rules_pairs rm_black_cls
mengj@19768
   593
	val user_cls = ResAxioms.cnf_rules_pairs user_rules
mengj@19768
   594
	val axclauses_as_thms = get_relevant_clauses ctxt cla_simp_atp_clauses user_cls (map prop_of goal_cls)
mengj@19194
   595
	val thy = ProofContext.theory_of ctxt
mengj@19442
   596
	val prob_logic = case mode of Auto => problem_logic_goals [map prop_of goal_cls]
mengj@19194
   597
				    | Fol => FOL
mengj@19194
   598
				    | Hol => HOL
mengj@19194
   599
	val keep_types = if is_fol_logic prob_logic then !fol_keep_types else is_typed_hol ()
mengj@19194
   600
	val classrel_clauses = if keep_types then ResClause.classrel_clauses_thy thy else []
mengj@19194
   601
	val arity_clauses = if keep_types then ResClause.arity_clause_thy thy else []
mengj@19722
   602
        val writer = if dfg then dfg_writer else tptp_writer 
mengj@19194
   603
	val file = atp_input_file()
mengj@19194
   604
    in
mengj@19352
   605
	(writer prob_logic goal_cls file (axclauses_as_thms,classrel_clauses,arity_clauses);
paulson@19746
   606
	 Output.debug ("Writing to " ^ file);
mengj@19194
   607
	 file)
mengj@19194
   608
    end;
mengj@19194
   609
mengj@19194
   610
mengj@19194
   611
(**** remove tmp files ****)
mengj@19194
   612
fun cond_rm_tmp file = 
paulson@19746
   613
    if !keep_atp_input then Output.debug "ATP input kept..." 
paulson@19746
   614
    else if !destdir <> "" then Output.debug ("ATP input kept in directory " ^ (!destdir))
paulson@19746
   615
    else (Output.debug "deleting ATP inputs..."; OS.FileSys.remove file);
mengj@19194
   616
mengj@19194
   617
mengj@19194
   618
(****** setup ATPs as Isabelle methods ******)
mengj@19194
   619
fun atp_meth' tac ths ctxt = 
mengj@19194
   620
    Method.SIMPLE_METHOD' HEADGOAL
mengj@19194
   621
    (tac ctxt ths);
mengj@19194
   622
mengj@19194
   623
fun atp_meth tac ths ctxt = 
mengj@19194
   624
    let val thy = ProofContext.theory_of ctxt
mengj@19194
   625
	val _ = ResClause.init thy
mengj@19194
   626
	val _ = ResHolClause.init thy
mengj@19194
   627
    in
mengj@19194
   628
	atp_meth' tac ths ctxt
mengj@19194
   629
    end;
mengj@19194
   630
mengj@19194
   631
fun atp_method tac = Method.thms_ctxt_args (atp_meth tac);
mengj@19194
   632
mengj@19194
   633
(***************************************************************)
mengj@19194
   634
(* automatic ATP invocation                                    *)
mengj@19194
   635
(***************************************************************)
mengj@19194
   636
paulson@17306
   637
(* call prover with settings and problem file for the current subgoal *)
paulson@17764
   638
fun watcher_call_provers sign sg_terms (childin, childout, pid) =
wenzelm@16802
   639
  let
paulson@17422
   640
    fun make_atp_list [] n = []
paulson@17717
   641
      | make_atp_list (sg_term::xs) n =
wenzelm@16802
   642
          let
paulson@17717
   643
            val probfile = prob_pathname n
paulson@17690
   644
            val time = Int.toString (!time_limit)
wenzelm@16802
   645
          in
wenzelm@18680
   646
            Output.debug ("problem file in watcher_call_provers is " ^ probfile);
paulson@17764
   647
            (*options are separated by Watcher.setting_sep, currently #"%"*)
paulson@17306
   648
            if !prover = "spass"
wenzelm@16802
   649
            then
paulson@19445
   650
              let val spass = helper_path "SPASS_HOME" "SPASS"
paulson@19445
   651
                  val sopts =
paulson@19445
   652
   "-Auto%-SOS=1%-PGiven=0%-PProblem=0%-Splits=0%-FullRed=0%-DocProof%-TimeLimit=" ^ time
paulson@19445
   653
              in 
paulson@19445
   654
                  ("spass", spass, sopts, probfile) :: make_atp_list xs (n+1)
wenzelm@16802
   655
              end
paulson@17306
   656
            else if !prover = "vampire"
quigley@17235
   657
	    then 
paulson@17819
   658
              let val vampire = helper_path "VAMPIRE_HOME" "vampire"
paulson@19445
   659
                  val casc = if !time_limit > 70 then "--mode casc%" else ""
paulson@19445
   660
                  val vopts = casc ^ "-m 100000%-t " ^ time
wenzelm@16802
   661
              in
paulson@19445
   662
                  ("vampire", vampire, vopts, probfile) :: make_atp_list xs (n+1)
wenzelm@16802
   663
              end
paulson@17306
   664
      	     else if !prover = "E"
paulson@17306
   665
      	     then
paulson@17819
   666
	       let val Eprover = helper_path "E_HOME" "eproof"
paulson@17306
   667
	       in
paulson@19445
   668
		  ("E", Eprover, 
paulson@19744
   669
		     "--tptp-in%-l5%-xAuto%-tAuto%--silent%--cpu-limit=" ^ time, probfile) ::
paulson@19445
   670
		   make_atp_list xs (n+1)
paulson@17306
   671
	       end
paulson@17306
   672
	     else error ("Invalid prover name: " ^ !prover)
wenzelm@16802
   673
          end
paulson@15452
   674
paulson@17422
   675
    val atp_list = make_atp_list sg_terms 1
wenzelm@16802
   676
  in
wenzelm@16802
   677
    Watcher.callResProvers(childout,atp_list);
wenzelm@18680
   678
    Output.debug "Sent commands to watcher!"
wenzelm@16802
   679
  end
quigley@16357
   680
paulson@17717
   681
(*We write out problem files for each subgoal. Argument pf generates filenames,
paulson@18986
   682
  and allows the suppression of the suffix "_1" in problem-generation mode.
paulson@18986
   683
  FIXME: does not cope with &&, and it isn't easy because one could have multiple
paulson@18986
   684
  subgoals, each involving &&.*)
paulson@17717
   685
fun write_problem_files pf (ctxt,th)  =
paulson@18753
   686
  let val goals = Thm.prems_of th
mengj@19194
   687
      val _ = Output.debug ("number of subgoals = " ^ Int.toString (length goals))
mengj@19768
   688
      val (cla_thms,simp_thms,atp_thms,white_thms) = get_clasimp_atp_lemmas ctxt []
mengj@19768
   689
      val rm_blacklist_cls = blacklist_filter (cla_thms@simp_thms@atp_thms)
mengj@19768
   690
      val cla_simp_atp_clauses = ResAxioms.cnf_rules_pairs rm_blacklist_cls
mengj@19768
   691
      val axclauses = get_relevant_clauses ctxt cla_simp_atp_clauses (ResAxioms.cnf_rules_pairs white_thms) goals 
mengj@19194
   692
      val _ = Output.debug ("claset, simprules and atprules total clauses = " ^ 
paulson@19675
   693
                     Int.toString (length axclauses))
paulson@17717
   694
      val thy = ProofContext.theory_of ctxt
mengj@19194
   695
      fun get_neg_subgoals n =
mengj@19194
   696
	  if n=0 then []
mengj@19194
   697
	  else
mengj@19194
   698
	      let val st = Seq.hd (EVERY'
mengj@19194
   699
				       [rtac ccontr, ObjectLogic.atomize_tac, skolemize_tac] n th)
mengj@19194
   700
		  val negs = Option.valOf (metahyps_thms n st)
mengj@19442
   701
		  val negs_clauses = make_clauses negs
mengj@19194
   702
	      in
mengj@19194
   703
		  negs_clauses::(get_neg_subgoals (n - 1))
mengj@19194
   704
	      end
mengj@19194
   705
      val neg_subgoals = get_neg_subgoals (length goals) 
mengj@19442
   706
      val goals_logic = case !linkup_logic_mode of Auto => problem_logic_goals (map (map prop_of) neg_subgoals)
paulson@19205
   707
						 | Fol => FOL
paulson@19205
   708
						 | Hol => HOL
mengj@19194
   709
      val keep_types = if is_fol_logic goals_logic then !ResClause.keep_types else is_typed_hol ()
mengj@19194
   710
      val classrel_clauses = if keep_types then ResClause.classrel_clauses_thy thy else []
wenzelm@18680
   711
      val _ = Output.debug ("classrel clauses = " ^ Int.toString (length classrel_clauses))
mengj@19194
   712
      val arity_clauses = if keep_types then ResClause.arity_clause_thy thy else []
wenzelm@18680
   713
      val _ = Output.debug ("arity clauses = " ^ Int.toString (length arity_clauses))
mengj@19718
   714
      val writer = if !prover = "spass" then dfg_writer else tptp_writer 
mengj@19194
   715
      fun write_all [] _ = []
mengj@19194
   716
	| write_all (subgoal::subgoals) k =
mengj@19442
   717
	  (writer goals_logic subgoal (pf k) (axclauses,classrel_clauses,arity_clauses); pf k):: (write_all subgoals (k - 1))
paulson@19675
   718
      val thm_names = Array.fromList (map (#1 o #2) axclauses)
mengj@19194
   719
  in
paulson@19675
   720
      (write_all neg_subgoals (length goals), thm_names)
mengj@19194
   721
  end;
quigley@15644
   722
paulson@17775
   723
val last_watcher_pid = ref (NONE : (TextIO.instream * TextIO.outstream * 
paulson@17775
   724
                                    Posix.Process.pid * string list) option);
paulson@17775
   725
paulson@17775
   726
fun kill_last_watcher () =
paulson@17775
   727
    (case !last_watcher_pid of 
paulson@17775
   728
         NONE => ()
paulson@19445
   729
       | SOME (_, _, pid, files) => 
wenzelm@18680
   730
	  (Output.debug ("Killing old watcher, pid = " ^ string_of_pid pid);
paulson@17775
   731
	   Watcher.killWatcher pid;  
paulson@17775
   732
	   ignore (map (try OS.FileSys.remove) files)))
wenzelm@18680
   733
     handle OS.SysErr _ => Output.debug "Attempt to kill watcher failed";
paulson@17525
   734
paulson@17525
   735
(*writes out the current clasimpset to a tptp file;
paulson@17525
   736
  turns off xsymbol at start of function, restoring it at end    *)
paulson@17484
   737
val isar_atp = setmp print_mode [] 
paulson@17717
   738
 (fn (ctxt, th) =>
paulson@17717
   739
  if Thm.no_prems th then ()
wenzelm@16802
   740
  else
wenzelm@16802
   741
    let
paulson@17775
   742
      val _ = kill_last_watcher()
paulson@19675
   743
      val (files,thm_names) = write_problem_files prob_pathname (ctxt,th)
paulson@19675
   744
      val (childin, childout, pid) = Watcher.createWatcher (th, thm_names)
paulson@15608
   745
    in
paulson@17772
   746
      last_watcher_pid := SOME (childin, childout, pid, files);
wenzelm@18680
   747
      Output.debug ("problem files: " ^ space_implode ", " files); 
wenzelm@18680
   748
      Output.debug ("pid: " ^ string_of_pid pid);
paulson@17717
   749
      watcher_call_provers (sign_of_thm th) (Thm.prems_of th) (childin, childout, pid)
wenzelm@16802
   750
    end);
paulson@15608
   751
paulson@17422
   752
val isar_atp_writeonly = setmp print_mode [] 
paulson@17717
   753
      (fn (ctxt,th) =>
paulson@17717
   754
       if Thm.no_prems th then ()
paulson@17717
   755
       else 
paulson@17717
   756
         let val pf = if Thm.nprems_of th = 1 then probfile_nosuffix 
paulson@17717
   757
         	      else prob_pathname
paulson@17717
   758
         in ignore (write_problem_files pf (ctxt,th)) end);
paulson@15452
   759
quigley@16357
   760
wenzelm@16802
   761
(** the Isar toplevel hook **)
wenzelm@16802
   762
paulson@19205
   763
fun invoke_atp_ml (ctxt, goal) =
paulson@19205
   764
  let val thy = ProofContext.theory_of ctxt;
wenzelm@16802
   765
  in
wenzelm@18680
   766
    Output.debug ("subgoals in isar_atp:\n" ^ 
paulson@19205
   767
		  Pretty.string_of (ProofContext.pretty_term ctxt
paulson@19205
   768
		    (Logic.mk_conjunction_list (Thm.prems_of goal))));
wenzelm@18680
   769
    Output.debug ("current theory: " ^ Context.theory_name thy);
quigley@17150
   770
    hook_count := !hook_count +1;
wenzelm@18680
   771
    Output.debug ("in hook for time: " ^ Int.toString (!hook_count));
paulson@16925
   772
    ResClause.init thy;
mengj@19194
   773
    ResHolClause.init thy;
paulson@17690
   774
    if !destdir = "" andalso !time_limit > 0 then isar_atp (ctxt, goal)
paulson@17502
   775
    else isar_atp_writeonly (ctxt, goal)
paulson@19205
   776
  end;
paulson@19205
   777
paulson@19205
   778
val invoke_atp = Toplevel.no_timing o Toplevel.unknown_proof o Toplevel.keep
paulson@19205
   779
 (fn state =>
paulson@19205
   780
  let val (ctxt, (_, goal)) = Proof.get_goal (Toplevel.proof_of state)
paulson@19205
   781
  in  invoke_atp_ml (ctxt, goal)  end);
quigley@16357
   782
paulson@17091
   783
val call_atpP =
paulson@17746
   784
  OuterSyntax.command 
paulson@17091
   785
    "ProofGeneral.call_atp" 
paulson@17091
   786
    "call automatic theorem provers" 
paulson@17091
   787
    OuterKeyword.diag
paulson@19205
   788
    (Scan.succeed invoke_atp);
paulson@17091
   789
paulson@17091
   790
val _ = OuterSyntax.add_parsers [call_atpP];
paulson@17091
   791
paulson@15347
   792
end;