YES

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

Proof:
 Uncurry Processor (mirror):
  a2(a(),x) -> f(f(x,a1(a1(a()))),a())
  f(a1(x4),x5) -> a2(x4,x5)
  f(a(),x5) -> a1(x5)
  Bounds Processor:
   bound: 2
   enrichment: match
   automaton:
    final states: {5}
    transitions:
     a{1,0}(5) -> 5*
     a{1,1}(10) -> 11*
     a{1,1}(5) -> 5*
     a{1,1}(12) -> 13*
     a{1,1}(11) -> 12*
     a{2,1}(5,5) -> 5*
     f1(14,10) -> 13*
     f1(13,10) -> 5*
     f1(5,12) -> 13*
     f1(12,12) -> 14*
     a1() -> 10*
     a{2,2}(11,12) -> 14*
     a{2,2}(5,12) -> 13*
     a{2,2}(12,10) -> 5*
     a{2,0}(5,5) -> 5*
     a0() -> 5*
     f0(5,5) -> 5*
   problem:
    
   Qed