MAYBE

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

Proof:
 DP Processor:
  DPs:
   f#(a(),f(a(),x)) -> f#(a(),a())
   f#(a(),f(a(),x)) -> f#(f(a(),a()),a())
   f#(a(),f(a(),x)) -> f#(a(),f(f(a(),a()),a()))
   f#(a(),f(a(),x)) -> f#(x,f(a(),f(f(a(),a()),a())))
  TRS:
   f(a(),f(a(),x)) -> f(x,f(a(),f(f(a(),a()),a())))
  Usable Rule Processor:
   DPs:
    f#(a(),f(a(),x)) -> f#(a(),a())
    f#(a(),f(a(),x)) -> f#(f(a(),a()),a())
    f#(a(),f(a(),x)) -> f#(a(),f(f(a(),a()),a()))
    f#(a(),f(a(),x)) -> f#(x,f(a(),f(f(a(),a()),a())))
   TRS:
    
   Restore Modifier:
    DPs:
     f#(a(),f(a(),x)) -> f#(a(),a())
     f#(a(),f(a(),x)) -> f#(f(a(),a()),a())
     f#(a(),f(a(),x)) -> f#(a(),f(f(a(),a()),a()))
     f#(a(),f(a(),x)) -> f#(x,f(a(),f(f(a(),a()),a())))
    TRS:
     f(a(),f(a(),x)) -> f(x,f(a(),f(f(a(),a()),a())))
    SCC Processor:
     #sccs: 1
     #rules: 4
     #arcs: 16/16
     DPs:
      f#(a(),f(a(),x)) -> f#(a(),a())
      f#(a(),f(a(),x)) -> f#(f(a(),a()),a())
      f#(a(),f(a(),x)) -> f#(a(),f(f(a(),a()),a()))
      f#(a(),f(a(),x)) -> f#(x,f(a(),f(f(a(),a()),a())))
     TRS:
      f(a(),f(a(),x)) -> f(x,f(a(),f(f(a(),a()),a())))
     Matrix Interpretation Processor:
      dimension: 1
      interpretation:
       [f#](x0, x1) = x1,
       
       [f](x0, x1) = 1,
       
       [a] = 0
      orientation:
       f#(a(),f(a(),x)) = 1 >= 0 = f#(a(),a())
       
       f#(a(),f(a(),x)) = 1 >= 0 = f#(f(a(),a()),a())
       
       f#(a(),f(a(),x)) = 1 >= 1 = f#(a(),f(f(a(),a()),a()))
       
       f#(a(),f(a(),x)) = 1 >= 1 = f#(x,f(a(),f(f(a(),a()),a())))
       
       f(a(),f(a(),x)) = 1 >= 1 = f(x,f(a(),f(f(a(),a()),a())))
      problem:
       DPs:
        f#(a(),f(a(),x)) -> f#(a(),f(f(a(),a()),a()))
        f#(a(),f(a(),x)) -> f#(x,f(a(),f(f(a(),a()),a())))
       TRS:
        f(a(),f(a(),x)) -> f(x,f(a(),f(f(a(),a()),a())))
      Open