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