interpretations
TIMEOUT
We are left with following problem, upon which TcT provides the
certificate TIMEOUT.
Strict Trs:
{ cond(true(), x, y) ->
cond(and(gr(x, 0()), gr(y, 0())), p(x), p(y))
, and(x, false()) -> false()
, and(true(), true()) -> true()
, and(false(), x) -> false()
, gr(0(), x) -> false()
, gr(0(), 0()) -> false()
, gr(s(x), 0()) -> true()
, gr(s(x), s(y)) -> gr(x, y)
, p(0()) -> 0()
, p(s(x)) -> x }
Obligation:
innermost runtime complexity
Answer:
TIMEOUT
Computation stopped due to timeout after 20.0 seconds.
Arrrr..
lmpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ cond(true(), x, y) ->
cond(and(gr(x, 0()), gr(y, 0())), p(x), p(y))
, and(true(), true()) -> true()
, and(x, false()) -> false()
, and(false(), x) -> false()
, gr(0(), 0()) -> false()
, gr(0(), x) -> false()
, gr(s(x), 0()) -> true()
, gr(s(x), s(y)) -> gr(x, y)
, p(0()) -> 0()
, p(s(x)) -> x }
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:
{ cond(true(), x, y) ->
cond(and(gr(x, 0()), gr(y, 0())), p(x), p(y))
, and(true(), true()) -> true()
, and(x, false()) -> false()
, and(false(), x) -> false()
, gr(0(), 0()) -> false()
, gr(0(), x) -> false()
, gr(s(x), 0()) -> true()
, gr(s(x), s(y)) -> gr(x, y)
, p(0()) -> 0()
, p(s(x)) -> x }
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:
{ cond(true(), x, y) ->
cond(and(gr(x, 0()), gr(y, 0())), p(x), p(y))
, and(true(), true()) -> true()
, and(x, false()) -> false()
, and(false(), x) -> false()
, gr(0(), 0()) -> false()
, gr(0(), x) -> false()
, gr(s(x), 0()) -> true()
, gr(s(x), s(y)) -> gr(x, y)
, p(0()) -> 0()
, p(s(x)) -> x }
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:
{ cond(true(), x, y) ->
cond(and(gr(x, 0()), gr(y, 0())), p(x), p(y))
, and(true(), true()) -> true()
, and(x, false()) -> false()
, and(false(), x) -> false()
, gr(0(), 0()) -> false()
, gr(0(), x) -> false()
, gr(s(x), 0()) -> true()
, gr(s(x), s(y)) -> gr(x, y)
, p(0()) -> 0()
, p(s(x)) -> x }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..