YES(?,O(n^1))

Problem:
 g(c(x,s(y))) -> g(c(s(x),y))
 f(c(s(x),y)) -> f(c(x,s(y)))
 f(f(x)) -> f(d(f(x)))
 f(x) -> x

Proof:
 Bounds Processor:
  bound: 1
  enrichment: match
  automaton:
   final states: {5,4}
   transitions:
    f1(11) -> 5*
    c1(6,2) -> 7*
    c1(1,6) -> 11*
    c1(3,6) -> 11*
    c1(6,1) -> 7*
    c1(6,3) -> 7*
    c1(2,6) -> 11*
    s1(2) -> 6*
    s1(6) -> 6*
    s1(1) -> 6*
    s1(3) -> 6*
    g1(7) -> 4*
    g0(2) -> 4*
    g0(1) -> 4*
    g0(3) -> 4*
    c0(3,1) -> 1*
    c0(3,3) -> 1*
    c0(1,2) -> 1*
    c0(2,1) -> 1*
    c0(2,3) -> 1*
    c0(3,2) -> 1*
    c0(1,1) -> 1*
    c0(1,3) -> 1*
    c0(2,2) -> 1*
    s0(2) -> 2*
    s0(1) -> 2*
    s0(3) -> 2*
    f0(2) -> 5*
    f0(1) -> 5*
    f0(3) -> 5*
    d0(2) -> 3*
    d0(1) -> 3*
    d0(3) -> 3*
    1 -> 5*
    2 -> 5*
    3 -> 5*
    11 -> 5*
  problem:
   
  Qed