0.00/0.13	MAYBE
0.00/0.14	Input TRS:
0.00/0.14	    1: a(b(x1)) -> c(d(x1))
0.00/0.14	    2: d(d(x1)) -> b(e(x1))
0.00/0.14	    3: b(x1) -> d(c(x1))
0.00/0.14	    4: d(x1) -> x1
0.00/0.14	    5: e(c(x1)) -> d(a(x1))
0.00/0.14	    6: a(x1) -> e(d(x1))
0.00/0.14	Number of strict rules: 6
0.00/0.14	Direct POLO(bPol) ... failed.
0.00/0.14	Uncurrying ... failed.
0.00/0.14	Dependency Pairs:
0.00/0.14	   #1: #d(d(x1)) -> #b(e(x1))
0.00/0.14	   #2: #d(d(x1)) -> #e(x1)
0.00/0.14	   #3: #a(x1) -> #e(d(x1))
0.00/0.14	   #4: #a(x1) -> #d(x1)
0.00/0.14	   #5: #e(c(x1)) -> #d(a(x1))
0.00/0.14	   #6: #e(c(x1)) -> #a(x1)
0.00/0.14	   #7: #b(x1) -> #d(c(x1))
0.00/0.14	   #8: #a(b(x1)) -> #d(x1)
0.00/0.14	Number of SCCs: 1, DPs: 6
0.00/0.14	  SCC { #2..6 #8 }
0.00/0.14	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
0.00/0.14	Finding a loop...  failed.
0.00/0.14	EOF