YES

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

Proof:
 DP Processor:
  DPs:
   f#(f(X)) -> f#(g(f(X)))
   f#(f(X)) -> f#(g(f(g(f(X)))))
   f#(g(f(X))) -> f#(g(X))
  TRS:
   f(f(X)) -> f(g(f(g(f(X)))))
   f(g(f(X))) -> f(g(X))
  EDG Processor:
   DPs:
    f#(f(X)) -> f#(g(f(X)))
    f#(f(X)) -> f#(g(f(g(f(X)))))
    f#(g(f(X))) -> f#(g(X))
   TRS:
    f(f(X)) -> f(g(f(g(f(X)))))
    f(g(f(X))) -> f(g(X))
   graph:
    f#(g(f(X))) -> f#(g(X)) -> f#(g(f(X))) -> f#(g(X))
    f#(f(X)) -> f#(g(f(g(f(X))))) -> f#(g(f(X))) -> f#(g(X))
    f#(f(X)) -> f#(g(f(X))) -> f#(g(f(X))) -> f#(g(X))
   SCC Processor:
    #sccs: 1
    #rules: 1
    #arcs: 3/9
    DPs:
     f#(g(f(X))) -> f#(g(X))
    TRS:
     f(f(X)) -> f(g(f(g(f(X)))))
     f(g(f(X))) -> f(g(X))
    Bounds Processor:
     bound: 0
     enrichment: match-dp
     automaton:
      final states: {1}
      transitions:
       f30() -> 2*
       f{#,0}(3) -> 1*
       g0(2) -> 3*
     problem:
      DPs:
       
      TRS:
       f(f(X)) -> f(g(f(g(f(X)))))
       f(g(f(X))) -> f(g(X))
     Qed