MAYBE

Problem:
 f(a(),y) -> f(y,g(y))
 g(a()) -> b()
 g(b()) -> b()

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