YES(?,PRIMREC)

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

Strict Trs:
  { sqr(0()) -> 0()
  , sqr(s(x)) -> s(+(sqr(x), double(x)))
  , sqr(s(x)) -> +(sqr(x), s(double(x)))
  , +(x, 0()) -> x
  , +(x, s(y)) -> s(+(x, y))
  , double(0()) -> 0()
  , double(s(x)) -> s(s(double(x))) }
Obligation:
  innermost runtime complexity
Answer:
  YES(?,PRIMREC)

The input was oriented with the instance of'multiset path order' as
induced by the precedence

 sqr > s, sqr > +, sqr > double, 0 > sqr, 0 > s, 0 > +, 0 > double,
 + > s, + > double, double > s .

Hurray, we answered YES(?,PRIMREC)