interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ cond1(true(), x) -> cond2(even(x), x)
, cond2(true(), x) -> cond1(neq(x, 0()), div2(x))
, cond2(false(), x) -> cond1(neq(x, 0()), p(x))
, even(0()) -> true()
, even(s(0())) -> false()
, even(s(s(x))) -> even(x)
, neq(0(), 0()) -> false()
, neq(0(), s(x)) -> true()
, neq(s(x), 0()) -> true()
, neq(s(x), s(y())) -> neq(x, y())
, div2(0()) -> 0()
, div2(s(0())) -> 0()
, div2(s(s(x))) -> s(div2(x))
, p(0()) -> 0()
, p(s(x)) -> x }
Obligation:
innermost runtime complexity
Answer:
MAYBE
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'matrix interpretation of dimension 3' failed due to the
following reason:
The input cannot be shown compatible
2) 'custom shape polynomial interpretation' failed due to the
following reason:
The input cannot be shown compatible
3) 'custom shape polynomial interpretation' failed due to the
following reason:
The input cannot be shown compatible
4) 'matrix interpretation of dimension 1' failed due to the
following reason:
The input cannot be shown compatible
Arrrr..
lmpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ cond1(true(), x) -> cond2(even(x), x)
, cond2(true(), x) -> cond1(neq(x, 0()), div2(x))
, cond2(false(), x) -> cond1(neq(x, 0()), p(x))
, neq(0(), 0()) -> false()
, neq(0(), s(x)) -> true()
, neq(s(x), 0()) -> true()
, neq(s(x), s(y())) -> neq(x, y())
, even(0()) -> true()
, even(s(0())) -> false()
, even(s(s(x))) -> even(x)
, div2(0()) -> 0()
, div2(s(0())) -> 0()
, div2(s(s(x))) -> s(div2(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:
{ cond1(true(), x) -> cond2(even(x), x)
, cond2(true(), x) -> cond1(neq(x, 0()), div2(x))
, cond2(false(), x) -> cond1(neq(x, 0()), p(x))
, neq(0(), 0()) -> false()
, neq(0(), s(x)) -> true()
, neq(s(x), 0()) -> true()
, neq(s(x), s(y())) -> neq(x, y())
, even(0()) -> true()
, even(s(0())) -> false()
, even(s(s(x))) -> even(x)
, div2(0()) -> 0()
, div2(s(0())) -> 0()
, div2(s(s(x))) -> s(div2(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:
{ cond1(true(), x) -> cond2(even(x), x)
, cond2(true(), x) -> cond1(neq(x, 0()), div2(x))
, cond2(false(), x) -> cond1(neq(x, 0()), p(x))
, neq(0(), 0()) -> false()
, neq(0(), s(x)) -> true()
, neq(s(x), 0()) -> true()
, neq(s(x), s(y())) -> neq(x, y())
, even(0()) -> true()
, even(s(0())) -> false()
, even(s(s(x))) -> even(x)
, div2(0()) -> 0()
, div2(s(0())) -> 0()
, div2(s(s(x))) -> s(div2(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:
{ cond1(true(), x) -> cond2(even(x), x)
, cond2(true(), x) -> cond1(neq(x, 0()), div2(x))
, cond2(false(), x) -> cond1(neq(x, 0()), p(x))
, neq(0(), 0()) -> false()
, neq(0(), s(x)) -> true()
, neq(s(x), 0()) -> true()
, neq(s(x), s(y())) -> neq(x, y())
, even(0()) -> true()
, even(s(0())) -> false()
, even(s(s(x))) -> even(x)
, div2(0()) -> 0()
, div2(s(0())) -> 0()
, div2(s(s(x))) -> s(div2(x))
, p(0()) -> 0()
, p(s(x)) -> x }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..