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) -> 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 (PS)' as induced by the safe mapping

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

and precedence

 and > plus .

Following symbols are considered recursive:

 {plus}

The recursion depth is 1.

For your convenience, here are the satisfied ordering constraints:

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

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