interpretations
Execution Time (secs) | - |
Answer | TIMEOUT |
Input | TCT 09 lcs |
TIMEOUT
We are left with following problem, upon which TcT provides the
certificate TIMEOUT.
Strict Trs:
{ lcs(x, e()) -> 0()
, lcs(e(), y) -> 0()
, lcs(a(x), a(y)) -> s(lcs(x, y))
, lcs(a(x), b(y)) -> max(lcs(x, b(y)), lcs(a(x), y))
, lcs(b(x), a(y)) -> max(lcs(x, a(y)), lcs(b(x), y))
, lcs(b(x), b(y)) -> s(lcs(x, y))
, max(x, 0()) -> 0()
, max(0(), y) -> 0()
, max(s(x), s(y)) -> max(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:
{ lcs(e(), y) -> 0()
, lcs(x, e()) -> 0()
, lcs(a(x), a(y)) -> s(lcs(x, y))
, lcs(b(x), b(y)) -> s(lcs(x, y))
, lcs(a(x), b(y)) -> max(lcs(x, b(y)), lcs(a(x), y))
, lcs(b(x), a(y)) -> max(lcs(x, a(y)), lcs(b(x), y))
, max(x, 0()) -> 0()
, max(0(), y) -> 0()
, max(s(x), s(y)) -> max(x, y) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
Execution Time (secs) | - |
Answer | YES(?,PRIMREC) |
Input | TCT 09 lcs |
YES(?,PRIMREC)
We are left with following problem, upon which TcT provides the
certificate YES(?,PRIMREC).
Strict Trs:
{ lcs(e(), y) -> 0()
, lcs(x, e()) -> 0()
, lcs(a(x), a(y)) -> s(lcs(x, y))
, lcs(b(x), b(y)) -> s(lcs(x, y))
, lcs(a(x), b(y)) -> max(lcs(x, b(y)), lcs(a(x), y))
, lcs(b(x), a(y)) -> max(lcs(x, a(y)), lcs(b(x), y))
, max(x, 0()) -> 0()
, max(0(), y) -> 0()
, max(s(x), s(y)) -> max(x, y) }
Obligation:
innermost runtime complexity
Answer:
YES(?,PRIMREC)
The input was oriented with the instance of'multiset path orders'
as induced by the precedence
lcs > 0, lcs > s, lcs > max .
Hurray, we answered YES(?,PRIMREC)
popstar
Execution Time (secs) | 0.406 |
Answer | MAYBE |
Input | TCT 09 lcs |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ lcs(e(), y) -> 0()
, lcs(x, e()) -> 0()
, lcs(a(x), a(y)) -> s(lcs(x, y))
, lcs(b(x), b(y)) -> s(lcs(x, y))
, lcs(a(x), b(y)) -> max(lcs(x, b(y)), lcs(a(x), y))
, lcs(b(x), a(y)) -> max(lcs(x, a(y)), lcs(b(x), y))
, max(x, 0()) -> 0()
, max(0(), y) -> 0()
, max(s(x), s(y)) -> max(x, y) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
Execution Time (secs) | 0.329 |
Answer | MAYBE |
Input | TCT 09 lcs |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ lcs(e(), y) -> 0()
, lcs(x, e()) -> 0()
, lcs(a(x), a(y)) -> s(lcs(x, y))
, lcs(b(x), b(y)) -> s(lcs(x, y))
, lcs(a(x), b(y)) -> max(lcs(x, b(y)), lcs(a(x), y))
, lcs(b(x), a(y)) -> max(lcs(x, a(y)), lcs(b(x), y))
, max(x, 0()) -> 0()
, max(0(), y) -> 0()
, max(s(x), s(y)) -> max(x, y) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..