MAYBE

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

Proof:
 DP Processor:
  DPs:
   f#(x,f(a(),a())) -> f#(f(a(),a()),a())
   f#(x,f(a(),a())) -> f#(f(f(a(),a()),a()),a())
   f#(x,f(a(),a())) -> f#(f(f(f(a(),a()),a()),a()),x)
  TRS:
   f(x,f(a(),a())) -> f(f(f(f(a(),a()),a()),a()),x)
  Usable Rule Processor:
   DPs:
    f#(x,f(a(),a())) -> f#(f(a(),a()),a())
    f#(x,f(a(),a())) -> f#(f(f(a(),a()),a()),a())
    f#(x,f(a(),a())) -> f#(f(f(f(a(),a()),a()),a()),x)
   TRS:
    
   ADG Processor:
    DPs:
     f#(x,f(a(),a())) -> f#(f(a(),a()),a())
     f#(x,f(a(),a())) -> f#(f(f(a(),a()),a()),a())
     f#(x,f(a(),a())) -> f#(f(f(f(a(),a()),a()),a()),x)
    TRS:
     
    graph:
     f#(x,f(a(),a())) -> f#(f(f(f(a(),a()),a()),a()),x) ->
     f#(x,f(a(),a())) -> f#(f(a(),a()),a())
     f#(x,f(a(),a())) -> f#(f(f(f(a(),a()),a()),a()),x) ->
     f#(x,f(a(),a())) -> f#(f(f(a(),a()),a()),a())
     f#(x,f(a(),a())) -> f#(f(f(f(a(),a()),a()),a()),x) ->
     f#(x,f(a(),a())) -> f#(f(f(f(a(),a()),a()),a()),x)
    Restore Modifier:
     DPs:
      f#(x,f(a(),a())) -> f#(f(a(),a()),a())
      f#(x,f(a(),a())) -> f#(f(f(a(),a()),a()),a())
      f#(x,f(a(),a())) -> f#(f(f(f(a(),a()),a()),a()),x)
     TRS:
      f(x,f(a(),a())) -> f(f(f(f(a(),a()),a()),a()),x)
     SCC Processor:
      #sccs: 1
      #rules: 1
      #arcs: 3/9
      DPs:
       f#(x,f(a(),a())) -> f#(f(f(f(a(),a()),a()),a()),x)
      TRS:
       f(x,f(a(),a())) -> f(f(f(f(a(),a()),a()),a()),x)
      Open