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