0.00/0.13	MAYBE
0.00/0.13	Input TRS:
0.00/0.13	    1: a(x1) -> x1
0.00/0.13	    2: a(a(b(x1))) -> c(c(b(a(x1))))
0.00/0.13	    3: b(c(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: #a(a(b(x1))) -> #b(a(x1))
0.00/0.13	   #2: #a(a(b(x1))) -> #a(x1)
0.00/0.13	   #3: #b(c(x1)) -> #a(b(x1))
0.00/0.13	   #4: #b(c(x1)) -> #b(x1)
0.00/0.13	Number of SCCs: 1, DPs: 4
0.00/0.13	  SCC { #1..4 }
0.00/0.13	POLO(Sum)... succeeded.
0.00/0.13	      a 	w: x1
0.00/0.13	      b 	w: x1 + 1
0.00/0.13	      c 	w: x1
0.00/0.13	      #a 	w: x1
0.00/0.13	      #b 	w: x1 + 1
0.00/0.13	    USABLE RULES: { 1..3 }
0.00/0.13	    Removed DPs: #2
0.00/0.13	Number of SCCs: 1, DPs: 3
0.00/0.13	  SCC { #1 #3 #4 }
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.13	EOF