(* -------------------------------------------------------------------------- *)
-(* File : GRP138-1 : TPTP v3.2.0. Bugfixed v1.2.1. *)
+(* File : GRP138-1 : TPTP v3.7.0. Bugfixed v1.2.1. *)
(* Domain : Group Theory (Lattice Ordered) *)
(* Status : Unsatisfiable *)
-(* Rating : 0.00 v2.2.1, 0.33 v2.2.0, 0.43 v2.1.0, 0.43 v2.0.0 *)
+(* Rating : 0.00 v3.4.0, 0.12 v3.3.0, 0.00 v2.2.1, 0.33 v2.2.0, 0.43 v2.1.0, 0.43 v2.0.0 *)
(* Syntax : Number of clauses : 18 ( 0 non-Horn; 18 unit; 3 RR) *)
(* -------------------------------------------------------------------------- *)
-(* 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 *)
(* 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) *)
(* -------------------------------------------------------------------------- *)
-(* 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) *)
(* 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) *)
(* -------------------------------------------------------------------------- *)
ntheorem prove_ax_glb1a:
- ∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
+ (∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
∀a:Univ.
∀b:Univ.
∀c:Univ.
∀H13:∀X:Univ.∀Y:Univ.eq Univ (greatest_lower_bound X Y) (greatest_lower_bound Y X).
∀H14:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (multiply (multiply X Y) Z) (multiply X (multiply Y Z)).
∀H15:∀X:Univ.eq Univ (multiply (inverse X) X) identity.
-∀H16:∀X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound (greatest_lower_bound a b) c) (greatest_lower_bound a b)
+∀H16:∀X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound (greatest_lower_bound a b) c) (greatest_lower_bound a b))
.
-#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.
-#H15.
-#H16.
-nauto by H0,H1,H2,H3,H4,H5,H6,H7,H8,H9,H10,H11,H12,H13,H14,H15,H16;
+#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 ##.
+#H15 ##.
+#H16 ##.
+nauto by H0,H1,H2,H3,H4,H5,H6,H7,H8,H9,H10,H11,H12,H13,H14,H15,H16 ##;
+ntry (nassumption) ##;
nqed.
(* -------------------------------------------------------------------------- *)