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