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