interpretations
TIMEOUT
We are left with following problem, upon which TcT provides the
certificate TIMEOUT.
Strict Trs:
{ cond(true(), x) -> cond(odd(x), p(p(p(x))))
, odd(0()) -> false()
, odd(s(0())) -> true()
, odd(s(s(x))) -> odd(x)
, p(0()) -> 0()
, p(s(x)) -> x }
Obligation:
innermost runtime complexity
Answer:
TIMEOUT
Computation stopped due to timeout after 20.0 seconds.
Arrrr..
lmpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ cond(true(), x) -> cond(odd(x), p(p(p(x))))
, odd(0()) -> false()
, odd(s(0())) -> true()
, odd(s(s(x))) -> odd(x)
, p(0()) -> 0()
, p(s(x)) -> x }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ cond(true(), x) -> cond(odd(x), p(p(p(x))))
, odd(0()) -> false()
, odd(s(0())) -> true()
, odd(s(s(x))) -> odd(x)
, p(0()) -> 0()
, p(s(x)) -> x }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ cond(true(), x) -> cond(odd(x), p(p(p(x))))
, odd(0()) -> false()
, odd(s(0())) -> true()
, odd(s(s(x))) -> odd(x)
, p(0()) -> 0()
, p(s(x)) -> x }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ cond(true(), x) -> cond(odd(x), p(p(p(x))))
, odd(0()) -> false()
, odd(s(0())) -> true()
, odd(s(s(x))) -> odd(x)
, p(0()) -> 0()
, p(s(x)) -> x }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..