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