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