X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fcontribs%2Fng_TPTP%2FRNG014-6.ma;h=8264a26ff7f5496a14bf1937bf41e4711adfd71d;hb=bd112857523fc543c78cd29b74417585033ec464;hp=8567d448b13548caa6278d6096cb2179026e53a3;hpb=11e495dda047bcdfa4267c06cad2d074fcffe3e3;p=helm.git

diff --git a/helm/software/matita/contribs/ng_TPTP/RNG014-6.ma b/helm/software/matita/contribs/ng_TPTP/RNG014-6.ma
index 8567d448b..8264a26ff 100644
--- a/helm/software/matita/contribs/ng_TPTP/RNG014-6.ma
+++ b/helm/software/matita/contribs/ng_TPTP/RNG014-6.ma
@@ -4,7 +4,7 @@ include "logic/equality.ma".
 
 (* -------------------------------------------------------------------------- *)
 
-(*  File     : RNG014-6 : TPTP v3.2.0. Released v1.0.0. *)
+(*  File     : RNG014-6 : TPTP v3.7.0. Released v1.0.0. *)
 
 (*  Domain   : Ring Theory (Alternative) *)
 
@@ -48,7 +48,7 @@ include "logic/equality.ma".
 
 (* -------------------------------------------------------------------------- *)
 
-(*  File     : RNG003-0 : TPTP v3.2.0. Released v1.0.0. *)
+(*  File     : RNG003-0 : TPTP v3.7.0. Released v1.0.0. *)
 
 (*  Domain   : Ring Theory (Alternative) *)
 
@@ -68,7 +68,7 @@ include "logic/equality.ma".
 
 (*  Syntax   : Number of clauses    :   15 (   0 non-Horn;  15 unit;   0 RR) *)
 
-(*             Number of literals   :   15 (  15 equality) *)
+(*             Number of atoms      :   15 (  15 equality) *)
 
 (*             Maximal clause size  :    1 (   1 average) *)
 
@@ -110,7 +110,7 @@ include "logic/equality.ma".
 
 (* -------------------------------------------------------------------------- *)
 ntheorem prove_equation:
- ∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
+ (∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
 ∀a:Univ.
 ∀add:∀_:Univ.∀_:Univ.Univ.
 ∀additive_identity:Univ.
@@ -133,36 +133,37 @@ ntheorem prove_equation:
 ∀H11:∀X:Univ.eq Univ (multiply X additive_identity) additive_identity.
 ∀H12:∀X:Univ.eq Univ (multiply additive_identity X) additive_identity.
 ∀H13:∀X:Univ.eq Univ (add X additive_identity) X.
-∀H14:∀X:Univ.eq Univ (add additive_identity X) X.eq Univ (multiply a (additive_inverse b)) (additive_inverse (multiply a b))
+∀H14:∀X:Univ.eq Univ (add additive_identity X) X.eq Univ (multiply a (additive_inverse b)) (additive_inverse (multiply a b)))
 .
-#Univ.
-#X.
-#Y.
-#Z.
-#a.
-#add.
-#additive_identity.
-#additive_inverse.
-#associator.
-#b.
-#commutator.
-#multiply.
-#H0.
-#H1.
-#H2.
-#H3.
-#H4.
-#H5.
-#H6.
-#H7.
-#H8.
-#H9.
-#H10.
-#H11.
-#H12.
-#H13.
-#H14.
-nauto by H0,H1,H2,H3,H4,H5,H6,H7,H8,H9,H10,H11,H12,H13,H14;
+#Univ ##.
+#X ##.
+#Y ##.
+#Z ##.
+#a ##.
+#add ##.
+#additive_identity ##.
+#additive_inverse ##.
+#associator ##.
+#b ##.
+#commutator ##.
+#multiply ##.
+#H0 ##.
+#H1 ##.
+#H2 ##.
+#H3 ##.
+#H4 ##.
+#H5 ##.
+#H6 ##.
+#H7 ##.
+#H8 ##.
+#H9 ##.
+#H10 ##.
+#H11 ##.
+#H12 ##.
+#H13 ##.
+#H14 ##.
+nauto by H0,H1,H2,H3,H4,H5,H6,H7,H8,H9,H10,H11,H12,H13,H14 ##;
+ntry (nassumption) ##;
 nqed.
 
 (* -------------------------------------------------------------------------- *)