YES(?,O(n^1))

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

Proof:
 Bounds Processor:
  bound: 1
  enrichment: match
  automaton:
   final states: {5}
   transitions:
    g1(10) -> 5*
    f1(5) -> 10*
    f1(9) -> 10,5
    c1(8,5) -> 10*
    c1(5,8) -> 9*
    s1(5) -> 8*
    s1(8) -> 8*
    f0(5) -> 5*
    c0(5,5) -> 5*
    s0(5) -> 5*
    g0(5) -> 5*
  problem:
   
  Qed