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