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