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