X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fcomponents%2Fng_paramodulation%2Fparamod.ml;h=4a688620590f94506e4ae07c7ec47bb5fe281269;hb=b714e87e96f14f332a5157567a4c62a4b28fa8eb;hp=ec098a61597142d0b603674c27d8cac95487dca4;hpb=10a9a8c36ff36e6a53bda1ec3074cb2fac03da63;p=helm.git diff --git a/helm/software/components/ng_paramodulation/paramod.ml b/helm/software/components/ng_paramodulation/paramod.ml index ec098a615..4a6886205 100644 --- a/helm/software/components/ng_paramodulation/paramod.ml +++ b/helm/software/components/ng_paramodulation/paramod.ml @@ -1,79 +1,165 @@ -(* LOOPING : COL057-1.ma *) - -let debug s = - () (* prerr_endline s *) -;; - -let nparamod rdb metasenv subst context t table = - let max_nb_iter = 999999999 in - let amount_of_time = 300.0 in - let module C = struct - let metasenv = metasenv - let subst = subst - let context = context - end - in - let nb_iter = ref 0 in - let module B = NCicBlob.NCicBlob(C) in - let module Pp = Pp.Pp (B) in - let module FU = FoUnif.Founif(B) in - let module IDX = Index.Index(B) in - let module Sup = Superposition.Superposition(B) in - let module Utils = FoUtils.Utils(B) in +(* + ||M|| This file is part of HELM, an Hypertextual, Electronic + ||A|| Library of Mathematics, developed at the Computer Science + ||T|| Department, University of Bologna, Italy. + ||I|| + ||T|| HELM is free software; you can redistribute it and/or + ||A|| modify it under the terms of the GNU General Public License + \ / version 2 or (at your option) any later version. + \ / This software is distributed as is, NO WARRANTY. + V_______________________________________________________________ *) + +(* $Id: orderings.ml 9869 2009-06-11 22:52:38Z denes $ *) + +let debug s = prerr_endline (Lazy.force s) ;; +(* let debug _ = ();; *) + +let monster = 100;; - let module OrderedPassives = +module type Paramod = + sig + type t + type szsontology = + | Unsatisfiable of (t Terms.bag * int * int list) list + | GaveUp + | Error of string + | Timeout of int * t Terms.bag + val paramod : + useage:bool -> + max_steps:int -> + print_problem:bool -> + ?timeout:float -> + t Terms.foterm * (t Terms.foterm list * t Terms.foterm list) -> + (t Terms.foterm * (t Terms.foterm list * t Terms.foterm list)) list -> szsontology + end + +module Paramod (B : Orderings.Blob) = struct + type t = B.t + type szsontology = + | Unsatisfiable of (B.t Terms.bag * int * int list) list + | GaveUp + | Error of string + | Timeout of int * B.t Terms.bag + exception Stop of szsontology + type bag = B.t Terms.bag * int + module Pp = Pp.Pp (B) + module FU = FoUnif.FoUnif(B) + module IDX = Index.Index(B) + module Sup = Superposition.Superposition(B) + module Utils = FoUtils.Utils(B) + module Order = B + module Clauses = Clauses.Clauses(B) + module WeightOrderedPassives = struct - type t = B.t Terms.passive_clause - - let compare = Utils.compare_passive_clauses + type t = B.t Terms.passive_clause + let compare = Clauses.compare_passive_clauses_weight end - in - let module PassiveSet = Set.Make(OrderedPassives) - in - let add_passive_clause passives cl = - PassiveSet.add (Utils.mk_passive_clause cl) passives - in - let timeout = Unix.gettimeofday () +. amount_of_time in - - (* TODO : fairness condition *) - let select passives g_passives = - if PassiveSet.is_empty passives then begin - assert (not (PassiveSet.is_empty g_passives)); - let g_cl = PassiveSet.min_elt g_passives in - (true,snd g_cl,passives,PassiveSet.remove g_cl g_passives) + + module AgeOrderedPassives = + struct + type t = B.t Terms.passive_clause + let compare = Clauses.compare_passive_clauses_age + end + + module WeightPassiveSet = Set.Make(WeightOrderedPassives) + module AgePassiveSet = Set.Make(AgeOrderedPassives) + + let add_passive_clause ?(bonus_weight=0) (passives_w,passives_a) cl = + let (w,cl) = Clauses.mk_passive_clause cl in + let cl = (w+bonus_weight,cl) in + WeightPassiveSet.add cl passives_w, AgePassiveSet.add cl passives_a + ;; + + let add_passive_goal ?(bonus_weight=0) (passives_w,passives_a) g = + let (w,g) = Clauses.mk_passive_goal g in + let g = (w+bonus_weight,g) in + WeightPassiveSet.add g passives_w, AgePassiveSet.add g passives_a + ;; + + let remove_passive_clause (passives_w,passives_a) cl = + let passives_w = WeightPassiveSet.remove cl passives_w in + let passives_a = AgePassiveSet.remove cl passives_a in + passives_w,passives_a + ;; + + let add_passive_clauses ?(bonus_weight=0) + (passives_w,passives_a) new_clauses = + let new_clauses_w,new_clauses_a = + List.fold_left (add_passive_clause ~bonus_weight) + (WeightPassiveSet.empty,AgePassiveSet.empty) new_clauses + in + (WeightPassiveSet.union new_clauses_w passives_w, + AgePassiveSet.union new_clauses_a passives_a) + ;; + + let add_passive_goals ?(bonus_weight=0) + (passives_w,passives_a) new_clauses = + let new_clauses_w,new_clauses_a = + List.fold_left (add_passive_goal ~bonus_weight) + (WeightPassiveSet.empty,AgePassiveSet.empty) new_clauses + in + (WeightPassiveSet.union new_clauses_w passives_w, + AgePassiveSet.union new_clauses_a passives_a) + ;; + + let is_passive_set_empty (passives_w,passives_a) = + if (WeightPassiveSet.is_empty passives_w) then begin + assert (AgePassiveSet.is_empty passives_a); true + end else begin + assert (not (AgePassiveSet.is_empty passives_a)); false + end + ;; + + let passive_set_cardinal (passives_w,_) = WeightPassiveSet.cardinal passives_w + + let passive_empty_set = + (WeightPassiveSet.empty,AgePassiveSet.empty) + ;; + + let pick_min_passive ~use_age (passives_w,passives_a) = + if use_age then AgePassiveSet.min_elt passives_a + else WeightPassiveSet.min_elt passives_w + ;; + + (* TODO : global age over facts and goals (without comparing weights) *) + let select ~use_age passives g_passives = + if is_passive_set_empty passives then begin + if (is_passive_set_empty g_passives) then + raise (Stop GaveUp) (* we say we are incomplete *) + else + let g_cl = pick_min_passive ~use_age:use_age g_passives in + (true,g_cl,passives,remove_passive_clause g_passives g_cl) end - else let cl = PassiveSet.min_elt passives in - if PassiveSet.is_empty g_passives then - (false,snd cl,PassiveSet.remove cl passives,g_passives) + else let cl = pick_min_passive ~use_age:use_age passives in + if is_passive_set_empty g_passives then + (false,cl,remove_passive_clause passives cl,g_passives) else - let g_cl = PassiveSet.min_elt g_passives in - if (fst cl <= fst g_cl) then - (false,snd cl,PassiveSet.remove cl passives,g_passives) - else - (true,snd g_cl,passives,PassiveSet.remove g_cl g_passives) - in - - let backward_infer_step bag maxvar actives passives g_actives g_passives g_current = + let g_cl = pick_min_passive ~use_age:use_age g_passives in + let (id1,_,_,_,_),(id2,_,_,_,_) = snd cl, snd g_cl in + let cmp = if use_age then id1 <= id2 + else fst cl <= fst g_cl + in + if cmp then + (false,cl,remove_passive_clause passives cl,g_passives) + else + (true,g_cl,passives,remove_passive_clause g_passives g_cl) + ;; + + let backward_infer_step bag maxvar actives passives + g_actives g_passives g_current iterno = (* superposition left, simplifications on goals *) - debug "infer_left step..."; - debug ("Selected goal : " ^ Pp.pp_unit_clause g_current); - let bag, g_current = - Sup.simplify_goal maxvar (snd actives) bag g_current - in - debug "Simplified goal"; + debug (lazy "infer_left step..."); let bag, maxvar, new_goals = Sup.infer_left bag maxvar g_current actives in - debug "Performed infer_left step"; - let new_goals = List.fold_left add_passive_clause - PassiveSet.empty new_goals - in - bag, maxvar, actives, passives, g_current::g_actives, - (PassiveSet.union new_goals g_passives) - in + debug (lazy "Performed infer_left step"); + let bag = Terms.replace_in_bag (g_current,false,iterno) bag in + bag, maxvar, actives, passives, g_current::g_actives, + (add_passive_goals g_passives new_goals) + ;; let forward_infer_step bag maxvar actives passives g_actives - g_passives current = + g_passives current iterno = (* forward step *) (* e = select P * @@ -84,149 +170,245 @@ let nparamod rdb metasenv subst context t table = * new = supright e'' A'' * * new'= demod A'' new * * P' = P + new' *) - debug "Forward infer step..."; - debug "Selected and simplified"; - (* debug ("Fact after simplification :" - ^ Pp.pp_unit_clause current); *) + debug (lazy "Forward infer step..."); + debug (lazy("Number of actives : " ^ (string_of_int (List.length (fst actives))))); let bag, maxvar, actives, new_clauses = Sup.infer_right bag maxvar current actives in - debug "Demodulating goals with actives..."; + debug (lazy "Demodulating goals with actives..."); (* keep goals demodulated w.r.t. actives and check if solved *) let bag, g_actives = - List.fold_left + List.fold_left (fun (bag,acc) c -> - let bag, c = Sup.simplify_goal maxvar (snd actives) bag c in - bag, c::acc) + match + Sup.simplify_goal ~no_demod:false maxvar (snd actives) bag acc c + with + | None -> bag, acc + | Some (bag,c1) -> bag,if c==c1 then c::acc else c::c1::acc) (bag,[]) g_actives in - let ctable = IDX.index_unit_clause IDX.DT.empty current in + let ctable = IDX.index_clause IDX.DT.empty current in let bag, maxvar, new_goals = - List.fold_left - (fun (bag,m,acc) g -> - let bag, m, ng = Sup.infer_left bag m g - ([current],ctable) in - bag,m,ng@acc) - (bag,maxvar,[]) g_actives + List.fold_left + (fun (bag,m,acc) g -> + let bag, m, ng = Sup.infer_left bag m g ([current],ctable) in + bag,m,ng@acc) + (bag,maxvar,[]) g_actives in - let new_clauses = List.fold_left add_passive_clause - PassiveSet.empty new_clauses in - let new_goals = List.fold_left add_passive_clause - PassiveSet.empty new_goals in - bag, maxvar, actives, - PassiveSet.union new_clauses passives, g_actives, - PassiveSet.union new_goals g_passives - in - - let rec given_clause bag maxvar actives passives g_actives g_passives = - (* prerr_endline "Bag :"; prerr_endline (Pp.pp_bag bag); - prerr_endline "Active table :"; - (List.iter (fun x -> prerr_endline (Pp.pp_unit_clause x)) - (fst actives)); *) - incr nb_iter; if !nb_iter = max_nb_iter then - raise (Failure "No iterations left !"); - if Unix.gettimeofday () > timeout then - raise (Failure "Timeout !"); - - - let rec aux_select passives g_passives = - let backward,current,passives,g_passives = select passives g_passives in - if backward then - backward_infer_step bag maxvar actives passives - g_actives g_passives current + let bag = Terms.replace_in_bag (current,false,iterno) bag in + bag, maxvar, actives, + add_passive_clauses passives new_clauses, g_actives, + add_passive_goals g_passives new_goals + ;; + + let rec given_clause ~useage ~noinfer + bag maxvar iterno weight_picks max_steps timeout + actives passives g_actives g_passives + = + let iterno = iterno + 1 in + if iterno = max_steps then raise (Stop (Timeout (maxvar,bag))); + (* timeout check: gettimeofday called only if timeout set *) + if timeout <> None && + (match timeout with + | None -> assert false + | Some timeout -> Unix.gettimeofday () > timeout) then + if noinfer then + begin + debug + (lazy("Last chance: all is indexed " ^ string_of_float + (Unix.gettimeofday()))); + let maxgoals = 100 in + ignore(List.fold_left + (fun (acc,i) x -> + if i < maxgoals then + ignore(Sup.simplify_goal ~no_demod:true + maxvar (snd actives) bag acc x) + else + (); + x::acc,i+1) + ([],0) g_actives); + raise (Stop (Timeout (maxvar,bag))) + end + else if false then (* activates last chance strategy *) + begin + debug (lazy("Last chance: "^string_of_float (Unix.gettimeofday()))); + given_clause ~useage ~noinfer:true bag maxvar iterno weight_picks max_steps + (Some (Unix.gettimeofday () +. 20.)) + actives passives g_actives g_passives; + raise (Stop (Timeout (maxvar,bag))); + end + else raise (Stop (Timeout (maxvar,bag))); + + let use_age = useage && (weight_picks = (iterno / 6 + 1)) in + let weight_picks = if use_age then 0 else weight_picks+1 + in + + let rec aux_select bag passives g_passives = + let backward,(weight,current),passives,g_passives = + select ~use_age passives g_passives + in + if use_age && weight > monster then + let bag,cl = Terms.add_to_bag current bag in + if backward then + aux_select bag passives (add_passive_clause g_passives cl) + else + aux_select bag (add_passive_clause passives cl) g_passives else - (* debug ("Selected fact : " ^ Pp.pp_unit_clause current); *) - match Sup.keep_simplified current actives bag maxvar with - (* match Sup.one_pass_simplification current actives bag maxvar with*) - | None -> aux_select passives g_passives - | Some x -> let (current, bag, actives) = x in - forward_infer_step bag maxvar actives passives - g_actives g_passives current + let bag = Terms.replace_in_bag (current,false,iterno) bag in + if backward then + let _ = debug (lazy("Selected goal : " ^ Pp.pp_clause current)) in + match + if noinfer then + if weight > monster then None else Some (bag,current) + else + Sup.simplify_goal + ~no_demod:false maxvar (snd actives) bag g_actives current + with + | None -> aux_select bag passives g_passives + | Some (bag,g_current) -> + if noinfer then + let g_actives = g_current :: g_actives in + bag,maxvar,actives,passives,g_actives,g_passives + else + backward_infer_step bag maxvar actives passives + g_actives g_passives g_current iterno + else + let _ = debug (lazy("Selected fact : " ^ Pp.pp_clause current)) in + (*let is_orphan = Sup.orphan_murder bag (fst actives) current in*) + match + if noinfer then + if weight > monster then bag,None + else bag, Some (current,actives) + else if Sup.orphan_murder bag (fst actives) current then + let _ = debug (lazy "Orphan murdered") in + let bag = Terms.replace_in_bag (current,true,iterno) bag in + bag, None + else Sup.keep_simplified current actives bag maxvar + with + (*match Sup.one_pass_simplification current actives bag maxvar with*) + | bag,None -> aux_select bag passives g_passives + | bag,Some (current,actives) -> +(* if is_orphan then prerr_endline + ("WRONG discarded: " ^ (Pp.pp_unit_clause current)); + List.iter (fun x -> + prerr_endline (Pp.pp_unit_clause x)) + (fst actives);*) + +(* List.iter (fun (id,_,_,_) -> let (cl,d) = + Terms.M.find id bag in + if d then prerr_endline + ("WRONG discarded: " ^ (Pp.pp_unit_clause cl))) + (current::fst actives);*) + if noinfer then + let actives = + current::fst actives, + IDX.index_clause (snd actives) current + in + bag,maxvar,actives,passives,g_actives,g_passives + else + forward_infer_step bag maxvar actives passives + g_actives g_passives current iterno in + + (*prerr_endline "Active table :"; + (List.iter (fun x -> prerr_endline (Pp.pp_unit_clause x)) + (fst actives)); *) let bag,maxvar,actives,passives,g_actives,g_passives = - aux_select passives g_passives + aux_select bag passives g_passives in - assert (PassiveSet.cardinal g_passives < 2); debug - (Printf.sprintf "Number of active goals : %d" - (List.length g_actives)); + (lazy(Printf.sprintf "Number of active goals : %d" + (List.length g_actives))); debug - (Printf.sprintf "Number of passive goals : %d" - (PassiveSet.cardinal g_passives)); + (lazy(Printf.sprintf "Number of passive goals : %d" + (passive_set_cardinal g_passives))); debug - (Printf.sprintf "Number of actives : %d" (List.length (fst actives))); + (lazy(Printf.sprintf "Number of actives : %d" (List.length (fst actives)))); debug - (Printf.sprintf "Number of passives : %d" - (PassiveSet.cardinal passives)); - given_clause bag maxvar actives passives g_actives g_passives - in - - let mk_clause bag maxvar (t,ty) = - let (proof,ty) = B.saturate t ty in - let c, maxvar = Utils.mk_unit_clause maxvar ty proof in - let bag, c = Utils.add_to_bag bag c in - bag, maxvar, c - in - let bag, maxvar, goal = mk_clause Terms.M.empty 0 t in - let g_actives = [] in - let g_passives = PassiveSet.singleton (Utils.mk_passive_clause goal) in - let passives, bag, maxvar = - List.fold_left - (fun (cl, bag, maxvar) t -> - let bag, maxvar, c = mk_clause bag maxvar t in - (add_passive_clause cl c), bag, maxvar) - (PassiveSet.empty, bag, maxvar) table - in - let actives = [], IDX.DT.empty in - try given_clause bag maxvar actives passives g_actives g_passives - with - | Sup.Success (bag, _, (i,_,_,_)) -> - let l = - let rec traverse ongoal (accg,acce) i = - match Terms.M.find i bag with - | (id,_,_,Terms.Exact _) -> - if ongoal then [i],acce else - if (List.mem i acce) then accg,acce else accg,acce@[i] - | (_,_,_,Terms.Step (_,i1,i2,_,_,_)) -> - if (not ongoal) && (List.mem i acce) then accg,acce - else - let accg,acce = - traverse false (traverse ongoal (accg,acce) i1) i2 - in - if ongoal then i::accg,acce else accg,i::acce - in - let gsteps,esteps = traverse true ([],[]) i in - (List.rev esteps)@gsteps - in - prerr_endline (Printf.sprintf "Found proof in %d iterations, %fs" - !nb_iter - (Unix.gettimeofday() -. timeout +. amount_of_time)); - (* prerr_endline "Proof:"; - List.iter (fun x -> prerr_endline (string_of_int x); - prerr_endline (Pp.pp_unit_clause (Terms.M.find x bag))) l;*) - let proofterm = B.mk_proof bag i l in - prerr_endline (Printf.sprintf "Got proof term, %fs" - (Unix.gettimeofday() -. timeout +. amount_of_time)); - let metasenv, proofterm = - let rec aux k metasenv = function - | NCic.Meta _ as t -> metasenv, t - | NCic.Implicit _ -> - let metasenv,i,_,_=NCicMetaSubst.mk_meta metasenv context `Term in - metasenv, NCic.Meta (i,(k,NCic.Irl (List.length context))) - | t -> NCicUntrusted.map_term_fold_a - (fun _ k -> k+1) k aux metasenv t + (lazy(Printf.sprintf "Number of passives : %d" + (passive_set_cardinal passives))); + given_clause ~useage ~noinfer + bag maxvar iterno weight_picks max_steps timeout + actives passives g_actives g_passives + ;; + + let paramod ~useage ~max_steps ~print_problem ?timeout goal hypotheses = + let initial_timestamp = Unix.gettimeofday () in + let bag = Terms.empty_bag in + let maxvar = 0 in + let build_clause (bag,maxvar,l) (t,(nlit,plit)) = + let c,maxvar = Clauses.mk_clause maxvar nlit plit t in + let bag,c = Terms.add_to_bag c bag in + (bag,maxvar,c::l) + in + let bag,maxvar,goals = build_clause (bag,maxvar,[]) goal in + let bag,maxvar,hypotheses = List.fold_left build_clause (bag,maxvar,[]) hypotheses in + let goal = match goals with | [g] -> g | _ -> assert false in + let passives = + add_passive_clauses ~bonus_weight:(-1000) passive_empty_set hypotheses + in + let g_passives = + add_passive_goal ~bonus_weight:(-1000) passive_empty_set goal + in + let g_actives = [] in + let actives = [], IDX.DT.empty in + if print_problem then begin + prerr_endline "Facts:"; + List.iter (fun x -> prerr_endline (" " ^ Pp.pp_clause x)) hypotheses; + prerr_endline "Goal:"; + prerr_endline (" " ^ Pp.pp_clause goal); + end; + try + given_clause ~useage ~noinfer:false + bag maxvar 0 0 max_steps timeout actives passives g_actives g_passives + with + | Sup.Success (bag, _, (i,_,_,_,_)) -> + let l = + let rec traverse ongoal (accg,acce) i = + match Terms.get_from_bag i bag with + | (id,_,_,_,Terms.Exact _),_,_ -> + if ongoal then [i],acce else + if (List.mem i acce) then accg,acce else accg,acce@[i] + | (_,_,_,_,Terms.Step (_,i1,i2,_,_,_)),_,_ -> + if (not ongoal) && (List.mem i acce) then accg,acce + else + let accg,acce = + traverse false (traverse ongoal (accg,acce) i1) i2 + in + if ongoal then i::accg,acce else accg,i::acce + in + let gsteps,esteps = traverse true ([],[]) i in + (List.rev esteps)@gsteps in - aux 0 metasenv proofterm - in - let metasenv, subst, proofterm, _prooftype = - NCicRefiner.typeof - (rdb#set_coerc_db NCicCoercion.empty_db) - metasenv subst context proofterm None - in - proofterm, metasenv, subst - | Failure s -> - prerr_endline s; - prerr_endline - (Printf.sprintf "FAILURE in %d iterations" !nb_iter); assert false -;; + let max_w = List.fold_left (fun acc i -> + let (cl,_,_) = Terms.get_from_bag i bag in + max acc (Order.compute_clause_weight cl)) 0 l in + prerr_endline "Statistics :"; + prerr_endline ("Max weight : " ^ (string_of_int max_w)); +(* List.iter (fun id -> let ((_,lit,_,proof as cl),d,it) = + Terms.get_from_bag id bag in + if d then + prerr_endline + (Printf.sprintf "Id : %d, selected at %d, weight %d,disc, by %s" + id it (Order.compute_unit_clause_weight cl) + (Pp.pp_proof_step proof)) + else + prerr_endline + (Printf.sprintf "Id : %d, selected at %d, weight %d by %s" + id it (Order.compute_unit_clause_weight cl) + (Pp.pp_proof_step proof))) l;*) + prerr_endline + (Printf.sprintf "Found proof, %fs" + (Unix.gettimeofday() -. initial_timestamp)); + (* + prerr_endline "Proof:"; + List.iter (fun x -> + prerr_endline (Pp.pp_unit_clause (fst(Terms.M.find x bag)))) l; + *) + Unsatisfiable [ bag, i, l ] + | Stop (Unsatisfiable _) -> Error "stop bug solution found!" + | Stop o -> o + ;; + +end