MAYBE

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

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