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