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