MAYBE

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

Proof:
 DP Processor:
  DPs:
   f#(f(x)) -> g#(f(x))
   g#(g(x)) -> f#(x)
  TRS:
   f(f(x)) -> g(f(x))
   g(g(x)) -> f(x)
  EDG Processor:
   DPs:
    f#(f(x)) -> g#(f(x))
    g#(g(x)) -> f#(x)
   TRS:
    f(f(x)) -> g(f(x))
    g(g(x)) -> f(x)
   graph:
    g#(g(x)) -> f#(x) -> f#(f(x)) -> g#(f(x))
    f#(f(x)) -> g#(f(x)) -> g#(g(x)) -> f#(x)
   Restore Modifier:
    DPs:
     f#(f(x)) -> g#(f(x))
     g#(g(x)) -> f#(x)
    TRS:
     f(f(x)) -> g(f(x))
     g(g(x)) -> f(x)
    SCC Processor:
     #sccs: 1
     #rules: 2
     #arcs: 2/4
     DPs:
      g#(g(x)) -> f#(x)
      f#(f(x)) -> g#(f(x))
     TRS:
      f(f(x)) -> g(f(x))
      g(g(x)) -> f(x)
     Open