YES(?,POLY) 'Pop* with parameter subtitution (timeout of 60.0 seconds)' ----------------------------------------------------------- Answer: YES(?,POLY) Input Problem: innermost runtime-complexity with respect to Rules: { and(tt(), X) -> X , plus(N, 0()) -> N , plus(N, s(M)) -> s(plus(N, M))} Proof Output: The input was oriented with the instance of POP* as induced by the precedence and ~ plus and safe mapping safe(and) = {}, safe(tt) = {}, safe(plus) = {}, safe(0) = {}, safe(s) = {1} . For your convenience, here is the input in predicative notation: Rules: { and(tt(), X;) -> X , plus(N, 0();) -> N , plus(N, s(; M);) -> s(; plus(N, M;))}