YES(?,O(n^1))

Problem:
 g(x,a(),b()) -> g(b(),b(),a())

Proof:
 Bounds Processor:
  bound: 1
  enrichment: match
  automaton:
   final states: {3}
   transitions:
    g1(5,5,4) -> 3*
    b1() -> 5*
    a1() -> 4*
    g0(1,1,1) -> 3*
    g0(2,2,1) -> 3*
    g0(1,1,2) -> 3*
    g0(2,2,2) -> 3*
    g0(1,2,1) -> 3*
    g0(2,1,1) -> 3*
    g0(1,2,2) -> 3*
    g0(2,1,2) -> 3*
    a0() -> 1*
    b0() -> 2*
  problem:
   
  Qed