0.00/0.03	YES
0.00/0.03	Input TRS:
0.00/0.03	    1: b(b(x1)) -> c(d(x1))
0.00/0.03	    2: c(c(x1)) -> d(d(d(x1)))
0.00/0.03	    3: c(x1) -> g(x1)
0.00/0.03	    4: d(d(x1)) -> c(f(x1))
0.00/0.03	    5: d(d(d(x1))) -> g(c(x1))
0.00/0.03	    6: f(x1) -> a(g(x1))
0.00/0.03	    7: g(x1) -> d(a(b(x1)))
0.00/0.03	    8: g(g(x1)) -> b(c(x1))
0.00/0.03	Number of strict rules: 8
0.00/0.03	Direct POLO(bPol) ... failed.
0.00/0.03	Uncurrying ... failed.
0.00/0.03	Dependency Pairs:
0.00/0.03	   #1: #c(c(x1)) -> #d(d(d(x1)))
0.00/0.03	   #2: #c(c(x1)) -> #d(d(x1))
0.00/0.03	   #3: #c(c(x1)) -> #d(x1)
0.00/0.03	   #4: #f(x1) -> #g(x1)
0.00/0.03	   #5: #g(x1) -> #d(a(b(x1)))
0.00/0.03	   #6: #g(x1) -> #b(x1)
0.00/0.03	   #7: #d(d(d(x1))) -> #g(c(x1))
0.00/0.03	   #8: #d(d(d(x1))) -> #c(x1)
0.00/0.03	   #9: #c(x1) -> #g(x1)
0.00/0.03	   #10: #b(b(x1)) -> #c(d(x1))
0.00/0.03	   #11: #b(b(x1)) -> #d(x1)
0.00/0.03	   #12: #g(g(x1)) -> #b(c(x1))
0.00/0.03	   #13: #g(g(x1)) -> #c(x1)
0.00/0.03	   #14: #d(d(x1)) -> #c(f(x1))
0.00/0.03	   #15: #d(d(x1)) -> #f(x1)
0.00/0.03	Number of SCCs: 1, DPs: 14
0.00/0.03	  SCC { #1..4 #6..15 }
0.00/0.03	POLO(Sum)... succeeded.
0.00/0.03	      a 	w: 1
0.00/0.03	      d 	w: x1 + 8
0.00/0.03	      b 	w: x1 + 12
0.00/0.03	      c 	w: x1 + 12
0.00/0.03	      f 	w: 2
0.00/0.03	      #d 	w: x1
0.00/0.03	      #f 	w: x1 + 4
0.00/0.03	      #g 	w: x1 + 3
0.00/0.03	      #c 	w: x1 + 5
0.00/0.03	      g 	w: x1 + 12
0.00/0.03	      #b 	w: x1 + 2
0.00/0.03	    USABLE RULES: { 1..8 }
0.00/0.03	    Removed DPs: #1..4 #6..15
0.00/0.03	Number of SCCs: 0, DPs: 0
0.00/0.03	EOF