MAYBE

Problem:
 f(g(X)) -> f(X)

Proof:
 DP Processor:
  DPs:
   f#(g(X)) -> f#(X)
  TRS:
   f(g(X)) -> f(X)
  Usable Rule Processor:
   DPs:
    f#(g(X)) -> f#(X)
   TRS:
    
   Restore Modifier:
    DPs:
     f#(g(X)) -> f#(X)
    TRS:
     f(g(X)) -> f(X)
    SCC Processor:
     #sccs: 1
     #rules: 1
     #arcs: 1/1
     DPs:
      f#(g(X)) -> f#(X)
     TRS:
      f(g(X)) -> f(X)
     Open