YES(?,PRIMREC)

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

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

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

 bin > +, 0 > +, s > +, bin ~ 0, bin ~ s, 0 ~ s .

Hurray, we answered YES(?,PRIMREC)