author | blanchet |
Thu, 07 Feb 2013 18:39:24 +0100 | |
changeset 51031 | 63d71b247323 |
parent 51030 | b0d9ff6b4b4f |
child 51145 | 280ece22765b |
permissions | -rw-r--r-- |
46320 | 1 |
(* Title: HOL/Tools/ATP/atp_proof_redirect.ML |
45877 | 2 |
Author: Jasmin Blanchette, TU Muenchen |
3 |
||
4 |
Transformation of a proof by contradiction into a direct proof. |
|
5 |
*) |
|
6 |
||
45882 | 7 |
signature ATP_ATOM = |
8 |
sig |
|
9 |
type key |
|
10 |
val ord : key * key -> order |
|
11 |
val string_of : key -> string |
|
12 |
end; |
|
13 |
||
46320 | 14 |
signature ATP_PROOF_REDIRECT = |
45877 | 15 |
sig |
45882 | 16 |
type atom |
17 |
||
18 |
structure Atom_Graph : GRAPH |
|
45877 | 19 |
|
45882 | 20 |
type ref_sequent = atom list * atom |
21 |
type ref_graph = unit Atom_Graph.T |
|
22 |
||
23 |
type clause = atom list |
|
24 |
type direct_sequent = atom list * clause |
|
25 |
type direct_graph = unit Atom_Graph.T |
|
45877 | 26 |
|
27 |
type rich_sequent = clause list * clause |
|
28 |
||
45882 | 29 |
datatype direct_inference = |
45877 | 30 |
Have of rich_sequent | |
45882 | 31 |
Cases of (clause * direct_inference list) list |
32 |
||
33 |
type direct_proof = direct_inference list |
|
45877 | 34 |
|
45882 | 35 |
val make_ref_graph : (atom list * atom) list -> ref_graph |
36 |
val axioms_of_ref_graph : ref_graph -> atom list -> atom list |
|
37 |
val tainted_atoms_of_ref_graph : ref_graph -> atom list -> atom list |
|
45877 | 38 |
val sequents_of_ref_graph : ref_graph -> ref_sequent list |
47915 | 39 |
val string_of_ref_graph : ref_graph -> string |
45882 | 40 |
val redirect_sequent : atom list -> atom -> ref_sequent -> direct_sequent |
45877 | 41 |
val direct_graph : direct_sequent list -> direct_graph |
51031
63d71b247323
more robustness in Isar proof reconstruction (cf. bug report by Ondrej)
blanchet
parents:
51030
diff
changeset
|
42 |
val redirect_graph : |
63d71b247323
more robustness in Isar proof reconstruction (cf. bug report by Ondrej)
blanchet
parents:
51030
diff
changeset
|
43 |
atom list -> atom list -> atom -> ref_graph -> direct_proof |
45882 | 44 |
val succedent_of_cases : (clause * direct_inference list) list -> clause |
45 |
val string_of_direct_proof : direct_proof -> string |
|
45877 | 46 |
end; |
47 |
||
46320 | 48 |
functor ATP_Proof_Redirect(Atom : ATP_ATOM): ATP_PROOF_REDIRECT = |
45877 | 49 |
struct |
50 |
||
45882 | 51 |
type atom = Atom.key |
52 |
||
53 |
structure Atom_Graph = Graph(Atom) |
|
45877 | 54 |
|
45882 | 55 |
type ref_sequent = atom list * atom |
56 |
type ref_graph = unit Atom_Graph.T |
|
57 |
||
58 |
type clause = atom list |
|
59 |
type direct_sequent = atom list * clause |
|
60 |
type direct_graph = unit Atom_Graph.T |
|
45877 | 61 |
|
62 |
type rich_sequent = clause list * clause |
|
63 |
||
45882 | 64 |
datatype direct_inference = |
45877 | 65 |
Have of rich_sequent | |
45882 | 66 |
Cases of (clause * direct_inference list) list |
67 |
||
68 |
type direct_proof = direct_inference list |
|
45877 | 69 |
|
45882 | 70 |
fun atom_eq p = (Atom.ord p = EQUAL) |
71 |
fun clause_eq (c, d) = (length c = length d andalso forall atom_eq (c ~~ d)) |
|
72 |
fun direct_sequent_eq ((gamma, c), (delta, d)) = |
|
73 |
clause_eq (gamma, delta) andalso clause_eq (c, d) |
|
45877 | 74 |
|
75 |
fun make_ref_graph infers = |
|
76 |
let |
|
77 |
fun add_edge to from = |
|
45882 | 78 |
Atom_Graph.default_node (from, ()) |
79 |
#> Atom_Graph.default_node (to, ()) |
|
80 |
#> Atom_Graph.add_edge_acyclic (from, to) |
|
45877 | 81 |
fun add_infer (froms, to) = fold (add_edge to) froms |
45882 | 82 |
in Atom_Graph.empty |> fold add_infer infers end |
83 |
||
84 |
fun axioms_of_ref_graph ref_graph conjs = |
|
85 |
subtract atom_eq conjs (Atom_Graph.minimals ref_graph) |
|
86 |
fun tainted_atoms_of_ref_graph ref_graph = Atom_Graph.all_succs ref_graph |
|
45877 | 87 |
|
45882 | 88 |
fun sequents_of_ref_graph ref_graph = |
89 |
map (`(Atom_Graph.immediate_preds ref_graph)) |
|
90 |
(filter_out (Atom_Graph.is_minimal ref_graph) (Atom_Graph.keys ref_graph)) |
|
45877 | 91 |
|
47915 | 92 |
val string_of_context = map Atom.string_of #> space_implode ", " |
93 |
||
94 |
fun string_of_sequent (gamma, c) = |
|
95 |
string_of_context gamma ^ " \<turnstile> " ^ Atom.string_of c |
|
96 |
||
47928 | 97 |
fun string_of_ref_graph ref_graph = |
98 |
ref_graph |> sequents_of_ref_graph |> map string_of_sequent |> cat_lines |
|
47915 | 99 |
|
45882 | 100 |
fun redirect_sequent tainted bot (gamma, c) = |
101 |
if member atom_eq tainted c then |
|
102 |
gamma |> List.partition (not o member atom_eq tainted) |
|
103 |
|>> not (atom_eq (c, bot)) ? cons c |
|
45877 | 104 |
else |
45882 | 105 |
(gamma, [c]) |
45877 | 106 |
|
107 |
fun direct_graph seqs = |
|
108 |
let |
|
109 |
fun add_edge from to = |
|
45882 | 110 |
Atom_Graph.default_node (from, ()) |
111 |
#> Atom_Graph.default_node (to, ()) |
|
112 |
#> Atom_Graph.add_edge_acyclic (from, to) |
|
113 |
fun add_seq (gamma, c) = fold (fn l => fold (add_edge l) c) gamma |
|
114 |
in Atom_Graph.empty |> fold add_seq seqs end |
|
45877 | 115 |
|
45882 | 116 |
fun disj cs = fold (union atom_eq) cs [] |> sort Atom.ord |
45877 | 117 |
|
45882 | 118 |
fun succedent_of_inference (Have (_, c)) = c |
119 |
| succedent_of_inference (Cases cases) = succedent_of_cases cases |
|
120 |
and succedent_of_case (c, []) = c |
|
121 |
| succedent_of_case (_, infs) = succedent_of_inference (List.last infs) |
|
122 |
and succedent_of_cases cases = disj (map succedent_of_case cases) |
|
45877 | 123 |
|
124 |
fun dest_Have (Have z) = z |
|
125 |
| dest_Have _ = raise Fail "non-Have" |
|
126 |
||
127 |
fun enrich_Have nontrivs trivs (cs, c) = |
|
45882 | 128 |
(cs |> map (fn c => if member clause_eq nontrivs c then disj (c :: trivs) |
45877 | 129 |
else c), |
130 |
disj (c :: trivs)) |
|
131 |
|> Have |
|
132 |
||
133 |
fun s_cases cases = |
|
134 |
case cases |> List.partition (null o snd) of |
|
45882 | 135 |
(trivs, nontrivs as [(nontriv0, proof)]) => |
45877 | 136 |
if forall (can dest_Have) proof then |
137 |
let val seqs = proof |> map dest_Have in |
|
138 |
seqs |> map (enrich_Have (nontriv0 :: map snd seqs) (map fst trivs)) |
|
139 |
end |
|
140 |
else |
|
45882 | 141 |
[Cases nontrivs] |
142 |
| (_, nontrivs) => [Cases nontrivs] |
|
45877 | 143 |
|
45882 | 144 |
fun descendants direct_graph = |
145 |
these o try (Atom_Graph.all_succs direct_graph) o single |
|
45877 | 146 |
|
147 |
fun zones_of 0 _ = [] |
|
45882 | 148 |
| zones_of n (bs :: bss) = |
149 |
(fold (subtract atom_eq) bss) bs :: zones_of (n - 1) (bss @ [bs]) |
|
150 |
||
51031
63d71b247323
more robustness in Isar proof reconstruction (cf. bug report by Ondrej)
blanchet
parents:
51030
diff
changeset
|
151 |
fun redirect_graph axioms tainted bot ref_graph = |
45882 | 152 |
let |
153 |
val seqs = |
|
154 |
map (redirect_sequent tainted bot) (sequents_of_ref_graph ref_graph) |
|
155 |
val direct_graph = direct_graph seqs |
|
156 |
fun redirect c proved seqs = |
|
157 |
if null seqs then |
|
158 |
[] |
|
159 |
else if length c < 2 then |
|
160 |
let |
|
161 |
val proved = c @ proved |
|
162 |
val provable = |
|
163 |
filter (fn (gamma, _) => subset atom_eq (gamma, proved)) seqs |
|
164 |
val horn_provable = filter (fn (_, [_]) => true | _ => false) provable |
|
165 |
val seq as (gamma, c) = hd (horn_provable @ provable) |
|
166 |
in |
|
167 |
Have (map single gamma, c) :: |
|
168 |
redirect c proved (filter (curry (not o direct_sequent_eq) seq) seqs) |
|
169 |
end |
|
170 |
else |
|
171 |
let |
|
172 |
fun subsequents seqs zone = |
|
173 |
filter (fn (gamma, _) => subset atom_eq (gamma, zone @ proved)) seqs |
|
174 |
val zones = zones_of (length c) (map (descendants direct_graph) c) |
|
175 |
val subseqss = map (subsequents seqs) zones |
|
176 |
val seqs = fold (subtract direct_sequent_eq) subseqss seqs |
|
177 |
val cases = |
|
178 |
map2 (fn l => fn subseqs => ([l], redirect [l] proved subseqs)) |
|
179 |
c subseqss |
|
180 |
in s_cases cases @ redirect (succedent_of_cases cases) proved seqs end |
|
45877 | 181 |
in redirect [] axioms seqs end |
182 |
||
183 |
fun indent 0 = "" |
|
184 |
| indent n = " " ^ indent (n - 1) |
|
185 |
||
186 |
fun string_of_clause [] = "\<bottom>" |
|
45882 | 187 |
| string_of_clause ls = space_implode " \<or> " (map Atom.string_of ls) |
45877 | 188 |
|
189 |
fun string_of_rich_sequent ch ([], c) = ch ^ " " ^ string_of_clause c |
|
190 |
| string_of_rich_sequent ch (cs, c) = |
|
191 |
commas (map string_of_clause cs) ^ " " ^ ch ^ " " ^ string_of_clause c |
|
192 |
||
193 |
fun string_of_case depth (c, proof) = |
|
194 |
indent (depth + 1) ^ "[" ^ string_of_clause c ^ "]" |
|
195 |
|> not (null proof) ? suffix ("\n" ^ string_of_subproof (depth + 1) proof) |
|
196 |
||
197 |
and string_of_inference depth (Have seq) = |
|
198 |
indent depth ^ string_of_rich_sequent "\<triangleright>" seq |
|
199 |
| string_of_inference depth (Cases cases) = |
|
200 |
indent depth ^ "[\n" ^ |
|
201 |
space_implode ("\n" ^ indent depth ^ "|\n") |
|
202 |
(map (string_of_case depth) cases) ^ "\n" ^ |
|
203 |
indent depth ^ "]" |
|
204 |
||
45882 | 205 |
and string_of_subproof depth = cat_lines o map (string_of_inference depth) |
45877 | 206 |
|
45882 | 207 |
val string_of_direct_proof = string_of_subproof 0 |
45877 | 208 |
|
209 |
end; |