2 include "logic/equality.ma".
3 (* Inclusion of: COL008-1.p *)
4 (* -------------------------------------------------------------------------- *)
5 (* File : COL008-1 : TPTP v3.1.1. Released v1.0.0. *)
6 (* Domain : Combinatory Logic *)
7 (* Problem : Weak fixed point for M and B *)
8 (* Version : [WM88] (equality) axioms. *)
9 (* English : The weak fixed point property holds for the set P consisting *)
10 (* of the combinators M and B, where ((Bx)y)z = x(yz), Mx = xx. *)
11 (* Refs : [Smu85] Smullyan (1978), To Mock a Mocking Bird and Other Logi *)
12 (* : [MW87] McCune & Wos (1987), A Case Study in Automated Theorem *)
13 (* : [WM88] Wos & McCune (1988), Challenge Problems Focusing on Eq *)
14 (* : [MW88] McCune & Wos (1988), Some Fixed Point Problems in Comb *)
15 (* : [Wos93] Wos (1993), The Kernel Strategy and Its Use for the St *)
17 (* Names : - [MW88] *)
18 (* : Question 13 [Wos93] *)
19 (* Status : Unsatisfiable *)
20 (* Rating : 0.00 v2.0.0 *)
21 (* Syntax : Number of clauses : 3 ( 0 non-Horn; 3 unit; 1 RR) *)
22 (* Number of atoms : 3 ( 3 equality) *)
23 (* Maximal clause size : 1 ( 1 average) *)
24 (* Number of predicates : 1 ( 0 propositional; 2-2 arity) *)
25 (* Number of functors : 4 ( 3 constant; 0-2 arity) *)
26 (* Number of variables : 5 ( 0 singleton) *)
27 (* Maximal term depth : 4 ( 2 average) *)
29 (* -------------------------------------------------------------------------- *)
30 theorem prove_fixed_point:
32 \forall apply:\forall _:Univ.\forall _:Univ.Univ.
34 \forall combinator:Univ.
36 \forall H0:\forall X:Univ.eq Univ (apply m X) (apply X X).
37 \forall H1:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).\exist Y:Univ.eq Univ Y (apply combinator Y)
42 autobatch paramodulation timeout=100;
48 (* -------------------------------------------------------------------------- *)