MAYBE

Problem:
 f(empty(),l) -> l
 f(cons(x,k),l) -> g(k,l,cons(x,k))
 g(a,b,c) -> f(a,cons(b,c))

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