Input TRS:
    1: c(A(),c(n,c(0(),L))) -> c(A(),c(S(n),L))
    2: c(A(),c(0(),c(S(m),L))) -> c(A(),c(S(0()),c(m,L)))
    3: c(A(),c(S(n),c(S(m),L))) -> c(A(),c(n,c(S(m),c(m,L))))
Number of strict rules: 3
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #c(A(),c(0(),c(S(m),L))) -> #c(A(),c(S(0()),c(m,L)))
   #2: #c(A(),c(0(),c(S(m),L))) -> #c(S(0()),c(m,L))
   #3: #c(A(),c(0(),c(S(m),L))) -> #c(m,L)
   #4: #c(A(),c(S(n),c(S(m),L))) -> #c(A(),c(n,c(S(m),c(m,L))))
   #5: #c(A(),c(S(n),c(S(m),L))) -> #c(n,c(S(m),c(m,L)))
   #6: #c(A(),c(S(n),c(S(m),L))) -> #c(S(m),c(m,L))
   #7: #c(A(),c(S(n),c(S(m),L))) -> #c(m,L)
   #8: #c(A(),c(n,c(0(),L))) -> #c(A(),c(S(n),L))
   #9: #c(A(),c(n,c(0(),L))) -> #c(S(n),L)
Number of SCCs: 1, DPs: 6, edges: 30
	SCC { #1 #3..5 #7 #8 }
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