YES(?,ELEMENTARY)

We are left with following problem, upon which TcT provides the
certificate YES(?,ELEMENTARY).

Strict Trs:
  { D(t()) -> 1()
  , D(constant()) -> 0()
  , D(+(x, y)) -> +(D(x), D(y))
  , D(*(x, y)) -> +(*(y, D(x)), *(x, D(y)))
  , D(-(x, y)) -> -(D(x), D(y)) }
Obligation:
  innermost runtime complexity
Answer:
  YES(?,ELEMENTARY)

The input was oriented with the instance of 'Lightweight Multiset
Path Order' as induced by the safe mapping

 safe(D) = {}, safe(t) = {}, safe(1) = {}, safe(constant) = {},
 safe(0) = {}, safe(+) = {1, 2}, safe(*) = {1, 2}, safe(-) = {1, 2}

and precedence

 empty .

Following symbols are considered recursive:

 {D}

The recursion depth is 1.

For your convenience, here are the satisfied ordering constraints:

         D(t();) > 1()                                 
                                                       
  D(constant();) > 0()                                 
                                                       
  D(+(; x,  y);) > +(; D(x;),  D(y;))                  
                                                       
  D(*(; x,  y);) > +(; *(; y,  D(x;)),  *(; x,  D(y;)))
                                                       
  D(-(; x,  y);) > -(; D(x;),  D(y;))                  
                                                       

Hurray, we answered YES(?,ELEMENTARY)