interpretations
| Execution Time (secs) | - |
| Answer | TIMEOUT |
| Input | TCT 09 ma7 |
TIMEOUT
We are left with following problem, upon which TcT provides the
certificate TIMEOUT.
Strict Trs:
{ ite(tt(), u, v) -> u
, ite(ff(), u, v) -> v
, find(u, v, nil()) -> ff()
, find(u, v, cons(cons(u, v), E)) -> tt()
, find(u, v, cons(cons(u2, v2), E)) -> find(u, v, E)
, complete(u, nil(), E) -> tt()
, complete(u, cons(v, S), E) ->
ite(find(u, v, E), complete(u, S, E), ff())
, clique(nil(), E) -> tt()
, clique(cons(u, K), E) ->
ite(complete(u, K, E), clique(K, E), ff())
, choice(nil(), K, E) -> ite(clique(K, E), K, nil())
, choice(cons(u, S), K, E) -> choice(S, K, E)
, choice(cons(u, S), K, E) -> choice(S, cons(u, K), E) }
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:
{ ite(tt(), u, v) -> u
, ite(ff(), u, v) -> v
, find(u, v, nil()) -> ff()
, find(u, v, cons(cons(u, v), E)) -> tt()
, find(u, v, cons(cons(u2, v2), E)) -> find(u, v, E)
, complete(u, nil(), E) -> tt()
, complete(u, cons(v, S), E) ->
ite(find(u, v, E), complete(u, S, E), ff())
, clique(nil(), E) -> tt()
, clique(cons(u, K), E) ->
ite(complete(u, K, E), clique(K, E), ff())
, choice(nil(), K, E) -> ite(clique(K, E), K, nil())
, choice(cons(u, S), K, E) -> choice(S, cons(u, K), E)
, choice(cons(u, S), K, E) -> choice(S, K, E) }
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:
{ ite(tt(), u, v) -> u
, ite(ff(), u, v) -> v
, find(u, v, nil()) -> ff()
, find(u, v, cons(cons(u, v), E)) -> tt()
, find(u, v, cons(cons(u2, v2), E)) -> find(u, v, E)
, complete(u, nil(), E) -> tt()
, complete(u, cons(v, S), E) ->
ite(find(u, v, E), complete(u, S, E), ff())
, clique(nil(), E) -> tt()
, clique(cons(u, K), E) ->
ite(complete(u, K, E), clique(K, E), ff())
, choice(nil(), K, E) -> ite(clique(K, E), K, nil())
, choice(cons(u, S), K, E) -> choice(S, cons(u, K), E)
, choice(cons(u, S), K, E) -> choice(S, K, E) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
| Execution Time (secs) | 0.642 |
| Answer | MAYBE |
| Input | TCT 09 ma7 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ ite(tt(), u, v) -> u
, ite(ff(), u, v) -> v
, find(u, v, nil()) -> ff()
, find(u, v, cons(cons(u, v), E)) -> tt()
, find(u, v, cons(cons(u2, v2), E)) -> find(u, v, E)
, complete(u, nil(), E) -> tt()
, complete(u, cons(v, S), E) ->
ite(find(u, v, E), complete(u, S, E), ff())
, clique(nil(), E) -> tt()
, clique(cons(u, K), E) ->
ite(complete(u, K, E), clique(K, E), ff())
, choice(nil(), K, E) -> ite(clique(K, E), K, nil())
, choice(cons(u, S), K, E) -> choice(S, cons(u, K), E)
, choice(cons(u, S), K, E) -> choice(S, K, E) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
| Execution Time (secs) | 0.725 |
| Answer | MAYBE |
| Input | TCT 09 ma7 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ ite(tt(), u, v) -> u
, ite(ff(), u, v) -> v
, find(u, v, nil()) -> ff()
, find(u, v, cons(cons(u, v), E)) -> tt()
, find(u, v, cons(cons(u2, v2), E)) -> find(u, v, E)
, complete(u, nil(), E) -> tt()
, complete(u, cons(v, S), E) ->
ite(find(u, v, E), complete(u, S, E), ff())
, clique(nil(), E) -> tt()
, clique(cons(u, K), E) ->
ite(complete(u, K, E), clique(K, E), ff())
, choice(nil(), K, E) -> ite(clique(K, E), K, nil())
, choice(cons(u, S), K, E) -> choice(S, cons(u, K), E)
, choice(cons(u, S), K, E) -> choice(S, K, E) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..