interpretations
Execution Time (secs) | - |
Answer | TIMEOUT |
Input | AG01 3.48 |
TIMEOUT
We are left with following problem, upon which TcT provides the
certificate TIMEOUT.
Strict Trs:
{ f(0()) -> true()
, f(1()) -> false()
, f(s(x)) -> f(x)
, if(true(), s(x), s(y)) -> s(x)
, if(false(), s(x), s(y)) -> s(y)
, g(x, c(y)) -> g(x, if(f(x), c(g(s(x), y)), c(y)))
, g(x, c(y)) -> c(g(x, y)) }
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.48 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(0()) -> true()
, f(1()) -> false()
, f(s(x)) -> f(x)
, if(true(), s(x), s(y)) -> s(x)
, if(false(), s(x), s(y)) -> s(y)
, g(x, c(y)) -> c(g(x, y))
, g(x, c(y)) -> g(x, if(f(x), c(g(s(x), y)), c(y))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
Execution Time (secs) | - |
Answer | MAYBE |
Input | AG01 3.48 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(0()) -> true()
, f(1()) -> false()
, f(s(x)) -> f(x)
, if(true(), s(x), s(y)) -> s(x)
, if(false(), s(x), s(y)) -> s(y)
, g(x, c(y)) -> c(g(x, y))
, g(x, c(y)) -> g(x, if(f(x), c(g(s(x), y)), c(y))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
Execution Time (secs) | 0.178 |
Answer | MAYBE |
Input | AG01 3.48 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(0()) -> true()
, f(1()) -> false()
, f(s(x)) -> f(x)
, if(true(), s(x), s(y)) -> s(x)
, if(false(), s(x), s(y)) -> s(y)
, g(x, c(y)) -> c(g(x, y))
, g(x, c(y)) -> g(x, if(f(x), c(g(s(x), y)), c(y))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
Execution Time (secs) | 0.149 |
Answer | MAYBE |
Input | AG01 3.48 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(0()) -> true()
, f(1()) -> false()
, f(s(x)) -> f(x)
, if(true(), s(x), s(y)) -> s(x)
, if(false(), s(x), s(y)) -> s(y)
, g(x, c(y)) -> c(g(x, y))
, g(x, c(y)) -> g(x, if(f(x), c(g(s(x), y)), c(y))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..