MAYBE

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

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