interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ isEmpty(cons(x, xs)) -> false()
, isEmpty(nil()) -> true()
, isZero(0()) -> true()
, isZero(s(x)) -> false()
, head(cons(x, xs)) -> x
, tail(cons(x, xs)) -> xs
, tail(nil()) -> nil()
, p(0()) -> 0()
, p(s(0())) -> 0()
, p(s(s(x))) -> s(p(s(x)))
, inc(0()) -> s(0())
, inc(s(x)) -> s(inc(x))
, sumList(xs, y) ->
if(isEmpty(xs),
isZero(head(xs)),
y,
tail(xs),
cons(p(head(xs)), tail(xs)),
inc(y))
, if(false(), false(), y, xs, ys, x) -> sumList(ys, x)
, if(false(), true(), y, xs, ys, x) -> sumList(xs, y)
, if(true(), b, y, xs, ys, x) -> y
, sum(xs) -> sumList(xs, 0()) }
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:
{ isEmpty(cons(x, xs)) -> false()
, isEmpty(nil()) -> true()
, isZero(0()) -> true()
, isZero(s(x)) -> false()
, head(cons(x, xs)) -> x
, tail(cons(x, xs)) -> xs
, tail(nil()) -> nil()
, p(s(s(x))) -> s(p(s(x)))
, p(s(0())) -> 0()
, p(0()) -> 0()
, inc(s(x)) -> s(inc(x))
, inc(0()) -> s(0())
, sumList(xs, y) ->
if(isEmpty(xs),
isZero(head(xs)),
y,
tail(xs),
cons(p(head(xs)), tail(xs)),
inc(y))
, if(true(), b, y, xs, ys, x) -> y
, if(false(), true(), y, xs, ys, x) -> sumList(xs, y)
, if(false(), false(), y, xs, ys, x) -> sumList(ys, x)
, sum(xs) -> sumList(xs, 0()) }
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:
{ isEmpty(cons(x, xs)) -> false()
, isEmpty(nil()) -> true()
, isZero(0()) -> true()
, isZero(s(x)) -> false()
, head(cons(x, xs)) -> x
, tail(cons(x, xs)) -> xs
, tail(nil()) -> nil()
, p(s(s(x))) -> s(p(s(x)))
, p(s(0())) -> 0()
, p(0()) -> 0()
, inc(s(x)) -> s(inc(x))
, inc(0()) -> s(0())
, sumList(xs, y) ->
if(isEmpty(xs),
isZero(head(xs)),
y,
tail(xs),
cons(p(head(xs)), tail(xs)),
inc(y))
, if(true(), b, y, xs, ys, x) -> y
, if(false(), true(), y, xs, ys, x) -> sumList(xs, y)
, if(false(), false(), y, xs, ys, x) -> sumList(ys, x)
, sum(xs) -> sumList(xs, 0()) }
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:
{ isEmpty(cons(x, xs)) -> false()
, isEmpty(nil()) -> true()
, isZero(0()) -> true()
, isZero(s(x)) -> false()
, head(cons(x, xs)) -> x
, tail(cons(x, xs)) -> xs
, tail(nil()) -> nil()
, p(s(s(x))) -> s(p(s(x)))
, p(s(0())) -> 0()
, p(0()) -> 0()
, inc(s(x)) -> s(inc(x))
, inc(0()) -> s(0())
, sumList(xs, y) ->
if(isEmpty(xs),
isZero(head(xs)),
y,
tail(xs),
cons(p(head(xs)), tail(xs)),
inc(y))
, if(true(), b, y, xs, ys, x) -> y
, if(false(), true(), y, xs, ys, x) -> sumList(xs, y)
, if(false(), false(), y, xs, ys, x) -> sumList(ys, x)
, sum(xs) -> sumList(xs, 0()) }
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:
{ isEmpty(cons(x, xs)) -> false()
, isEmpty(nil()) -> true()
, isZero(0()) -> true()
, isZero(s(x)) -> false()
, head(cons(x, xs)) -> x
, tail(cons(x, xs)) -> xs
, tail(nil()) -> nil()
, p(s(s(x))) -> s(p(s(x)))
, p(s(0())) -> 0()
, p(0()) -> 0()
, inc(s(x)) -> s(inc(x))
, inc(0()) -> s(0())
, sumList(xs, y) ->
if(isEmpty(xs),
isZero(head(xs)),
y,
tail(xs),
cons(p(head(xs)), tail(xs)),
inc(y))
, if(true(), b, y, xs, ys, x) -> y
, if(false(), true(), y, xs, ys, x) -> sumList(xs, y)
, if(false(), false(), y, xs, ys, x) -> sumList(ys, x)
, sum(xs) -> sumList(xs, 0()) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..