MAYBE

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

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