YES(?,O(n^1))

Problem:
 f(c(X,s(Y))) -> f(c(s(X),Y))
 g(c(s(X),Y)) -> f(c(X,s(Y)))

Proof:
 Bounds Processor:
  bound: 2
  enrichment: match
  automaton:
   final states: {4,3}
   transitions:
    f1(9) -> 4*
    f1(8) -> 3*
    c1(7,1) -> 8*
    c1(2,7) -> 9*
    c1(1,7) -> 9*
    c1(7,2) -> 8*
    s1(7) -> 7*
    s1(2) -> 7*
    s1(1) -> 7*
    s1(13) -> 13*
    f2(14) -> 4*
    c2(13,1) -> 14*
    c2(13,7) -> 14*
    c2(13,2) -> 14*
    f0(2) -> 3*
    f0(1) -> 3*
    s2(2) -> 13*
    s2(1) -> 13*
    s2(13) -> 13*
    c0(1,2) -> 1*
    c0(2,1) -> 1*
    c0(1,1) -> 1*
    c0(2,2) -> 1*
    s0(2) -> 2*
    s0(1) -> 2*
    g0(2) -> 4*
    g0(1) -> 4*
  problem:
   
  Qed