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