(* -------------------------------------------------------------------------- *)
-(* File : BOO014-4 : TPTP v3.2.0. Released v1.1.0. *)
+(* File : BOO014-4 : TPTP v3.7.0. Released v1.1.0. *)
(* Domain : Boolean Algebra *)
(* Status : Unsatisfiable *)
-(* Rating : 0.00 v2.2.1, 0.33 v2.2.0, 0.43 v2.1.0, 0.62 v2.0.0 *)
+(* Rating : 0.11 v3.4.0, 0.12 v3.3.0, 0.00 v2.2.1, 0.33 v2.2.0, 0.43 v2.1.0, 0.62 v2.0.0 *)
(* Syntax : Number of clauses : 9 ( 0 non-Horn; 9 unit; 1 RR) *)
(* -------------------------------------------------------------------------- *)
-(* File : BOO004-0 : TPTP v3.2.0. Released v1.0.0. *)
+(* File : BOO004-0 : TPTP v3.7.0. Released v1.0.0. *)
(* Domain : Boolean Algebra *)
(* Syntax : Number of clauses : 8 ( 0 non-Horn; 8 unit; 0 RR) *)
-(* Number of literals : 8 ( 8 equality) *)
+(* Number of atoms : 8 ( 8 equality) *)
(* Maximal clause size : 1 ( 1 average) *)
(* -------------------------------------------------------------------------- *)
ntheorem prove_c_inverse_is_d:
- ∀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.
∀H4:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (multiply X (add Y Z)) (add (multiply X Y) (multiply X Z)).
∀H5:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (add X (multiply Y Z)) (multiply (add X Y) (add X Z)).
∀H6:∀X:Univ.∀Y:Univ.eq Univ (multiply X Y) (multiply Y X).
-∀H7:∀X:Univ.∀Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (inverse (add a b)) (multiply (inverse a) (inverse b))
+∀H7:∀X:Univ.∀Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (inverse (add a b)) (multiply (inverse a) (inverse b)))
.
-#Univ.
-#X.
-#Y.
-#Z.
-#a.
-#add.
-#additive_identity.
-#b.
-#inverse.
-#multiplicative_identity.
-#multiply.
-#H0.
-#H1.
-#H2.
-#H3.
-#H4.
-#H5.
-#H6.
-#H7.
-nauto by H0,H1,H2,H3,H4,H5,H6,H7;
+#Univ ##.
+#X ##.
+#Y ##.
+#Z ##.
+#a ##.
+#add ##.
+#additive_identity ##.
+#b ##.
+#inverse ##.
+#multiplicative_identity ##.
+#multiply ##.
+#H0 ##.
+#H1 ##.
+#H2 ##.
+#H3 ##.
+#H4 ##.
+#H5 ##.
+#H6 ##.
+#H7 ##.
+nauto by H0,H1,H2,H3,H4,H5,H6,H7 ##;
+ntry (nassumption) ##;
nqed.
(* -------------------------------------------------------------------------- *)