MAYBE

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

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