YES

1 decompositions
 #1 -----------
   1: p(x1) -> q(x1)
   2: p(x2) -> r(x2)
   3: q(x3) -> s(p(x3))
   4: r(x4) -> s(p(x4))
   5: s(x5) -> f(p(x5))

@Development Closedness
--- R
   1: p(x1) -> q(x1)
   2: p(x2) -> r(x2)
   3: q(x3) -> s(p(x3))
   4: r(x4) -> s(p(x4))
   5: s(x5) -> f(p(x5))

--- S
   1: p(x1) -> q(x1)
   2: p(x2) -> r(x2)
   3: q(x3) -> s(p(x3))
   4: r(x4) -> s(p(x4))
   5: s(x5) -> f(p(x5))