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