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