author | blanchet |
Fri, 01 Oct 2010 15:34:09 +0200 | |
changeset 39901 | 75d792edf634 |
parent 39899 | 608b108ec979 |
child 39902 | bb43fe4fac93 |
permissions | -rw-r--r-- |
35826 | 1 |
(* Title: HOL/Tools/Sledgehammer/metis_tactics.ML |
38027 | 2 |
Author: Kong W. Susanto, Cambridge University Computer Laboratory |
3 |
Author: Lawrence C. Paulson, Cambridge University Computer Laboratory |
|
4 |
Author: Jasmin Blanchette, TU Muenchen |
|
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset
|
5 |
Copyright Cambridge University 2007 |
23447 | 6 |
|
29266 | 7 |
HOL setup for the Metis prover. |
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset
|
8 |
*) |
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset
|
9 |
|
35826 | 10 |
signature METIS_TACTICS = |
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset
|
11 |
sig |
39497
fa16349939b7
complete refactoring of Metis along the lines of Sledgehammer
blanchet
parents:
39494
diff
changeset
|
12 |
val trace : bool Unsynchronized.ref |
fa16349939b7
complete refactoring of Metis along the lines of Sledgehammer
blanchet
parents:
39494
diff
changeset
|
13 |
val type_lits : bool Config.T |
39891
8e12f1956fcd
"meson_new_skolemizer" -> "metis_new_skolemizer" option (since Meson doesn't support the new skolemizer (yet))
blanchet
parents:
39890
diff
changeset
|
14 |
val new_skolemizer : bool Config.T |
39497
fa16349939b7
complete refactoring of Metis along the lines of Sledgehammer
blanchet
parents:
39494
diff
changeset
|
15 |
val metis_tac : Proof.context -> thm list -> int -> tactic |
fa16349939b7
complete refactoring of Metis along the lines of Sledgehammer
blanchet
parents:
39494
diff
changeset
|
16 |
val metisF_tac : Proof.context -> thm list -> int -> tactic |
fa16349939b7
complete refactoring of Metis along the lines of Sledgehammer
blanchet
parents:
39494
diff
changeset
|
17 |
val metisFT_tac : Proof.context -> thm list -> int -> tactic |
fa16349939b7
complete refactoring of Metis along the lines of Sledgehammer
blanchet
parents:
39494
diff
changeset
|
18 |
val setup : theory -> theory |
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset
|
19 |
end |
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset
|
20 |
|
35826 | 21 |
structure Metis_Tactics : METIS_TACTICS = |
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset
|
22 |
struct |
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset
|
23 |
|
39494
bf7dd4902321
rename "Metis_Clauses" to "Metis_Translate" for consistency with "Sledgehammer_Translate"
blanchet
parents:
39450
diff
changeset
|
24 |
open Metis_Translate |
39497
fa16349939b7
complete refactoring of Metis along the lines of Sledgehammer
blanchet
parents:
39494
diff
changeset
|
25 |
open Metis_Reconstruct |
35826 | 26 |
|
39899
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
27 |
structure Int_Pair_Graph = |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
28 |
Graph(type key = int * int val ord = prod_ord int_ord int_ord) |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
29 |
|
39497
fa16349939b7
complete refactoring of Metis along the lines of Sledgehammer
blanchet
parents:
39494
diff
changeset
|
30 |
fun trace_msg msg = if !trace then tracing (msg ()) else () |
32955 | 31 |
|
39891
8e12f1956fcd
"meson_new_skolemizer" -> "metis_new_skolemizer" option (since Meson doesn't support the new skolemizer (yet))
blanchet
parents:
39890
diff
changeset
|
32 |
val (type_lits, type_lits_setup) = Attrib.config_bool "metis_type_lits" (K true) |
8e12f1956fcd
"meson_new_skolemizer" -> "metis_new_skolemizer" option (since Meson doesn't support the new skolemizer (yet))
blanchet
parents:
39890
diff
changeset
|
33 |
val (new_skolemizer, new_skolemizer_setup) = |
8e12f1956fcd
"meson_new_skolemizer" -> "metis_new_skolemizer" option (since Meson doesn't support the new skolemizer (yet))
blanchet
parents:
39890
diff
changeset
|
34 |
Attrib.config_bool "metis_new_skolemizer" (K false) |
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset
|
35 |
|
39497
fa16349939b7
complete refactoring of Metis along the lines of Sledgehammer
blanchet
parents:
39494
diff
changeset
|
36 |
fun is_false t = t aconv (HOLogic.mk_Trueprop HOLogic.false_const); |
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset
|
37 |
|
39497
fa16349939b7
complete refactoring of Metis along the lines of Sledgehammer
blanchet
parents:
39494
diff
changeset
|
38 |
fun have_common_thm ths1 ths2 = |
fa16349939b7
complete refactoring of Metis along the lines of Sledgehammer
blanchet
parents:
39494
diff
changeset
|
39 |
exists (member Thm.eq_thm ths1) (map Meson.make_meta_clause ths2) |
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset
|
40 |
|
32956 | 41 |
(*Determining which axiom clauses are actually used*) |
39419
c9accfd621a5
"Metis." -> "Metis_" to reflect change in "metis.ML"
blanchet
parents:
39376
diff
changeset
|
42 |
fun used_axioms axioms (th, Metis_Proof.Axiom _) = SOME (lookth axioms th) |
32994 | 43 |
| used_axioms _ _ = NONE; |
24855 | 44 |
|
39450
7e9879fbb7c5
supply the Metis parameter defaults as argument, instead of patching the Metis sources;
blanchet
parents:
39419
diff
changeset
|
45 |
val clause_params = |
7e9879fbb7c5
supply the Metis parameter defaults as argument, instead of patching the Metis sources;
blanchet
parents:
39419
diff
changeset
|
46 |
{ordering = Metis_KnuthBendixOrder.default, |
7e9879fbb7c5
supply the Metis parameter defaults as argument, instead of patching the Metis sources;
blanchet
parents:
39419
diff
changeset
|
47 |
orderLiterals = Metis_Clause.UnsignedLiteralOrder, |
7e9879fbb7c5
supply the Metis parameter defaults as argument, instead of patching the Metis sources;
blanchet
parents:
39419
diff
changeset
|
48 |
orderTerms = true} |
7e9879fbb7c5
supply the Metis parameter defaults as argument, instead of patching the Metis sources;
blanchet
parents:
39419
diff
changeset
|
49 |
val active_params = |
7e9879fbb7c5
supply the Metis parameter defaults as argument, instead of patching the Metis sources;
blanchet
parents:
39419
diff
changeset
|
50 |
{clause = clause_params, |
7e9879fbb7c5
supply the Metis parameter defaults as argument, instead of patching the Metis sources;
blanchet
parents:
39419
diff
changeset
|
51 |
prefactor = #prefactor Metis_Active.default, |
7e9879fbb7c5
supply the Metis parameter defaults as argument, instead of patching the Metis sources;
blanchet
parents:
39419
diff
changeset
|
52 |
postfactor = #postfactor Metis_Active.default} |
7e9879fbb7c5
supply the Metis parameter defaults as argument, instead of patching the Metis sources;
blanchet
parents:
39419
diff
changeset
|
53 |
val waiting_params = |
7e9879fbb7c5
supply the Metis parameter defaults as argument, instead of patching the Metis sources;
blanchet
parents:
39419
diff
changeset
|
54 |
{symbolsWeight = 1.0, |
7e9879fbb7c5
supply the Metis parameter defaults as argument, instead of patching the Metis sources;
blanchet
parents:
39419
diff
changeset
|
55 |
variablesWeight = 0.0, |
7e9879fbb7c5
supply the Metis parameter defaults as argument, instead of patching the Metis sources;
blanchet
parents:
39419
diff
changeset
|
56 |
literalsWeight = 0.0, |
7e9879fbb7c5
supply the Metis parameter defaults as argument, instead of patching the Metis sources;
blanchet
parents:
39419
diff
changeset
|
57 |
models = []} |
39497
fa16349939b7
complete refactoring of Metis along the lines of Sledgehammer
blanchet
parents:
39494
diff
changeset
|
58 |
val resolution_params = {active = active_params, waiting = waiting_params} |
37573 | 59 |
|
39887
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
60 |
(* In principle, it should be sufficient to apply "assume_tac" to unify the |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
61 |
conclusion with one of the premises. However, in practice, this fails |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
62 |
horribly because of the mildly higher-order nature of the unification |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
63 |
problems. Typical constraints are of the form "?x a b =?= b", where "a" and |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
64 |
"b" are goal parameters. *) |
39897 | 65 |
fun unify_prem_with_concl thy i th = |
39887
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
66 |
let |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
67 |
val goal = Logic.get_goal (prop_of th) i |> Envir.beta_eta_contract |
39897 | 68 |
val prem = goal |> Logic.strip_assums_hyp |> the_single |
69 |
val concl = goal |> Logic.strip_assums_concl |
|
39887
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
70 |
fun add_types Tp instT = |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
71 |
if exists (curry (op =) Tp) instT then instT |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
72 |
else Tp :: map (apsnd (typ_subst_atomic [Tp])) instT |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
73 |
fun unify_types (T, U) = |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
74 |
if T = U then |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
75 |
I |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
76 |
else case (T, U) of |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
77 |
(TVar _, _) => add_types (T, U) |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
78 |
| (_, TVar _) => add_types (U, T) |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
79 |
| (Type (s, Ts), Type (t, Us)) => |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
80 |
if s = t andalso length Ts = length Us then fold unify_types (Ts ~~ Us) |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
81 |
else raise TYPE ("unify_types", [T, U], []) |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
82 |
| _ => raise TYPE ("unify_types", [T, U], []) |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
83 |
fun pair_untyped_aconv (t1, t2) (u1, u2) = |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
84 |
untyped_aconv t1 u1 andalso untyped_aconv t2 u2 |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
85 |
fun add_terms tp inst = |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
86 |
if exists (pair_untyped_aconv tp) inst then inst |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
87 |
else tp :: map (apsnd (subst_atomic [tp])) inst |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
88 |
fun is_flex t = |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
89 |
case strip_comb t of |
39892 | 90 |
(Var _, args) => forall (is_Bound orf is_Var (*FIXME: orf is_Free*)) args |
39887
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
91 |
| _ => false |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
92 |
fun unify_flex flex rigid = |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
93 |
case strip_comb flex of |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
94 |
(Var (z as (_, T)), args) => |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
95 |
add_terms (Var z, |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
96 |
(* FIXME: reindex bound variables *) |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
97 |
fold_rev (curry absdummy) (take (length args) (binder_types T)) rigid) |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
98 |
| _ => raise TERM ("unify_flex: expected flex", [flex]) |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
99 |
fun unify_potential_flex comb atom = |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
100 |
if is_flex comb then unify_flex comb atom |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
101 |
else if is_Var atom then add_terms (atom, comb) |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
102 |
else raise TERM ("unify_terms", [comb, atom]) |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
103 |
fun unify_terms (t, u) = |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
104 |
case (t, u) of |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
105 |
(t1 $ t2, u1 $ u2) => |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
106 |
if is_flex t then unify_flex t u |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
107 |
else if is_flex u then unify_flex u t |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
108 |
else fold unify_terms [(t1, u1), (t2, u2)] |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
109 |
| (_ $ _, _) => unify_potential_flex t u |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
110 |
| (_, _ $ _) => unify_potential_flex u t |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
111 |
| (Var _, _) => add_terms (t, u) |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
112 |
| (_, Var _) => add_terms (u, t) |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
113 |
| _ => if untyped_aconv t u then I else raise TERM ("unify_terms", [t, u]) |
39897 | 114 |
|
115 |
val inst = [] |> unify_terms (prem, concl) |
|
116 |
val _ = trace_msg (fn () => cat_lines (map (fn (t, u) => |
|
117 |
Syntax.string_of_term @{context} t ^ " |-> " ^ |
|
118 |
Syntax.string_of_term @{context} u) inst)) |
|
119 |
val instT = fold (fn Tp => unify_types (pairself fastype_of Tp) |
|
120 |
handle TERM _ => I) inst [] |
|
121 |
val inst = inst |> map (pairself (subst_atomic_types instT)) |
|
122 |
val cinstT = instT |> map (pairself (ctyp_of thy)) |
|
123 |
val cinst = inst |> map (pairself (cterm_of thy)) |
|
124 |
in th |> Thm.instantiate (cinstT, []) |> Thm.instantiate ([], cinst) end |
|
125 |
handle Empty => th (* ### FIXME *) |
|
39887
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
126 |
|
39899
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
127 |
val cluster_ord = prod_ord (prod_ord int_ord int_ord) bool_ord |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
128 |
|
39887
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
129 |
(* Attempts to derive the theorem "False" from a theorem of the form |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
130 |
"P1 ==> ... ==> Pn ==> False", where the "Pi"s are to be discharged using the |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
131 |
specified axioms. The axioms have leading "All" and "Ex" quantifiers, which |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
132 |
must be eliminated first. *) |
39897 | 133 |
fun discharge_skolem_premises ctxt axioms prems_imp_false = |
134 |
case prop_of prems_imp_false of |
|
135 |
@{prop False} => prems_imp_false |
|
136 |
| prems_imp_false_prop => |
|
137 |
let |
|
138 |
val thy = ProofContext.theory_of ctxt |
|
139 |
fun match_term p = |
|
140 |
let |
|
141 |
val (tyenv, tenv) = |
|
142 |
Pattern.first_order_match thy p (Vartab.empty, Vartab.empty) |
|
143 |
val tsubst = |
|
144 |
tenv |> Vartab.dest |
|
39899
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
145 |
|> sort (cluster_ord |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
146 |
o pairself (Meson_Clausify.cluster_of_zapped_var_name |
39897 | 147 |
o fst o fst)) |
148 |
|> map (Meson.term_pair_of |
|
149 |
#> pairself (Envir.subst_term_types tyenv)) |
|
150 |
in (tyenv, tsubst) end |
|
151 |
fun subst_info_for_prem assm_no prem = |
|
152 |
case prem of |
|
153 |
_ $ (Const (@{const_name skolem}, _) $ (_ $ t $ num)) => |
|
154 |
let val ax_no = num |> HOLogic.dest_number |> snd in |
|
155 |
(ax_no, (assm_no, match_term (nth axioms ax_no |> snd, t))) |
|
156 |
end |
|
157 |
| _ => raise TERM ("discharge_skolem_premises: Malformed premise", |
|
158 |
[prem]) |
|
39899
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
159 |
fun cluster_of_var_name skolem s = |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
160 |
let val (jj, skolem') = Meson_Clausify.cluster_of_zapped_var_name s in |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
161 |
if skolem' = skolem then SOME jj else NONE |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
162 |
end |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
163 |
fun clusters_in_term skolem t = |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
164 |
Term.add_var_names t [] |> map_filter (cluster_of_var_name skolem o fst) |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
165 |
fun deps_for_term_subst (var, t) = |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
166 |
case clusters_in_term false var of |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
167 |
[] => NONE |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
168 |
| [(ax_no, cluster_no)] => |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
169 |
SOME ((ax_no, cluster_no), |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
170 |
clusters_in_term true t |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
171 |
|> cluster_no > 0 ? cons (ax_no, cluster_no - 1)) |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
172 |
| _ => raise TERM ("discharge_skolem_premises: Expected Var", [var]) |
39897 | 173 |
val prems = Logic.strip_imp_prems prems_imp_false_prop |
174 |
val substs = map2 subst_info_for_prem (0 upto length prems - 1) prems |
|
39899
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
175 |
val depss = maps (map_filter deps_for_term_subst o snd o snd o snd) substs |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
176 |
val clusters = maps (op ::) depss |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
177 |
val ordered_clusters = |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
178 |
Int_Pair_Graph.empty |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
179 |
|> fold Int_Pair_Graph.default_node (map (rpair ()) clusters) |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
180 |
|> fold Int_Pair_Graph.add_deps_acyclic depss |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
181 |
|> Int_Pair_Graph.topological_order |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
182 |
handle Int_Pair_Graph.CYCLES _ => |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
183 |
error "Cannot replay Metis proof in Isabelle without axiom of \ |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
184 |
\choice." |
39901
75d792edf634
make "cnf_axiom" work (after a fashion) in the absence of the axiom of choice
blanchet
parents:
39899
diff
changeset
|
185 |
(* FIXME *) |
39899
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
186 |
val _ = tracing ("SUBSTS: " ^ PolyML.makestring substs) |
608b108ec979
compute quantifier dependency graph in new skolemizer
blanchet
parents:
39897
diff
changeset
|
187 |
val _ = tracing ("ORDERED: " ^ PolyML.makestring ordered_clusters) |
39897 | 188 |
in |
39887
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
189 |
Goal.prove ctxt [] [] @{prop False} |
39897 | 190 |
(K (cut_rules_tac (map fst axioms) 1 |
39887
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
191 |
THEN TRY (REPEAT_ALL_NEW (etac @{thm exE}) 1) |
39892 | 192 |
(* two copies are better than one (FIXME) *) |
193 |
THEN etac @{lemma "P ==> (P ==> P ==> Q) ==> Q" by fast} 1 |
|
39887
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
194 |
THEN TRY (REPEAT_ALL_NEW (etac @{thm allE}) 1) |
39897 | 195 |
THEN match_tac [prems_imp_false] 1 |
39887
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
196 |
THEN DETERM_UNTIL_SOLVED |
39894
35ae5cf8c96a
encode number of skolem assumptions in them, for more efficient retrieval later
blanchet
parents:
39892
diff
changeset
|
197 |
(rtac @{thm skolem_COMBK_I} 1 |
39897 | 198 |
THEN PRIMITIVE (unify_prem_with_concl thy 1) |
39887
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
199 |
THEN assume_tac 1))) |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
200 |
end |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
201 |
|
37516
c81c86bfc18a
have "metis" method and "metis_tac" fall back on "metisFT" upon failure, following a suggestion by Larry
blanchet
parents:
37509
diff
changeset
|
202 |
(* Main function to start Metis proof and reconstruction *) |
32956 | 203 |
fun FOL_SOLVE mode ctxt cls ths0 = |
204 |
let val thy = ProofContext.theory_of ctxt |
|
39497
fa16349939b7
complete refactoring of Metis along the lines of Sledgehammer
blanchet
parents:
39494
diff
changeset
|
205 |
val type_lits = Config.get ctxt type_lits |
39901
75d792edf634
make "cnf_axiom" work (after a fashion) in the absence of the axiom of choice
blanchet
parents:
39899
diff
changeset
|
206 |
val new_skolemizer = |
75d792edf634
make "cnf_axiom" work (after a fashion) in the absence of the axiom of choice
blanchet
parents:
39899
diff
changeset
|
207 |
Config.get ctxt new_skolemizer orelse null (Meson_Choices.get ctxt) |
35826 | 208 |
val th_cls_pairs = |
39894
35ae5cf8c96a
encode number of skolem assumptions in them, for more efficient retrieval later
blanchet
parents:
39892
diff
changeset
|
209 |
map2 (fn j => fn th => |
35ae5cf8c96a
encode number of skolem assumptions in them, for more efficient retrieval later
blanchet
parents:
39892
diff
changeset
|
210 |
(Thm.get_name_hint th, |
39901
75d792edf634
make "cnf_axiom" work (after a fashion) in the absence of the axiom of choice
blanchet
parents:
39899
diff
changeset
|
211 |
Meson_Clausify.cnf_axiom ctxt new_skolemizer j th)) |
39894
35ae5cf8c96a
encode number of skolem assumptions in them, for more efficient retrieval later
blanchet
parents:
39892
diff
changeset
|
212 |
(0 upto length ths0 - 1) ths0 |
39887
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
213 |
val thss = map (snd o snd) th_cls_pairs |
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
214 |
val dischargers = map_filter (fst o snd) th_cls_pairs |
32956 | 215 |
val _ = trace_msg (fn () => "FOL_SOLVE: CONJECTURE CLAUSES") |
216 |
val _ = app (fn th => trace_msg (fn () => Display.string_of_thm ctxt th)) cls |
|
217 |
val _ = trace_msg (fn () => "THEOREM CLAUSES") |
|
39886
8a9f0c97d550
first step towards a new skolemizer that doesn't require "Eps"
blanchet
parents:
39721
diff
changeset
|
218 |
val _ = app (app (fn th => trace_msg (fn () => Display.string_of_thm ctxt th))) thss |
8a9f0c97d550
first step towards a new skolemizer that doesn't require "Eps"
blanchet
parents:
39721
diff
changeset
|
219 |
val (mode, {axioms, tfrees, old_skolems}) = |
8a9f0c97d550
first step towards a new skolemizer that doesn't require "Eps"
blanchet
parents:
39721
diff
changeset
|
220 |
build_logic_map mode ctxt type_lits cls thss |
32956 | 221 |
val _ = if null tfrees then () |
222 |
else (trace_msg (fn () => "TFREE CLAUSES"); |
|
37643
f576af716aa6
rewrote the TPTP problem generation code more or less from scratch;
blanchet
parents:
37632
diff
changeset
|
223 |
app (fn TyLitFree ((s, _), (s', _)) => |
39887
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
224 |
trace_msg (fn () => s ^ "(" ^ s' ^ ")")) tfrees) |
32956 | 225 |
val _ = trace_msg (fn () => "CLAUSES GIVEN TO METIS") |
226 |
val thms = map #1 axioms |
|
39419
c9accfd621a5
"Metis." -> "Metis_" to reflect change in "metis.ML"
blanchet
parents:
39376
diff
changeset
|
227 |
val _ = app (fn th => trace_msg (fn () => Metis_Thm.toString th)) thms |
32956 | 228 |
val _ = trace_msg (fn () => "mode = " ^ string_of_mode mode) |
229 |
val _ = trace_msg (fn () => "START METIS PROVE PROCESS") |
|
230 |
in |
|
33317 | 231 |
case filter (is_false o prop_of) cls of |
32956 | 232 |
false_th::_ => [false_th RS @{thm FalseE}] |
233 |
| [] => |
|
39497
fa16349939b7
complete refactoring of Metis along the lines of Sledgehammer
blanchet
parents:
39494
diff
changeset
|
234 |
case Metis_Resolution.new resolution_params {axioms = thms, conjecture = []} |
fa16349939b7
complete refactoring of Metis along the lines of Sledgehammer
blanchet
parents:
39494
diff
changeset
|
235 |
|> Metis_Resolution.loop of |
39419
c9accfd621a5
"Metis." -> "Metis_" to reflect change in "metis.ML"
blanchet
parents:
39376
diff
changeset
|
236 |
Metis_Resolution.Contradiction mth => |
32956 | 237 |
let val _ = trace_msg (fn () => "METIS RECONSTRUCTION START: " ^ |
39419
c9accfd621a5
"Metis." -> "Metis_" to reflect change in "metis.ML"
blanchet
parents:
39376
diff
changeset
|
238 |
Metis_Thm.toString mth) |
32956 | 239 |
val ctxt' = fold Variable.declare_constraints (map prop_of cls) ctxt |
240 |
(*add constraints arising from converting goal to clause form*) |
|
39419
c9accfd621a5
"Metis." -> "Metis_" to reflect change in "metis.ML"
blanchet
parents:
39376
diff
changeset
|
241 |
val proof = Metis_Proof.proof mth |
39886
8a9f0c97d550
first step towards a new skolemizer that doesn't require "Eps"
blanchet
parents:
39721
diff
changeset
|
242 |
val result = |
8a9f0c97d550
first step towards a new skolemizer that doesn't require "Eps"
blanchet
parents:
39721
diff
changeset
|
243 |
fold (replay_one_inference ctxt' mode old_skolems) proof axioms |
32956 | 244 |
and used = map_filter (used_axioms axioms) proof |
245 |
val _ = trace_msg (fn () => "METIS COMPLETED...clauses actually used:") |
|
246 |
val _ = app (fn th => trace_msg (fn () => Display.string_of_thm ctxt th)) used |
|
39887
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
247 |
val unused = th_cls_pairs |> map_filter (fn (name, (_, cls)) => |
39497
fa16349939b7
complete refactoring of Metis along the lines of Sledgehammer
blanchet
parents:
39494
diff
changeset
|
248 |
if have_common_thm used cls then NONE else SOME name) |
32956 | 249 |
in |
39497
fa16349939b7
complete refactoring of Metis along the lines of Sledgehammer
blanchet
parents:
39494
diff
changeset
|
250 |
if not (null cls) andalso not (have_common_thm used cls) then |
36383 | 251 |
warning "Metis: The assumptions are inconsistent." |
252 |
else |
|
253 |
(); |
|
254 |
if not (null unused) then |
|
36230
43d10a494c91
added warning about inconsistent context to Metis;
blanchet
parents:
36170
diff
changeset
|
255 |
warning ("Metis: Unused theorems: " ^ commas_quote unused |
43d10a494c91
added warning about inconsistent context to Metis;
blanchet
parents:
36170
diff
changeset
|
256 |
^ ".") |
43d10a494c91
added warning about inconsistent context to Metis;
blanchet
parents:
36170
diff
changeset
|
257 |
else |
43d10a494c91
added warning about inconsistent context to Metis;
blanchet
parents:
36170
diff
changeset
|
258 |
(); |
32956 | 259 |
case result of |
260 |
(_,ith)::_ => |
|
36230
43d10a494c91
added warning about inconsistent context to Metis;
blanchet
parents:
36170
diff
changeset
|
261 |
(trace_msg (fn () => "Success: " ^ Display.string_of_thm ctxt ith); |
39887
74939e2afb95
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet
parents:
39886
diff
changeset
|
262 |
[discharge_skolem_premises ctxt dischargers ith]) |
38097
5e4ad2df09f3
revert exception throwing in FOL_SOLVE, since they're not caught anyway
blanchet
parents:
38028
diff
changeset
|
263 |
| _ => (trace_msg (fn () => "Metis: No result"); []) |
32956 | 264 |
end |
39419
c9accfd621a5
"Metis." -> "Metis_" to reflect change in "metis.ML"
blanchet
parents:
39376
diff
changeset
|
265 |
| Metis_Resolution.Satisfiable _ => |
32956 | 266 |
(trace_msg (fn () => "Metis: No first-order proof with the lemmas supplied"); |
38097
5e4ad2df09f3
revert exception throwing in FOL_SOLVE, since they're not caught anyway
blanchet
parents:
38028
diff
changeset
|
267 |
[]) |
32956 | 268 |
end; |
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset
|
269 |
|
38632
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
270 |
(* Extensionalize "th", because that makes sense and that's what Sledgehammer |
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
271 |
does, but also keep an unextensionalized version of "th" for backward |
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
272 |
compatibility. *) |
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
273 |
fun also_extensionalize_theorem th = |
39890 | 274 |
let val th' = Meson_Clausify.extensionalize_theorem th in |
38632
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
275 |
if Thm.eq_thm (th, th') then [th] |
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
276 |
else th :: Meson.make_clauses_unsorted [th'] |
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
277 |
end |
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
278 |
|
38028 | 279 |
val neg_clausify = |
280 |
single |
|
281 |
#> Meson.make_clauses_unsorted |
|
38632
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
282 |
#> maps also_extensionalize_theorem |
39890 | 283 |
#> map Meson_Clausify.introduce_combinators_in_theorem |
38028 | 284 |
#> Meson.finish_cnf |
285 |
||
39269
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39267
diff
changeset
|
286 |
fun preskolem_tac ctxt st0 = |
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39267
diff
changeset
|
287 |
(if exists (Meson.has_too_many_clauses ctxt) |
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39267
diff
changeset
|
288 |
(Logic.prems_of_goal (prop_of st0) 1) then |
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39267
diff
changeset
|
289 |
cnf.cnfx_rewrite_tac ctxt 1 |
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39267
diff
changeset
|
290 |
else |
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39267
diff
changeset
|
291 |
all_tac) st0 |
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39267
diff
changeset
|
292 |
|
38652
e063be321438
perform eta-expansion of quantifier bodies in Sledgehammer translation when needed + transform elim rules later;
blanchet
parents:
38632
diff
changeset
|
293 |
val type_has_top_sort = |
e063be321438
perform eta-expansion of quantifier bodies in Sledgehammer translation when needed + transform elim rules later;
blanchet
parents:
38632
diff
changeset
|
294 |
exists_subtype (fn TFree (_, []) => true | TVar (_, []) => true | _ => false) |
e063be321438
perform eta-expansion of quantifier bodies in Sledgehammer translation when needed + transform elim rules later;
blanchet
parents:
38632
diff
changeset
|
295 |
|
37516
c81c86bfc18a
have "metis" method and "metis_tac" fall back on "metisFT" upon failure, following a suggestion by Larry
blanchet
parents:
37509
diff
changeset
|
296 |
fun generic_metis_tac mode ctxt ths i st0 = |
37926
e6ff246c0cdb
renamings + only need second component of name pool to reconstruct proofs
blanchet
parents:
37925
diff
changeset
|
297 |
let |
e6ff246c0cdb
renamings + only need second component of name pool to reconstruct proofs
blanchet
parents:
37925
diff
changeset
|
298 |
val _ = trace_msg (fn () => |
32956 | 299 |
"Metis called with theorems " ^ cat_lines (map (Display.string_of_thm ctxt) ths)) |
300 |
in |
|
37626
1146291fe718
move blacklisting completely out of the clausifier;
blanchet
parents:
37625
diff
changeset
|
301 |
if exists_type type_has_top_sort (prop_of st0) then |
37516
c81c86bfc18a
have "metis" method and "metis_tac" fall back on "metisFT" upon failure, following a suggestion by Larry
blanchet
parents:
37509
diff
changeset
|
302 |
(warning ("Metis: Proof state contains the universal sort {}"); Seq.empty) |
35568
8fbbfc39508f
renamed type_has_empty_sort to type_has_topsort -- {} is the full universal sort;
wenzelm
parents:
34087
diff
changeset
|
303 |
else |
39594
624d6c0e220d
revert b96941dddd04 and c13b4589fddf, which dramatically inflate proof terms
blanchet
parents:
39560
diff
changeset
|
304 |
Meson.MESON (preskolem_tac ctxt) (maps neg_clausify) |
624d6c0e220d
revert b96941dddd04 and c13b4589fddf, which dramatically inflate proof terms
blanchet
parents:
39560
diff
changeset
|
305 |
(fn cls => resolve_tac (FOL_SOLVE mode ctxt cls ths) 1) |
624d6c0e220d
revert b96941dddd04 and c13b4589fddf, which dramatically inflate proof terms
blanchet
parents:
39560
diff
changeset
|
306 |
ctxt i st0 |
32956 | 307 |
end |
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset
|
308 |
|
37516
c81c86bfc18a
have "metis" method and "metis_tac" fall back on "metisFT" upon failure, following a suggestion by Larry
blanchet
parents:
37509
diff
changeset
|
309 |
val metis_tac = generic_metis_tac HO |
c81c86bfc18a
have "metis" method and "metis_tac" fall back on "metisFT" upon failure, following a suggestion by Larry
blanchet
parents:
37509
diff
changeset
|
310 |
val metisF_tac = generic_metis_tac FO |
c81c86bfc18a
have "metis" method and "metis_tac" fall back on "metisFT" upon failure, following a suggestion by Larry
blanchet
parents:
37509
diff
changeset
|
311 |
val metisFT_tac = generic_metis_tac FT |
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset
|
312 |
|
38632
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
313 |
(* Whenever "X" has schematic type variables, we treat "using X by metis" as |
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
314 |
"by (metis X)", to prevent "Subgoal.FOCUS" from freezing the type variables. |
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
315 |
We don't do it for nonschematic facts "X" because this breaks a few proofs |
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
316 |
(in the rare and subtle case where a proof relied on extensionality not being |
38994 | 317 |
applied) and brings few benefits. *) |
38632
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
318 |
val has_tvar = |
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
319 |
exists_type (exists_subtype (fn TVar _ => true | _ => false)) o prop_of |
37516
c81c86bfc18a
have "metis" method and "metis_tac" fall back on "metisFT" upon failure, following a suggestion by Larry
blanchet
parents:
37509
diff
changeset
|
320 |
fun method name mode = |
c81c86bfc18a
have "metis" method and "metis_tac" fall back on "metisFT" upon failure, following a suggestion by Larry
blanchet
parents:
37509
diff
changeset
|
321 |
Method.setup name (Attrib.thms >> (fn ths => fn ctxt => |
38632
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
322 |
METHOD (fn facts => |
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
323 |
let |
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
324 |
val (schem_facts, nonschem_facts) = |
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
325 |
List.partition has_tvar facts |
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
326 |
in |
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
327 |
HEADGOAL (Method.insert_tac nonschem_facts THEN' |
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
328 |
CHANGED_PROP |
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
329 |
o generic_metis_tac mode ctxt (schem_facts @ ths)) |
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38614
diff
changeset
|
330 |
end))) |
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset
|
331 |
|
32956 | 332 |
val setup = |
37516
c81c86bfc18a
have "metis" method and "metis_tac" fall back on "metisFT" upon failure, following a suggestion by Larry
blanchet
parents:
37509
diff
changeset
|
333 |
type_lits_setup |
39891
8e12f1956fcd
"meson_new_skolemizer" -> "metis_new_skolemizer" option (since Meson doesn't support the new skolemizer (yet))
blanchet
parents:
39890
diff
changeset
|
334 |
#> new_skolemizer_setup |
37516
c81c86bfc18a
have "metis" method and "metis_tac" fall back on "metisFT" upon failure, following a suggestion by Larry
blanchet
parents:
37509
diff
changeset
|
335 |
#> method @{binding metis} HO "Metis for FOL/HOL problems" |
c81c86bfc18a
have "metis" method and "metis_tac" fall back on "metisFT" upon failure, following a suggestion by Larry
blanchet
parents:
37509
diff
changeset
|
336 |
#> method @{binding metisF} FO "Metis for FOL problems" |
c81c86bfc18a
have "metis" method and "metis_tac" fall back on "metisFT" upon failure, following a suggestion by Larry
blanchet
parents:
37509
diff
changeset
|
337 |
#> method @{binding metisFT} FT |
c81c86bfc18a
have "metis" method and "metis_tac" fall back on "metisFT" upon failure, following a suggestion by Larry
blanchet
parents:
37509
diff
changeset
|
338 |
"Metis for FOL/HOL problems with fully-typed translation" |
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset
|
339 |
|
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset
|
340 |
end; |