interpretations
Execution Time (secs) | - |
Answer | TIMEOUT |
Input | AG01 3.8a |
TIMEOUT
We are left with following problem, upon which TcT provides the
certificate TIMEOUT.
Strict Trs:
{ pred(s(x)) -> x
, minus(x, s(y)) -> pred(minus(x, y))
, minus(x, 0()) -> x
, quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
, quot(0(), s(y)) -> 0()
, log(s(s(x))) -> s(log(s(quot(x, s(s(0()))))))
, log(s(0())) -> 0() }
Obligation:
innermost runtime complexity
Answer:
TIMEOUT
Computation stopped due to timeout after 20.0 seconds.
Arrrr..
lmpo
Execution Time (secs) | - |
Answer | MAYBE |
Input | AG01 3.8a |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ pred(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> pred(minus(x, y))
, quot(0(), s(y)) -> 0()
, quot(s(x), s(y)) -> s(quot(minus(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
Execution Time (secs) | - |
Answer | MAYBE |
Input | AG01 3.8a |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ pred(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> pred(minus(x, y))
, quot(0(), s(y)) -> 0()
, quot(s(x), s(y)) -> s(quot(minus(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
Execution Time (secs) | 0.225 |
Answer | MAYBE |
Input | AG01 3.8a |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ pred(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> pred(minus(x, y))
, quot(0(), s(y)) -> 0()
, quot(s(x), s(y)) -> s(quot(minus(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
Execution Time (secs) | 0.235 |
Answer | MAYBE |
Input | AG01 3.8a |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ pred(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> pred(minus(x, y))
, quot(0(), s(y)) -> 0()
, quot(s(x), s(y)) -> s(quot(minus(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..