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