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