#-------------------------------------------------------------------------- # File : COL044-2 : TPTP v2.1.0. Released v1.2.0. # Domain : Combinatory Logic # Problem : Strong fixed point for B and N # Version : [WM88] (equality) axioms : Augmented > Special. # Theorem formulation : The fixed point is provided and checked. # English : The strong fixed point property holds for the set # P consisting of the combinators B and N, where ((Bx)y)z # = x(yz), ((Nx)y)z = ((xz)y)z. # Refs : [WM88] Wos & McCune (1988), Challenge Problems Focusing on Eq # : [Wos93] Wos (1993), The Kernel Strategy and Its Use for the St # Source : [TPTP] # Names : # Status : unknown # Rating : 1.00 v2.0.0 # Syntax : Number of clauses : 4 ( 0 non-Horn; 3 unit; 2 RR) # Number of literals : 5 ( 3 equality) # Maximal clause size : 2 ( 1 average) # Number of predicates : 2 ( 0 propositional; 1-2 arity) # Number of functors : 4 ( 3 constant; 0-2 arity) # Number of variables : 7 ( 0 singleton) # Maximal term depth : 12 ( 4 average) # Comments : fixed_point/1 substitution axioms are not included as it is # simply a way of introducing the required copies of the strong # fixed point. # : tptp2X -f setheo:sign -t rm_equality:rstfp COL044-2.p #-------------------------------------------------------------------------- # b_definition, axiom. equal(apply(apply(apply(b, X), Y), Z), apply(X, apply(Y, Z))) <- . # n_definition, axiom. equal(apply(apply(apply(n, X), Y), Z), apply(apply(apply(X, Z), Y), Z)) <- . # strong_fixed_point, axiom. fixed_point(Strong_fixed_point) <- equal(apply(Strong_fixed_point, fixed_pt), apply(fixed_pt, apply(Strong_fixed_point, fixed_pt))). # prove_strong_fixed_point, conjecture. <- fixed_point(apply(apply(b, apply(apply(b, apply(apply(n, apply(apply(b, b), apply(apply(n, apply(apply(b, b), n)), n))), n)), b)), b)). #--------------------------------------------------------------------------