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