MAYBE

Problem:
 a__f(f(a())) -> a__f(g(f(a())))
 mark(f(X)) -> a__f(X)
 mark(a()) -> a()
 mark(g(X)) -> g(mark(X))
 a__f(X) -> f(X)

Proof:
 DP Processor:
  DPs:
   a__f#(f(a())) -> a__f#(g(f(a())))
   mark#(f(X)) -> a__f#(X)
   mark#(g(X)) -> mark#(X)
  TRS:
   a__f(f(a())) -> a__f(g(f(a())))
   mark(f(X)) -> a__f(X)
   mark(a()) -> a()
   mark(g(X)) -> g(mark(X))
   a__f(X) -> f(X)
  Usable Rule Processor:
   DPs:
    a__f#(f(a())) -> a__f#(g(f(a())))
    mark#(f(X)) -> a__f#(X)
    mark#(g(X)) -> mark#(X)
   TRS:
    
   CDG Processor:
    DPs:
     a__f#(f(a())) -> a__f#(g(f(a())))
     mark#(f(X)) -> a__f#(X)
     mark#(g(X)) -> mark#(X)
    TRS:
     
    graph:
     mark#(g(X)) -> mark#(X) -> mark#(f(X)) -> a__f#(X)
     mark#(g(X)) -> mark#(X) -> mark#(g(X)) -> mark#(X)
     mark#(f(X)) -> a__f#(X) -> a__f#(f(a())) -> a__f#(g(f(a())))
    Restore Modifier:
     DPs:
      a__f#(f(a())) -> a__f#(g(f(a())))
      mark#(f(X)) -> a__f#(X)
      mark#(g(X)) -> mark#(X)
     TRS:
      a__f(f(a())) -> a__f(g(f(a())))
      mark(f(X)) -> a__f(X)
      mark(a()) -> a()
      mark(g(X)) -> g(mark(X))
      a__f(X) -> f(X)
     SCC Processor:
      #sccs: 1
      #rules: 1
      #arcs: 3/9
      DPs:
       mark#(g(X)) -> mark#(X)
      TRS:
       a__f(f(a())) -> a__f(g(f(a())))
       mark(f(X)) -> a__f(X)
       mark(a()) -> a()
       mark(g(X)) -> g(mark(X))
       a__f(X) -> f(X)
      Open