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