interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ empty(nil()) -> true()
, empty(cons(x, y)) -> false()
, tail(nil()) -> nil()
, tail(cons(x, y)) -> y
, head(cons(x, y)) -> x
, zero(0()) -> true()
, zero(s(x)) -> false()
, p(0()) -> 0()
, p(s(0())) -> 0()
, p(s(s(x))) -> s(p(s(x)))
, intlist(x) -> if_intlist(empty(x), x)
, if_intlist(true(), x) -> nil()
, if_intlist(false(), x) -> cons(s(head(x)), intlist(tail(x)))
, int(x, y) -> if_int(zero(x), zero(y), x, y)
, if_int(true(), b, x, y) -> if1(b, x, y)
, if_int(false(), b, x, y) -> if2(b, x, y)
, if1(true(), x, y) -> cons(0(), nil())
, if1(false(), x, y) -> cons(0(), int(s(0()), y))
, if2(true(), x, y) -> nil()
, if2(false(), x, y) -> intlist(int(p(x), p(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:
{ empty(nil()) -> true()
, empty(cons(x, y)) -> false()
, tail(nil()) -> nil()
, tail(cons(x, y)) -> y
, head(cons(x, y)) -> x
, zero(0()) -> true()
, zero(s(x)) -> false()
, p(0()) -> 0()
, p(s(0())) -> 0()
, p(s(s(x))) -> s(p(s(x)))
, intlist(x) -> if_intlist(empty(x), x)
, if_intlist(true(), x) -> nil()
, if_intlist(false(), x) -> cons(s(head(x)), intlist(tail(x)))
, int(x, y) -> if_int(zero(x), zero(y), x, y)
, if_int(true(), b, x, y) -> if1(b, x, y)
, if_int(false(), b, x, y) -> if2(b, x, y)
, if1(true(), x, y) -> cons(0(), nil())
, if1(false(), x, y) -> cons(0(), int(s(0()), y))
, if2(true(), x, y) -> nil()
, if2(false(), x, y) -> intlist(int(p(x), p(y))) }
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:
{ empty(nil()) -> true()
, empty(cons(x, y)) -> false()
, tail(nil()) -> nil()
, tail(cons(x, y)) -> y
, head(cons(x, y)) -> x
, zero(0()) -> true()
, zero(s(x)) -> false()
, p(0()) -> 0()
, p(s(0())) -> 0()
, p(s(s(x))) -> s(p(s(x)))
, intlist(x) -> if_intlist(empty(x), x)
, if_intlist(true(), x) -> nil()
, if_intlist(false(), x) -> cons(s(head(x)), intlist(tail(x)))
, int(x, y) -> if_int(zero(x), zero(y), x, y)
, if_int(true(), b, x, y) -> if1(b, x, y)
, if_int(false(), b, x, y) -> if2(b, x, y)
, if1(true(), x, y) -> cons(0(), nil())
, if1(false(), x, y) -> cons(0(), int(s(0()), y))
, if2(true(), x, y) -> nil()
, if2(false(), x, y) -> intlist(int(p(x), p(y))) }
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:
{ empty(nil()) -> true()
, empty(cons(x, y)) -> false()
, tail(nil()) -> nil()
, tail(cons(x, y)) -> y
, head(cons(x, y)) -> x
, zero(0()) -> true()
, zero(s(x)) -> false()
, p(0()) -> 0()
, p(s(0())) -> 0()
, p(s(s(x))) -> s(p(s(x)))
, intlist(x) -> if_intlist(empty(x), x)
, if_intlist(true(), x) -> nil()
, if_intlist(false(), x) -> cons(s(head(x)), intlist(tail(x)))
, int(x, y) -> if_int(zero(x), zero(y), x, y)
, if_int(true(), b, x, y) -> if1(b, x, y)
, if_int(false(), b, x, y) -> if2(b, x, y)
, if1(true(), x, y) -> cons(0(), nil())
, if1(false(), x, y) -> cons(0(), int(s(0()), y))
, if2(true(), x, y) -> nil()
, if2(false(), x, y) -> intlist(int(p(x), p(y))) }
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:
{ empty(nil()) -> true()
, empty(cons(x, y)) -> false()
, tail(nil()) -> nil()
, tail(cons(x, y)) -> y
, head(cons(x, y)) -> x
, zero(0()) -> true()
, zero(s(x)) -> false()
, p(0()) -> 0()
, p(s(0())) -> 0()
, p(s(s(x))) -> s(p(s(x)))
, intlist(x) -> if_intlist(empty(x), x)
, if_intlist(true(), x) -> nil()
, if_intlist(false(), x) -> cons(s(head(x)), intlist(tail(x)))
, int(x, y) -> if_int(zero(x), zero(y), x, y)
, if_int(true(), b, x, y) -> if1(b, x, y)
, if_int(false(), b, x, y) -> if2(b, x, y)
, if1(true(), x, y) -> cons(0(), nil())
, if1(false(), x, y) -> cons(0(), int(s(0()), y))
, if2(true(), x, y) -> nil()
, if2(false(), x, y) -> intlist(int(p(x), p(y))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..