YES(?,O(n^1))

Problem:
 p(0()) -> 0()
 p(s(x)) -> x
 minus(x,0()) -> x
 minus(x,s(y)) -> minus(p(x),y)

Proof:
 Complexity Transformation Processor:
  strict:
   p(0()) -> 0()
   p(s(x)) -> x
   minus(x,0()) -> x
   minus(x,s(y)) -> minus(p(x),y)
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   max_matrix:
    1
    interpretation:
     [minus](x0, x1) = x0 + x1,
     
     [s](x0) = x0 + 1,
     
     [p](x0) = x0,
     
     [0] = 0
    orientation:
     p(0()) = 0 >= 0 = 0()
     
     p(s(x)) = x + 1 >= x = x
     
     minus(x,0()) = x >= x = x
     
     minus(x,s(y)) = x + y + 1 >= x + y = minus(p(x),y)
    problem:
     strict:
      p(0()) -> 0()
      minus(x,0()) -> x
     weak:
      p(s(x)) -> x
      minus(x,s(y)) -> minus(p(x),y)
    Matrix Interpretation Processor:
     dimension: 1
     max_matrix:
      1
      interpretation:
       [minus](x0, x1) = x0 + x1 + 1,
       
       [s](x0) = x0,
       
       [p](x0) = x0,
       
       [0] = 1
      orientation:
       p(0()) = 1 >= 1 = 0()
       
       minus(x,0()) = x + 2 >= x = x
       
       p(s(x)) = x >= x = x
       
       minus(x,s(y)) = x + y + 1 >= x + y + 1 = minus(p(x),y)
      problem:
       strict:
        p(0()) -> 0()
       weak:
        minus(x,0()) -> x
        p(s(x)) -> x
        minus(x,s(y)) -> minus(p(x),y)
      Matrix Interpretation Processor:
       dimension: 1
       max_matrix:
        1
        interpretation:
         [minus](x0, x1) = x0 + x1,
         
         [s](x0) = x0 + 1,
         
         [p](x0) = x0 + 1,
         
         [0] = 0
        orientation:
         p(0()) = 1 >= 0 = 0()
         
         minus(x,0()) = x >= x = x
         
         p(s(x)) = x + 2 >= x = x
         
         minus(x,s(y)) = x + y + 1 >= x + y + 1 = minus(p(x),y)
        problem:
         strict:
          
         weak:
          p(0()) -> 0()
          minus(x,0()) -> x
          p(s(x)) -> x
          minus(x,s(y)) -> minus(p(x),y)
        Qed