YES(?,O(n^1))

We are left with following problem, upon which TcT provides the
certificate YES(?,O(n^1)).

Strict Trs:
  { and(tt(), X) -> activate(X)
  , activate(X) -> X
  , plus(N, 0()) -> N
  , plus(N, s(M)) -> s(plus(N, M)) }
Obligation:
  innermost runtime complexity
Answer:
  YES(?,O(n^1))

The input was oriented with the instance of 'Small Polynomial Path
Order (1-bounded)' as induced by the safe mapping

 safe(and) = {}, safe(tt) = {}, safe(activate) = {1},
 safe(plus) = {1}, safe(0) = {}, safe(s) = {1}

and precedence

 and > activate, and ~ plus .

Following symbols are considered recursive:

 {activate, plus}

The recursion depth is 1.

For your convenience, here are the satisfied ordering constraints:

   and(tt(),  X;) > activate(; X)  
                                   
    activate(; X) > X              
                                   
     plus(0(); N) > N              
                                   
  plus(s(; M); N) > s(; plus(M; N))
                                   

Hurray, we answered YES(?,O(n^1))