(* -------------------------------------------------------------------------- *)
-(* File : RNG007-4 : TPTP v3.2.0. Released v1.0.0. *)
+(* File : RNG007-4 : TPTP v3.7.0. Released v1.0.0. *)
(* Domain : Ring Theory *)
(* -------------------------------------------------------------------------- *)
-(* File : RNG002-0 : TPTP v3.2.0. Released v1.0.0. *)
+(* File : RNG002-0 : TPTP v3.7.0. Released v1.0.0. *)
(* Domain : Ring Theory *)
(* Syntax : Number of clauses : 14 ( 0 non-Horn; 14 unit; 1 RR) *)
-(* Number of literals : 14 ( 14 equality) *)
+(* Number of atoms : 14 ( 14 equality) *)
(* Maximal clause size : 1 ( 1 average) *)
(* -------------------------------------------------------------------------- *)
ntheorem prove_inverse:
- ∀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.
∀H11:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (multiply (add X Y) Z) (add (multiply X Z) (multiply Y Z)).
∀H12:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (multiply X (add Y Z)) (add (multiply X Y) (multiply X Z)).
∀H13:∀X:Univ.eq Univ (add (additive_inverse X) X) additive_identity.
-∀H14:∀X:Univ.eq Univ (add additive_identity X) X.eq Univ (add a a) additive_identity
+∀H14:∀X:Univ.eq Univ (add additive_identity X) X.eq Univ (add a a) additive_identity)
.
-#Univ.
-#X.
-#Y.
-#Z.
-#a.
-#add.
-#additive_identity.
-#additive_inverse.
-#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 ##.
+#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.
(* -------------------------------------------------------------------------- *)