X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;ds=sidebyside;f=matita%2Fcomponents%2Fng_paramodulation%2Findex.ml;h=c1e12a34dbbc684c38560e2bae7ff046aff1eabf;hb=db020b4218272e2e35641ce3bc3b0a9b3afda899;hp=36c9dd75e693ec51cf5e168995563113c2b92f66;hpb=2c01ff6094173915e7023076ea48b5804dca7778;p=helm.git

diff --git a/matita/components/ng_paramodulation/index.ml b/matita/components/ng_paramodulation/index.ml
index 36c9dd75e..c1e12a34d 100644
--- a/matita/components/ng_paramodulation/index.ml
+++ b/matita/components/ng_paramodulation/index.ml
@@ -13,8 +13,8 @@
 
 module Index(B : Orderings.Blob) = struct
   module U = FoUtils.Utils(B)
-  module Unif = FoUnif.Founif(B)
-  module Pp = Pp.Pp(B)
+  (*module Unif = FoUnif.Founif(B)*)
+  (*module Pp = Pp.Pp(B)*)
 
   module ClauseOT =
     struct 
@@ -44,12 +44,13 @@ module Index(B : Orderings.Blob) = struct
       let path_string_of =
         let rec aux arity = function
           | Terms.Leaf a -> [Constant (a, arity)]
-          | Terms.Var i -> (* assert (arity = 0); *) [Variable]
+          | Terms.Var _i -> (* assert (arity = 0); *) [Variable]
 	  (* FIXME : should this be allowed or not ? 
           | Terms.Node (Terms.Var _::_) ->
 	      assert false *)
           | Terms.Node ([] | [ _ ] ) -> assert false
-          | Terms.Node (Terms.Node _::_) -> assert false	      
+          (* FIXME : if we can have a variable we can also have a term 
+            | Terms.Node (Terms.Node _::_) as t -> assert false	 *)      
           | Terms.Node (hd::tl) ->
               aux (List.length tl) hd @ List.flatten (List.map (aux 0) tl) 
         in 
@@ -86,12 +87,12 @@ module Index(B : Orderings.Blob) = struct
         op t l (Terms.Left2Right, c)
     | (_,Terms.Equation (_,r,_,Terms.Lt),_,_) as c -> 
         op t r (Terms.Right2Left, c)
-    | (_,Terms.Equation (l,r,_,Terms.Incomparable),vl,_) as c ->
+    | (_,Terms.Equation (l,r,_,Terms.Incomparable),_vl,_) as c ->
         op (op t l (Terms.Left2Right, c))
           r (Terms.Right2Left, c)
-    | (_,Terms.Equation (l,r,_,Terms.Invertible),vl,_) as c ->
+    | (_,Terms.Equation (l,_r,_,Terms.Invertible),_vl,_) as c ->
 	op t l (Terms.Left2Right, c)
-    | (_,Terms.Equation (_,r,_,Terms.Eq),_,_)  -> assert false
+    | (_,Terms.Equation (_,_r,_,Terms.Eq),_,_)  -> assert false
     | (_,Terms.Predicate p,_,_) as c ->
         op t p (Terms.Nodir, c)
   ;;