Input TRS:
    1: g(X) -> u(h(X),h(X),X)
    2: u(d(),c(Y),X) -> k(Y)
    3: h(d()) -> c(a())
    4: h(d()) -> c(b())
    5: f(k(a()),k(b()),X) -> f(X,X,X)
Number of strict rules: 5
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #f(k(a()),k(b()),X) -> #f(X,X,X)
   #2: #g(X) -> #u(h(X),h(X),X)
   #3: #g(X) -> #h(X)
   #4: #g(X) -> #h(X)
Number of SCCs: 1, DPs: 1, edges: 1
	SCC { #1 }
Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... QLPOpS... Order(PosReal,>,MaxSum)... QWPOpS(PosReal,>,MaxSum)... Order(PosReal,>,Sum-Sum; PosReal,≥,Sum-Sum)... Order(PosReal,>,Sum-Sum; NegReal,≥,Sum)... Order(PosReal,>,MaxSum-Sum; NegReal,≥,Sum)... failed.
Removing edges: failed.
Finding a loop...  failed.
MAYBE