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