(* DISCRIMINATION TREES *)
+let init_index () =
+ Hashtbl.clear Discrimination_tree.arities;
+;;
+
let empty_table () =
Discrimination_tree.DiscriminationTree.empty
;;
(* | _, _, (_, left, right, _), _, _ -> *)
(* not (fst (CR.are_convertible context left right ugraph)) *)
(* in *)
+ let _ =
+ let env = metasenv, context, ugraph in
+ debug_print
+ (lazy
+ (Printf.sprintf "end of superposition_right:\n%s\n"
+ (String.concat "\n"
+ ((List.map
+ (fun e -> "Positive " ^
+ (Inference.string_of_equality ~env e)) (new1 @ new2))))))
+ in
let ok e = not (Inference.is_identity (metasenv, context, ugraph) e) in
(!maxmeta,
(List.filter ok (new1 @ new2)))