MAYBE

Problem:
 g() -> h()
 c() -> d()
 h() -> g()

Proof:
 DP Processor:
  DPs:
   g#() -> h#()
   h#() -> g#()
  TRS:
   g() -> h()
   c() -> d()
   h() -> g()
  Usable Rule Processor:
   DPs:
    g#() -> h#()
    h#() -> g#()
   TRS:
    
   CDG Processor:
    DPs:
     g#() -> h#()
     h#() -> g#()
    TRS:
     
    graph:
     h#() -> g#() -> g#() -> h#()
     g#() -> h#() -> h#() -> g#()
    Restore Modifier:
     DPs:
      g#() -> h#()
      h#() -> g#()
     TRS:
      g() -> h()
      c() -> d()
      h() -> g()
     SCC Processor:
      #sccs: 1
      #rules: 2
      #arcs: 2/4
      DPs:
       h#() -> g#()
       g#() -> h#()
      TRS:
       g() -> h()
       c() -> d()
       h() -> g()
      Open