MAYBE

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

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