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