--- /dev/null
+include "logic/equality.ma".
+
+(* Inclusion of: COL064-1.p *)
+
+(* -------------------------------------------------------------------------- *)
+
+(* File : COL064-1 : TPTP v3.2.0. Released v1.0.0. *)
+
+(* Domain : Combinatory Logic *)
+
+(* Problem : Find combinator equivalent to V from B and T *)
+
+(* Version : [WM88] (equality) axioms. *)
+
+(* English : Construct from B and T alone a combinator that behaves as the *)
+
+(* combinator V does, where ((Bx)y)z = x(yz), (Tx)y = yx, *)
+
+(* ((Vx)y)z = (zx)y. *)
+
+(* Refs : [WM88] Wos & McCune (1988), Challenge Problems Focusing on Eq *)
+
+(* : [WW+90] Wos et al. (1990), Automated Reasoning Contributes to *)
+
+(* Source : [WW+90] *)
+
+(* Names : CL-5 [WW+90] *)
+
+(* Status : Unsatisfiable *)
+
+(* Rating : 0.64 v3.1.0, 0.44 v2.7.0, 0.45 v2.6.0, 0.17 v2.5.0, 0.00 v2.4.0, 0.00 v2.2.1, 0.78 v2.2.0, 0.86 v2.1.0, 1.00 v2.0.0 *)
+
+(* Syntax : Number of clauses : 3 ( 0 non-Horn; 3 unit; 1 RR) *)
+
+(* Number of atoms : 3 ( 3 equality) *)
+
+(* Maximal clause size : 1 ( 1 average) *)
+
+(* Number of predicates : 1 ( 0 propositional; 2-2 arity) *)
+
+(* Number of functors : 6 ( 2 constant; 0-2 arity) *)
+
+(* Number of variables : 6 ( 0 singleton) *)
+
+(* Maximal term depth : 5 ( 4 average) *)
+
+(* Comments : *)
+
+(* -------------------------------------------------------------------------- *)
+ntheorem prove_v_combinator:
+ ∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
+∀apply:∀_:Univ.∀_:Univ.Univ.
+∀b:Univ.
+∀f:∀_:Univ.Univ.
+∀g:∀_:Univ.Univ.
+∀h:∀_:Univ.Univ.
+∀t:Univ.
+∀H0:∀X:Univ.∀Y:Univ.eq Univ (apply (apply t X) Y) (apply Y X).
+∀H1:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).∃X:Univ.eq Univ (apply (apply (apply X (f X)) (g X)) (h X)) (apply (apply (h X) (f X)) (g X))
+.
+#Univ.
+#X.
+#Y.
+#Z.
+#apply.
+#b.
+#f.
+#g.
+#h.
+#t.
+#H0.
+#H1.
+napply ex_intro[
+nid2:
+nauto by H0,H1;
+nid|
+skip]
+nqed.
+
+(* -------------------------------------------------------------------------- *)