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