interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ double(x) -> permute(x, x, a())
, permute(x, y, a()) -> permute(isZero(x), x, b())
, permute(y, x, c()) -> s(s(permute(x, y, a())))
, permute(false(), x, b()) -> permute(ack(x, x), p(x), c())
, permute(true(), x, b()) -> 0()
, isZero(0()) -> true()
, isZero(s(x)) -> false()
, ack(0(), x) -> plus(x, s(0()))
, ack(s(x), 0()) -> ack(x, s(0()))
, ack(s(x), s(y)) -> ack(x, ack(s(x), y))
, p(0()) -> 0()
, p(s(x)) -> x
, plus(x, 0()) -> x
, plus(x, s(0())) -> s(x)
, plus(x, s(s(y))) -> s(plus(s(x), y))
, plus(0(), y) -> y
, plus(s(x), y) -> plus(x, s(y)) }
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:
{ double(x) -> permute(x, x, a())
, permute(x, y, a()) -> permute(isZero(x), x, b())
, permute(false(), x, b()) -> permute(ack(x, x), p(x), c())
, permute(true(), x, b()) -> 0()
, permute(y, x, c()) -> s(s(permute(x, y, a())))
, p(0()) -> 0()
, p(s(x)) -> x
, ack(0(), x) -> plus(x, s(0()))
, ack(s(x), 0()) -> ack(x, s(0()))
, ack(s(x), s(y)) -> ack(x, ack(s(x), y))
, plus(0(), y) -> y
, plus(s(x), y) -> plus(x, s(y))
, plus(x, s(s(y))) -> s(plus(s(x), y))
, plus(x, s(0())) -> s(x)
, plus(x, 0()) -> x
, isZero(0()) -> true()
, isZero(s(x)) -> false() }
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:
{ double(x) -> permute(x, x, a())
, permute(x, y, a()) -> permute(isZero(x), x, b())
, permute(false(), x, b()) -> permute(ack(x, x), p(x), c())
, permute(true(), x, b()) -> 0()
, permute(y, x, c()) -> s(s(permute(x, y, a())))
, p(0()) -> 0()
, p(s(x)) -> x
, ack(0(), x) -> plus(x, s(0()))
, ack(s(x), 0()) -> ack(x, s(0()))
, ack(s(x), s(y)) -> ack(x, ack(s(x), y))
, plus(0(), y) -> y
, plus(s(x), y) -> plus(x, s(y))
, plus(x, s(s(y))) -> s(plus(s(x), y))
, plus(x, s(0())) -> s(x)
, plus(x, 0()) -> x
, isZero(0()) -> true()
, isZero(s(x)) -> false() }
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:
{ double(x) -> permute(x, x, a())
, permute(x, y, a()) -> permute(isZero(x), x, b())
, permute(false(), x, b()) -> permute(ack(x, x), p(x), c())
, permute(true(), x, b()) -> 0()
, permute(y, x, c()) -> s(s(permute(x, y, a())))
, p(0()) -> 0()
, p(s(x)) -> x
, ack(0(), x) -> plus(x, s(0()))
, ack(s(x), 0()) -> ack(x, s(0()))
, ack(s(x), s(y)) -> ack(x, ack(s(x), y))
, plus(0(), y) -> y
, plus(s(x), y) -> plus(x, s(y))
, plus(x, s(s(y))) -> s(plus(s(x), y))
, plus(x, s(0())) -> s(x)
, plus(x, 0()) -> x
, isZero(0()) -> true()
, isZero(s(x)) -> false() }
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:
{ double(x) -> permute(x, x, a())
, permute(x, y, a()) -> permute(isZero(x), x, b())
, permute(false(), x, b()) -> permute(ack(x, x), p(x), c())
, permute(true(), x, b()) -> 0()
, permute(y, x, c()) -> s(s(permute(x, y, a())))
, p(0()) -> 0()
, p(s(x)) -> x
, ack(0(), x) -> plus(x, s(0()))
, ack(s(x), 0()) -> ack(x, s(0()))
, ack(s(x), s(y)) -> ack(x, ack(s(x), y))
, plus(0(), y) -> y
, plus(s(x), y) -> plus(x, s(y))
, plus(x, s(s(y))) -> s(plus(s(x), y))
, plus(x, s(0())) -> s(x)
, plus(x, 0()) -> x
, isZero(0()) -> true()
, isZero(s(x)) -> false() }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..