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