12.99/10.51	MAYBE
12.99/10.52	Input TRS:
12.99/10.52	    1: c(a(b(a(b(a(b(a(b(a(x1)))))))))) -> a(b(a(b(a(b(a(b(a(b(c(c(c(a(x1))))))))))))))
12.99/10.52	Number of strict rules: 1
12.99/10.52	Direct POLO(bPol) ... failed.
12.99/10.52	Uncurrying c
12.99/10.52	1: c^1_a(b(a(b(a(b(a(b(a(x1))))))))) -> a(b(a(b(a(b(a(b(a(b(c(c(c^1_a(x1)))))))))))))
12.99/10.52	2: c(a(_1)) ->= c^1_a(_1)
12.99/10.52	Number of strict rules: 1
12.99/10.52	Direct POLO(bPol) ... failed.
12.99/10.52	Dependency Pairs:
12.99/10.52	   #1: #c(a(_1)) ->? #c^1_a(_1)
12.99/10.52	   #2: #c^1_a(b(a(b(a(b(a(b(a(x1))))))))) -> #c(c(c^1_a(x1)))
12.99/10.52	   #3: #c^1_a(b(a(b(a(b(a(b(a(x1))))))))) -> #c(c^1_a(x1))
12.99/10.52	   #4: #c^1_a(b(a(b(a(b(a(b(a(x1))))))))) -> #c^1_a(x1)
12.99/10.52	Number of SCCs: 1, DPs: 4
12.99/10.52	  SCC { #1..4 }
12.99/10.52	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
12.99/10.52	Finding a loop...  failed.
12.99/10.52	EOF