src/HOL/Tools/res_atp.ML
author mengj
Thu Mar 09 06:05:01 2006 +0100 (2006-03-09)
changeset 19227 d15f2baa7ecc
parent 19205 4ec788c69f82
child 19352 1a07f6cf1e6c
permissions -rw-r--r--
Added more functions to the signature and tidied up some functions.
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@19205
    18
  val write_subgoal_file: mode -> Proof.context -> thm list -> thm list -> int -> string
mengj@19194
    19
  val vampire_time: int ref
mengj@19194
    20
  val eprover_time: int ref
mengj@19194
    21
  val run_vampire: int -> unit
mengj@19194
    22
  val run_eprover: int -> unit
mengj@19194
    23
  val vampireLimit: unit -> int
mengj@19194
    24
  val eproverLimit: unit -> int
paulson@19205
    25
  val atp_method: (ProofContext.context -> thm list -> int -> Tactical.tactic) ->
mengj@19194
    26
		  Method.src -> ProofContext.context -> Method.method
mengj@19194
    27
  val cond_rm_tmp: string -> unit
mengj@19194
    28
  val keep_atp_input: bool ref
mengj@19194
    29
  val fol_keep_types: bool ref
mengj@19194
    30
  val hol_full_types: unit -> unit
mengj@19194
    31
  val hol_partial_types: unit -> unit
mengj@19194
    32
  val hol_const_types_only: unit -> unit
mengj@19194
    33
  val hol_no_types: unit -> unit
mengj@19194
    34
  val hol_typ_level: unit -> ResHolClause.type_level
mengj@19194
    35
  val run_relevance_filter: bool ref
paulson@19205
    36
  val invoke_atp_ml : ProofContext.context * thm -> unit
mengj@19227
    37
  val add_claset : unit -> unit
mengj@19227
    38
  val add_simpset : unit -> unit
mengj@19227
    39
  val add_clasimp : unit -> unit
mengj@19227
    40
  val add_atpset : unit -> unit
mengj@19227
    41
  val rm_claset : unit -> unit
mengj@19227
    42
  val rm_simpset : unit -> unit
mengj@19227
    43
  val rm_atpset : unit -> unit
mengj@19227
    44
  val rm_clasimp : unit -> unit
paulson@15347
    45
end;
paulson@15347
    46
paulson@19205
    47
structure ResAtp : RES_ATP =
paulson@15347
    48
struct
paulson@15347
    49
mengj@19194
    50
(********************************************************************)
mengj@19194
    51
(* some settings for both background automatic ATP calling procedure*)
mengj@19194
    52
(* and also explicit ATP invocation methods                         *)
mengj@19194
    53
(********************************************************************)
mengj@19194
    54
mengj@19194
    55
(*** background linkup ***)
mengj@19194
    56
val call_atp = ref false; 
quigley@17150
    57
val hook_count = ref 0;
paulson@18675
    58
val time_limit = ref 30;
paulson@17404
    59
val prover = ref "E";   (* use E as the default prover *)
paulson@17305
    60
val custom_spass =   (*specialized options for SPASS*)
paulson@17690
    61
      ref ["-Auto=0","-FullRed=0","-IORe","-IOFc","-RTaut","-RFSub","-RBSub"];
paulson@17484
    62
val destdir = ref "";   (*Empty means write files to /tmp*)
paulson@17484
    63
val problem_name = ref "prob";
paulson@17484
    64
paulson@17819
    65
(*Return the path to a "helper" like SPASS or tptp2X, first checking that
paulson@17819
    66
  it exists.  FIXME: modify to use Path primitives and move to some central place.*)  
paulson@17819
    67
fun helper_path evar base =
paulson@17819
    68
  case getenv evar of
paulson@17819
    69
      "" => error  ("Isabelle environment variable " ^ evar ^ " not defined")
paulson@17819
    70
    | home => 
paulson@17819
    71
        let val path = home ^ "/" ^ base
paulson@17819
    72
        in  if File.exists (File.unpack_platform_path path) then path 
paulson@17819
    73
	    else error ("Could not find the file " ^ path)
paulson@17819
    74
	end;  
paulson@17819
    75
paulson@17717
    76
fun probfile_nosuffix _ = 
paulson@17484
    77
  if !destdir = "" then File.platform_path (File.tmp_path (Path.basic (!problem_name)))
paulson@17484
    78
  else if File.exists (File.unpack_platform_path (!destdir))
paulson@17484
    79
  then !destdir ^ "/" ^ !problem_name
paulson@17484
    80
  else error ("No such directory: " ^ !destdir);
quigley@15644
    81
paulson@17717
    82
fun prob_pathname n = probfile_nosuffix n ^ "_" ^ Int.toString n;
paulson@17717
    83
mengj@19194
    84
mengj@19194
    85
(*** ATP methods ***)
mengj@19194
    86
val vampire_time = ref 60;
mengj@19194
    87
val eprover_time = ref 60;
mengj@19194
    88
fun run_vampire time =  
mengj@19194
    89
    if (time >0) then vampire_time:= time
mengj@19194
    90
    else vampire_time:=60;
mengj@19194
    91
mengj@19194
    92
fun run_eprover time = 
mengj@19194
    93
    if (time > 0) then eprover_time:= time
mengj@19194
    94
    else eprover_time:=60;
mengj@19194
    95
mengj@19194
    96
fun vampireLimit () = !vampire_time;
mengj@19194
    97
fun eproverLimit () = !eprover_time;
mengj@19194
    98
mengj@19194
    99
val keep_atp_input = ref false;
mengj@19194
   100
val fol_keep_types = ResClause.keep_types;
mengj@19194
   101
val hol_full_types = ResHolClause.full_types;
mengj@19194
   102
val hol_partial_types = ResHolClause.partial_types;
mengj@19194
   103
val hol_const_types_only = ResHolClause.const_types_only;
mengj@19194
   104
val hol_no_types = ResHolClause.no_types;
mengj@19194
   105
fun hol_typ_level () = ResHolClause.find_typ_level ();
mengj@19194
   106
fun is_typed_hol () = 
mengj@19194
   107
    let val tp_level = hol_typ_level()
mengj@19194
   108
    in
mengj@19194
   109
	not (tp_level = ResHolClause.T_NONE)
mengj@19194
   110
    end;
mengj@19194
   111
val include_combS = ResHolClause.include_combS;
mengj@19194
   112
val include_min_comb = ResHolClause.include_min_comb;
mengj@19194
   113
mengj@19194
   114
fun atp_input_file () =
mengj@19194
   115
    let val file = !problem_name 
mengj@19194
   116
    in
mengj@19194
   117
	if !destdir = "" then File.platform_path (File.tmp_path (Path.basic file))
mengj@19194
   118
	else if File.exists (File.unpack_platform_path (!destdir))
mengj@19194
   119
	then !destdir ^ "/" ^ file
mengj@19194
   120
	else error ("No such directory: " ^ !destdir)
mengj@19194
   121
    end;
mengj@19194
   122
mengj@19194
   123
val include_simpset = ref false;
mengj@19194
   124
val include_claset = ref false; 
mengj@19194
   125
val include_atpset = ref true;
mengj@19194
   126
val add_simpset = (fn () => include_simpset:=true);
mengj@19194
   127
val add_claset = (fn () => include_claset:=true);
mengj@19227
   128
val add_clasimp = (fn () => (include_simpset:=true;include_claset:=true));
mengj@19194
   129
val add_atpset = (fn () => include_atpset:=true);
mengj@19194
   130
val rm_simpset = (fn () => include_simpset:=false);
mengj@19194
   131
val rm_claset = (fn () => include_claset:=false);
mengj@19227
   132
val rm_clasimp = (fn () => (include_simpset:=false;include_claset:=false));
mengj@19194
   133
val rm_atpset = (fn () => include_atpset:=false);
mengj@19194
   134
mengj@19194
   135
(*** paths for HOL helper files ***)
mengj@19194
   136
fun full_typed_comb_inclS () =
mengj@19194
   137
    helper_path "E_HOME" "additionals/full_comb_inclS"
mengj@19194
   138
    handle _ => helper_path "VAMPIRE_HOME" "additionals/full_comb_inclS";
mengj@19194
   139
mengj@19194
   140
fun full_typed_comb_noS () =
mengj@19194
   141
    helper_path "E_HOME" "additionals/full_comb_noS"
mengj@19194
   142
    handle _ => helper_path "VAMPIRE_HOME" "additionals/full_comb_noS";
mengj@19194
   143
									      
mengj@19194
   144
fun partial_typed_comb_inclS () =
mengj@19194
   145
    helper_path "E_HOME" "additionals/par_comb_inclS"
mengj@19194
   146
    handle _ => helper_path "VAMPIRE_HOME" "additionals/par_comb_inclS";
mengj@19194
   147
mengj@19194
   148
fun partial_typed_comb_noS () =
mengj@19194
   149
    helper_path "E_HOME" "additionals/par_comb_noS"
mengj@19194
   150
    handle _ => helper_path "VAMPIRE_HOME" "additionals/par_comb_noS";
mengj@19194
   151
mengj@19194
   152
fun const_typed_comb_inclS () =
mengj@19194
   153
    helper_path "E_HOME" "additionals/const_comb_inclS"
mengj@19194
   154
    handle _ => helper_path "VAMPIRE_HOME" "additionals/const_comb_inclS";
mengj@19194
   155
mengj@19194
   156
fun const_typed_comb_noS () =
mengj@19194
   157
    helper_path "E_HOME" "additionals/const_comb_noS"
mengj@19194
   158
    handle _ => helper_path "VAMPIRE_HOME" "additionals/const_comb_noS";
mengj@19194
   159
mengj@19194
   160
fun untyped_comb_inclS () =
mengj@19194
   161
    helper_path "E_HOME" "additionals/u_comb_inclS"
mengj@19194
   162
    handle _ => helper_path "VAMPIRE_HOME" "additionals/u_comb_inclS";
mengj@19194
   163
mengj@19194
   164
fun untyped_comb_noS () =
mengj@19194
   165
    helper_path "E_HOME" "additionals/u_comb_noS"
mengj@19194
   166
    handle _ => helper_path "VAMPIRE_HOME" "additionals/u_comb_noS";
mengj@19194
   167
mengj@19194
   168
fun full_typed_HOL_helper1 () =
mengj@19194
   169
    helper_path "E_HOME" "additionals/full_helper1"
mengj@19194
   170
    handle _ => helper_path "VAMPIRE_HOME" "additionals/full_helper1";
mengj@19194
   171
mengj@19194
   172
fun partial_typed_HOL_helper1 () = 
mengj@19194
   173
    helper_path "E_HOME" "additionals/par_helper1"
mengj@19194
   174
    handle _ => helper_path "VAMPIRE_HOME" "additionals/par_helper1";
mengj@19194
   175
mengj@19194
   176
fun const_typed_HOL_helper1 () = 
mengj@19194
   177
    helper_path "E_HOME" "additionals/const_helper1"
mengj@19194
   178
    handle _ => helper_path "VAMPIRE_HOME" "additionals/const_helper1";
mengj@19194
   179
mengj@19194
   180
fun untyped_HOL_helper1 () = 
mengj@19194
   181
    helper_path "E_HOME" "additionals/u_helper1"
mengj@19194
   182
    handle _ => helper_path "VAMPIRE_HOME" "additionals/u_helper1";
mengj@19194
   183
mengj@19194
   184
fun get_full_typed_helpers () =
mengj@19194
   185
    (full_typed_HOL_helper1 (), full_typed_comb_noS (), full_typed_comb_inclS ());
mengj@19194
   186
mengj@19194
   187
fun get_partial_typed_helpers () =
mengj@19194
   188
    (partial_typed_HOL_helper1 (), partial_typed_comb_noS (), partial_typed_comb_inclS ());
mengj@19194
   189
mengj@19194
   190
fun get_const_typed_helpers () =
mengj@19194
   191
    (const_typed_HOL_helper1 (), const_typed_comb_noS (), const_typed_comb_inclS ());
mengj@19194
   192
mengj@19194
   193
fun get_untyped_helpers () =
mengj@19194
   194
    (untyped_HOL_helper1 (), untyped_comb_noS (), untyped_comb_inclS ());
mengj@19194
   195
mengj@19194
   196
fun get_all_helpers () =
mengj@19194
   197
    (get_full_typed_helpers (), get_partial_typed_helpers (), get_const_typed_helpers (), get_untyped_helpers ());
mengj@19194
   198
mengj@19194
   199
mengj@19194
   200
(**** relevance filter ****)
mengj@19194
   201
val run_relevance_filter = ref true;
mengj@19194
   202
mengj@19194
   203
(******************************************************************)
mengj@19194
   204
(* detect whether a given problem (clauses) is FOL/HOL/HOLC/HOLCS *)
mengj@19194
   205
(******************************************************************)
mengj@19194
   206
mengj@19194
   207
datatype logic = FOL | HOL | HOLC | HOLCS;
mengj@19194
   208
mengj@19194
   209
fun string_of_logic FOL = "FOL"
mengj@19194
   210
  | string_of_logic HOL = "HOL"
mengj@19194
   211
  | string_of_logic HOLC = "HOLC"
mengj@19194
   212
  | string_of_logic HOLCS = "HOLCS";
mengj@19194
   213
mengj@19194
   214
mengj@19194
   215
fun is_fol_logic FOL = true
mengj@19194
   216
  | is_fol_logic  _ = false
mengj@19194
   217
mengj@19194
   218
mengj@19194
   219
(*HOLCS will not occur here*)
mengj@19194
   220
fun upgrade_lg HOLC _ = HOLC
mengj@19194
   221
  | upgrade_lg HOL HOLC = HOLC
mengj@19194
   222
  | upgrade_lg HOL _ = HOL
mengj@19194
   223
  | upgrade_lg FOL lg = lg; 
mengj@19194
   224
mengj@19194
   225
(* check types *)
mengj@19194
   226
fun has_bool (Type("bool",_)) = true
mengj@19194
   227
  | has_bool (Type(_, Ts)) = exists has_bool Ts
mengj@19194
   228
  | has_bool _ = false;
mengj@19194
   229
mengj@19194
   230
fun has_bool_arg tp = 
mengj@19194
   231
    let val (targs,tr) = strip_type tp
mengj@19194
   232
    in
mengj@19194
   233
	exists has_bool targs
mengj@19194
   234
    end;
mengj@19194
   235
mengj@19194
   236
fun is_fn_tp (Type("fun",_)) = true
mengj@19194
   237
  | is_fn_tp _ = false;
mengj@19194
   238
mengj@19194
   239
mengj@19194
   240
exception FN_LG of term;
mengj@19194
   241
mengj@19194
   242
fun fn_lg (t as Const(f,tp)) (lg,seen) = 
mengj@19194
   243
    if has_bool tp then (upgrade_lg HOL lg, t ins seen) else (lg, t ins seen) 
mengj@19194
   244
  | fn_lg (t as Free(f,tp)) (lg,seen) = 
mengj@19194
   245
    if has_bool tp then (upgrade_lg HOL lg, t ins seen) else (lg, t ins seen) 
mengj@19194
   246
  | fn_lg (t as Var(f,tp)) (lg,seen) =
mengj@19194
   247
    if is_fn_tp tp orelse has_bool tp then (upgrade_lg HOL lg,t ins seen)
mengj@19194
   248
    else (lg,t ins seen)
mengj@19194
   249
  | fn_lg (t as Abs(_,_,_)) (lg,seen) = (upgrade_lg HOLC lg,t ins seen)
mengj@19194
   250
  | fn_lg f _ = raise FN_LG(f); 
mengj@19194
   251
mengj@19194
   252
mengj@19194
   253
fun term_lg [] (lg,seen) = (lg,seen)
mengj@19194
   254
  | term_lg (tm::tms) (FOL,seen) =
mengj@19194
   255
    let val (f,args) = strip_comb tm
mengj@19194
   256
	val (lg',seen') = if f mem seen then (FOL,seen) 
mengj@19194
   257
			  else fn_lg f (FOL,seen)
mengj@19194
   258
mengj@19194
   259
	 in
mengj@19194
   260
	     term_lg (args@tms) (lg',seen')
mengj@19194
   261
    end
mengj@19194
   262
  | term_lg _ (lg,seen) = (lg,seen)
mengj@19194
   263
mengj@19194
   264
exception PRED_LG of term;
mengj@19194
   265
mengj@19194
   266
fun pred_lg (t as Const(P,tp)) (lg,seen)= 
mengj@19194
   267
    if has_bool_arg tp then (upgrade_lg HOL lg, t ins seen) else (lg,t ins seen) 
mengj@19194
   268
  | pred_lg (t as Free(P,tp)) (lg,seen) =
mengj@19194
   269
    if has_bool_arg tp then (upgrade_lg HOL lg, t ins seen) else (lg,t ins seen)
mengj@19194
   270
  | pred_lg (t as Var(_,_)) (lg,seen) = (upgrade_lg HOL lg, t ins seen)
mengj@19194
   271
  | pred_lg P _ = raise PRED_LG(P);
mengj@19194
   272
mengj@19194
   273
mengj@19194
   274
fun lit_lg (Const("Not",_) $ P) (lg,seen) = lit_lg P (lg,seen)
mengj@19194
   275
  | lit_lg P (lg,seen) =
mengj@19194
   276
    let val (pred,args) = strip_comb P
mengj@19194
   277
	val (lg',seen') = if pred mem seen then (lg,seen) 
mengj@19194
   278
			  else pred_lg pred (lg,seen)
mengj@19227
   279
	val _ = if is_fol_logic lg' then () else warning ("Found a HOL predicate: " ^ (Term.str_of_term pred))
mengj@19194
   280
    in
mengj@19194
   281
	term_lg args (lg',seen')
mengj@19194
   282
    end;
mengj@19194
   283
mengj@19194
   284
fun lits_lg [] (lg,seen) = (lg,seen)
mengj@19194
   285
  | lits_lg (lit::lits) (FOL,seen) =
mengj@19227
   286
    let val (lg,seen') = lit_lg lit (FOL,seen)
mengj@19227
   287
	val _ =  if is_fol_logic lg then () else warning ("Found a HOL literal: " ^ (Term.str_of_term lit))
mengj@19227
   288
    in
mengj@19227
   289
	lits_lg lits (lg,seen')
mengj@19227
   290
    end
mengj@19194
   291
  | lits_lg lits (lg,seen) = (lg,seen);
mengj@19194
   292
mengj@19194
   293
mengj@19227
   294
fun dest_disj_aux (Const ("op |", _) $ t $ t') disjs = 
mengj@19227
   295
    dest_disj_aux t (dest_disj_aux t' disjs)
mengj@19227
   296
  | dest_disj_aux t disjs = t::disjs;
mengj@19227
   297
mengj@19227
   298
fun dest_disj t = dest_disj_aux t [];
mengj@19227
   299
mengj@19194
   300
fun logic_of_clause tm (lg,seen) =
mengj@19194
   301
    let val tm' = HOLogic.dest_Trueprop tm
mengj@19227
   302
	val disjs = dest_disj tm'
mengj@19194
   303
    in
mengj@19194
   304
	lits_lg disjs (lg,seen)
mengj@19194
   305
    end;
mengj@19194
   306
mengj@19194
   307
fun logic_of_clauses [] (lg,seen) = (lg,seen)
mengj@19194
   308
  | logic_of_clauses (cls::clss) (FOL,seen) =
mengj@19227
   309
    let val (lg,seen') = logic_of_clause cls (FOL,seen)
mengj@19227
   310
	val _ = if is_fol_logic lg then () else warning ("Found a HOL clause: " ^ (Term.str_of_term cls))
mengj@19227
   311
    in
mengj@19227
   312
	logic_of_clauses clss (lg,seen')
mengj@19227
   313
    end
mengj@19194
   314
  | logic_of_clauses (cls::clss) (lg,seen) = (lg,seen);
mengj@19194
   315
mengj@19194
   316
fun logic_of_nclauses [] (lg,seen) = (lg,seen)
mengj@19194
   317
  | logic_of_nclauses (cls::clss) (FOL,seen) =
mengj@19194
   318
    logic_of_nclauses clss (logic_of_clauses (snd cls) (FOL,seen))
mengj@19194
   319
  | logic_of_nclauses clss (lg,seen) = (lg,seen);
mengj@19194
   320
mengj@19194
   321
fun problem_logic (goal_cls,rules_cls) =
mengj@19194
   322
    let val (lg1,seen1) = logic_of_clauses goal_cls (FOL,[])
mengj@19194
   323
	val (lg2,seen2) = logic_of_nclauses rules_cls (lg1,seen1)
mengj@19194
   324
    in
mengj@19194
   325
	lg2
mengj@19194
   326
    end;
mengj@19194
   327
mengj@19194
   328
fun problem_logic_goals_aux [] (lg,seen) = lg
mengj@19194
   329
  | problem_logic_goals_aux (subgoal::subgoals) (lg,seen) = 
mengj@19194
   330
    problem_logic_goals_aux subgoals (logic_of_clauses subgoal (lg,seen));
mengj@19194
   331
    
mengj@19194
   332
fun problem_logic_goals subgoals = problem_logic_goals_aux subgoals (FOL,[]);
mengj@19194
   333
mengj@19194
   334
mengj@19194
   335
(***************************************************************)
mengj@19194
   336
(* ATP invocation methods setup                                *)
mengj@19194
   337
(***************************************************************)
mengj@19194
   338
mengj@19194
   339
mengj@19194
   340
(**** prover-specific format: TPTP ****)
mengj@19194
   341
mengj@19194
   342
mengj@19194
   343
fun cnf_hyps_thms ctxt = 
mengj@19194
   344
    let val ths = ProofContext.prems_of ctxt
mengj@19194
   345
    in
mengj@19194
   346
	ResClause.union_all (map ResAxioms.skolem_thm ths)
mengj@19194
   347
    end;
mengj@19194
   348
mengj@19194
   349
mengj@19194
   350
(**** write to files ****)
mengj@19194
   351
mengj@19194
   352
datatype mode = Auto | Fol | Hol;
mengj@19194
   353
paulson@19205
   354
val linkup_logic_mode = ref Fol;
paulson@19205
   355
mengj@19194
   356
fun tptp_writer logic goals filename (axioms,classrels,arities) =
mengj@19194
   357
    if is_fol_logic logic then ResClause.tptp_write_file goals filename (axioms, classrels, arities)
mengj@19194
   358
    else
mengj@19194
   359
	ResHolClause.tptp_write_file goals filename (axioms, classrels, arities) (get_all_helpers());
mengj@19194
   360
mengj@19194
   361
mengj@19194
   362
fun write_subgoal_file mode ctxt conjectures user_thms n =
mengj@19194
   363
    let val conj_cls = map prop_of (make_clauses conjectures) 
mengj@19194
   364
	val hyp_cls = map prop_of (cnf_hyps_thms ctxt)
mengj@19194
   365
	val goal_cls = conj_cls@hyp_cls
mengj@19194
   366
	val user_rules = map ResAxioms.pairname user_thms
mengj@19194
   367
	val (names_arr,axclauses_as_tms) = ResClasimp.get_clasimp_atp_lemmas ctxt (goal_cls) user_rules (!include_claset,!include_simpset,!include_atpset) (!run_relevance_filter)  
mengj@19194
   368
	val thy = ProofContext.theory_of ctxt
mengj@19194
   369
	val prob_logic = case mode of Auto => problem_logic_goals [goal_cls]
mengj@19194
   370
				    | Fol => FOL
mengj@19194
   371
				    | Hol => HOL
mengj@19194
   372
	val keep_types = if is_fol_logic prob_logic then !fol_keep_types else is_typed_hol ()
mengj@19194
   373
	val classrel_clauses = if keep_types then ResClause.classrel_clauses_thy thy else []
mengj@19194
   374
	val arity_clauses = if keep_types then ResClause.arity_clause_thy thy else []
mengj@19194
   375
	val writer = tptp_writer
mengj@19194
   376
	val file = atp_input_file()
mengj@19194
   377
    in
mengj@19194
   378
	(writer prob_logic goal_cls file (axclauses_as_tms,classrel_clauses,arity_clauses);
mengj@19194
   379
	 warning ("Writing to " ^ file);
mengj@19194
   380
	 file)
mengj@19194
   381
    end;
mengj@19194
   382
mengj@19194
   383
mengj@19194
   384
(**** remove tmp files ****)
mengj@19194
   385
fun cond_rm_tmp file = 
mengj@19194
   386
    if !keep_atp_input then warning "ATP input kept..." 
mengj@19194
   387
    else if !destdir <> "" then warning ("ATP input kept in directory " ^ (!destdir))
mengj@19194
   388
    else (warning "deleting ATP inputs..."; OS.FileSys.remove file);
mengj@19194
   389
mengj@19194
   390
mengj@19194
   391
(****** setup ATPs as Isabelle methods ******)
mengj@19194
   392
fun atp_meth' tac ths ctxt = 
mengj@19194
   393
    Method.SIMPLE_METHOD' HEADGOAL
mengj@19194
   394
    (tac ctxt ths);
mengj@19194
   395
mengj@19194
   396
fun atp_meth tac ths ctxt = 
mengj@19194
   397
    let val thy = ProofContext.theory_of ctxt
mengj@19194
   398
	val _ = ResClause.init thy
mengj@19194
   399
	val _ = ResHolClause.init thy
mengj@19194
   400
    in
mengj@19194
   401
	atp_meth' tac ths ctxt
mengj@19194
   402
    end;
mengj@19194
   403
mengj@19194
   404
fun atp_method tac = Method.thms_ctxt_args (atp_meth tac);
mengj@19194
   405
mengj@19194
   406
(***************************************************************)
mengj@19194
   407
(* automatic ATP invocation                                    *)
mengj@19194
   408
(***************************************************************)
mengj@19194
   409
paulson@17306
   410
(* call prover with settings and problem file for the current subgoal *)
paulson@17764
   411
fun watcher_call_provers sign sg_terms (childin, childout, pid) =
wenzelm@16802
   412
  let
paulson@17422
   413
    fun make_atp_list [] n = []
paulson@17717
   414
      | make_atp_list (sg_term::xs) n =
wenzelm@16802
   415
          let
paulson@17717
   416
            val probfile = prob_pathname n
paulson@17690
   417
            val time = Int.toString (!time_limit)
wenzelm@16802
   418
          in
wenzelm@18680
   419
            Output.debug ("problem file in watcher_call_provers is " ^ probfile);
paulson@17317
   420
            (*Avoid command arguments containing spaces: Poly/ML and SML/NJ
paulson@17317
   421
              versions of Unix.execute treat them differently!*)
paulson@17764
   422
            (*options are separated by Watcher.setting_sep, currently #"%"*)
paulson@17306
   423
            if !prover = "spass"
wenzelm@16802
   424
            then
paulson@18700
   425
              let val baseopts = "%-PGiven=0%-PProblem=0%-Splits=0%-FullRed=0%-DocProof%-TimeLimit=" ^ time
paulson@18700
   426
              val infopts = 
paulson@17484
   427
		      if !AtpCommunication.reconstruct 
paulson@18700
   428
		          (*Proof reconstruction needs a limited set of inf rules*)
paulson@18700
   429
                      then space_implode "%" (!custom_spass)                           
paulson@18700
   430
                      else "-Auto%-SOS=1"
paulson@18700
   431
                  val spass = helper_path "SPASS_HOME" "SPASS"
paulson@18700
   432
            in 
paulson@18700
   433
                ([("spass", spass, infopts ^ baseopts, probfile)] @ 
paulson@18798
   434
                  make_atp_list xs (n+1))
wenzelm@16802
   435
              end
paulson@17306
   436
            else if !prover = "vampire"
quigley@17235
   437
	    then 
paulson@17819
   438
              let val vampire = helper_path "VAMPIRE_HOME" "vampire"
wenzelm@16802
   439
              in
paulson@17772
   440
                ([("vampire", vampire, "-m 100000%-t " ^ time, probfile)] @
paulson@18798
   441
                 make_atp_list xs (n+1))       (*BEWARE! spaces in options!*)
wenzelm@16802
   442
              end
paulson@17306
   443
      	     else if !prover = "E"
paulson@17306
   444
      	     then
paulson@17819
   445
	       let val Eprover = helper_path "E_HOME" "eproof"
paulson@17306
   446
	       in
paulson@17772
   447
		  ([("E", Eprover, 
paulson@17690
   448
		     "--tptp-in%-l5%-xAuto%-tAuto%--cpu-limit=" ^ time,
paulson@17422
   449
		     probfile)] @
paulson@18798
   450
		   make_atp_list xs (n+1))
paulson@17306
   451
	       end
paulson@17306
   452
	     else error ("Invalid prover name: " ^ !prover)
wenzelm@16802
   453
          end
paulson@15452
   454
paulson@17422
   455
    val atp_list = make_atp_list sg_terms 1
wenzelm@16802
   456
  in
wenzelm@16802
   457
    Watcher.callResProvers(childout,atp_list);
wenzelm@18680
   458
    Output.debug "Sent commands to watcher!"
wenzelm@16802
   459
  end
quigley@16357
   460
paulson@17717
   461
(*We write out problem files for each subgoal. Argument pf generates filenames,
paulson@18986
   462
  and allows the suppression of the suffix "_1" in problem-generation mode.
paulson@18986
   463
  FIXME: does not cope with &&, and it isn't easy because one could have multiple
paulson@18986
   464
  subgoals, each involving &&.*)
paulson@17717
   465
fun write_problem_files pf (ctxt,th)  =
paulson@18753
   466
  let val goals = Thm.prems_of th
mengj@19194
   467
      val _ = Output.debug ("number of subgoals = " ^ Int.toString (length goals))
mengj@19194
   468
      val (names_arr, axclauses_as_terms) = ResClasimp.get_clasimp_atp_lemmas ctxt goals [] (true,true,true) (!run_relevance_filter) (* no user supplied rules here, because no user invocation *)
mengj@19194
   469
      val _ = Output.debug ("claset, simprules and atprules total clauses = " ^ 
mengj@19194
   470
                     Int.toString (Array.length names_arr))
paulson@17717
   471
      val thy = ProofContext.theory_of ctxt
mengj@19194
   472
      fun get_neg_subgoals n =
mengj@19194
   473
	  if n=0 then []
mengj@19194
   474
	  else
mengj@19194
   475
	      let val st = Seq.hd (EVERY'
mengj@19194
   476
				       [rtac ccontr, ObjectLogic.atomize_tac, skolemize_tac] n th)
mengj@19194
   477
		  val negs = Option.valOf (metahyps_thms n st)
mengj@19194
   478
		  val negs_clauses = map prop_of (make_clauses negs)
mengj@19194
   479
	      in
mengj@19194
   480
		  negs_clauses::(get_neg_subgoals (n - 1))
mengj@19194
   481
	      end
mengj@19194
   482
      val neg_subgoals = get_neg_subgoals (length goals) 
paulson@19205
   483
      val goals_logic = case !linkup_logic_mode of Auto => problem_logic_goals neg_subgoals
paulson@19205
   484
						 | Fol => FOL
paulson@19205
   485
						 | Hol => HOL
mengj@19194
   486
      val keep_types = if is_fol_logic goals_logic then !ResClause.keep_types else is_typed_hol ()
mengj@19194
   487
      val classrel_clauses = if keep_types then ResClause.classrel_clauses_thy thy else []
wenzelm@18680
   488
      val _ = Output.debug ("classrel clauses = " ^ Int.toString (length classrel_clauses))
mengj@19194
   489
      val arity_clauses = if keep_types then ResClause.arity_clause_thy thy else []
wenzelm@18680
   490
      val _ = Output.debug ("arity clauses = " ^ Int.toString (length arity_clauses))
mengj@19194
   491
      val writer = (*if !prover ~= "spass" then *)tptp_writer 
mengj@19194
   492
      fun write_all [] _ = []
mengj@19194
   493
	| write_all (subgoal::subgoals) k =
mengj@19194
   494
	  (writer goals_logic subgoal (pf k) (axclauses_as_terms,classrel_clauses,arity_clauses); pf k):: (write_all subgoals (k - 1))
mengj@19194
   495
  in
mengj@19194
   496
      (write_all neg_subgoals (length goals), names_arr)
mengj@19194
   497
  end;
quigley@15644
   498
paulson@17775
   499
val last_watcher_pid = ref (NONE : (TextIO.instream * TextIO.outstream * 
paulson@17775
   500
                                    Posix.Process.pid * string list) option);
paulson@17775
   501
paulson@17775
   502
fun kill_last_watcher () =
paulson@17775
   503
    (case !last_watcher_pid of 
paulson@17775
   504
         NONE => ()
paulson@17775
   505
       | SOME (_, childout, pid, files) => 
wenzelm@18680
   506
	  (Output.debug ("Killing old watcher, pid = " ^ string_of_pid pid);
paulson@17775
   507
	   Watcher.killWatcher pid;  
paulson@17775
   508
	   ignore (map (try OS.FileSys.remove) files)))
wenzelm@18680
   509
     handle OS.SysErr _ => Output.debug "Attempt to kill watcher failed";
paulson@17525
   510
paulson@17525
   511
(*writes out the current clasimpset to a tptp file;
paulson@17525
   512
  turns off xsymbol at start of function, restoring it at end    *)
paulson@17484
   513
val isar_atp = setmp print_mode [] 
paulson@17717
   514
 (fn (ctxt, th) =>
paulson@17717
   515
  if Thm.no_prems th then ()
wenzelm@16802
   516
  else
wenzelm@16802
   517
    let
paulson@17775
   518
      val _ = kill_last_watcher()
mengj@19194
   519
      val (files,names_arr) = write_problem_files prob_pathname (ctxt,th)
mengj@19194
   520
      val (childin, childout, pid) = Watcher.createWatcher (th, names_arr)
paulson@15608
   521
    in
paulson@17772
   522
      last_watcher_pid := SOME (childin, childout, pid, files);
wenzelm@18680
   523
      Output.debug ("problem files: " ^ space_implode ", " files); 
wenzelm@18680
   524
      Output.debug ("pid: " ^ string_of_pid pid);
paulson@17717
   525
      watcher_call_provers (sign_of_thm th) (Thm.prems_of th) (childin, childout, pid)
wenzelm@16802
   526
    end);
paulson@15608
   527
paulson@17422
   528
val isar_atp_writeonly = setmp print_mode [] 
paulson@17717
   529
      (fn (ctxt,th) =>
paulson@17717
   530
       if Thm.no_prems th then ()
paulson@17717
   531
       else 
paulson@17717
   532
         let val pf = if Thm.nprems_of th = 1 then probfile_nosuffix 
paulson@17717
   533
         	      else prob_pathname
paulson@17717
   534
         in ignore (write_problem_files pf (ctxt,th)) end);
paulson@15452
   535
quigley@16357
   536
wenzelm@16802
   537
(** the Isar toplevel hook **)
wenzelm@16802
   538
paulson@19205
   539
fun invoke_atp_ml (ctxt, goal) =
paulson@19205
   540
  let val thy = ProofContext.theory_of ctxt;
wenzelm@16802
   541
  in
wenzelm@18680
   542
    Output.debug ("subgoals in isar_atp:\n" ^ 
paulson@19205
   543
		  Pretty.string_of (ProofContext.pretty_term ctxt
paulson@19205
   544
		    (Logic.mk_conjunction_list (Thm.prems_of goal))));
wenzelm@18680
   545
    Output.debug ("current theory: " ^ Context.theory_name thy);
quigley@17150
   546
    hook_count := !hook_count +1;
wenzelm@18680
   547
    Output.debug ("in hook for time: " ^ Int.toString (!hook_count));
paulson@16925
   548
    ResClause.init thy;
mengj@19194
   549
    ResHolClause.init thy;
paulson@17690
   550
    if !destdir = "" andalso !time_limit > 0 then isar_atp (ctxt, goal)
paulson@17502
   551
    else isar_atp_writeonly (ctxt, goal)
paulson@19205
   552
  end;
paulson@19205
   553
paulson@19205
   554
val invoke_atp = Toplevel.no_timing o Toplevel.unknown_proof o Toplevel.keep
paulson@19205
   555
 (fn state =>
paulson@19205
   556
  let val (ctxt, (_, goal)) = Proof.get_goal (Toplevel.proof_of state)
paulson@19205
   557
  in  invoke_atp_ml (ctxt, goal)  end);
quigley@16357
   558
paulson@17091
   559
val call_atpP =
paulson@17746
   560
  OuterSyntax.command 
paulson@17091
   561
    "ProofGeneral.call_atp" 
paulson@17091
   562
    "call automatic theorem provers" 
paulson@17091
   563
    OuterKeyword.diag
paulson@19205
   564
    (Scan.succeed invoke_atp);
paulson@17091
   565
paulson@17091
   566
val _ = OuterSyntax.add_parsers [call_atpP];
paulson@17091
   567
paulson@15347
   568
end;