MAYBE

Problem:
 f(x,y) -> g(x,y)
 g(h(x),y) -> h(f(x,y))
 g(h(x),y) -> h(g(x,y))

Proof:
 DP Processor:
  DPs:
   f#(x,y) -> g#(x,y)
   g#(h(x),y) -> f#(x,y)
   g#(h(x),y) -> g#(x,y)
  TRS:
   f(x,y) -> g(x,y)
   g(h(x),y) -> h(f(x,y))
   g(h(x),y) -> h(g(x,y))
  Usable Rule Processor:
   DPs:
    f#(x,y) -> g#(x,y)
    g#(h(x),y) -> f#(x,y)
    g#(h(x),y) -> g#(x,y)
   TRS:
    
   ADG Processor:
    DPs:
     f#(x,y) -> g#(x,y)
     g#(h(x),y) -> f#(x,y)
     g#(h(x),y) -> g#(x,y)
    TRS:
     
    graph:
     g#(h(x),y) -> g#(x,y) -> g#(h(x),y) -> f#(x,y)
     g#(h(x),y) -> g#(x,y) -> g#(h(x),y) -> g#(x,y)
     g#(h(x),y) -> f#(x,y) -> f#(x,y) -> g#(x,y)
     f#(x,y) -> g#(x,y) -> g#(h(x),y) -> f#(x,y)
     f#(x,y) -> g#(x,y) -> g#(h(x),y) -> g#(x,y)
    Restore Modifier:
     DPs:
      f#(x,y) -> g#(x,y)
      g#(h(x),y) -> f#(x,y)
      g#(h(x),y) -> g#(x,y)
     TRS:
      f(x,y) -> g(x,y)
      g(h(x),y) -> h(f(x,y))
      g(h(x),y) -> h(g(x,y))
     SCC Processor:
      #sccs: 1
      #rules: 3
      #arcs: 5/9
      DPs:
       g#(h(x),y) -> g#(x,y)
       g#(h(x),y) -> f#(x,y)
       f#(x,y) -> g#(x,y)
      TRS:
       f(x,y) -> g(x,y)
       g(h(x),y) -> h(f(x,y))
       g(h(x),y) -> h(g(x,y))
      Open