new function list_mapi_acc

[helm.git] / helm / software / matita / contribs / ng_TPTP / GRP164-2.ma

diff --git a/helm/software/matita/contribs/ng_TPTP/GRP164-2.ma b/helm/software/matita/contribs/ng_TPTP/GRP164-2.ma
index 40c0aed3d1a26d7e7078a04afbd5fbce6c999d5e..1fd78a85cbc359ad0311d8d34fac5a200468cd16 100644 (file)
--- a/helm/software/matita/contribs/ng_TPTP/GRP164-2.ma
+++ b/helm/software/matita/contribs/ng_TPTP/GRP164-2.ma
@@ -4,7 +4,7 @@ include "logic/equality.ma".
 
 (* -------------------------------------------------------------------------- *)
 
-(*  File     : GRP164-2 : TPTP v3.2.0. Bugfixed v1.2.1. *)
+(*  File     : GRP164-2 : TPTP v3.7.0. Bugfixed v1.2.1. *)
 
 (*  Domain   : Group Theory (Lattice Ordered) *)
 
@@ -26,7 +26,7 @@ include "logic/equality.ma".
 
 (*  Status   : Unsatisfiable *)
 
-(*  Rating   : 0.93 v3.1.0, 0.89 v2.7.0, 0.91 v2.6.0, 0.83 v2.5.0, 0.75 v2.4.0, 0.67 v2.2.1, 1.00 v2.0.0 *)
+(*  Rating   : 0.89 v3.4.0, 0.88 v3.3.0, 0.93 v3.1.0, 0.89 v2.7.0, 0.91 v2.6.0, 0.83 v2.5.0, 0.75 v2.4.0, 0.67 v2.2.1, 1.00 v2.0.0 *)
 
 (*  Syntax   : Number of clauses     :   16 (   0 non-Horn;  16 unit;   1 RR) *)
 
@@ -56,7 +56,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 *)
 
@@ -80,7 +80,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) *)
 
@@ -122,7 +122,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) *)
 
@@ -144,7 +144,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) *)
 
@@ -168,7 +168,7 @@ include "logic/equality.ma".
 
 (* -------------------------------------------------------------------------- *)
 ntheorem prove_distrun:
- ∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
+ (∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
 ∀a:Univ.
 ∀b:Univ.
 ∀c:Univ.
@@ -191,36 +191,37 @@ ntheorem prove_distrun:
 ∀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 (greatest_lower_bound a (least_upper_bound b c)) (least_upper_bound (greatest_lower_bound a b) (greatest_lower_bound a c))
+∀H14:∀X:Univ.eq Univ (multiply identity X) X.eq Univ (greatest_lower_bound a (least_upper_bound b c)) (least_upper_bound (greatest_lower_bound a b) (greatest_lower_bound a c)))
 .
-#Univ.
-#X.
-#Y.
-#Z.
-#a.
-#b.
-#c.
-#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 ##.
+#b ##.
+#c ##.
+#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.
 
 (* -------------------------------------------------------------------------- *)