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