MAYBE

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

Proof:
 DP Processor:
  DPs:
   f#(s(x)) -> g#(x,x)
   f#(s(x)) -> f#(g(x,x))
  TRS:
   f(s(x)) -> f(g(x,x))
   g(0(),1()) -> s(0())
   0() -> 1()
  Usable Rule Processor:
   DPs:
    f#(s(x)) -> g#(x,x)
    f#(s(x)) -> f#(g(x,x))
   TRS:
    f8(x,y) -> x
    f8(x,y) -> y
    g(0(),1()) -> s(0())
    0() -> 1()
   EDG Processor:
    DPs:
     f#(s(x)) -> g#(x,x)
     f#(s(x)) -> f#(g(x,x))
    TRS:
     f8(x,y) -> x
     f8(x,y) -> y
     g(0(),1()) -> s(0())
     0() -> 1()
    graph:
     f#(s(x)) -> f#(g(x,x)) -> f#(s(x)) -> g#(x,x)
     f#(s(x)) -> f#(g(x,x)) -> f#(s(x)) -> f#(g(x,x))
    Restore Modifier:
     DPs:
      f#(s(x)) -> g#(x,x)
      f#(s(x)) -> f#(g(x,x))
     TRS:
      f(s(x)) -> f(g(x,x))
      g(0(),1()) -> s(0())
      0() -> 1()
     SCC Processor:
      #sccs: 1
      #rules: 1
      #arcs: 2/4
      DPs:
       f#(s(x)) -> f#(g(x,x))
      TRS:
       f(s(x)) -> f(g(x,x))
       g(0(),1()) -> s(0())
       0() -> 1()
      Open