interpretations
| Execution Time (secs) | - |
| Answer | TIMEOUT |
| Input | AG01 3.13 |
TIMEOUT
We are left with following problem, upon which TcT provides the
certificate TIMEOUT.
Strict Trs:
{ eq(0(), 0()) -> true()
, eq(0(), s(x)) -> false()
, eq(s(x), 0()) -> false()
, eq(s(x), s(y)) -> eq(x, y)
, or(true(), y) -> true()
, or(false(), y) -> y
, union(empty(), h) -> h
, union(edge(x, y, i), h) -> edge(x, y, union(i, h))
, reach(x, y, empty(), h) -> false()
, reach(x, y, edge(u, v, i), h) ->
if_reach_1(eq(x, u), x, y, edge(u, v, i), h)
, if_reach_1(true(), x, y, edge(u, v, i), h) ->
if_reach_2(eq(y, v), x, y, edge(u, v, i), h)
, if_reach_1(false(), x, y, edge(u, v, i), h) ->
reach(x, y, i, edge(u, v, h))
, if_reach_2(true(), x, y, edge(u, v, i), h) -> true()
, if_reach_2(false(), x, y, edge(u, v, i), h) ->
or(reach(x, y, i, h), reach(v, y, union(i, h), empty())) }
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.13 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ eq(0(), 0()) -> true()
, eq(0(), s(x)) -> false()
, eq(s(x), 0()) -> false()
, eq(s(x), s(y)) -> eq(x, y)
, or(true(), y) -> true()
, or(false(), y) -> y
, union(empty(), h) -> h
, union(edge(x, y, i), h) -> edge(x, y, union(i, h))
, reach(x, y, empty(), h) -> false()
, reach(x, y, edge(u, v, i), h) ->
if_reach_1(eq(x, u), x, y, edge(u, v, i), h)
, if_reach_1(true(), x, y, edge(u, v, i), h) ->
if_reach_2(eq(y, v), x, y, edge(u, v, i), h)
, if_reach_2(true(), x, y, edge(u, v, i), h) -> true()
, if_reach_2(false(), x, y, edge(u, v, i), h) ->
or(reach(x, y, i, h), reach(v, y, union(i, h), empty()))
, if_reach_1(false(), x, y, edge(u, v, i), h) ->
reach(x, y, i, edge(u, v, h)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
| Execution Time (secs) | - |
| Answer | MAYBE |
| Input | AG01 3.13 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ eq(0(), 0()) -> true()
, eq(0(), s(x)) -> false()
, eq(s(x), 0()) -> false()
, eq(s(x), s(y)) -> eq(x, y)
, or(true(), y) -> true()
, or(false(), y) -> y
, union(empty(), h) -> h
, union(edge(x, y, i), h) -> edge(x, y, union(i, h))
, reach(x, y, empty(), h) -> false()
, reach(x, y, edge(u, v, i), h) ->
if_reach_1(eq(x, u), x, y, edge(u, v, i), h)
, if_reach_1(true(), x, y, edge(u, v, i), h) ->
if_reach_2(eq(y, v), x, y, edge(u, v, i), h)
, if_reach_2(true(), x, y, edge(u, v, i), h) -> true()
, if_reach_2(false(), x, y, edge(u, v, i), h) ->
or(reach(x, y, i, h), reach(v, y, union(i, h), empty()))
, if_reach_1(false(), x, y, edge(u, v, i), h) ->
reach(x, y, i, edge(u, v, h)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
| Execution Time (secs) | 0.956 |
| Answer | MAYBE |
| Input | AG01 3.13 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ eq(0(), 0()) -> true()
, eq(0(), s(x)) -> false()
, eq(s(x), 0()) -> false()
, eq(s(x), s(y)) -> eq(x, y)
, or(true(), y) -> true()
, or(false(), y) -> y
, union(empty(), h) -> h
, union(edge(x, y, i), h) -> edge(x, y, union(i, h))
, reach(x, y, empty(), h) -> false()
, reach(x, y, edge(u, v, i), h) ->
if_reach_1(eq(x, u), x, y, edge(u, v, i), h)
, if_reach_1(true(), x, y, edge(u, v, i), h) ->
if_reach_2(eq(y, v), x, y, edge(u, v, i), h)
, if_reach_2(true(), x, y, edge(u, v, i), h) -> true()
, if_reach_2(false(), x, y, edge(u, v, i), h) ->
or(reach(x, y, i, h), reach(v, y, union(i, h), empty()))
, if_reach_1(false(), x, y, edge(u, v, i), h) ->
reach(x, y, i, edge(u, v, h)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
| Execution Time (secs) | 0.848 |
| Answer | MAYBE |
| Input | AG01 3.13 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ eq(0(), 0()) -> true()
, eq(0(), s(x)) -> false()
, eq(s(x), 0()) -> false()
, eq(s(x), s(y)) -> eq(x, y)
, or(true(), y) -> true()
, or(false(), y) -> y
, union(empty(), h) -> h
, union(edge(x, y, i), h) -> edge(x, y, union(i, h))
, reach(x, y, empty(), h) -> false()
, reach(x, y, edge(u, v, i), h) ->
if_reach_1(eq(x, u), x, y, edge(u, v, i), h)
, if_reach_1(true(), x, y, edge(u, v, i), h) ->
if_reach_2(eq(y, v), x, y, edge(u, v, i), h)
, if_reach_2(true(), x, y, edge(u, v, i), h) -> true()
, if_reach_2(false(), x, y, edge(u, v, i), h) ->
or(reach(x, y, i, h), reach(v, y, union(i, h), empty()))
, if_reach_1(false(), x, y, edge(u, v, i), h) ->
reach(x, y, i, edge(u, v, h)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..