YES(?,O(n^1))

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

Proof:
 Matrix Interpretation Processor:
  dimension: 1
  interpretation:
   [b] = 4,
   
   [g](x0, x1) = x0 + x1 + 11,
   
   [f](x0, x1) = x0 + x1 + 12,
   
   [a] = 19
  orientation:
   f(a(),x) = x + 31 >= x + 30 = g(a(),x)
   
   g(a(),x) = x + 30 >= x + 16 = f(b(),x)
   
   f(a(),x) = x + 31 >= x + 16 = f(b(),x)
  problem:
   
  Qed