MAYBE

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

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