MAYBE

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

Proof:
 DP Processor:
  DPs:
   c#() -> c#()
   c#() -> f#(g(c()))
  TRS:
   c() -> f(g(c()))
   f(g(X)) -> g(X)
  CDG Processor:
   DPs:
    c#() -> c#()
    c#() -> f#(g(c()))
   TRS:
    c() -> f(g(c()))
    f(g(X)) -> g(X)
   graph:
    c#() -> c#() -> c#() -> c#()
    c#() -> c#() -> c#() -> f#(g(c()))
   SCC Processor:
    #sccs: 1
    #rules: 1
    #arcs: 2/4
    DPs:
     c#() -> c#()
    TRS:
     c() -> f(g(c()))
     f(g(X)) -> g(X)
    Open