interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ is_empty(nil()) -> true()
, is_empty(cons(x, l)) -> false()
, hd(cons(x, l)) -> x
, tl(cons(x, l)) -> l
, append(l1, l2) -> ifappend(l1, l2, is_empty(l1))
, ifappend(l1, l2, true()) -> l2
, ifappend(l1, l2, false()) -> cons(hd(l1), append(tl(l1), l2)) }
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) 'matrix interpretation of dimension 1' failed due to the
following reason:
The input cannot be shown compatible
4) 'custom shape polynomial interpretation' 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:
{ is_empty(nil()) -> true()
, is_empty(cons(x, l)) -> false()
, hd(cons(x, l)) -> x
, tl(cons(x, l)) -> l
, append(l1, l2) -> ifappend(l1, l2, is_empty(l1))
, ifappend(l1, l2, true()) -> l2
, ifappend(l1, l2, false()) -> cons(hd(l1), append(tl(l1), l2)) }
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:
{ is_empty(nil()) -> true()
, is_empty(cons(x, l)) -> false()
, hd(cons(x, l)) -> x
, tl(cons(x, l)) -> l
, append(l1, l2) -> ifappend(l1, l2, is_empty(l1))
, ifappend(l1, l2, true()) -> l2
, ifappend(l1, l2, false()) -> cons(hd(l1), append(tl(l1), l2)) }
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:
{ is_empty(nil()) -> true()
, is_empty(cons(x, l)) -> false()
, hd(cons(x, l)) -> x
, tl(cons(x, l)) -> l
, append(l1, l2) -> ifappend(l1, l2, is_empty(l1))
, ifappend(l1, l2, true()) -> l2
, ifappend(l1, l2, false()) -> cons(hd(l1), append(tl(l1), l2)) }
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:
{ is_empty(nil()) -> true()
, is_empty(cons(x, l)) -> false()
, hd(cons(x, l)) -> x
, tl(cons(x, l)) -> l
, append(l1, l2) -> ifappend(l1, l2, is_empty(l1))
, ifappend(l1, l2, true()) -> l2
, ifappend(l1, l2, false()) -> cons(hd(l1), append(tl(l1), l2)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..