YES(?,POLY)

'Pop* (timeout of 60.0 seconds)'
--------------------------------
Answer:           YES(?,POLY)
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  p(m, n, s(r)) -> p(m, r, n)
     , p(m, s(n), 0()) -> p(0(), n, m)
     , p(m, 0(), 0()) -> m}

Proof Output:    
  The input was oriented with the instance of POP* as induced by the precedence
  
   empty
  
  and safe mapping
  
   safe(p) = {}, safe(s) = {1}, safe(0) = {} .
  
  For your convenience, here is the input in predicative notation:
  
   Rules:
    {  p(m, n, s(; r);) -> p(m, r, n;)
     , p(m, s(; n), 0();) -> p(0(), n, m;)
     , p(m, 0(), 0();) -> m}