(* -------------------------------------------------------------------------- *)
-(* File : COL042-1 : TPTP v3.2.0. Released v1.0.0. *)
+(* File : COL042-1 : TPTP v3.7.0. Released v1.0.0. *)
(* Domain : Combinatory Logic *)
(* Status : Unsatisfiable *)
-(* Rating : 0.86 v3.1.0, 0.89 v2.7.0, 0.91 v2.6.0, 0.83 v2.5.0, 0.75 v2.4.0, 0.33 v2.2.1, 0.89 v2.2.0, 1.00 v2.0.0 *)
+(* Rating : 0.67 v3.4.0, 0.75 v3.3.0, 0.86 v3.1.0, 0.89 v2.7.0, 0.91 v2.6.0, 0.83 v2.5.0, 0.75 v2.4.0, 0.33 v2.2.1, 0.89 v2.2.0, 1.00 v2.0.0 *)
(* Syntax : Number of clauses : 3 ( 0 non-Horn; 3 unit; 1 RR) *)
(* -------------------------------------------------------------------------- *)
ntheorem prove_fixed_point:
- ∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
+ (∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
∀apply:∀_:Univ.∀_:Univ.Univ.
∀b:Univ.
∀f:∀_:Univ.Univ.
∀w1:Univ.
∀H0:∀X:Univ.∀Y:Univ.eq Univ (apply (apply w1 X) Y) (apply (apply Y X) X).
-∀H1:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).∃Y:Univ.eq Univ (apply Y (f Y)) (apply (f Y) (apply Y (f Y)))
+∀H1:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).∃Y:Univ.eq Univ (apply Y (f Y)) (apply (f Y) (apply Y (f Y))))
.
-#Univ.
-#X.
-#Y.
-#Z.
-#apply.
-#b.
-#f.
-#w1.
-#H0.
-#H1.
-napply ex_intro[
-nid2:
-nauto by H0,H1;
-nid|
-skip]
+#Univ ##.
+#X ##.
+#Y ##.
+#Z ##.
+#apply ##.
+#b ##.
+#f ##.
+#w1 ##.
+#H0 ##.
+#H1 ##.
+napply (ex_intro ? ? ? ?) ##[
+##2:
+nauto by H0,H1 ##;
+##| ##skip ##]
+ntry (nassumption) ##;
nqed.
(* -------------------------------------------------------------------------- *)