MAYBE

Problem:
 g(X) -> u(h(X),h(X),X)
 u(d(),c(Y),X) -> k(Y)
 h(d()) -> c(a())
 h(d()) -> c(b())
 f(k(a()),k(b()),X) -> f(X,X,X)

Proof:
 DP Processor:
  DPs:
   g#(X) -> h#(X)
   g#(X) -> u#(h(X),h(X),X)
   f#(k(a()),k(b()),X) -> f#(X,X,X)
  TRS:
   g(X) -> u(h(X),h(X),X)
   u(d(),c(Y),X) -> k(Y)
   h(d()) -> c(a())
   h(d()) -> c(b())
   f(k(a()),k(b()),X) -> f(X,X,X)
  TDG Processor:
   DPs:
    g#(X) -> h#(X)
    g#(X) -> u#(h(X),h(X),X)
    f#(k(a()),k(b()),X) -> f#(X,X,X)
   TRS:
    g(X) -> u(h(X),h(X),X)
    u(d(),c(Y),X) -> k(Y)
    h(d()) -> c(a())
    h(d()) -> c(b())
    f(k(a()),k(b()),X) -> f(X,X,X)
   graph:
    f#(k(a()),k(b()),X) -> f#(X,X,X) -> f#(k(a()),k(b()),X) -> f#(X,X,X)
   SCC Processor:
    #sccs: 1
    #rules: 1
    #arcs: 1/9
    DPs:
     f#(k(a()),k(b()),X) -> f#(X,X,X)
    TRS:
     g(X) -> u(h(X),h(X),X)
     u(d(),c(Y),X) -> k(Y)
     h(d()) -> c(a())
     h(d()) -> c(b())
     f(k(a()),k(b()),X) -> f(X,X,X)
    Open