Input TRS:
    1: f(node(s(n),xs)) -> f(addchild(select(xs),node(n,xs)))
    2: select(cons(ap,xs)) -> ap
    3: select(cons(ap,xs)) -> select(xs)
    4: addchild(node(y,ys),node(n,xs)) -> node(y,cons(node(n,xs),ys))
Number of strict rules: 4
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #select(cons(ap,xs)) -> #select(xs)
   #2: #f(node(s(n),xs)) -> #f(addchild(select(xs),node(n,xs)))
   #3: #f(node(s(n),xs)) -> #addchild(select(xs),node(n,xs))
   #4: #f(node(s(n),xs)) -> #select(xs)
Number of SCCs: 2, DPs: 2, edges: 2
	SCC { #1 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
addchild(x1,x2)	weight: 0
     s(x1)	weight: 0
#select(x1)	weight: x1
select(x1)	weight: 0
     f(x1)	weight: 0
   #f(x1)	weight: 0
#addchild(x1,x2)	weight: 0
  cons(x1,x2)	weight: (/ 1 2) + x2
  node(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #1
Number of SCCs: 1, DPs: 1, edges: 1
	SCC { #2 }
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