1.12/1.05	MAYBE
1.12/1.06	Input TRS:
1.12/1.06	    1: a(a(b(b(x1)))) -> b(b(c(c(a(a(x1))))))
1.12/1.06	    2: b(b(c(c(x1)))) -> c(c(b(b(b(b(x1))))))
1.12/1.06	    3: a(a(c(c(x1)))) -> c(c(a(a(b(b(x1))))))
1.12/1.06	Number of strict rules: 3
1.12/1.06	Direct POLO(bPol) ... failed.
1.12/1.06	Uncurrying ... failed.
1.12/1.06	Dependency Pairs:
1.12/1.06	   #1: #b(b(c(c(x1)))) -> #b(b(b(b(x1))))
1.12/1.06	   #2: #b(b(c(c(x1)))) -> #b(b(b(x1)))
1.12/1.06	   #3: #b(b(c(c(x1)))) -> #b(b(x1))
1.12/1.06	   #4: #b(b(c(c(x1)))) -> #b(x1)
1.12/1.06	   #5: #a(a(c(c(x1)))) -> #a(a(b(b(x1))))
1.12/1.06	   #6: #a(a(c(c(x1)))) -> #a(b(b(x1)))
1.12/1.06	   #7: #a(a(c(c(x1)))) -> #b(b(x1))
1.12/1.06	   #8: #a(a(c(c(x1)))) -> #b(x1)
1.12/1.06	   #9: #a(a(b(b(x1)))) -> #b(b(c(c(a(a(x1))))))
1.12/1.06	   #10: #a(a(b(b(x1)))) -> #b(c(c(a(a(x1)))))
1.12/1.06	   #11: #a(a(b(b(x1)))) -> #a(a(x1))
1.12/1.06	   #12: #a(a(b(b(x1)))) -> #a(x1)
1.12/1.06	Number of SCCs: 2, DPs: 7
1.12/1.06	  SCC { #5 #11 #12 }
1.12/1.06	POLO(Sum)... succeeded.
1.12/1.06	      a 	w: x1 + 1
1.12/1.06	      b 	w: x1
1.12/1.06	      c 	w: x1
1.12/1.06	      #a 	w: x1
1.12/1.06	      #b 	w: 0
1.12/1.06	    USABLE RULES: { 1..3 }
1.12/1.06	    Removed DPs: #12
1.12/1.06	Number of SCCs: 2, DPs: 6
1.12/1.06	  SCC { #5 #11 }
1.12/1.06	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
1.12/1.06	Finding a loop...  failed.
1.12/1.06	EOF