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