interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ empty(nil()) -> true()
, empty(cons(x, l)) -> false()
, head(cons(x, l)) -> x
, tail(nil()) -> nil()
, tail(cons(x, l)) -> l
, rev(nil()) -> nil()
, rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
, rev2(x, nil()) -> nil()
, rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l)))
, last(x, l) -> if(empty(l), x, l)
, if(true(), x, l) -> x
, if(false(), x, l) -> last(head(l), tail(l)) }
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, l)) -> false()
, head(cons(x, l)) -> x
, tail(nil()) -> nil()
, tail(cons(x, l)) -> l
, rev(nil()) -> nil()
, rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
, last(x, l) -> if(empty(l), x, l)
, if(true(), x, l) -> x
, if(false(), x, l) -> last(head(l), tail(l))
, rev2(x, nil()) -> nil()
, rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l))) }
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, l)) -> false()
, head(cons(x, l)) -> x
, tail(nil()) -> nil()
, tail(cons(x, l)) -> l
, rev(nil()) -> nil()
, rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
, last(x, l) -> if(empty(l), x, l)
, if(true(), x, l) -> x
, if(false(), x, l) -> last(head(l), tail(l))
, rev2(x, nil()) -> nil()
, rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l))) }
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, l)) -> false()
, head(cons(x, l)) -> x
, tail(nil()) -> nil()
, tail(cons(x, l)) -> l
, rev(nil()) -> nil()
, rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
, last(x, l) -> if(empty(l), x, l)
, if(true(), x, l) -> x
, if(false(), x, l) -> last(head(l), tail(l))
, rev2(x, nil()) -> nil()
, rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l))) }
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, l)) -> false()
, head(cons(x, l)) -> x
, tail(nil()) -> nil()
, tail(cons(x, l)) -> l
, rev(nil()) -> nil()
, rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
, last(x, l) -> if(empty(l), x, l)
, if(true(), x, l) -> x
, if(false(), x, l) -> last(head(l), tail(l))
, rev2(x, nil()) -> nil()
, rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..