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