X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Focaml%2Fparamodulation%2Findexing.ml;h=5a8960101d21c2a513b4acc18223817c1aad27c7;hb=a3acd934eba07f24937e59c3c7a41db82d901025;hp=84559b22247fdde62f74f2485562eb34fef34cbb;hpb=a89f7271e79dc7dc81dc868a75125669c8decc16;p=helm.git diff --git a/helm/ocaml/paramodulation/indexing.ml b/helm/ocaml/paramodulation/indexing.ml index 84559b222..5a8960101 100644 --- a/helm/ocaml/paramodulation/indexing.ml +++ b/helm/ocaml/paramodulation/indexing.ml @@ -1,61 +1,136 @@ -let head_of_term = function - | Cic.Appl (hd::tl) -> hd - | t -> t -;; +type retrieval_mode = Matching | Unification;; -(* -let empty_table () = - Hashtbl.create 10 +let print_candidates mode term res = + let _ = + match mode with + | Matching -> + Printf.printf "| candidates Matching %s\n" (CicPp.ppterm term) + | Unification -> + Printf.printf "| candidates Unification %s\n" (CicPp.ppterm term) + in + print_endline + (String.concat "\n" + (List.map + (fun (p, e) -> + Printf.sprintf "| (%s, %s)" (Utils.string_of_pos p) + (Inference.string_of_equality e)) + res)); + print_endline "|"; ;; -let index table eq = - let _, (_, l, r, ordering), _, _ = eq in - let hl = head_of_term l in - let hr = head_of_term r in - let index x pos = - let x_entry = try Hashtbl.find table x with Not_found -> [] in - Hashtbl.replace table x ((pos, eq)::x_entry) - in - let _ = - match ordering with - | Utils.Gt -> - index hl Utils.Left - | Utils.Lt -> - index hr Utils.Right - | _ -> index hl Utils.Left; index hr Utils.Right - in -(* index hl Utils.Left; *) -(* index hr Utils.Right; *) - table -;; +let indexing_retrieval_time = ref 0.;; -let remove_index table eq = - let _, (_, l, r, ordering), _, _ = eq in - let hl = head_of_term l - and hr = head_of_term r in - let remove_index x pos = - let x_entry = try Hashtbl.find table x with Not_found -> [] in - let newentry = List.filter (fun e -> e <> (pos, eq)) x_entry in - Hashtbl.replace table x newentry - in - remove_index hl Utils.Left; - remove_index hr Utils.Right; - table +(* let my_apply_subst subst term = *) +(* let module C = Cic in *) +(* let lookup lift_amount meta = *) +(* match meta with *) +(* | C.Meta (i, _) -> ( *) +(* try *) +(* let _, (_, t, _) = List.find (fun (m, _) -> m = i) subst in *) +(* (\* CicSubstitution.lift lift_amount *\)t *) +(* with Not_found -> meta *) +(* ) *) +(* | _ -> assert false *) +(* in *) +(* let rec apply_aux lift_amount = function *) +(* | C.Meta (i, l) as t -> lookup lift_amount t *) +(* | C.Appl l -> C.Appl (List.map (apply_aux lift_amount) l) *) +(* | C.Prod (nn, s, t) -> *) +(* C.Prod (nn, apply_aux lift_amount s, apply_aux (lift_amount+1) t) *) +(* | C.Lambda (nn, s, t) -> *) +(* C.Lambda (nn, apply_aux lift_amount s, apply_aux (lift_amount+1) t) *) +(* | t -> t *) +(* in *) +(* apply_aux 0 term *) +(* ;; *) + + +(* let apply_subst subst term = *) +(* Printf.printf "| apply_subst:\n| subst: %s\n| term: %s\n" *) +(* (Utils.print_subst ~prefix:" ; " subst) (CicPp.ppterm term); *) +(* let res = my_apply_subst subst term in *) +(* (\* let res = CicMetaSubst.apply_subst subst term in *\) *) +(* Printf.printf "| res: %s\n" (CicPp.ppterm res); *) +(* print_endline "|"; *) +(* res *) +(* ;; *) + +(* let apply_subst = my_apply_subst *) +let apply_subst = CicMetaSubst.apply_subst + + +let apply_subst = + let profile = CicUtil.profile "apply_subst" in + (fun s a -> profile (apply_subst s) a) ;; -*) +(* let empty_table () = Path_indexing.PSTrie.empty ;; let index = Path_indexing.index -and remove_index = Path_indexing.remove_index;; +and remove_index = Path_indexing.remove_index +and in_index = Path_indexing.in_index;; +let get_candidates mode trie term = + let t1 = Unix.gettimeofday () in + let res = + let s = + match mode with + | Matching -> Path_indexing.retrieve_generalizations trie term + | Unification -> Path_indexing.retrieve_unifiables trie term +(* Path_indexing.retrieve_all trie term *) + in + Path_indexing.PosEqSet.elements s + in +(* print_candidates mode term res; *) + let t2 = Unix.gettimeofday () in + indexing_retrieval_time := !indexing_retrieval_time +. (t2 -. t1); + res +;; +*) + + +let empty_table () = + Discrimination_tree.DiscriminationTree.empty +;; + +let index = Discrimination_tree.index +and remove_index = Discrimination_tree.remove_index +and in_index = Discrimination_tree.in_index;; + +let get_candidates mode tree term = + let t1 = Unix.gettimeofday () in + let res = + let s = + match mode with + | Matching -> Discrimination_tree.retrieve_generalizations tree term + | Unification -> Discrimination_tree.retrieve_unifiables tree term + in + Discrimination_tree.PosEqSet.elements s + in +(* print_candidates mode term res; *) + let t2 = Unix.gettimeofday () in + indexing_retrieval_time := !indexing_retrieval_time +. (t2 -. t1); + res +;; + + +(* let get_candidates = *) +(* let profile = CicUtil.profile "Indexing.get_candidates" in *) +(* (fun mode tree term -> profile (get_candidates mode tree) term) *) +(* ;; *) + + +let match_unif_time_ok = ref 0.;; +let match_unif_time_no = ref 0.;; + let rec find_matches metasenv context ugraph lift_amount term = let module C = Cic in @@ -71,11 +146,21 @@ let rec find_matches metasenv context ugraph lift_amount term = let pos, (proof, (ty, left, right, o), metas, args) = candidate in let do_match c other eq_URI = let subst', metasenv', ugraph' = - Inference.matching (metasenv @ metas) context - term (S.lift lift_amount c) ugraph + let t1 = Unix.gettimeofday () in + try + let r = + Inference.matching (metasenv @ metas) context + term (S.lift lift_amount c) ugraph in + let t2 = Unix.gettimeofday () in + match_unif_time_ok := !match_unif_time_ok +. (t2 -. t1); + r + with e -> + let t2 = Unix.gettimeofday () in + match_unif_time_no := !match_unif_time_no +. (t2 -. t1); + raise e in - Some (C.Rel (1 + lift_amount), subst', metasenv', ugraph', - (candidate, eq_URI)) + Some (C.Rel (1 + lift_amount), subst', metasenv', ugraph', + (candidate, eq_URI)) in let c, other, eq_URI = if pos = Utils.Left then left, right, HL.Logic.eq_ind_URI @@ -90,8 +175,8 @@ let rec find_matches metasenv context ugraph lift_amount term = let res = try do_match c other eq_URI with e -> None in match res with | Some (_, s, _, _, _) -> - let c' = M.apply_subst s c - and other' = M.apply_subst s other in + let c' = (* M. *)apply_subst s c + and other' = (* M. *)apply_subst s other in let order = cmp c' other' in let names = U.names_of_context context in if order = U.Gt then @@ -103,7 +188,7 @@ let rec find_matches metasenv context ugraph lift_amount term = ;; -let rec find_all_matches ?(unif_fun=CicUnification.fo_unif) +let rec find_all_matches ?(unif_fun=Inference.unification) metasenv context ugraph lift_amount term = let module C = Cic in let module U = Utils in @@ -118,8 +203,18 @@ let rec find_all_matches ?(unif_fun=CicUnification.fo_unif) let pos, (proof, (ty, left, right, o), metas, args) = candidate in let do_match c other eq_URI = let subst', metasenv', ugraph' = - unif_fun (metasenv @ metas) context - term (S.lift lift_amount c) ugraph + let t1 = Unix.gettimeofday () in + try + let r = + unif_fun (metasenv @ metas) context + term (S.lift lift_amount c) ugraph in + let t2 = Unix.gettimeofday () in + match_unif_time_ok := !match_unif_time_ok +. (t2 -. t1); + r + with e -> + let t2 = Unix.gettimeofday () in + match_unif_time_no := !match_unif_time_no +. (t2 -. t1); + raise e in (C.Rel (1 + lift_amount), subst', metasenv', ugraph', (candidate, eq_URI)) @@ -141,8 +236,8 @@ let rec find_all_matches ?(unif_fun=CicUnification.fo_unif) let res = do_match c other eq_URI in match res with | _, s, _, _, _ -> - let c' = M.apply_subst s c - and other' = M.apply_subst s other in + let c' = (* M. *)apply_subst s c + and other' = (* M. *)apply_subst s other in let order = cmp c' other' in let names = U.names_of_context context in if order <> U.Lt && order <> U.Le then @@ -157,29 +252,8 @@ let rec find_all_matches ?(unif_fun=CicUnification.fo_unif) ;; -type retrieval_mode = Matching | Unification;; - -(* -let get_candidates mode table term = - try Hashtbl.find table (head_of_term term) with Not_found -> [] -;; -*) - - -let get_candidates mode trie term = - let s = - match mode with - | Matching -> - Path_indexing.retrieve_generalizations trie term - | Unification -> - Path_indexing.retrieve_unifiables trie term - in - Path_indexing.PosEqSet.elements s -;; - - let subsumption env table target = - let _, (ty, tl, tr, _), tmetas, _ = target in + let _, (ty, left, right, _), tmetas, _ = target in let metasenv, context, ugraph = env in let metasenv = metasenv @ tmetas in let samesubst subst subst' = @@ -195,39 +269,47 @@ let subsumption env table target = true) subst' in - let subsaux left right = - let leftc = get_candidates Matching table left in - let leftr = - find_all_matches ~unif_fun:Inference.matching - metasenv context ugraph 0 left leftc - in - let ok what (_, subst, menv, ug, ((pos, (_, (_, l, r, o), _, _)), _)) = - try - let other = if pos = Utils.Left then r else l in - let subst', menv', ug' = - Inference.matching metasenv context what other ugraph in - samesubst subst subst' - with e -> - false - in - let r = List.exists (ok right) leftr in - if r then - true - else - let rightc = get_candidates Matching table right in - let rightr = + let leftr = + match left with + | Cic.Meta _ -> [] + | _ -> + let leftc = get_candidates Matching table left in find_all_matches ~unif_fun:Inference.matching - metasenv context ugraph 0 right rightc + metasenv context ugraph 0 left leftc + in + let ok what (_, subst, menv, ug, ((pos, (_, (_, l, r, o), _, _)), _)) = + try + let other = if pos = Utils.Left then r else l in + let subst', menv', ug' = + let t1 = Unix.gettimeofday () in + try + let r = + Inference.matching metasenv context what other ugraph in + let t2 = Unix.gettimeofday () in + match_unif_time_ok := !match_unif_time_ok +. (t2 -. t1); + r + with e -> + let t2 = Unix.gettimeofday () in + match_unif_time_no := !match_unif_time_no +. (t2 -. t1); + raise e in - List.exists (ok left) rightr + samesubst subst subst' + with e -> + false in - let res = subsaux tl tr in - if res then ( - Printf.printf "subsumption!:\ntarget: %s\n" - (Inference.string_of_equality ~env target); - print_newline (); - ); - res + let r = List.exists (ok right) leftr in + if r then + true + else + let rightr = + match right with + | Cic.Meta _ -> [] + | _ -> + let rightc = get_candidates Matching table right in + find_all_matches ~unif_fun:Inference.matching + metasenv context ugraph 0 right rightc + in + List.exists (ok left) rightr ;; @@ -293,6 +375,8 @@ let rec demodulate_term metasenv context ugraph table lift_amount term = ;; +let build_newtarget_time = ref 0.;; + let rec demodulation newmeta env table target = let module C = Cic in let module S = CicSubstitution in @@ -302,10 +386,12 @@ let rec demodulation newmeta env table target = let proof, (eq_ty, left, right, order), metas, args = target in let metasenv' = metasenv @ metas in let build_newtarget is_left (t, subst, menv, ug, (eq_found, eq_URI)) = + let time1 = Unix.gettimeofday () in + let pos, (proof', (ty, what, other, _), menv', args') = eq_found in let what, other = if pos = Utils.Left then what, other else other, what in let newterm, newproof = - let bo = M.apply_subst subst (S.subst other t) in + let bo = (* M. *)apply_subst subst (S.subst other t) in let bo'' = C.Appl ([C.MutInd (HL.Logic.eq_URI, 0, []); S.lift 1 eq_ty] @ @@ -313,8 +399,9 @@ let rec demodulation newmeta env table target = in let t' = C.Lambda (C.Anonymous, ty, bo'') in bo, - M.apply_subst subst (C.Appl [C.Const (eq_URI, []); ty; what; t'; - proof; other; proof']) + C.Implicit None +(* (\* M. *\)apply_subst subst (C.Appl [C.Const (eq_URI, []); ty; what; t'; *) +(* proof; other; proof']) *) in let left, right = if is_left then newterm, right else left, newterm in let m = @@ -327,8 +414,16 @@ let rec demodulation newmeta env table target = args in let ordering = !Utils.compare_terms left right in + + let time2 = Unix.gettimeofday () in + build_newtarget_time := !build_newtarget_time +. (time2 -. time1); + newmeta, (newproof, (eq_ty, left, right, ordering), newmetasenv, newargs) in +(* let build_newtarget = *) +(* let profile = CicUtil.profile "Indexing.demodulation.build_newtarget" in *) +(* (fun a b -> profile (build_newtarget a) b) *) +(* in *) let res = demodulate_term metasenv' context ugraph table 0 left in let build_identity (p, (t, l, r, o), m, a) = match o with @@ -342,9 +437,9 @@ let rec demodulation newmeta env table target = (Inference.meta_convertibility_eq target newtarget) then newmeta, newtarget else - if subsumption env table newtarget then - newmeta, build_identity newtarget - else +(* if subsumption env table newtarget then *) +(* newmeta, build_identity newtarget *) +(* else *) demodulation newmeta env table newtarget | None -> let res = demodulate_term metasenv' context ugraph table 0 right in @@ -355,9 +450,9 @@ let rec demodulation newmeta env table target = (Inference.meta_convertibility_eq target newtarget) then newmeta, newtarget else - if subsumption env table newtarget then - newmeta, build_identity newtarget - else +(* if subsumption env table newtarget then *) +(* newmeta, build_identity newtarget *) +(* else *) demodulation newmeta env table newtarget | None -> newmeta, target @@ -476,10 +571,12 @@ let superposition_left (metasenv, context, ugraph) table target = betaexpand_term metasenv context ugraph table 0 term in let build_new (bo, s, m, ug, (eq_found, eq_URI)) = + let time1 = Unix.gettimeofday () in + let pos, (proof', (ty, what, other, _), menv', args') = eq_found in let what, other = if pos = Utils.Left then what, other else other, what in let newgoal, newproof = - let bo' = M.apply_subst s (S.subst other bo) in + let bo' = (* M. *)apply_subst s (S.subst other bo) in let bo'' = C.Appl ( [C.MutInd (HL.Logic.eq_URI, 0, []); @@ -489,15 +586,24 @@ let superposition_left (metasenv, context, ugraph) table target = in let t' = C.Lambda (C.Anonymous, ty, bo'') in bo', - M.apply_subst s - (C.Appl [C.Const (eq_URI, []); ty; what; t'; - proof; other; proof']) + C.Implicit None +(* (\* M. *\)apply_subst s *) +(* (C.Appl [C.Const (eq_URI, []); ty; what; t'; *) +(* proof; other; proof']) *) in let left, right = if ordering = U.Gt then newgoal, right else left, newgoal in let neworder = !Utils.compare_terms left right in + + let time2 = Unix.gettimeofday () in + build_newtarget_time := !build_newtarget_time +. (time2 -. time1); + (newproof, (eq_ty, left, right, neworder), [], []) in +(* let build_new = *) +(* let profile = CicUtil.profile "Inference.superposition_left.build_new" in *) +(* (fun e -> profile build_new e) *) +(* in *) List.map build_new expansions ;; @@ -520,7 +626,7 @@ let superposition_right newmeta (metasenv, context, ugraph) table target = let res l r = List.filter (fun (_, subst, _, _, _) -> - let subst = M.apply_subst subst in + let subst = (* M. *)apply_subst subst in let o = !Utils.compare_terms (subst l) (subst r) in o <> U.Lt && o <> U.Le) (fst (betaexpand_term metasenv' context ugraph table 0 l)) @@ -528,10 +634,13 @@ let superposition_right newmeta (metasenv, context, ugraph) table target = (res left right), (res right left) in let build_new ordering (bo, s, m, ug, (eq_found, eq_URI)) = + + let time1 = Unix.gettimeofday () in + let pos, (proof', (ty, what, other, _), menv', args') = eq_found in let what, other = if pos = Utils.Left then what, other else other, what in let newgoal, newproof = - let bo' = M.apply_subst s (S.subst other bo) in + let bo' = (* M. *)apply_subst s (S.subst other bo) in let bo'' = C.Appl ( [C.MutInd (HL.Logic.eq_URI, 0, []); S.lift 1 eq_ty] @ @@ -540,14 +649,15 @@ let superposition_right newmeta (metasenv, context, ugraph) table target = in let t' = C.Lambda (C.Anonymous, ty, bo'') in bo', - M.apply_subst s - (C.Appl [C.Const (eq_URI, []); ty; what; t'; - eqproof; other; proof']) + C.Implicit None +(* (\* M. *\)apply_subst s *) +(* (C.Appl [C.Const (eq_URI, []); ty; what; t'; *) +(* eqproof; other; proof']) *) in let newmeta, newequality = let left, right = - if ordering = U.Gt then newgoal, M.apply_subst s right - else M.apply_subst s left, newgoal in + if ordering = U.Gt then newgoal, (* M. *)apply_subst s right + else (* M. *)apply_subst s left, newgoal in let neworder = !Utils.compare_terms left right and newmenv = newmetas @ menv' and newargs = args @ args' in @@ -557,8 +667,18 @@ let superposition_right newmeta (metasenv, context, ugraph) table target = newm, eq' in maxmeta := newmeta; + + let time2 = Unix.gettimeofday () in + build_newtarget_time := !build_newtarget_time +. (time2 -. time1); + newequality in + +(* let build_new = *) +(* let profile = CicUtil.profile "Indexing.superposition_right.build_new" in *) +(* (fun o e -> profile (build_new o) e) *) +(* in *) + let new1 = List.map (build_new U.Gt) res1 and new2 = List.map (build_new U.Lt) res2 in let ok = function