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