0.00/0.03	YES
0.00/0.03	Input TRS:
0.00/0.03	    1: f(s(x1)) -> s(s(f(p(s(x1)))))
0.00/0.03	    2: f(0(x1)) -> 0(x1)
0.00/0.03	    3: p(s(x1)) -> x1
0.00/0.03	Number of strict rules: 3
0.00/0.03	Direct POLO(bPol) ... removes: 2
0.00/0.03	      s 	w: x1
0.00/0.03	      f 	w: x1 + 1
0.00/0.03	      p 	w: x1
0.00/0.03	      0 	w: 2 * x1 + 1
0.00/0.03	Number of strict rules: 2
0.00/0.03	Direct POLO(bPol) ... failed.
0.00/0.03	Uncurrying p
0.00/0.03	1: f(s(x1)) -> s(s(f(p^1_s(x1))))
0.00/0.03	3: p^1_s(x1) -> x1
0.00/0.03	4: p(s(_1)) ->= p^1_s(_1)
0.00/0.03	Number of strict rules: 2
0.00/0.03	Direct POLO(bPol) ... removes: 4
0.00/0.03	      s 	w: x1 + 1
0.00/0.03	      p^1_s	w: x1
0.00/0.03	      f 	w: 2 * x1 + 1
0.00/0.03	      p 	w: 2 * x1
0.00/0.03	      0 	w: x1
0.00/0.03	Number of strict rules: 2
0.00/0.03	Direct POLO(bPol) ... failed.
0.00/0.03	Dependency Pairs:
0.00/0.03	   #1: #f(s(x1)) -> #f(p^1_s(x1))
0.00/0.03	   #2: #f(s(x1)) -> #p^1_s(x1)
0.00/0.03	Number of SCCs: 1, DPs: 1
0.00/0.03	  SCC { #1 }
0.00/0.03	POLO(Sum)... succeeded.
0.00/0.03	      s 	w: x1 + 2
0.00/0.03	      #p^1_s	w: 0
0.00/0.03	      p^1_s	w: x1 + 1
0.00/0.03	      f 	w: 0
0.00/0.03	      p 	w: 0
0.00/0.03	      0 	w: 0
0.00/0.03	      #f 	w: x1
0.00/0.03	    USABLE RULES: { 3 }
0.00/0.03	    Removed DPs: #1
0.00/0.03	Number of SCCs: 0, DPs: 0
0.00/0.03	EOF