X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fcontribs%2Fng_TPTP%2FGRP182-1.ma;h=6d0dded5f821866f77dfb3119a62b6dc8fac2e4e;hb=34cdd4af2d7bdac3bab74a54123fbfcb02fa0403;hp=8d0029e3f3ec708b8d28db8bc5feba4dad8eb9d5;hpb=11e495dda047bcdfa4267c06cad2d074fcffe3e3;p=helm.git

diff --git a/helm/software/matita/contribs/ng_TPTP/GRP182-1.ma b/helm/software/matita/contribs/ng_TPTP/GRP182-1.ma
index 8d0029e3f..6d0dded5f 100644
--- a/helm/software/matita/contribs/ng_TPTP/GRP182-1.ma
+++ b/helm/software/matita/contribs/ng_TPTP/GRP182-1.ma
@@ -4,7 +4,7 @@ include "logic/equality.ma".
 
 (* -------------------------------------------------------------------------- *)
 
-(*  File     : GRP182-1 : TPTP v3.2.0. Bugfixed v1.2.1. *)
+(*  File     : GRP182-1 : TPTP v3.7.0. Bugfixed v1.2.1. *)
 
 (*  Domain   : Group Theory (Lattice Ordered) *)
 
@@ -68,7 +68,7 @@ include "logic/equality.ma".
 
 (* -------------------------------------------------------------------------- *)
 
-(*  File     : GRP004-0 : TPTP v3.2.0. Released v1.0.0. *)
+(*  File     : GRP004-0 : TPTP v3.7.0. Released v1.0.0. *)
 
 (*  Domain   : Group Theory *)
 
@@ -92,7 +92,7 @@ include "logic/equality.ma".
 
 (*  Syntax   : Number of clauses    :    3 (   0 non-Horn;   3 unit;   0 RR) *)
 
-(*             Number of literals   :    3 (   3 equality) *)
+(*             Number of atoms      :    3 (   3 equality) *)
 
 (*             Maximal clause size  :    1 (   1 average) *)
 
@@ -134,7 +134,7 @@ include "logic/equality.ma".
 
 (* -------------------------------------------------------------------------- *)
 
-(*  File     : GRP004-2 : TPTP v3.2.0. Bugfixed v1.2.0. *)
+(*  File     : GRP004-2 : TPTP v3.7.0. Bugfixed v1.2.0. *)
 
 (*  Domain   : Group Theory (Lattice Ordered) *)
 
@@ -156,7 +156,7 @@ include "logic/equality.ma".
 
 (*  Syntax   : Number of clauses    :   12 (   0 non-Horn;  12 unit;   0 RR) *)
 
-(*             Number of literals   :   12 (  12 equality) *)
+(*             Number of atoms      :   12 (  12 equality) *)
 
 (*             Maximal clause size  :    1 (   1 average) *)
 
@@ -190,7 +190,7 @@ include "logic/equality.ma".
 
 (* ----This is Dahn's clause *)
 ntheorem prove_p17a:
- ∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
+ (∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
 ∀a:Univ.
 ∀greatest_lower_bound:∀_:Univ.∀_:Univ.Univ.
 ∀identity:Univ.
@@ -211,34 +211,35 @@ ntheorem prove_p17a:
 ∀H11:∀X:Univ.∀Y:Univ.eq Univ (greatest_lower_bound X Y) (greatest_lower_bound Y X).
 ∀H12:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (multiply (multiply X Y) Z) (multiply X (multiply Y Z)).
 ∀H13:∀X:Univ.eq Univ (multiply (inverse X) X) identity.
-∀H14:∀X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound identity (greatest_lower_bound a identity)) identity
+∀H14:∀X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound identity (greatest_lower_bound a identity)) identity)
 .
-#Univ.
-#X.
-#Y.
-#Z.
-#a.
-#greatest_lower_bound.
-#identity.
-#inverse.
-#least_upper_bound.
-#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 ##.
+#greatest_lower_bound ##.
+#identity ##.
+#inverse ##.
+#least_upper_bound ##.
+#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.
 
 (* -------------------------------------------------------------------------- *)