32.20/22.55	MAYBE
32.20/22.56	Input TRS:
32.20/22.56	    1: b(c(c(a(a(a(a(a(a(x1))))))))) -> a(a(a(a(a(a(a(b(c(c(b(c(c(x1)))))))))))))
32.20/22.56	Number of strict rules: 1
32.20/22.56	Direct POLO(bPol) ... failed.
32.20/22.56	Uncurrying b
32.20/22.56	1: b^1_c(c(a(a(a(a(a(a(x1)))))))) -> a(a(a(a(a(a(a(b^1_c(c(b^1_c(c(x1)))))))))))
32.20/22.56	2: b(c(_1)) ->= b^1_c(_1)
32.20/22.56	Number of strict rules: 1
32.20/22.56	Direct POLO(bPol) ... removes: 2
32.20/22.56	      a 	w: x1
32.20/22.56	      b 	w: x1 + 1
32.20/22.56	      b^1_c	w: x1
32.20/22.56	      c 	w: x1
32.20/22.56	Number of strict rules: 1
32.20/22.56	Direct POLO(bPol) ... failed.
32.20/22.56	Dependency Pairs:
32.20/22.56	   #1: #b^1_c(c(a(a(a(a(a(a(x1)))))))) -> #b^1_c(c(b^1_c(c(x1))))
32.20/22.56	   #2: #b^1_c(c(a(a(a(a(a(a(x1)))))))) -> #b^1_c(c(x1))
32.20/22.56	Number of SCCs: 1, DPs: 2
32.20/22.56	  SCC { #1 #2 }
32.20/22.56	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
32.20/22.56	Finding a loop...  failed.
32.20/22.56	EOF