YES(?,PRIMREC)

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

Strict Trs:
  { 0(1(2(3(4(x1))))) -> 0(2(3(1(4(x1)))))
  , 0(5(1(2(3(4(x1)))))) -> 0(1(2(5(3(4(x1))))))
  , 0(5(1(2(3(4(x1)))))) -> 0(5(2(1(3(4(x1))))))
  , 0(5(1(2(3(4(x1)))))) -> 5(0(2(3(1(4(x1))))))
  , 0(5(2(3(1(4(x1)))))) -> 0(1(5(2(3(4(x1)))))) }
Obligation:
  innermost runtime complexity
Answer:
  YES(?,PRIMREC)

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

 0 > 1, 0 > 2, 0 > 3, 0 > 5, 1 > 2, 4 > 1, 4 > 2, 4 > 3, 4 > 5,
 5 > 1, 5 > 2, 5 > 3, 0 ~ 4, 1 ~ 3 .

Hurray, we answered YES(?,PRIMREC)