X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fcontribs%2Fng_TPTP%2FROB027-1.ma;h=518b5b8833fe3456d2ace6471262959740e4bf94;hb=e880d6eab5e1700f4a625ddcd7d0fa8f0cce2dcc;hp=efba01858c85e44dfb84b590bf8568f2dbe54038;hpb=11e495dda047bcdfa4267c06cad2d074fcffe3e3;p=helm.git

diff --git a/helm/software/matita/contribs/ng_TPTP/ROB027-1.ma b/helm/software/matita/contribs/ng_TPTP/ROB027-1.ma
index efba01858..518b5b883 100644
--- a/helm/software/matita/contribs/ng_TPTP/ROB027-1.ma
+++ b/helm/software/matita/contribs/ng_TPTP/ROB027-1.ma
@@ -4,7 +4,7 @@ include "logic/equality.ma".
 
 (* -------------------------------------------------------------------------- *)
 
-(*  File     : ROB027-1 : TPTP v3.2.0. Released v1.2.0. *)
+(*  File     : ROB027-1 : TPTP v3.7.0. Released v1.2.0. *)
 
 (*  Domain   : Robbins Algebra *)
 
@@ -58,7 +58,7 @@ include "logic/equality.ma".
 
 (* -------------------------------------------------------------------------- *)
 
-(*  File     : ROB001-0 : TPTP v3.2.0. Released v1.0.0. *)
+(*  File     : ROB001-0 : TPTP v3.7.0. Released v1.0.0. *)
 
 (*  Domain   : Robbins algebra *)
 
@@ -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) *)
 
@@ -100,7 +100,7 @@ include "logic/equality.ma".
 
 (* -------------------------------------------------------------------------- *)
 ntheorem prove_huntingtons_axiom:
- ∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
+ (∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
 ∀a:Univ.
 ∀add:∀_:Univ.∀_:Univ.Univ.
 ∀b:Univ.
@@ -109,22 +109,23 @@ ntheorem prove_huntingtons_axiom:
 ∀H0:eq Univ (negate (negate c)) c.
 ∀H1:∀X:Univ.∀Y:Univ.eq Univ (negate (add (negate (add X Y)) (negate (add X (negate Y))))) X.
 ∀H2:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (add (add X Y) Z) (add X (add Y Z)).
-∀H3:∀X:Univ.∀Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (add (negate (add a (negate b))) (negate (add (negate a) (negate b)))) b
+∀H3:∀X:Univ.∀Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (add (negate (add a (negate b))) (negate (add (negate a) (negate b)))) b)
 .
-#Univ.
-#X.
-#Y.
-#Z.
-#a.
-#add.
-#b.
-#c.
-#negate.
-#H0.
-#H1.
-#H2.
-#H3.
-nauto by H0,H1,H2,H3;
+#Univ ##.
+#X ##.
+#Y ##.
+#Z ##.
+#a ##.
+#add ##.
+#b ##.
+#c ##.
+#negate ##.
+#H0 ##.
+#H1 ##.
+#H2 ##.
+#H3 ##.
+nauto by H0,H1,H2,H3 ##;
+ntry (nassumption) ##;
 nqed.
 
 (* -------------------------------------------------------------------------- *)