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