X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Ftests%2Fcoercions.ma;h=8e7582a147113a99b67e93e6bf484fe2865efb26;hb=fbdd1cc46819d19ed135391a4a954c19d1b92c0c;hp=1d841d16ebc2f3cad7299d9ec30cf9198ffa81c8;hpb=cb4b3b6d71a8d0b5120fe6604cc55105637ef234;p=helm.git

diff --git a/matita/tests/coercions.ma b/matita/tests/coercions.ma
index 1d841d16e..8e7582a14 100644
--- a/matita/tests/coercions.ma
+++ b/matita/tests/coercions.ma
@@ -59,10 +59,14 @@ definition double2:
 \def 
   \lambda f:int \to int. \lambda x : pos .f (nat2int (pos2nat x)).
 
+(* This used to test eq_f as a coercion. However, posing both eq_f and sym_eq
+   as coercions made the qed time of some TPTP problems reach infty.
+   Thus eq_f is no longer a coercion (nor is sym_eq).
 theorem coercion_svelta : \forall T,S:Type.\forall f:T \to S.\forall x,y:T.x=y \to f y = f x.
   intros.
   apply ((\lambda h:f y = f x.h) H).
 qed.
+*)
 
 variant pos2nat' : ? \def pos2nat.