0.00/0.12	YES
0.00/0.13	Input TRS:
0.00/0.13	    1: f(x1) -> n(c(c(x1)))
0.00/0.13	    2: c(f(x1)) -> f(c(c(x1)))
0.00/0.13	    3: c(c(x1)) -> c(x1)
0.00/0.13	    4: n(s(x1)) -> f(s(s(x1)))
0.00/0.13	    5: n(f(x1)) -> f(n(x1))
0.00/0.13	Number of strict rules: 5
0.00/0.13	Direct POLO(bPol) ... failed.
0.00/0.13	Uncurrying ... failed.
0.00/0.13	Dependency Pairs:
0.00/0.13	   #1: #c(f(x1)) -> #f(c(c(x1)))
0.00/0.13	   #2: #c(f(x1)) -> #c(c(x1))
0.00/0.13	   #3: #c(f(x1)) -> #c(x1)
0.00/0.13	   #4: #n(f(x1)) -> #f(n(x1))
0.00/0.13	   #5: #n(f(x1)) -> #n(x1)
0.00/0.13	   #6: #f(x1) -> #n(c(c(x1)))
0.00/0.13	   #7: #f(x1) -> #c(c(x1))
0.00/0.13	   #8: #f(x1) -> #c(x1)
0.00/0.13	   #9: #n(s(x1)) -> #f(s(s(x1)))
0.00/0.13	Number of SCCs: 1, DPs: 9
0.00/0.13	  SCC { #1..9 }
0.00/0.13	POLO(Sum)... succeeded.
0.00/0.13	      s 	w: 1
0.00/0.13	      n 	w: x1 + 2
0.00/0.13	      c 	w: x1
0.00/0.13	      f 	w: x1 + 2
0.00/0.13	      #f 	w: x1 + 1
0.00/0.13	      #c 	w: x1
0.00/0.13	      #n 	w: x1 + 1
0.00/0.13	    USABLE RULES: { 1..5 }
0.00/0.13	    Removed DPs: #1..3 #5 #7 #8
0.00/0.13	Number of SCCs: 1, DPs: 2
0.00/0.13	  SCC { #4 #6 }
0.00/0.13	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded.
0.00/0.13	      s 	w: [1;2]
0.00/0.13	      n 	w: [1,1;0,1] * x1 + [1;0]
0.00/0.13	      c 	w: [1,0;0,0] * x1
0.00/0.13	      f 	w: x1 + [3;0]
0.00/0.13	      #f 	w: [1,0;0,0] * x1 + [1;0]
0.00/0.13	      #c 	w: [0;0]
0.00/0.13	      #n 	w: [1,1;0,0] * x1
0.00/0.13	    USABLE RULES: { 1..5 }
0.00/0.13	    Removed DPs: #4 #6
0.00/0.13	Number of SCCs: 0, DPs: 0
0.00/0.13	EOF