MAYBE

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

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