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