8 Cic.term * (* left side *)
9 Cic.term * (* right side *)
10 Utils.comparison) * (* ordering *)
11 Cic.metasenv * (* environment for metas *)
12 Cic.term list (* arguments *)
16 | BasicProof of Cic.term
18 Cic.substitution * UriManager.uri *
19 (* name, ty, eq_ty, left, right *)
20 (Cic.name * Cic.term * Cic.term * Cic.term * Cic.term) *
21 (Utils.pos * equality) * proof
22 | ProofGoalBlock of proof * equality
23 | ProofSymBlock of Cic.term Cic.explicit_named_substitution * proof
27 let string_of_equality ?env =
31 | w, _, (ty, left, right, o), _, _ ->
32 Printf.sprintf "Weight: %d, {%s}: %s =(%s) %s" w (CicPp.ppterm ty)
33 (CicPp.ppterm left) (string_of_comparison o) (CicPp.ppterm right)
35 | Some (_, context, _) -> (
36 let names = names_of_context context in
38 | w, _, (ty, left, right, o), _, _ ->
39 Printf.sprintf "Weight: %d, {%s}: %s =(%s) %s" w (CicPp.pp ty names)
40 (CicPp.pp left names) (string_of_comparison o)
41 (CicPp.pp right names)
46 let build_proof_term equality =
47 (* Printf.printf "build_term_proof %s" (string_of_equality equality); *)
48 (* print_newline (); *)
52 let rec do_build_proof proof =
55 Printf.fprintf stderr "WARNING: no proof!\n";
56 (* (string_of_equality equality); *)
58 | BasicProof term -> term
59 | ProofGoalBlock (proofbit, equality) ->
60 print_endline "found ProofGoalBlock, going up...";
61 let _, proof, _, _, _ = equality in
62 do_build_goal_proof proofbit proof
63 | ProofSymBlock (ens, proof) ->
64 let proof = do_build_proof proof in
66 Cic.Const (HelmLibraryObjects.Logic.sym_eq_URI, ens); (* symmetry *)
69 | ProofBlock (subst, eq_URI, t', (pos, eq), eqproof) ->
70 (* Printf.printf "\nsubst:\n%s\n" (print_subst subst); *)
71 (* print_newline (); *)
73 let name, ty, eq_ty, left, right = t' in
75 Cic.Appl [Cic.MutInd (HelmLibraryObjects.Logic.eq_URI, 0, []);
78 let t' = Cic.Lambda (name, ty, (* CicSubstitution.lift 1 *) bo) in
79 (* Printf.printf " ProofBlock: eq = %s, eq' = %s" *)
80 (* (string_of_equality eq) (string_of_equality eq'); *)
81 (* print_newline (); *)
83 (* let s = String.make !indent ' ' in *)
86 (* print_endline (s ^ "build proof'------------"); *)
89 let _, proof', _, _, _ = eq in
92 (* print_endline (s ^ "END proof'"); *)
94 (* print_endline (s ^ "build eqproof-----------"); *)
96 let eqproof = do_build_proof eqproof in
98 (* print_endline (s ^ "END eqproof"); *)
102 let _, _, (ty, what, other, _), menv', args' = eq in
104 if pos = Utils.Left then what, other else other, what
106 CicMetaSubst.apply_subst subst
107 (Cic.Appl [Cic.Const (eq_URI, []); ty;
108 what; t'; eqproof; other; proof'])
110 and do_build_goal_proof proofbit proof =
111 (* match proofbit with *)
112 (* | BasicProof _ -> do_build_proof proof *)
115 | ProofGoalBlock (pb, eq) ->
116 do_build_proof (ProofGoalBlock (replace_proof proofbit pb, eq))
117 (* let _, proof, _, _, _ = eq in *)
118 (* let newproof = replace_proof proofbit proof in *)
119 (* do_build_proof newproof *)
121 (* | ProofBlock (subst, eq_URI, t', poseq, eqproof) -> *)
122 (* let eqproof' = replace_proof proofbit eqproof in *)
123 (* do_build_proof (ProofBlock (subst, eq_URI, t', poseq, eqproof')) *)
124 | _ -> do_build_proof (replace_proof proofbit proof) (* assert false *)
126 and replace_proof newproof = function
127 | ProofBlock (subst, eq_URI, t', poseq, eqproof) ->
129 (* if eq_URI = HelmLibraryObjects.Logic.eq_ind_URI then *)
130 (* HelmLibraryObjects.Logic.eq_ind_r_URI *)
132 (* HelmLibraryObjects.Logic.eq_ind_URI *)
134 let eqproof' = replace_proof newproof eqproof in
135 ProofBlock (subst, uri(* eq_URI *), t', poseq, eqproof')
136 (* ProofBlock (subst, eq_URI, t', poseq, newproof) *)
137 | ProofGoalBlock (pb, equality) ->
138 let pb' = replace_proof newproof pb in
139 ProofGoalBlock (pb', equality)
140 (* let w, proof, t, menv, args = equality in *)
141 (* let proof' = replace_proof newproof proof in *)
142 (* ProofGoalBlock (pb, (w, proof', t, menv, args)) *)
143 | BasicProof _ -> newproof
146 let _, proof, _, _, _ = equality in
151 let rec metas_of_term = function
152 | Cic.Meta (i, c) -> [i]
155 | Cic.MutInd (_, _, ens)
156 | Cic.MutConstruct (_, _, _, ens) ->
157 List.flatten (List.map (fun (u, t) -> metas_of_term t) ens)
160 | Cic.Lambda (_, s, t)
161 | Cic.LetIn (_, s, t) -> (metas_of_term s) @ (metas_of_term t)
162 | Cic.Appl l -> List.flatten (List.map metas_of_term l)
163 | Cic.MutCase (uri, i, s, t, l) ->
164 (metas_of_term s) @ (metas_of_term t) @
165 (List.flatten (List.map metas_of_term l))
168 (List.map (fun (s, i, t1, t2) ->
169 (metas_of_term t1) @ (metas_of_term t2)) il)
170 | Cic.CoFix (i, il) ->
172 (List.map (fun (s, t1, t2) ->
173 (metas_of_term t1) @ (metas_of_term t2)) il)
178 exception NotMetaConvertible;;
180 let meta_convertibility_aux table t1 t2 =
181 let module C = Cic in
185 (fun (k, v) -> Printf.sprintf "(%d, %d)" k v) t)
187 let rec aux ((table_l, table_r) as table) t1 t2 =
188 (* Printf.printf "aux %s, %s\ntable_l: %s, table_r: %s\n" *)
189 (* (CicPp.ppterm t1) (CicPp.ppterm t2) *)
190 (* (print_table table_l) (print_table table_r); *)
192 | C.Meta (m1, tl1), C.Meta (m2, tl2) ->
193 let m1_binding, table_l =
194 try List.assoc m1 table_l, table_l
195 with Not_found -> m2, (m1, m2)::table_l
196 and m2_binding, table_r =
197 try List.assoc m2 table_r, table_r
198 with Not_found -> m1, (m2, m1)::table_r
200 (* let m1_binding, m2_binding, table = *)
201 (* let m1b, table = *)
202 (* try List.assoc m1 table, table *)
203 (* with Not_found -> m2, (m1, m2)::table *)
205 (* let m2b, table = *)
206 (* try List.assoc m2 table, table *)
207 (* with Not_found -> m1, (m2, m1)::table *)
209 (* m1b, m2b, table *)
211 (* Printf.printf "table_l: %s\ntable_r: %s\n\n" *)
212 (* (print_table table_l) (print_table table_r); *)
213 if (m1_binding <> m2) || (m2_binding <> m1) then
214 raise NotMetaConvertible
220 | None, Some _ | Some _, None -> raise NotMetaConvertible
222 | Some t1, Some t2 -> (aux res t1 t2))
223 (table_l, table_r) tl1 tl2
224 with Invalid_argument _ ->
225 raise NotMetaConvertible
227 | C.Var (u1, ens1), C.Var (u2, ens2)
228 | C.Const (u1, ens1), C.Const (u2, ens2) when (UriManager.eq u1 u2) ->
229 aux_ens table ens1 ens2
230 | C.Cast (s1, t1), C.Cast (s2, t2)
231 | C.Prod (_, s1, t1), C.Prod (_, s2, t2)
232 | C.Lambda (_, s1, t1), C.Lambda (_, s2, t2)
233 | C.LetIn (_, s1, t1), C.LetIn (_, s2, t2) ->
234 let table = aux table s1 s2 in
236 | C.Appl l1, C.Appl l2 -> (
237 try List.fold_left2 (fun res t1 t2 -> (aux res t1 t2)) table l1 l2
238 with Invalid_argument _ -> raise NotMetaConvertible
240 | C.MutInd (u1, i1, ens1), C.MutInd (u2, i2, ens2)
241 when (UriManager.eq u1 u2) && i1 = i2 -> aux_ens table ens1 ens2
242 | C.MutConstruct (u1, i1, j1, ens1), C.MutConstruct (u2, i2, j2, ens2)
243 when (UriManager.eq u1 u2) && i1 = i2 && j1 = j2 ->
244 aux_ens table ens1 ens2
245 | C.MutCase (u1, i1, s1, t1, l1), C.MutCase (u2, i2, s2, t2, l2)
246 when (UriManager.eq u1 u2) && i1 = i2 ->
247 let table = aux table s1 s2 in
248 let table = aux table t1 t2 in (
249 try List.fold_left2 (fun res t1 t2 -> (aux res t1 t2)) table l1 l2
250 with Invalid_argument _ -> raise NotMetaConvertible
252 | C.Fix (i1, il1), C.Fix (i2, il2) when i1 = i2 -> (
255 (fun res (n1, i1, s1, t1) (n2, i2, s2, t2) ->
256 if i1 <> i2 then raise NotMetaConvertible
258 let res = (aux res s1 s2) in aux res t1 t2)
260 with Invalid_argument _ -> raise NotMetaConvertible
262 | C.CoFix (i1, il1), C.CoFix (i2, il2) when i1 = i2 -> (
265 (fun res (n1, s1, t1) (n2, s2, t2) ->
266 let res = aux res s1 s2 in aux res t1 t2)
268 with Invalid_argument _ -> raise NotMetaConvertible
270 | t1, t2 when t1 = t2 -> table
271 | _, _ -> raise NotMetaConvertible
273 and aux_ens table ens1 ens2 =
274 let cmp (u1, t1) (u2, t2) =
275 compare (UriManager.string_of_uri u1) (UriManager.string_of_uri u2)
277 let ens1 = List.sort cmp ens1
278 and ens2 = List.sort cmp ens2 in
281 (fun res (u1, t1) (u2, t2) ->
282 if not (UriManager.eq u1 u2) then raise NotMetaConvertible
285 with Invalid_argument _ -> raise NotMetaConvertible
291 let meta_convertibility_eq eq1 eq2 =
292 let _, _, (ty, left, right, _), _, _ = eq1
293 and _, _, (ty', left', right', _), _, _ = eq2 in
296 else if (left = left') && (right = right') then
298 else if (left = right') && (right = left') then
302 let table = meta_convertibility_aux ([], []) left left' in
303 let _ = meta_convertibility_aux table right right' in
305 with NotMetaConvertible ->
307 let table = meta_convertibility_aux ([], []) left right' in
308 let _ = meta_convertibility_aux table right left' in
310 with NotMetaConvertible ->
315 let meta_convertibility t1 t2 =
319 (fun (k, v) -> Printf.sprintf "(%d, %d)" k v) t)
325 let l, r = meta_convertibility_aux ([], []) t1 t2 in
326 (* Printf.printf "meta_convertibility:\n%s\n%s\n\n" (f l) (f r); *)
328 with NotMetaConvertible ->
334 let replace_metas (* context *) term =
335 let module C = Cic in
336 let rec aux = function
339 (* CicMkImplicit.identity_relocation_list_for_metavariable context *)
341 (* if c = irl then *)
342 (* C.Implicit (Some (`MetaIndex i)) *)
344 (* Printf.printf "WARNING: c non e` un identity_relocation_list!\n%s\n" *)
345 (* (String.concat "\n" *)
347 (* (function None -> "" | Some t -> CicPp.ppterm t) c)); *)
350 C.Implicit (Some (`MetaInfo (i, c)))
351 | C.Var (u, ens) -> C.Var (u, aux_ens ens)
352 | C.Const (u, ens) -> C.Const (u, aux_ens ens)
353 | C.Cast (s, t) -> C.Cast (aux s, aux t)
354 | C.Prod (name, s, t) -> C.Prod (name, aux s, aux t)
355 | C.Lambda (name, s, t) -> C.Lambda (name, aux s, aux t)
356 | C.LetIn (name, s, t) -> C.LetIn (name, aux s, aux t)
357 | C.Appl l -> C.Appl (List.map aux l)
358 | C.MutInd (uri, i, ens) -> C.MutInd (uri, i, aux_ens ens)
359 | C.MutConstruct (uri, i, j, ens) -> C.MutConstruct (uri, i, j, aux_ens ens)
360 | C.MutCase (uri, i, s, t, l) ->
361 C.MutCase (uri, i, aux s, aux t, List.map aux l)
364 List.map (fun (s, i, t1, t2) -> (s, i, aux t1, aux t2)) il in
368 List.map (fun (s, t1, t2) -> (s, aux t1, aux t2)) il in
372 List.map (fun (u, t) -> (u, aux t)) ens
378 let restore_metas (* context *) term =
379 let module C = Cic in
380 let rec aux = function
381 | C.Implicit (Some (`MetaInfo (i, c))) ->
383 (* CicMkImplicit.identity_relocation_list_for_metavariable context *)
386 (* let local_context:(C.term option) list = *)
387 (* Marshal.from_string mc 0 *)
389 (* C.Meta (i, local_context) *)
391 | C.Var (u, ens) -> C.Var (u, aux_ens ens)
392 | C.Const (u, ens) -> C.Const (u, aux_ens ens)
393 | C.Cast (s, t) -> C.Cast (aux s, aux t)
394 | C.Prod (name, s, t) -> C.Prod (name, aux s, aux t)
395 | C.Lambda (name, s, t) -> C.Lambda (name, aux s, aux t)
396 | C.LetIn (name, s, t) -> C.LetIn (name, aux s, aux t)
397 | C.Appl l -> C.Appl (List.map aux l)
398 | C.MutInd (uri, i, ens) -> C.MutInd (uri, i, aux_ens ens)
399 | C.MutConstruct (uri, i, j, ens) -> C.MutConstruct (uri, i, j, aux_ens ens)
400 | C.MutCase (uri, i, s, t, l) ->
401 C.MutCase (uri, i, aux s, aux t, List.map aux l)
404 List.map (fun (s, i, t1, t2) -> (s, i, aux t1, aux t2)) il in
408 List.map (fun (s, t1, t2) -> (s, aux t1, aux t2)) il in
412 List.map (fun (u, t) -> (u, aux t)) ens
418 let rec restore_subst (* context *) subst =
420 (fun (i, (c, t, ty)) ->
421 i, (c, restore_metas (* context *) t, ty))
427 let rec check_irl start = function
429 | None::tl -> check_irl (start+1) tl
430 | (Some (Cic.Rel x))::tl ->
431 if x = start then check_irl (start+1) tl else false
435 let rec is_simple_term = function
436 | Cic.Appl ((Cic.Meta _)::_) -> false
437 | Cic.Appl l -> List.for_all is_simple_term l
438 | Cic.Meta (i, l) -> check_irl 1 l
440 | Cic.Const _ -> true
445 let lookup_subst meta subst =
447 | Cic.Meta (i, _) -> (
448 try let _, (_, t, _) = List.find (fun (m, _) -> m = i) subst in t
449 with Not_found -> meta
455 let unification_simple metasenv context t1 t2 ugraph =
456 let module C = Cic in
457 let module M = CicMetaSubst in
458 let module U = CicUnification in
459 let lookup = lookup_subst in
460 let rec occurs_check subst what where =
462 | t when what = t -> true
463 | C.Appl l -> List.exists (occurs_check subst what) l
465 let t = lookup where subst in
466 if t <> where then occurs_check subst what t else false
469 let rec unif subst menv s t =
470 let s = match s with C.Meta _ -> lookup s subst | _ -> s
471 and t = match t with C.Meta _ -> lookup t subst | _ -> t
474 | s, t when s = t -> subst, menv
475 | C.Meta (i, _), C.Meta (j, _) when i > j ->
477 | C.Meta _, t when occurs_check subst s t ->
478 raise (U.UnificationFailure "Inference.unification.unif")
479 | C.Meta (i, l), t ->
480 let _, _, ty = CicUtil.lookup_meta i menv in
482 if not (List.mem_assoc i subst) then (i, (context, t, ty))::subst
485 let menv = List.filter (fun (m, _, _) -> i <> m) menv in
487 | _, C.Meta _ -> unif subst menv t s
488 | C.Appl (hds::_), C.Appl (hdt::_) when hds <> hdt ->
489 raise (U.UnificationFailure "Inference.unification.unif")
490 | C.Appl (hds::tls), C.Appl (hdt::tlt) -> (
493 (fun (subst', menv) s t -> unif subst' menv s t)
494 (subst, menv) tls tlt
496 raise (U.UnificationFailure "Inference.unification.unif")
498 | _, _ -> raise (U.UnificationFailure "Inference.unification.unif")
500 let subst, menv = unif [] metasenv t1 t2 in
501 List.rev subst, menv, ugraph
505 let unification metasenv context t1 t2 ugraph =
506 (* Printf.printf "| unification %s %s\n" (CicPp.ppterm t1) (CicPp.ppterm t2); *)
507 let subst, menv, ug =
508 if not (is_simple_term t1) || not (is_simple_term t2) then
509 CicUnification.fo_unif metasenv context t1 t2 ugraph
511 unification_simple metasenv context t1 t2 ugraph
513 let rec fix_term = function
514 | (Cic.Meta (i, l) as t) ->
515 let t' = lookup_subst t subst in
516 if t <> t' then fix_term t' else t
517 | Cic.Appl l -> Cic.Appl (List.map fix_term l)
520 let rec fix_subst = function
522 | (i, (c, t, ty))::tl -> (i, (c, fix_term t, fix_term ty))::(fix_subst tl)
524 (* Printf.printf "| subst: %s\n" (print_subst ~prefix:" ; " subst); *)
525 (* print_endline "|"; *)
526 fix_subst subst, menv, ug
530 (* let unification = CicUnification.fo_unif;; *)
532 exception MatchingFailure;;
535 let matching_simple metasenv context t1 t2 ugraph =
536 let module C = Cic in
537 let module M = CicMetaSubst in
538 let module U = CicUnification in
539 let lookup meta subst =
542 try let _, (_, t, _) = List.find (fun (m, _) -> m = i) subst in t
543 with Not_found -> meta
547 let rec do_match subst menv s t =
548 (* Printf.printf "do_match %s %s\n%s\n" (CicPp.ppterm s) (CicPp.ppterm t) *)
549 (* (print_subst subst); *)
550 (* print_newline (); *)
551 (* let s = match s with C.Meta _ -> lookup s subst | _ -> s *)
552 (* let t = match t with C.Meta _ -> lookup t subst | _ -> t in *)
553 (* Printf.printf "after apply_subst: %s %s\n%s" *)
554 (* (CicPp.ppterm s) (CicPp.ppterm t) (print_subst subst); *)
555 (* print_newline (); *)
557 | s, t when s = t -> subst, menv
558 (* | C.Meta (i, _), C.Meta (j, _) when i > j -> *)
559 (* do_match subst menv t s *)
560 (* | C.Meta _, t when occurs_check subst s t -> *)
561 (* raise MatchingFailure *)
562 (* | s, C.Meta _ when occurs_check subst t s -> *)
563 (* raise MatchingFailure *)
564 | s, C.Meta (i, l) ->
565 let filter_menv i menv =
566 List.filter (fun (m, _, _) -> i <> m) menv
569 let value = lookup t subst in
571 (* | C.Meta (i', l') when Hashtbl.mem table i' -> *)
572 (* (i', (context, s, ty))::subst, menv (\* filter_menv i' menv *\) *)
573 | value when value = t ->
574 let _, _, ty = CicUtil.lookup_meta i menv in
575 (i, (context, s, ty))::subst, filter_menv i menv
576 | value when value <> s ->
577 raise MatchingFailure
578 | value -> do_match subst menv s value
581 (* else if value <> s then *)
582 (* raise MatchingFailure *)
584 (* if not (List.mem_assoc i subst) then (i, (context, t, ty))::subst *)
587 (* let menv = List.filter (fun (m, _, _) -> i <> m) menv in *)
589 (* | _, C.Meta _ -> do_match subst menv t s *)
590 (* | C.Appl (hds::_), C.Appl (hdt::_) when hds <> hdt -> *)
591 (* raise MatchingFailure *)
592 | C.Appl ls, C.Appl lt -> (
595 (fun (subst, menv) s t -> do_match subst menv s t)
598 (* print_endline (Printexc.to_string e); *)
599 (* Printf.printf "NO MATCH: %s %s\n" (CicPp.ppterm s) (CicPp.ppterm t); *)
600 (* print_newline (); *)
601 raise MatchingFailure
604 (* Printf.printf "NO MATCH: %s %s\n" (CicPp.ppterm s) (CicPp.ppterm t); *)
605 (* print_newline (); *)
606 raise MatchingFailure
608 let subst, menv = do_match [] metasenv t1 t2 in
609 (* Printf.printf "DONE!: subst = \n%s\n" (print_subst subst); *)
610 (* print_newline (); *)
615 let matching metasenv context t1 t2 ugraph =
616 (* if (is_simple_term t1) && (is_simple_term t2) then *)
617 (* let subst, menv, ug = *)
618 (* matching_simple metasenv context t1 t2 ugraph in *)
619 (* (\* Printf.printf "matching %s %s:\n%s\n" *\) *)
620 (* (\* (CicPp.ppterm t1) (CicPp.ppterm t2) (print_subst subst); *\) *)
621 (* (\* print_newline (); *\) *)
622 (* subst, menv, ug *)
624 (* Printf.printf "matching %s %s" (CicPp.ppterm t1) (CicPp.ppterm t2); *)
625 (* print_newline (); *)
627 let subst, metasenv, ugraph =
628 (* CicUnification.fo_unif metasenv context t1 t2 ugraph *)
629 unification metasenv context t1 t2 ugraph
631 let t' = CicMetaSubst.apply_subst subst t1 in
632 if not (meta_convertibility t1 t') then
633 raise MatchingFailure
635 let metas = metas_of_term t1 in
636 let fix_subst = function
637 | (i, (c, Cic.Meta (j, lc), ty)) when List.mem i metas ->
638 (j, (c, Cic.Meta (i, lc), ty))
641 let subst = List.map fix_subst subst in
643 (* Printf.printf "matching %s %s:\n%s\n" *)
644 (* (CicPp.ppterm t1) (CicPp.ppterm t2) (print_subst subst); *)
645 (* print_newline (); *)
647 subst, metasenv, ugraph
649 (* Printf.printf "failed to match %s %s\n" *)
650 (* (CicPp.ppterm t1) (CicPp.ppterm t2); *)
651 (* print_endline (Printexc.to_string e); *)
652 raise MatchingFailure
656 (* let profile = CicUtil.profile "Inference.matching" in *)
657 (* (fun metasenv context t1 t2 ugraph -> *)
658 (* profile (matching metasenv context t1 t2) ugraph) *)
662 let beta_expand ?(metas_ok=true) ?(match_only=false)
663 what type_of_what where context metasenv ugraph =
664 let module S = CicSubstitution in
665 let module C = Cic in
667 let print_info = false in
670 (* let names = names_of_context context in *)
671 (* Printf.printf "beta_expand:\nwhat: %s, %s\nwhere: %s, %s\n" *)
672 (* (CicPp.pp what names) (CicPp.ppterm what) *)
673 (* (CicPp.pp where names) (CicPp.ppterm where); *)
674 (* print_newline (); *)
678 ((list of all possible beta expansions, subst, metasenv, ugraph),
681 let rec aux lift_amount term context metasenv subst ugraph =
682 (* Printf.printf "enter aux %s\n" (CicPp.ppterm term); *)
683 let res, lifted_term =
686 [], if m <= lift_amount then C.Rel m else C.Rel (m+1)
688 | C.Var (uri, exp_named_subst) ->
689 let ens', lifted_ens =
690 aux_ens lift_amount exp_named_subst context metasenv subst ugraph
694 (fun (e, s, m, ug) ->
695 (C.Var (uri, e), s, m, ug)) ens'
697 expansions, C.Var (uri, lifted_ens)
702 (fun arg (res, lifted_tl) ->
705 let arg_res, lifted_arg =
706 aux lift_amount arg context metasenv subst ugraph in
709 (fun (a, s, m, ug) -> (Some a)::lifted_tl, s, m, ug)
714 (fun (r, s, m, ug) -> (Some lifted_arg)::r, s, m, ug)
716 (Some lifted_arg)::lifted_tl)
719 (fun (r, s, m, ug) -> None::r, s, m, ug)
726 (fun (l, s, m, ug) ->
727 (C.Meta (i, l), s, m, ug)) l'
729 e, C.Meta (i, lifted_l)
732 | C.Implicit _ as t -> [], t
736 aux lift_amount s context metasenv subst ugraph in
738 aux lift_amount t context metasenv subst ugraph
742 (fun (t, s, m, ug) ->
743 C.Cast (t, lifted_t), s, m, ug) l1 in
746 (fun (t, s, m, ug) ->
747 C.Cast (lifted_s, t), s, m, ug) l2 in
748 l1'@l2', C.Cast (lifted_s, lifted_t)
750 | C.Prod (nn, s, t) ->
752 aux lift_amount s context metasenv subst ugraph in
754 aux (lift_amount+1) t ((Some (nn, C.Decl s))::context)
755 metasenv subst ugraph
759 (fun (t, s, m, ug) ->
760 C.Prod (nn, t, lifted_t), s, m, ug) l1 in
763 (fun (t, s, m, ug) ->
764 C.Prod (nn, lifted_s, t), s, m, ug) l2 in
765 l1'@l2', C.Prod (nn, lifted_s, lifted_t)
767 | C.Lambda (nn, s, t) ->
769 aux lift_amount s context metasenv subst ugraph in
771 aux (lift_amount+1) t ((Some (nn, C.Decl s))::context)
772 metasenv subst ugraph
776 (fun (t, s, m, ug) ->
777 C.Lambda (nn, t, lifted_t), s, m, ug) l1 in
780 (fun (t, s, m, ug) ->
781 C.Lambda (nn, lifted_s, t), s, m, ug) l2 in
782 l1'@l2', C.Lambda (nn, lifted_s, lifted_t)
784 | C.LetIn (nn, s, t) ->
786 aux lift_amount s context metasenv subst ugraph in
788 aux (lift_amount+1) t ((Some (nn, C.Def (s, None)))::context)
789 metasenv subst ugraph
793 (fun (t, s, m, ug) ->
794 C.LetIn (nn, t, lifted_t), s, m, ug) l1 in
797 (fun (t, s, m, ug) ->
798 C.LetIn (nn, lifted_s, t), s, m, ug) l2 in
799 l1'@l2', C.LetIn (nn, lifted_s, lifted_t)
803 aux_list lift_amount l context metasenv subst ugraph
805 (List.map (fun (l, s, m, ug) -> (C.Appl l, s, m, ug)) l',
808 | C.Const (uri, exp_named_subst) ->
809 let ens', lifted_ens =
810 aux_ens lift_amount exp_named_subst context metasenv subst ugraph
814 (fun (e, s, m, ug) ->
815 (C.Const (uri, e), s, m, ug)) ens'
817 (expansions, C.Const (uri, lifted_ens))
819 | C.MutInd (uri, i ,exp_named_subst) ->
820 let ens', lifted_ens =
821 aux_ens lift_amount exp_named_subst context metasenv subst ugraph
825 (fun (e, s, m, ug) ->
826 (C.MutInd (uri, i, e), s, m, ug)) ens'
828 (expansions, C.MutInd (uri, i, lifted_ens))
830 | C.MutConstruct (uri, i, j, exp_named_subst) ->
831 let ens', lifted_ens =
832 aux_ens lift_amount exp_named_subst context metasenv subst ugraph
836 (fun (e, s, m, ug) ->
837 (C.MutConstruct (uri, i, j, e), s, m, ug)) ens'
839 (expansions, C.MutConstruct (uri, i, j, lifted_ens))
841 | C.MutCase (sp, i, outt, t, pl) ->
842 let pl_res, lifted_pl =
843 aux_list lift_amount pl context metasenv subst ugraph
845 let l1, lifted_outt =
846 aux lift_amount outt context metasenv subst ugraph in
848 aux lift_amount t context metasenv subst ugraph in
852 (fun (outt, s, m, ug) ->
853 C.MutCase (sp, i, outt, lifted_t, lifted_pl), s, m, ug) l1 in
856 (fun (t, s, m, ug) ->
857 C.MutCase (sp, i, lifted_outt, t, lifted_pl), s, m, ug) l2 in
860 (fun (pl, s, m, ug) ->
861 C.MutCase (sp, i, lifted_outt, lifted_t, pl), s, m, ug) pl_res
863 (l1'@l2'@l3', C.MutCase (sp, i, lifted_outt, lifted_t, lifted_pl))
866 let len = List.length fl in
869 (fun (nm, idx, ty, bo) (res, lifted_tl) ->
870 let lifted_ty = S.lift lift_amount ty in
871 let bo_res, lifted_bo =
872 aux (lift_amount+len) bo context metasenv subst ugraph in
875 (fun (a, s, m, ug) ->
876 (nm, idx, lifted_ty, a)::lifted_tl, s, m, ug)
881 (fun (r, s, m, ug) ->
882 (nm, idx, lifted_ty, lifted_bo)::r, s, m, ug) res),
883 (nm, idx, lifted_ty, lifted_bo)::lifted_tl)
887 (fun (fl, s, m, ug) -> C.Fix (i, fl), s, m, ug) fl',
888 C.Fix (i, lifted_fl))
891 let len = List.length fl in
894 (fun (nm, ty, bo) (res, lifted_tl) ->
895 let lifted_ty = S.lift lift_amount ty in
896 let bo_res, lifted_bo =
897 aux (lift_amount+len) bo context metasenv subst ugraph in
900 (fun (a, s, m, ug) ->
901 (nm, lifted_ty, a)::lifted_tl, s, m, ug)
906 (fun (r, s, m, ug) ->
907 (nm, lifted_ty, lifted_bo)::r, s, m, ug) res),
908 (nm, lifted_ty, lifted_bo)::lifted_tl)
912 (fun (fl, s, m, ug) -> C.CoFix (i, fl), s, m, ug) fl',
913 C.CoFix (i, lifted_fl))
917 | C.Meta _ when (not metas_ok) ->
921 (* if match_only then replace_metas context term *)
925 let subst', metasenv', ugraph' =
926 (* Printf.printf "provo a unificare %s e %s\n" *)
927 (* (CicPp.ppterm (S.lift lift_amount what)) (CicPp.ppterm term); *)
929 matching metasenv context term (S.lift lift_amount what) ugraph
931 CicUnification.fo_unif metasenv context
932 (S.lift lift_amount what) term ugraph
934 (* Printf.printf "Ok, trovato: %s\n\nwhat: %s" (CicPp.ppterm term) *)
935 (* (CicPp.ppterm (S.lift lift_amount what)); *)
936 (* Printf.printf "substitution:\n%s\n\n" (print_subst subst'); *)
937 (* Printf.printf "metasenv': %s\n" (print_metasenv metasenv'); *)
938 (* Printf.printf "metasenv: %s\n\n" (print_metasenv metasenv); *)
939 (* if match_only then *)
940 (* let t' = CicMetaSubst.apply_subst subst' term in *)
941 (* if not (meta_convertibility term t') then ( *)
942 (* res, lifted_term *)
944 (* let metas = metas_of_term term in *)
945 (* let fix_subst = function *)
946 (* | (i, (c, C.Meta (j, lc), ty)) when List.mem i metas -> *)
947 (* (j, (c, C.Meta (i, lc), ty)) *)
950 (* let subst' = List.map fix_subst subst' in *)
951 (* ((C.Rel (1 + lift_amount), subst', metasenv', ugraph')::res, *)
955 ((C.Rel (1 + lift_amount), subst', metasenv', ugraph')::res,
959 print_endline ("beta_expand ERROR!: " ^ (Printexc.to_string e));
963 (* Printf.printf "exit aux\n"; *)
966 and aux_list lift_amount l context metasenv subst ugraph =
968 (fun arg (res, lifted_tl) ->
969 let arg_res, lifted_arg =
970 aux lift_amount arg context metasenv subst ugraph in
972 (fun (a, s, m, ug) -> a::lifted_tl, s, m, ug) arg_res
975 (fun (r, s, m, ug) -> lifted_arg::r, s, m, ug) res),
976 lifted_arg::lifted_tl)
979 and aux_ens lift_amount exp_named_subst context metasenv subst ugraph =
981 (fun (u, arg) (res, lifted_tl) ->
982 let arg_res, lifted_arg =
983 aux lift_amount arg context metasenv subst ugraph in
986 (fun (a, s, m, ug) -> (u, a)::lifted_tl, s, m, ug) arg_res
988 (l1 @ (List.map (fun (r, s, m, ug) ->
989 (u, lifted_arg)::r, s, m, ug) res),
990 (u, lifted_arg)::lifted_tl)
991 ) exp_named_subst ([], [])
996 (* if match_only then replace_metas (\* context *\) where *)
1000 Printf.printf "searching %s inside %s\n"
1001 (CicPp.ppterm what) (CicPp.ppterm where);
1003 aux 0 where context metasenv [] ugraph
1006 (* if match_only then *)
1007 (* (fun (term, subst, metasenv, ugraph) -> *)
1009 (* C.Lambda (C.Anonymous, type_of_what, restore_metas term) *)
1010 (* and subst = restore_subst subst in *)
1011 (* (term', subst, metasenv, ugraph)) *)
1013 (fun (term, subst, metasenv, ugraph) ->
1014 let term' = C.Lambda (C.Anonymous, type_of_what, term) in
1015 (term', subst, metasenv, ugraph))
1017 List.map mapfun expansions
1021 let find_equalities ?(eq_uri=HelmLibraryObjects.Logic.eq_URI) context proof =
1022 let module C = Cic in
1023 let module S = CicSubstitution in
1024 let module T = CicTypeChecker in
1025 let newmeta = ProofEngineHelpers.new_meta_of_proof ~proof in
1026 let rec aux index newmeta = function
1028 | (Some (_, C.Decl (term)))::tl ->
1029 let do_find context term =
1031 | C.Prod (name, s, t) ->
1032 (* let newmeta = ProofEngineHelpers.new_meta_of_proof ~proof in *)
1033 let (head, newmetas, args, newmeta) =
1034 ProofEngineHelpers.saturate_term newmeta []
1035 context (S.lift index term)
1038 if List.length args = 0 then
1041 C.Appl ((C.Rel index)::args)
1044 | C.Appl [C.MutInd (uri, _, _); ty; t1; t2]
1045 when UriManager.eq uri eq_uri ->
1046 Printf.printf "OK: %s\n" (CicPp.ppterm term);
1047 let o = !Utils.compare_terms t1 t2 in
1048 let w = compute_equality_weight ty t1 t2 in
1049 let proof = BasicProof p in
1050 let e = (w, proof, (ty, t1, t2, o), newmetas, args) in
1052 | _ -> None, newmeta
1054 | C.Appl [C.MutInd (uri, _, _); ty; t1; t2]
1055 when UriManager.eq uri eq_uri ->
1056 let t1 = S.lift index t1
1057 and t2 = S.lift index t2 in
1058 let o = !Utils.compare_terms t1 t2 in
1059 let w = compute_equality_weight ty t1 t2 in
1060 let e = (w, BasicProof (C.Rel index), (ty, t1, t2, o), [], []) in
1062 | _ -> None, newmeta
1064 match do_find context term with
1065 | Some p, newmeta ->
1066 let tl, newmeta' = (aux (index+1) newmeta tl) in
1067 p::tl, max newmeta newmeta'
1069 aux (index+1) newmeta tl
1072 aux (index+1) newmeta tl
1074 aux 1 newmeta context
1078 let equations_blacklist =
1080 (fun s u -> UriManager.UriSet.add (UriManager.uri_of_string u) s)
1081 UriManager.UriSet.empty [
1082 "cic:/Coq/Init/Logic/eq.ind#xpointer(1/1/1)";
1083 "cic:/Coq/Init/Logic/trans_eq.con";
1084 "cic:/Coq/Init/Logic/f_equal.con";
1085 "cic:/Coq/Init/Logic/f_equal2.con";
1086 "cic:/Coq/Init/Logic/f_equal3.con";
1087 "cic:/Coq/Init/Logic/sym_eq.con"
1091 let find_library_equalities ~(dbd:Mysql.dbd) context status maxmeta =
1092 let module C = Cic in
1093 let module S = CicSubstitution in
1094 let module T = CicTypeChecker in
1098 if UriManager.UriSet.mem uri equations_blacklist then
1101 let t = CicUtil.term_of_uri uri in
1103 CicTypeChecker.type_of_aux' [] context t CicUniv.empty_ugraph
1107 (MetadataQuery.equations_for_goal ~dbd status)
1109 let eq_uri1 = UriManager.uri_of_string HelmLibraryObjects.Logic.eq_XURI
1110 and eq_uri2 = HelmLibraryObjects.Logic.eq_URI in
1112 (UriManager.eq uri eq_uri1) || (UriManager.eq uri eq_uri2)
1114 let rec aux newmeta = function
1116 | (term, termty)::tl ->
1119 | C.Prod (name, s, t) ->
1120 let head, newmetas, args, newmeta =
1121 ProofEngineHelpers.saturate_term newmeta [] context termty
1124 if List.length args = 0 then
1130 | C.Appl [C.MutInd (uri, _, _); ty; t1; t2] when iseq uri ->
1131 Printf.printf "OK: %s\n" (CicPp.ppterm term);
1132 let o = !Utils.compare_terms t1 t2 in
1133 let w = compute_equality_weight ty t1 t2 in
1134 let proof = BasicProof p in
1135 let e = (w, proof, (ty, t1, t2, o), newmetas, args) in
1137 | _ -> None, newmeta
1139 | C.Appl [C.MutInd (uri, _, _); ty; t1; t2] when iseq uri ->
1140 let o = !Utils.compare_terms t1 t2 in
1141 let w = compute_equality_weight ty t1 t2 in
1142 let e = (w, BasicProof term, (ty, t1, t2, o), [], []) in
1144 | _ -> None, newmeta
1148 let tl, newmeta' = aux newmeta tl in
1149 e::tl, max newmeta newmeta'
1153 aux maxmeta candidates
1157 let fix_metas newmeta ((w, p, (ty, left, right, o), menv, args) as equality) =
1158 (* print_endline ("fix_metas " ^ (string_of_int newmeta)); *)
1159 let table = Hashtbl.create (List.length args) in
1160 let is_this_case = ref false in
1161 let newargs, newmeta =
1163 (fun t (newargs, index) ->
1165 | Cic.Meta (i, l) ->
1166 Hashtbl.add table i index;
1167 (* if index = 5469 then ( *)
1168 (* Printf.printf "?5469 COMES FROM (%d): %s\n" *)
1169 (* i (string_of_equality equality); *)
1170 (* print_newline (); *)
1171 (* is_this_case := true *)
1173 ((Cic.Meta (index, l))::newargs, index+1)
1174 | _ -> assert false)
1175 args ([], newmeta+1)
1178 ProofEngineReduction.replace ~equality:(=) ~what:args ~with_what:newargs
1183 (fun (i, context, term) menv ->
1185 let index = Hashtbl.find table i in
1186 (index, context, term)::menv
1188 (i, context, term)::menv)
1192 and left = repl left
1193 and right = repl right in
1194 let metas = (metas_of_term left) @ (metas_of_term right) in
1195 let menv' = List.filter (fun (i, _, _) -> List.mem i metas) menv'
1198 (function Cic.Meta (i, _) -> List.mem i metas | _ -> assert false) newargs
1200 let rec fix_proof = function
1201 | NoProof -> NoProof
1202 | BasicProof term -> BasicProof (repl term)
1203 | ProofBlock (subst, eq_URI, t', (pos, eq), p) ->
1205 (* Printf.printf "fix_proof of equality %s, subst is:\n%s\n" *)
1206 (* (string_of_equality equality) (print_subst subst); *)
1212 | Cic.Meta (i, l) -> (
1214 let j = Hashtbl.find table i in
1215 if List.mem_assoc i subst then
1218 (* let _, context, ty = CicUtil.lookup_meta j menv' in *)
1219 (* (i, (context, Cic.Meta (j, l), ty))::s *)
1220 let _, context, ty = CicUtil.lookup_meta i menv in
1221 (i, (context, Cic.Meta (j, l), ty))::s
1224 | _ -> assert false)
1229 (* (fun (i, e) -> *)
1230 (* try let j = Hashtbl.find table i in (j, e) *)
1231 (* with _ -> (i, e)) subst *)
1234 (* Printf.printf "subst' is:\n%s\n" (print_subst subst'); *)
1235 (* print_newline (); *)
1237 ProofBlock (subst' @ subst, eq_URI, t', (pos, eq), p)
1238 (* | ProofSymBlock (ens, p) -> *)
1239 (* let ens' = List.map (fun (u, t) -> (u, repl t)) ens in *)
1240 (* ProofSymBlock (ens', fix_proof p) *)
1243 (* (newmeta + (List.length newargs) + 2, *)
1244 let neweq = (w, fix_proof p, (ty, left, right, o), menv', newargs) in
1245 (* if !is_this_case then ( *)
1246 (* print_endline "\nTHIS IS THE TROUBLE!!!"; *)
1247 (* let pt = build_proof_term neweq in *)
1248 (* Printf.printf "equality: %s\nproof: %s\n" *)
1249 (* (string_of_equality neweq) (CicPp.ppterm pt); *)
1250 (* print_endline (String.make 79 '-'); *)
1252 (newmeta + 1, neweq)
1253 (* (w, fix_proof p, (ty, left, right, o), menv', newargs)) *)
1257 let term_is_equality ?(eq_uri=HelmLibraryObjects.Logic.eq_URI) term =
1258 let iseq uri = UriManager.eq uri eq_uri in
1260 | Cic.Appl [Cic.MutInd (uri, _, _); _; _; _] when iseq uri -> true
1265 exception TermIsNotAnEquality;;
1267 let equality_of_term ?(eq_uri=HelmLibraryObjects.Logic.eq_URI) proof term =
1268 let iseq uri = UriManager.eq uri eq_uri in
1270 | Cic.Appl [Cic.MutInd (uri, _, _); ty; t1; t2] when iseq uri ->
1271 let o = !Utils.compare_terms t1 t2 in
1272 let w = compute_equality_weight ty t1 t2 in
1273 let e = (w, BasicProof proof, (ty, t1, t2, o), [], []) in
1275 (* (proof, (ty, t1, t2, o), [], []) *)
1277 raise TermIsNotAnEquality
1281 type environment = Cic.metasenv * Cic.context * CicUniv.universe_graph;;
1285 let superposition_left (metasenv, context, ugraph) target source =
1286 let module C = Cic in
1287 let module S = CicSubstitution in
1288 let module M = CicMetaSubst in
1289 let module HL = HelmLibraryObjects in
1290 let module CR = CicReduction in
1291 (* we assume that target is ground (does not contain metavariables): this
1292 * should always be the case (I hope, at least) *)
1293 let proof, (eq_ty, left, right, t_order), _, _ = target in
1294 let eqproof, (ty, t1, t2, s_order), newmetas, args = source in
1296 let compare_terms = !Utils.compare_terms in
1301 let where, is_left =
1302 match t_order (* compare_terms left right *) with
1303 | Lt -> right, false
1306 Printf.printf "????????? %s = %s" (CicPp.ppterm left)
1307 (CicPp.ppterm right);
1309 assert false (* again, for ground terms this shouldn't happen... *)
1312 let metasenv' = newmetas @ metasenv in
1313 let result = s_order (* compare_terms t1 t2 *) in
1316 | Gt -> (beta_expand t1 ty where context metasenv' ugraph), []
1317 | Lt -> [], (beta_expand t2 ty where context metasenv' ugraph)
1321 (fun (t, s, m, ug) ->
1322 compare_terms (M.apply_subst s t1) (M.apply_subst s t2) = Gt)
1323 (beta_expand t1 ty where context metasenv' ugraph)
1326 (fun (t, s, m, ug) ->
1327 compare_terms (M.apply_subst s t2) (M.apply_subst s t1) = Gt)
1328 (beta_expand t2 ty where context metasenv' ugraph)
1332 (* let what, other = *)
1333 (* if is_left then left, right *)
1334 (* else right, left *)
1336 let build_new what other eq_URI (t, s, m, ug) =
1337 let newgoal, newgoalproof =
1339 | C.Lambda (nn, ty, bo) ->
1340 let bo' = S.subst (M.apply_subst s other) bo in
1343 [C.MutInd (HL.Logic.eq_URI, 0, []);
1345 if is_left then [bo'; S.lift 1 right]
1346 else [S.lift 1 left; bo'])
1348 let t' = C.Lambda (nn, ty, bo'') in
1349 S.subst (M.apply_subst s other) bo,
1351 (C.Appl [C.Const (eq_URI, []); ty; what; t';
1352 proof; other; eqproof])
1356 if is_left then (eq_ty, newgoal, right, compare_terms newgoal right)
1357 else (eq_ty, left, newgoal, compare_terms left newgoal)
1359 (newgoalproof (* eqproof *), equation, [], [])
1361 let new1 = List.map (build_new t1 t2 HL.Logic.eq_ind_URI) res1
1362 and new2 = List.map (build_new t2 t1 HL.Logic.eq_ind_r_URI) res2 in
1367 let superposition_right newmeta (metasenv, context, ugraph) target source =
1368 let module C = Cic in
1369 let module S = CicSubstitution in
1370 let module M = CicMetaSubst in
1371 let module HL = HelmLibraryObjects in
1372 let module CR = CicReduction in
1373 let eqproof, (eq_ty, left, right, t_order), newmetas, args = target in
1374 let eqp', (ty', t1, t2, s_order), newm', args' = source in
1375 let maxmeta = ref newmeta in
1377 let compare_terms = !Utils.compare_terms in
1379 if eq_ty <> ty' then
1382 (* let ok term subst other other_eq_side ugraph = *)
1383 (* match term with *)
1384 (* | C.Lambda (nn, ty, bo) -> *)
1385 (* let bo' = S.subst (M.apply_subst subst other) bo in *)
1386 (* let res, _ = CR.are_convertible context bo' other_eq_side ugraph in *)
1388 (* | _ -> assert false *)
1390 let condition left right what other (t, s, m, ug) =
1391 let subst = M.apply_subst s in
1392 let cmp1 = compare_terms (subst what) (subst other) in
1393 let cmp2 = compare_terms (subst left) (subst right) in
1394 (* cmp1 = Gt && cmp2 = Gt *)
1395 cmp1 <> Lt && cmp1 <> Le && cmp2 <> Lt && cmp2 <> Le
1396 (* && (ok t s other right ug) *)
1398 let metasenv' = metasenv @ newmetas @ newm' in
1399 let beta_expand = beta_expand ~metas_ok:false in
1400 let cmp1 = t_order (* compare_terms left right *)
1401 and cmp2 = s_order (* compare_terms t1 t2 *) in
1402 let res1, res2, res3, res4 =
1406 (beta_expand s eq_ty l context metasenv' ugraph)
1408 match cmp1, cmp2 with
1410 (beta_expand t1 eq_ty left context metasenv' ugraph), [], [], []
1412 [], (beta_expand t2 eq_ty left context metasenv' ugraph), [], []
1414 [], [], (beta_expand t1 eq_ty right context metasenv' ugraph), []
1416 [], [], [], (beta_expand t2 eq_ty right context metasenv' ugraph)
1418 let res1 = res left right t1 t2
1419 and res2 = res left right t2 t1 in
1422 let res3 = res right left t1 t2
1423 and res4 = res right left t2 t1 in
1426 let res1 = res left right t1 t2
1427 and res3 = res right left t1 t2 in
1430 let res2 = res left right t2 t1
1431 and res4 = res right left t2 t1 in
1434 let res1 = res left right t1 t2
1435 and res2 = res left right t2 t1
1436 and res3 = res right left t1 t2
1437 and res4 = res right left t2 t1 in
1438 res1, res2, res3, res4
1440 let newmetas = newmetas @ newm' in
1441 let newargs = args @ args' in
1442 let build_new what other is_left eq_URI (t, s, m, ug) =
1443 (* let what, other = *)
1444 (* if is_left then left, right *)
1445 (* else right, left *)
1447 let newterm, neweqproof =
1449 | C.Lambda (nn, ty, bo) ->
1450 let bo' = M.apply_subst s (S.subst other bo) in
1453 [C.MutInd (HL.Logic.eq_URI, 0, []); S.lift 1 eq_ty] @
1454 if is_left then [bo'; S.lift 1 right]
1455 else [S.lift 1 left; bo'])
1457 let t' = C.Lambda (nn, ty, bo'') in
1460 (C.Appl [C.Const (eq_URI, []); ty; what; t';
1461 eqproof; other; eqp'])
1464 let newmeta, newequality =
1466 if is_left then (newterm, M.apply_subst s right)
1467 else (M.apply_subst s left, newterm) in
1468 let neworder = compare_terms left right in
1470 (neweqproof, (eq_ty, left, right, neworder), newmetas, newargs)
1475 let new1 = List.map (build_new t1 t2 true HL.Logic.eq_ind_URI) res1
1476 and new2 = List.map (build_new t2 t1 true HL.Logic.eq_ind_r_URI) res2
1477 and new3 = List.map (build_new t1 t2 false HL.Logic.eq_ind_URI) res3
1478 and new4 = List.map (build_new t2 t1 false HL.Logic.eq_ind_r_URI) res4 in
1480 | _, (_, left, right, _), _, _ ->
1481 not (fst (CR.are_convertible context left right ugraph))
1484 (List.filter ok (new1 @ new2 @ new3 @ new4)))
1489 let is_identity ((_, context, ugraph) as env) = function
1490 | ((_, _, (ty, left, right, _), _, _) as equality) ->
1492 (fst (CicReduction.are_convertible context left right ugraph)))
1497 let demodulation newmeta (metasenv, context, ugraph) target source =
1498 let module C = Cic in
1499 let module S = CicSubstitution in
1500 let module M = CicMetaSubst in
1501 let module HL = HelmLibraryObjects in
1502 let module CR = CicReduction in
1504 let proof, (eq_ty, left, right, t_order), metas, args = target
1505 and proof', (ty, t1, t2, s_order), metas', args' = source in
1507 let compare_terms = !Utils.compare_terms in
1512 let first_step, get_params =
1513 match s_order (* compare_terms t1 t2 *) with
1514 | Gt -> 1, (function
1515 | 1 -> true, t1, t2, HL.Logic.eq_ind_URI
1516 | 0 -> false, t1, t2, HL.Logic.eq_ind_URI
1517 | _ -> assert false)
1518 | Lt -> 1, (function
1519 | 1 -> true, t2, t1, HL.Logic.eq_ind_r_URI
1520 | 0 -> false, t2, t1, HL.Logic.eq_ind_r_URI
1521 | _ -> assert false)
1523 let first_step = 3 in
1524 let get_params step =
1526 | 3 -> true, t1, t2, HL.Logic.eq_ind_URI
1527 | 2 -> false, t1, t2, HL.Logic.eq_ind_URI
1528 | 1 -> true, t2, t1, HL.Logic.eq_ind_r_URI
1529 | 0 -> false, t2, t1, HL.Logic.eq_ind_r_URI
1532 first_step, get_params
1534 let rec demodulate newmeta step metasenv target =
1535 let proof, (eq_ty, left, right, t_order), metas, args = target in
1536 let is_left, what, other, eq_URI = get_params step in
1538 let env = metasenv, context, ugraph in
1539 let names = names_of_context context in
1541 (* "demodulate\ntarget: %s\nwhat: %s\nother: %s\nis_left: %s\n" *)
1542 (* (string_of_equality ~env target) (CicPp.pp what names) *)
1543 (* (CicPp.pp other names) (string_of_bool is_left); *)
1544 (* Printf.printf "step: %d" step; *)
1545 (* print_newline (); *)
1547 let ok (t, s, m, ug) =
1548 compare_terms (M.apply_subst s what) (M.apply_subst s other) = Gt
1551 let r = (beta_expand ~metas_ok:false ~match_only:true
1552 what ty (if is_left then left else right)
1553 context (metasenv @ metas) ugraph)
1555 (* let m' = metas_of_term what *)
1556 (* and m'' = metas_of_term (if is_left then left else right) in *)
1557 (* if (List.mem 527 m'') && (List.mem 6 m') then ( *)
1559 (* "demodulate\ntarget: %s\nwhat: %s\nother: %s\nis_left: %s\n" *)
1560 (* (string_of_equality ~env target) (CicPp.pp what names) *)
1561 (* (CicPp.pp other names) (string_of_bool is_left); *)
1562 (* Printf.printf "step: %d" step; *)
1563 (* print_newline (); *)
1564 (* print_endline "res:"; *)
1565 (* List.iter (fun (t, s, m, ug) -> print_endline (CicPp.pp t names)) r; *)
1566 (* print_newline (); *)
1567 (* Printf.printf "metasenv:\n%s\n" (print_metasenv (metasenv @ metas)); *)
1568 (* print_newline (); *)
1574 if step = 0 then newmeta, target
1575 else demodulate newmeta (step-1) metasenv target
1576 | (t, s, m, ug)::_ ->
1577 let newterm, newproof =
1579 | C.Lambda (nn, ty, bo) ->
1580 (* let bo' = M.apply_subst s (S.subst other bo) in *)
1581 let bo' = S.subst (M.apply_subst s other) bo in
1584 [C.MutInd (HL.Logic.eq_URI, 0, []);
1586 if is_left then [bo'; S.lift 1 right]
1587 else [S.lift 1 left; bo'])
1589 let t' = C.Lambda (nn, ty, bo'') in
1590 (* M.apply_subst s (S.subst other bo), *)
1593 (C.Appl [C.Const (eq_URI, []); ty; what; t';
1594 proof; other; proof'])
1597 let newmeta, newtarget =
1599 (* if is_left then (newterm, M.apply_subst s right) *)
1600 (* else (M.apply_subst s left, newterm) in *)
1601 if is_left then newterm, right
1604 let neworder = compare_terms left right in
1605 (* let newmetasenv = metasenv @ metas in *)
1606 (* let newargs = args @ args' in *)
1607 (* fix_metas newmeta *)
1608 (* (newproof, (eq_ty, left, right), newmetasenv, newargs) *)
1609 let m = (metas_of_term left) @ (metas_of_term right) in
1610 let newmetasenv = List.filter (fun (i, _, _) -> List.mem i m) metas
1613 (function C.Meta (i, _) -> List.mem i m | _ -> assert false)
1617 (newproof, (eq_ty, left, right, neworder), newmetasenv, newargs)
1620 (* "demodulate, newtarget: %s\ntarget was: %s\n" *)
1621 (* (string_of_equality ~env newtarget) *)
1622 (* (string_of_equality ~env target); *)
1623 (* (\* let _, _, newm, newa = newtarget in *\) *)
1624 (* (\* Printf.printf "newmetasenv:\n%s\nnewargs:\n%s\n" *\) *)
1625 (* (\* (print_metasenv newm) *\) *)
1626 (* (\* (String.concat "\n" (List.map CicPp.ppterm newa)); *\) *)
1627 (* print_newline (); *)
1628 if is_identity env newtarget then
1631 demodulate newmeta first_step metasenv newtarget
1633 demodulate newmeta first_step (metasenv @ metas') target
1638 let demodulation newmeta env target source =
1644 let subsumption env target source =
1645 let _, (ty, tl, tr, _), tmetas, _ = target
1646 and _, (ty', sl, sr, _), smetas, _ = source in
1650 let metasenv, context, ugraph = env in
1651 let metasenv = metasenv @ tmetas @ smetas in
1652 let names = names_of_context context in
1653 let samesubst subst subst' =
1654 (* Printf.printf "samesubst:\nsubst: %s\nsubst': %s\n" *)
1655 (* (print_subst subst) (print_subst subst'); *)
1656 (* print_newline (); *)
1657 let tbl = Hashtbl.create (List.length subst) in
1658 List.iter (fun (m, (c, t1, t2)) -> Hashtbl.add tbl m (c, t1, t2)) subst;
1660 (fun (m, (c, t1, t2)) ->
1662 let c', t1', t2' = Hashtbl.find tbl m in
1663 if (c = c') && (t1 = t1') && (t2 = t2') then true
1669 let subsaux left right left' right' =
1671 let subst, menv, ug = matching metasenv context left left' ugraph
1672 and subst', menv', ug' = matching metasenv context right right' ugraph
1674 (* Printf.printf "left = right: %s = %s\n" *)
1675 (* (CicPp.pp left names) (CicPp.pp right names); *)
1676 (* Printf.printf "left' = right': %s = %s\n" *)
1677 (* (CicPp.pp left' names) (CicPp.pp right' names); *)
1678 samesubst subst subst'
1680 (* print_endline (Printexc.to_string e); *)
1684 if subsaux tl tr sl sr then true
1685 else subsaux tl tr sr sl
1688 Printf.printf "subsumption!:\ntarget: %s\nsource: %s\n"
1689 (string_of_equality ~env target) (string_of_equality ~env source);
1697 let extract_differing_subterms t1 t2 =
1698 let module C = Cic in
1701 | C.Appl l1, C.Appl l2 when (List.length l1) <> (List.length l2) ->
1703 | C.Appl (h1::tl1), C.Appl (h2::tl2) ->
1704 let res = List.concat (List.map2 aux tl1 tl2) in
1706 if res = [] then [(h1, h2)] else [(t1, t2)]
1708 if List.length res > 1 then [(t1, t2)] else res
1710 if t1 <> t2 then [(t1, t2)] else []
1712 let res = aux t1 t2 in