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