interpretations
TIMEOUT
We are left with following problem, upon which TcT provides the
certificate TIMEOUT.
Strict Trs:
{ cond1(true(), x, y, z) -> cond2(gr(x, 0()), x, y, z)
, cond2(true(), x, y, z) -> cond1(gr(add(x, y), z), p(x), y, z)
, cond2(false(), x, y, z) -> cond3(gr(y, 0()), x, y, z)
, gr(0(), x) -> false()
, gr(s(x), 0()) -> true()
, gr(s(x), s(y)) -> gr(x, y)
, add(0(), x) -> x
, add(s(x), y) -> s(add(x, y))
, p(0()) -> 0()
, p(s(x)) -> x
, cond3(true(), x, y, z) -> cond1(gr(add(x, y), z), x, p(y), z)
, cond3(false(), x, y, z) -> cond1(gr(add(x, y), z), x, y, z) }
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:
{ cond1(true(), x, y, z) -> cond2(gr(x, 0()), x, y, z)
, cond2(true(), x, y, z) -> cond1(gr(add(x, y), z), p(x), y, z)
, cond2(false(), x, y, z) -> cond3(gr(y, 0()), x, y, z)
, cond3(true(), x, y, z) -> cond1(gr(add(x, y), z), x, p(y), z)
, cond3(false(), x, y, z) -> cond1(gr(add(x, y), z), x, y, z)
, gr(0(), x) -> false()
, gr(s(x), 0()) -> true()
, gr(s(x), s(y)) -> gr(x, y)
, add(0(), x) -> x
, add(s(x), y) -> s(add(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:
{ cond1(true(), x, y, z) -> cond2(gr(x, 0()), x, y, z)
, cond2(true(), x, y, z) -> cond1(gr(add(x, y), z), p(x), y, z)
, cond2(false(), x, y, z) -> cond3(gr(y, 0()), x, y, z)
, cond3(true(), x, y, z) -> cond1(gr(add(x, y), z), x, p(y), z)
, cond3(false(), x, y, z) -> cond1(gr(add(x, y), z), x, y, z)
, gr(0(), x) -> false()
, gr(s(x), 0()) -> true()
, gr(s(x), s(y)) -> gr(x, y)
, add(0(), x) -> x
, add(s(x), y) -> s(add(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:
{ cond1(true(), x, y, z) -> cond2(gr(x, 0()), x, y, z)
, cond2(true(), x, y, z) -> cond1(gr(add(x, y), z), p(x), y, z)
, cond2(false(), x, y, z) -> cond3(gr(y, 0()), x, y, z)
, cond3(true(), x, y, z) -> cond1(gr(add(x, y), z), x, p(y), z)
, cond3(false(), x, y, z) -> cond1(gr(add(x, y), z), x, y, z)
, gr(0(), x) -> false()
, gr(s(x), 0()) -> true()
, gr(s(x), s(y)) -> gr(x, y)
, add(0(), x) -> x
, add(s(x), y) -> s(add(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:
{ cond1(true(), x, y, z) -> cond2(gr(x, 0()), x, y, z)
, cond2(true(), x, y, z) -> cond1(gr(add(x, y), z), p(x), y, z)
, cond2(false(), x, y, z) -> cond3(gr(y, 0()), x, y, z)
, cond3(true(), x, y, z) -> cond1(gr(add(x, y), z), x, p(y), z)
, cond3(false(), x, y, z) -> cond1(gr(add(x, y), z), x, y, z)
, gr(0(), x) -> false()
, gr(s(x), 0()) -> true()
, gr(s(x), s(y)) -> gr(x, y)
, add(0(), x) -> x
, add(s(x), y) -> s(add(x, y))
, p(0()) -> 0()
, p(s(x)) -> x }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..