0.00/0.17	YES
0.00/0.17	Input TRS:
0.00/0.17	    1: t(o(x1)) -> m(a(x1))
0.00/0.17	    2: t(e(x1)) -> n(s(x1))
0.00/0.17	    3: a(l(x1)) -> a(t(x1))
0.00/0.17	    4: o(m(a(x1))) -> t(e(n(x1)))
0.00/0.17	    5: s(a(x1)) -> l(a(t(o(m(a(t(e(x1))))))))
0.00/0.17	    6: n(s(x1)) -> a(l(a(t(x1))))
0.00/0.17	Number of strict rules: 6
0.00/0.17	Direct POLO(bPol) ... failed.
0.00/0.17	Uncurrying ... failed.
0.00/0.17	Dependency Pairs:
0.00/0.17	   #1: #t(e(x1)) -> #n(s(x1))
0.00/0.17	   #2: #t(e(x1)) -> #s(x1)
0.00/0.17	   #3: #n(s(x1)) -> #a(l(a(t(x1))))
0.00/0.17	   #4: #n(s(x1)) -> #a(t(x1))
0.00/0.17	   #5: #n(s(x1)) -> #t(x1)
0.00/0.17	   #6: #s(a(x1)) -> #a(t(o(m(a(t(e(x1)))))))
0.00/0.17	   #7: #s(a(x1)) -> #t(o(m(a(t(e(x1))))))
0.00/0.17	   #8: #s(a(x1)) -> #o(m(a(t(e(x1)))))
0.00/0.17	   #9: #s(a(x1)) -> #a(t(e(x1)))
0.00/0.17	   #10: #s(a(x1)) -> #t(e(x1))
0.00/0.17	   #11: #a(l(x1)) -> #a(t(x1))
0.00/0.17	   #12: #a(l(x1)) -> #t(x1)
0.00/0.17	   #13: #t(o(x1)) -> #a(x1)
0.00/0.17	   #14: #o(m(a(x1))) -> #t(e(n(x1)))
0.00/0.17	   #15: #o(m(a(x1))) -> #n(x1)
0.00/0.17	Number of SCCs: 1, DPs: 11
0.00/0.17	  SCC { #1..3 #5 #7 #8 #10 #12..15 }
0.00/0.17	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
0.00/0.17	      a 	w: max(x1 + 11, 0)
0.00/0.17	      s 	w: max(x1 + 38, 0)
0.00/0.17	      n 	w: max(x1 - 27, 0)
0.00/0.17	      t 	w: max(x1 - 49, 0)
0.00/0.17	      l 	w: max(x1 - 49, 0)
0.00/0.17	      o 	w: max(x1 + 65, 0)
0.00/0.17	      #s 	w: max(x1 - 2, 0)
0.00/0.17	      #o 	w: max(x1 + 4, 0)
0.00/0.17	      e 	w: max(x1 + 60, 0)
0.00/0.17	      #a 	w: max(x1 + 1, 0)
0.00/0.17	      #t 	w: max(x1 - 57, 0)
0.00/0.17	      #n 	w: max(x1 - 36, 0)
0.00/0.17	      m 	w: max(x1 - 27, 0)
0.00/0.17	    USABLE RULES: { 1..6 }
0.00/0.17	    Removed DPs: #1..3 #5 #7 #8 #10 #12..15
0.00/0.17	Number of SCCs: 0, DPs: 0
0.00/0.17	EOF