(* -------------------------------------------------------------------------- *)
-(* File : COL004-3 : TPTP v3.2.0. Released v1.0.0. *)
+(* File : COL004-3 : TPTP v3.7.0. Released v1.0.0. *)
(* Domain : Combinatory Logic *)
(* Status : Unsatisfiable *)
-(* Rating : 0.21 v3.1.0, 0.22 v2.7.0, 0.27 v2.6.0, 0.17 v2.5.0, 0.00 v2.2.1, 0.22 v2.2.0, 0.29 v2.1.0, 0.38 v2.0.0 *)
+(* Rating : 0.33 v3.4.0, 0.38 v3.3.0, 0.21 v3.1.0, 0.22 v2.7.0, 0.27 v2.6.0, 0.17 v2.5.0, 0.00 v2.2.1, 0.22 v2.2.0, 0.29 v2.1.0, 0.38 v2.0.0 *)
(* Syntax : Number of clauses : 3 ( 0 non-Horn; 3 unit; 1 RR) *)
(* ----This is the U equivalent *)
ntheorem prove_u_combinator:
- ∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
+ (∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
∀apply:∀_:Univ.∀_:Univ.Univ.
∀k:Univ.
∀s:Univ.
∀x:Univ.
∀y:Univ.
∀H0:∀X:Univ.∀Y:Univ.eq Univ (apply (apply k X) Y) X.
-∀H1:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (apply (apply (apply s X) Y) Z) (apply (apply X Z) (apply Y Z)).eq Univ (apply (apply (apply (apply s (apply k (apply s (apply (apply s k) k)))) (apply (apply s (apply (apply s k) k)) (apply (apply s k) k))) x) y) (apply y (apply (apply x x) y))
+∀H1:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (apply (apply (apply s X) Y) Z) (apply (apply X Z) (apply Y Z)).eq Univ (apply (apply (apply (apply s (apply k (apply s (apply (apply s k) k)))) (apply (apply s (apply (apply s k) k)) (apply (apply s k) k))) x) y) (apply y (apply (apply x x) y)))
.
-#Univ.
-#X.
-#Y.
-#Z.
-#apply.
-#k.
-#s.
-#x.
-#y.
-#H0.
-#H1.
-nauto by H0,H1;
+#Univ ##.
+#X ##.
+#Y ##.
+#Z ##.
+#apply ##.
+#k ##.
+#s ##.
+#x ##.
+#y ##.
+#H0 ##.
+#H1 ##.
+nauto by H0,H1 ##;
+ntry (nassumption) ##;
nqed.
(* -------------------------------------------------------------------------- *)