...

[helm.git] / helm / software / matita / contribs / ng_TPTP / ROB023-1.ma

diff --git a/helm/software/matita/contribs/ng_TPTP/ROB023-1.ma b/helm/software/matita/contribs/ng_TPTP/ROB023-1.ma
index 03691189e01321ee3d090243d72eb6a113a208d9..80809dc923a231c270ba93b34ee6ad15e384ab22 100644 (file)
--- a/helm/software/matita/contribs/ng_TPTP/ROB023-1.ma
+++ b/helm/software/matita/contribs/ng_TPTP/ROB023-1.ma
@@ -4,7 +4,7 @@ include "logic/equality.ma".
 
 (* -------------------------------------------------------------------------- *)
 
-(*  File     : ROB023-1 : TPTP v3.2.0. Released v1.0.0. *)
+(*  File     : ROB023-1 : TPTP v3.7.0. Released v1.0.0. *)
 
 (*  Domain   : Robbins Algebra *)
 
@@ -28,7 +28,7 @@ include "logic/equality.ma".
 
 (*  Status   : Unsatisfiable *)
 
-(*  Rating   : 0.00 v2.2.1, 0.44 v2.2.0, 0.43 v2.1.0, 0.38 v2.0.0 *)
+(*  Rating   : 0.11 v3.4.0, 0.12 v3.3.0, 0.00 v2.2.1, 0.44 v2.2.0, 0.43 v2.1.0, 0.38 v2.0.0 *)
 
 (*  Syntax   : Number of clauses     :    5 (   0 non-Horn;   5 unit;   1 RR) *)
 
@@ -56,7 +56,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 *)
 
@@ -78,7 +78,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) *)
 
@@ -98,7 +98,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.
@@ -106,21 +106,22 @@ ntheorem prove_huntingtons_axiom:
 ∀H0:∀X:Univ.eq Univ (add X X) X.
 ∀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.
-#negate.
-#H0.
-#H1.
-#H2.
-#H3.
-nauto by H0,H1,H2,H3;
+#Univ ##.
+#X ##.
+#Y ##.
+#Z ##.
+#a ##.
+#add ##.
+#b ##.
+#negate ##.
+#H0 ##.
+#H1 ##.
+#H2 ##.
+#H3 ##.
+nauto by H0,H1,H2,H3 ##;
+ntry (nassumption) ##;
 nqed.
 
 (* -------------------------------------------------------------------------- *)