| Cic.Appl l -> List.for_all is_simple_term l
| Cic.Meta (i, l) -> check_irl 1 l
| Cic.Rel _ -> true
+ | Cic.Const _ -> true
| _ -> false
;;
let module U = CicUnification in
let lookup = lookup_subst in
let rec occurs_check subst what where =
- (* Printf.printf "occurs_check %s %s" *)
- (* (CicPp.ppterm what) (CicPp.ppterm where); *)
- (* print_newline (); *)
match where with
| t when what = t -> true
| C.Appl l -> List.exists (occurs_check subst what) l
| _ -> false
in
let rec unif subst menv s t =
-(* Printf.printf "unif %s %s\n%s\n" (CicPp.ppterm s) (CicPp.ppterm t) *)
-(* (print_subst subst); *)
-(* print_newline (); *)
let s = match s with C.Meta _ -> lookup s subst | _ -> s
and t = match t with C.Meta _ -> lookup t subst | _ -> t
in
- (* Printf.printf "after apply_subst: %s %s\n%s" *)
- (* (CicPp.ppterm s) (CicPp.ppterm t) (print_subst subst); *)
- (* print_newline (); *)
match s, t with
| s, t when s = t -> subst, menv
| C.Meta (i, _), C.Meta (j, _) when i > j ->
unif subst menv t s
| C.Meta _, t when occurs_check subst s t ->
raise (U.UnificationFailure "Inference.unification.unif")
-(* | C.Meta (i, l), C.Meta (j, l') -> *)
-(* let _, _, ty = CicUtil.lookup_meta i menv in *)
-(* let _, _, ty' = CicUtil.lookup_meta j menv in *)
-(* let binding1 = lookup s subst in *)
-(* let binding2 = lookup t subst in *)
-(* let subst, menv = *)
-(* if binding1 != s then *)
-(* if binding2 != t then *)
-(* unif subst menv binding1 binding2 *)
-(* else *)
-(* if binding1 = t then *)
-(* subst, menv *)
-(* else *)
-(* ((j, (context, binding1, ty'))::subst, *)
-(* List.filter (fun (m, _, _) -> j <> m) menv) *)
-(* else *)
-(* if binding2 != t then *)
-(* if s = binding2 then *)
-(* subst, menv *)
-(* else *)
-(* ((i, (context, binding2, ty))::subst, *)
-(* List.filter (fun (m, _, _) -> i <> m) menv) *)
-(* else *)
-(* ((i, (context, t, ty))::subst, *)
-(* List.filter (fun (m, _, _) -> i <> m) menv) *)
-(* in *)
-(* subst, menv *)
-
| C.Meta (i, l), t ->
let _, _, ty = CicUtil.lookup_meta i menv in
let subst =
| _, _ -> raise (U.UnificationFailure "Inference.unification.unif")
in
let subst, menv = unif [] metasenv t1 t2 in
- (* Printf.printf "DONE!: subst = \n%s\n" (print_subst subst); *)
- (* print_newline (); *)
-(* let rec fix_term = function *)
-(* | (C.Meta (i, l) as t) -> *)
-(* lookup t subst *)
-(* | C.Appl l -> C.Appl (List.map fix_term l) *)
-(* | t -> t *)
-(* in *)
-(* let rec fix_subst = function *)
-(* | [] -> [] *)
-(* | (i, (c, t, ty))::tl -> (i, (c, fix_term t, fix_term ty))::(fix_subst tl) *)
-(* in *)
-(* List.rev (fix_subst subst), menv, ugraph *)
List.rev subst, menv, ugraph
;;
(* (\* print_newline (); *\) *)
(* subst, menv, ug *)
(* else *)
+(* Printf.printf "matching %s %s" (CicPp.ppterm t1) (CicPp.ppterm t2); *)
+(* print_newline (); *)
try
let subst, metasenv, ugraph =
(* CicUnification.fo_unif metasenv context t1 t2 ugraph *)
with e ->
(* Printf.printf "failed to match %s %s\n" *)
(* (CicPp.ppterm t1) (CicPp.ppterm t2); *)
+(* print_endline (Printexc.to_string e); *)
raise MatchingFailure
;;
C.Appl ((C.Rel index)::args)
in (
match head with
- | C.Appl [C.MutInd (uri, _, _); ty; t1; t2] when uri = eq_uri ->
+ | C.Appl [C.MutInd (uri, _, _); ty; t1; t2]
+ when UriManager.eq uri eq_uri ->
Printf.printf "OK: %s\n" (CicPp.ppterm term);
let o = !Utils.compare_terms t1 t2 in
let w = compute_equality_weight ty t1 t2 in
Some e, (newmeta+1)
| _ -> None, newmeta
)
- | C.Appl [C.MutInd (uri, _, _); ty; t1; t2] when uri = eq_uri ->
+ | C.Appl [C.MutInd (uri, _, _); ty; t1; t2]
+ when UriManager.eq uri eq_uri ->
let t1 = S.lift index t1
and t2 = S.lift index t2 in
let o = !Utils.compare_terms t1 t2 in
;;
-let find_library_equalities ~(dbd:Mysql.dbd) status maxmeta =
+let equations_blacklist =
+ List.fold_left
+ (fun s u -> UriManager.UriSet.add (UriManager.uri_of_string u) s)
+ UriManager.UriSet.empty [
+ "cic:/Coq/Init/Logic/eq.ind#xpointer(1/1/1)";
+ "cic:/Coq/Init/Logic/trans_eq.con";
+ "cic:/Coq/Init/Logic/f_equal.con";
+ "cic:/Coq/Init/Logic/f_equal2.con";
+ "cic:/Coq/Init/Logic/f_equal3.con";
+ "cic:/Coq/Init/Logic/sym_eq.con"
+ ]
+;;
+
+let find_library_equalities ~(dbd:Mysql.dbd) context status maxmeta =
let module C = Cic in
let module S = CicSubstitution in
let module T = CicTypeChecker in
let candidates =
- List.map
- (fun uri ->
- let t = CicUtil.term_of_uri uri in
- let ty, _ = CicTypeChecker.type_of_aux' [] [] t CicUniv.empty_ugraph in
- t, ty)
+ List.fold_left
+ (fun l uri ->
+ if UriManager.UriSet.mem uri equations_blacklist then
+ l
+ else
+ let t = CicUtil.term_of_uri uri in
+ let ty, _ =
+ CicTypeChecker.type_of_aux' [] context t CicUniv.empty_ugraph
+ in
+ (t, ty)::l)
+ []
(MetadataQuery.equations_for_goal ~dbd status)
in
let eq_uri1 = UriManager.uri_of_string HelmLibraryObjects.Logic.eq_XURI
and eq_uri2 = HelmLibraryObjects.Logic.eq_URI in
let iseq uri =
- uri == eq_uri1 || uri == eq_uri2
+ (UriManager.eq uri eq_uri1) || (UriManager.eq uri eq_uri2)
in
let rec aux newmeta = function
| [] -> [], newmeta
match termty with
| C.Prod (name, s, t) ->
let head, newmetas, args, newmeta =
- ProofEngineHelpers.saturate_term newmeta [] [] termty
+ ProofEngineHelpers.saturate_term newmeta [] context termty
in
let p =
if List.length args = 0 then
;;
+let term_is_equality ?(eq_uri=HelmLibraryObjects.Logic.eq_URI) term =
+ let iseq uri = UriManager.eq uri eq_uri in
+ match term with
+ | Cic.Appl [Cic.MutInd (uri, _, _); _; _; _] when iseq uri -> true
+ | _ -> false
+;;
+
+
exception TermIsNotAnEquality;;
-let equality_of_term ?(eq_uri=HelmLibraryObjects.Logic.eq_URI) proof = function
- | Cic.Appl [Cic.MutInd (uri, _, _); ty; t1; t2] when uri = eq_uri ->
+let equality_of_term ?(eq_uri=HelmLibraryObjects.Logic.eq_URI) proof term =
+ let iseq uri = UriManager.eq uri eq_uri in
+ match term with
+ | Cic.Appl [Cic.MutInd (uri, _, _); ty; t1; t2] when iseq uri ->
let o = !Utils.compare_terms t1 t2 in
let w = compute_equality_weight ty t1 t2 in
let e = (w, BasicProof proof, (ty, t1, t2, o), [], []) in
open Utils;;
+(* set to false to disable paramodulation inside auto_tac *)
+let connect_to_auto = true;;
+
+let debug = true;;
+
+let debug_print = if debug then prerr_endline else ignore;;
+
+
(* profiling statistics... *)
let infer_time = ref 0.;;
let forward_simpl_time = ref 0.;;
and ratio = float_of_int !weight_age_ratio in
let in_weight = int_of_float (howmany *. ratio /. (ratio +. 1.))
and in_age = int_of_float (howmany /. (ratio +. 1.)) in
- Printf.printf "in_weight: %d, in_age: %d\n" in_weight in_age;
+ debug_print (Printf.sprintf "in_weight: %d, in_age: %d\n" in_weight in_age);
let symbols, card =
match active with
| (Negative, e)::_ ->
if !time_limit = 0. || !processed_clauses = 0 then
passive
else if !elapsed_time > !time_limit then (
- Printf.printf "Time limit (%.2f) reached: %.2f\n"
- !time_limit !elapsed_time;
+ debug_print (Printf.sprintf "Time limit (%.2f) reached: %.2f\n"
+ !time_limit !elapsed_time);
make_passive [] []
) else if kept > selection_estimate then (
- Printf.printf ("Too many passive equalities: pruning... (kept: %d, " ^^
- "selection_estimate: %d)\n") kept selection_estimate;
+ debug_print (Printf.sprintf ("Too many passive equalities: pruning..." ^^
+ "(kept: %d, selection_estimate: %d)\n")
+ kept selection_estimate);
prune_passive selection_estimate active passive
) else
passive
given_clause env passive active
| Some (sign, current) ->
if (sign = Negative) && (is_identity env current) then (
- Printf.printf "OK!!! %s %s" (string_of_sign sign)
- (string_of_equality ~env current);
- print_newline ();
+ debug_print (Printf.sprintf "OK!!! %s %s" (string_of_sign sign)
+ (string_of_equality ~env current));
Success (Some current, env)
) else (
- print_endline "\n================================================";
- Printf.printf "selected: %s %s"
- (string_of_sign sign) (string_of_equality ~env current);
- print_newline ();
+ debug_print "\n================================================";
+ debug_print (Printf.sprintf "selected: %s %s"
+ (string_of_sign sign)
+ (string_of_equality ~env current));
let t1 = Unix.gettimeofday () in
let new' = infer env sign current active in
if !time_limit = 0. || !processed_clauses = 0 then
passive
else if !elapsed_time > !time_limit then (
- Printf.printf "Time limit (%.2f) reached: %.2f\n"
- !time_limit !elapsed_time;
+ debug_print (Printf.sprintf "Time limit (%.2f) reached: %.2f\n"
+ !time_limit !elapsed_time);
make_passive [] []
) else if kept > selection_estimate then (
- Printf.printf ("Too many passive equalities: pruning... (kept: %d, " ^^
- "selection_estimate: %d)\n") kept selection_estimate;
+ debug_print (Printf.sprintf ("Too many passive equalities: pruning..." ^^
+ "(kept: %d, selection_estimate: %d)\n")
+ kept selection_estimate);
prune_passive selection_estimate active passive
) else
passive
given_clause_fullred env passive active
| Some (sign, current) ->
if (sign = Negative) && (is_identity env current) then (
- Printf.printf "OK!!! %s %s" (string_of_sign sign)
- (string_of_equality ~env current);
- print_newline ();
+ debug_print (Printf.sprintf "OK!!! %s %s" (string_of_sign sign)
+ (string_of_equality ~env current));
Success (Some current, env)
) else (
- print_endline "\n================================================";
- Printf.printf "selected: %s %s"
- (string_of_sign sign) (string_of_equality ~env current);
- print_newline ();
+ debug_print "\n================================================";
+ debug_print (Printf.sprintf "selected: %s %s"
+ (string_of_sign sign)
+ (string_of_equality ~env current));
let t1 = Unix.gettimeofday () in
let new' = infer env sign current active in
if k < (kept - 1) then
processed_clauses := !processed_clauses + (kept - 1 - k);
-(* let _ = *)
-(* Printf.printf "active:\n%s\n" *)
-(* (String.concat "\n" *)
-(* ((List.map *)
-(* (fun (s, e) -> (string_of_sign s) ^ " " ^ *)
-(* (string_of_equality ~env e)) (fst active)))); *)
-(* print_newline (); *)
-(* in *)
-(* let _ = *)
-(* match new' with *)
-(* | neg, pos -> *)
-(* Printf.printf "new':\n%s\n" *)
-(* (String.concat "\n" *)
-(* ((List.map *)
-(* (fun e -> "Negative " ^ *)
-(* (string_of_equality ~env e)) neg) @ *)
-(* (List.map *)
-(* (fun e -> "Positive " ^ *)
-(* (string_of_equality ~env e)) pos))); *)
-(* print_newline (); *)
-(* in *)
+ let _ =
+ debug_print (
+ Printf.sprintf "active:\n%s\n"
+ (String.concat "\n"
+ ((List.map
+ (fun (s, e) -> (string_of_sign s) ^ " " ^
+ (string_of_equality ~env e)) (fst active)))))
+ in
+ let _ =
+ match new' with
+ | neg, pos ->
+ debug_print (
+ Printf.sprintf "new':\n%s\n"
+ (String.concat "\n"
+ ((List.map
+ (fun e -> "Negative " ^
+ (string_of_equality ~env e)) neg) @
+ (List.map
+ (fun e -> "Positive " ^
+ (string_of_equality ~env e)) pos))))
+ in
match contains_empty env new' with
| false, _ ->
let passive = add_to_passive passive new' in
- let (_, ns), (_, ps), _ = passive in
+(* let (_, ns), (_, ps), _ = passive in *)
(* Printf.printf "passive:\n%s\n" *)
(* (String.concat "\n" *)
(* ((List.map (fun e -> "Negative " ^ *)
;;
-let get_from_user ~(dbd:Mysql.dbd) =
- let rec get () =
- match read_line () with
- | "" -> []
- | t -> t::(get ())
- in
- let term_string = String.concat "\n" (get ()) in
- let env, metasenv, term, ugraph =
- List.nth (Disambiguate.Trivial.disambiguate_string dbd term_string) 0
- in
- term, metasenv, ugraph
-;;
-
-
let given_clause_ref = ref given_clause;;
-let main () =
+let main dbd term metasenv ugraph =
let module C = Cic in
let module T = CicTypeChecker in
let module PET = ProofEngineTypes in
let module PP = CicPp in
- let dbd = Mysql.quick_connect
- ~host:"localhost" ~user:"helm" ~database:"mowgli" () in
- let term, metasenv, ugraph = get_from_user ~dbd in
let proof = None, (1, [], term)::metasenv, C.Meta (1, []), term in
let status = PET.apply_tactic (PrimitiveTactics.intros_tac ()) (proof, 1) in
let proof, goals = status in
let _, context, goal = CicUtil.lookup_meta goal' metasenv in
let equalities, maxm = find_equalities context proof in
let library_equalities, maxm =
- find_library_equalities ~dbd (proof, goal') (maxm+1) in
+ find_library_equalities ~dbd context (proof, goal') (maxm+1)
+ in
maxmeta := maxm+2; (* TODO ugly!! *)
let irl = CicMkImplicit.identity_relocation_list_for_metavariable context in
let new_meta_goal, metasenv, type_of_goal =
let term_equality = equality_of_term new_meta_goal goal in
let _, meta_proof, (eq_ty, left, right, ordering), _, _ = term_equality in
let active = make_active () in
- let passive = make_passive [term_equality] equalities in
+ let passive =
+ make_passive [term_equality] (equalities @ library_equalities)
+ in
Printf.printf "\ncurrent goal: %s\n"
(string_of_equality ~env term_equality);
Printf.printf "\ncontext:\n%s\n" (PP.ppcontext context);
| Failure ->
Printf.printf "NO proof found! :-(\n\n"
| Success (Some goal, env) ->
- Printf.printf "OK, found a proof!\n";
let proof = Inference.build_proof_term goal in
- (* REMEMBER: we have to instantiate meta_proof, we should use
- apply the "apply" tactic to proof and status
- *)
- let names = names_of_context context in
- print_endline (PP.pp proof names);
-(* print_endline (PP.ppterm proof); *)
-
- print_endline (string_of_float (finish -. start));
let newmetasenv =
List.fold_left
(fun m (_, _, _, menv, _) -> m @ menv) metasenv equalities
let ty, ug =
CicTypeChecker.type_of_aux' newmetasenv context proof ugraph
in
+ Printf.printf "OK, found a proof!\n";
+ (* REMEMBER: we have to instantiate meta_proof, we should use
+ apply the "apply" tactic to proof and status
+ *)
+ let names = names_of_context context in
+ print_endline (PP.pp proof names);
+ (* print_endline (PP.ppterm proof); *)
+
+ print_endline (string_of_float (finish -. start));
Printf.printf
"\nGOAL was: %s\nPROOF has type: %s\nconvertible?: %s\n\n"
(CicPp.pp type_of_goal names) (CicPp.pp ty names)
(string_of_bool
- (fst (CicReduction.are_convertible context type_of_goal ty ug)));
+ (fst (CicReduction.are_convertible
+ context type_of_goal ty ug)));
with e ->
+ Printf.printf "\nEXCEPTION!!! %s\n" (Printexc.to_string e);
Printf.printf "MAXMETA USED: %d\n" !maxmeta;
in
()
;;
-let saturation_tactic status =
+exception Failure of string
+
+let saturate dbd (proof, goal) =
let module C = Cic in
- let saturation_tac (proof, goal) =
- maxmeta := 0;
-(* if List.length goals <> 1 then *)
-(* raise (ProofEngineTypes.Fail "There should be only one open goal"); *)
-
-(* let goal' = List.hd goals in *)
- let goal' = goal in
- let uri, metasenv, meta_proof, term_to_prove = proof in
- let _, context, goal = CicUtil.lookup_meta goal' metasenv in
- let equalities, maxm = find_equalities context proof in
- maxmeta := maxm+2;
- let new_meta_goal, metasenv, type_of_goal =
- let irl =
- CicMkImplicit.identity_relocation_list_for_metavariable context in
- let _, context, ty = CicUtil.lookup_meta goal' metasenv in
- Printf.printf "\n\nTIPO DEL GOAL: %s\n" (CicPp.ppterm ty);
- print_newline ();
- Cic.Meta (maxm+1, irl),
- (maxm+1, context, ty)::metasenv,
- ty
+ maxmeta := 0;
+ let goal' = goal in
+ let uri, metasenv, meta_proof, term_to_prove = proof in
+ let _, context, goal = CicUtil.lookup_meta goal' metasenv in
+ let equalities, maxm = find_equalities context proof in
+ let library_equalities, maxm =
+ find_library_equalities ~dbd context (proof, goal') (maxm+2)
+ in
+ maxmeta := maxm+2;
+ let new_meta_goal, metasenv, type_of_goal =
+ let irl =
+ CicMkImplicit.identity_relocation_list_for_metavariable context in
+ let _, context, ty = CicUtil.lookup_meta goal' metasenv in
+ debug_print (Printf.sprintf "\n\nTIPO DEL GOAL: %s\n" (CicPp.ppterm ty));
+ Cic.Meta (maxm+1, irl),
+ (maxm+1, context, ty)::metasenv,
+ ty
+ in
+ let ugraph = CicUniv.empty_ugraph in
+ let env = (metasenv, context, ugraph) in
+(* try *)
+ let term_equality = equality_of_term new_meta_goal goal in
+ let active = make_active () in
+ let passive =
+ make_passive [term_equality] (equalities @ library_equalities)
in
- let ugraph = CicUniv.empty_ugraph in
- let env = (metasenv, context, ugraph) in
- try
- let term_equality = equality_of_term new_meta_goal goal in
-(* let _, meta_proof, (eq_ty, left, right, ordering), _, _ = term_equality in *)
- let active = make_active () in
- let passive = make_passive [term_equality] equalities in
- let res = given_clause_fullred env passive active in
- match res with
- | Success (Some goal, env) ->
- Printf.printf "OK, found a proof!\n";
- let proof = Inference.build_proof_term goal in
- let names = names_of_context context in
- print_endline (CicPp.pp proof names);
- let newmetasenv =
- let i1 =
- match new_meta_goal with
- | C.Meta (i, _) -> i | _ -> assert false
+ let res = given_clause_fullred env passive active in
+ match res with
+ | Success (Some goal, env) ->
+ debug_print "OK, found a proof!";
+ let proof = Inference.build_proof_term goal in
+ let names = names_of_context context in
+ let newmetasenv =
+ let i1 =
+ match new_meta_goal with
+ | C.Meta (i, _) -> i | _ -> assert false
+ in
+(* let i2 = *)
+(* match meta_proof with *)
+(* | C.Meta (i, _) -> i *)
+(* | t -> *)
+(* Printf.printf "\nHMMM!!! meta_proof: %s\ngoal': %s" *)
+(* (CicPp.pp meta_proof names) (string_of_int goal'); *)
+(* print_newline (); *)
+(* assert false *)
+(* in *)
+ List.filter (fun (i, _, _) -> i <> i1 && i <> goal') metasenv
+ in
+ let newstatus =
+ try
+ let ty, ug =
+ CicTypeChecker.type_of_aux' newmetasenv context proof ugraph
in
- let i2 =
- match meta_proof with
- | C.Meta (i, _) -> i | _ -> assert false
+ debug_print (CicPp.pp proof [](* names *));
+ debug_print
+ (Printf.sprintf
+ "\nGOAL was: %s\nPROOF has type: %s\nconvertible?: %s\n"
+ (CicPp.pp type_of_goal names) (CicPp.pp ty names)
+ (string_of_bool
+ (fst (CicReduction.are_convertible
+ context type_of_goal ty ug))));
+ let equality_for_replace t1 i =
+ match t1 with
+ | C.Meta (n, _) -> n = i
+ | _ -> false
in
- List.filter (fun (i, _, _) -> i <> i1 && i <> i2) metasenv
- in
- let newstatus =
- try
- let ty, ug =
- CicTypeChecker.type_of_aux' newmetasenv context proof ugraph
- in
- Printf.printf
- "\nGOAL was: %s\nPROOF has type: %s\nconvertible?: %s\n\n"
- (CicPp.pp type_of_goal names) (CicPp.pp ty names)
- (string_of_bool
- (fst (CicReduction.are_convertible
- context type_of_goal ty ug)));
- ((uri, newmetasenv, proof, term_to_prove), [])
- with e ->
- raise (ProofEngineTypes.Fail
- "Found a proof, but it doesn't typecheck")
- in
- newstatus
- | _ ->
- raise (ProofEngineTypes.Fail "NO proof found")
- with e ->
- raise (ProofEngineTypes.Fail "saturation failed")
- in
- ProofEngineTypes.mk_tactic saturation_tac
+ let real_proof =
+ ProofEngineReduction.replace
+ ~equality:equality_for_replace
+ ~what:[goal'] ~with_what:[proof]
+ ~where:meta_proof
+ in
+ debug_print (
+ Printf.sprintf "status:\n%s\n%s\n%s\n%s\n"
+ (match uri with Some uri -> UriManager.string_of_uri uri
+ | None -> "")
+ (print_metasenv newmetasenv)
+ (CicPp.pp real_proof [](* names *))
+ (CicPp.pp term_to_prove names));
+ ((uri, newmetasenv, real_proof, term_to_prove), [])
+ with e ->
+ debug_print "THE PROOF DOESN'T TYPECHECK!!!";
+ debug_print (CicPp.pp proof names);
+ raise (Failure "Found a proof, but it doesn't typecheck")
+ in
+ newstatus
+ | _ ->
+ raise (Failure "NO proof found")
+(* with e -> *)
+(* raise (Failure "saturation failed") *)
;;
+(* dummy function called within matita to trigger linkage *)
+let init () = ();;
-let configuration_file = ref "../../matita/matita.conf.xml";;
-
-let _ =
- let set_ratio v = weight_age_ratio := (v+1); weight_age_counter := (v+1)
- and set_sel v = symbols_ratio := v; symbols_counter := v;
- and set_conf f = configuration_file := f
- and set_lpo () = Utils.compare_terms := lpo
- and set_kbo () = Utils.compare_terms := nonrec_kbo
- and set_fullred b = use_fullred := b
- and set_time_limit v = time_limit := float_of_int v
- in
- Arg.parse [
- "-f", Arg.Bool set_fullred,
- "Enable/disable full-reduction strategy (default: enabled)";
-
- "-r", Arg.Int set_ratio, "Weight-Age equality selection ratio (default: 3)";
-
- "-s", Arg.Int set_sel,
- "symbols-based selection ratio (relative to the weight ratio, default: 2)";
-
- "-c", Arg.String set_conf, "Configuration file (for the db connection)";
-
- "-lpo", Arg.Unit set_lpo, "Use lpo term ordering";
-
- "-kbo", Arg.Unit set_kbo, "Use (non-recursive) kbo term ordering (default)";
- "-l", Arg.Int set_time_limit, "Time limit (in seconds)";
- ] (fun a -> ()) "Usage:"
-in
-Helm_registry.load_from !configuration_file;
-main ()
+(* UGLY SIDE EFFECT... *)
+if connect_to_auto then (
+ AutoTactic.paramodulation_tactic := saturate;
+ AutoTactic.term_is_equality := Inference.term_is_equality;
+);;
projects / helm.git / commitdiff