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