failsWhen
P8788
predicate
Indicates that a particular action, process, or condition does not succeed under the specified circumstances or triggers.
All labels observed (13)
| Label | Occurrences |
|---|---|
| failsWhen canonical | 21 |
| failureCondition | 18 |
| failsFor | 12 |
| failsAt | 9 |
| mayFailWhen | 6 |
| failsIn | 5 |
| canFailWhen | 4 |
| falseWhen | 3 |
| throwsOn | 3 |
| failsInDimension | 1 |
| failsToIntegrate | 1 |
| failsWithout | 1 |
| mayFailIn | 1 |
Description generation (PDg)
The one-sentence description above was generated by prompting gpt-5.1 with the predicate name and this instruction.
Instruction
Given a predicate that represents a relationship or action between entities, generate a one-sentence description explaining its meaning. # Instructions Focus on describing the relationship, not the entities themselves. # Response Format Begin the description with \' Indicates...\'
Input
Predicate: failsWhen
Generated description
Indicates that a particular action, process, or condition does not succeed under the specified circumstances or triggers.
Sample triples (85)
| Subject | Object |
|---|---|
| Breakout | ball passes the paddle and is lost via predicate surface "failureCondition" ⓘ |
| Sir Andrew Aguecheek | wooing Olivia via predicate surface "failsAt" ⓘ |
| Wilson's theorem | composite numbers n > 4 via predicate surface "failsFor" ⓘ |
| Lucas Burch | accepting paternal responsibility via predicate surface "failsAt" ⓘ |
| Pontryagin duality | non-abelian locally compact groups in its classical form via predicate surface "failsFor" ⓘ |
| LoadLibrary | specified DLL not found via predicate surface "failureCondition" ⓘ |
| LoadLibrary | specified DLL is not a valid Win32 application via predicate surface "failureCondition" ⓘ |
| LoadLibrary | dependency DLL missing via predicate surface "failureCondition" ⓘ |
| LoadLibrary | insufficient memory via predicate surface "failureCondition" ⓘ |
| LoadLibrary | insufficient address space via predicate surface "failureCondition" ⓘ |
| SetEnvironmentVariable | lpName is NULL ⓘ |
| SetEnvironmentVariable | lpName is empty string ⓘ |
| SetEnvironmentVariable | lpName contains '=' character ⓘ |
| WSAEventSelect | WSANOTINITIALISED if WSAStartup not called via predicate surface "failureCondition" ⓘ |
| WSAEventSelect | WSAENETDOWN if network subsystem failed via predicate surface "failureCondition" ⓘ |
| WSAEventSelect | WSAENOTSOCK if descriptor is not a socket via predicate surface "failureCondition" ⓘ |
| WSAEventSelect | WSAEINVAL for invalid parameters via predicate surface "failureCondition" ⓘ |
| WSAEventSelect | WSAEINPROGRESS if a blocking Winsock call is in progress via predicate surface "failureCondition" ⓘ |
| WSAEventSelect | WSAENOBUFS if no buffer space is available via predicate surface "failureCondition" ⓘ |
| WSAEventSelect | WSAENOTSUP if operation not supported via predicate surface "failureCondition" ⓘ |
| Owen Warland | conforming to practical expectations via predicate surface "failsAt" ⓘ |
|
Professor Hinkle in Frosty the Snowman (1969 TV special)
surface form:
Professor Hinkle
|
performing competent magic via predicate surface "failsAt" ⓘ |
| Cauchy completeness | rational numbers with the usual metric via predicate surface "failsFor" ⓘ |
| United States military (fictional) | preventing the spread of Captain Trips via predicate surface "failsAt" ⓘ |
| Bellman–Ford algorithm | negative cycle is present and distances are considered finite ⓘ |
|
Tubular is known for heavy Balloon power-up use
surface form:
Tubular
|
balloon timer expiring over hazards via predicate surface "failureCondition" ⓘ |
| Dijkstra's shortest path algorithm | graph has negative weight cycle ⓘ |
| Dijkstra's shortest path algorithm | graph has negative edge weights ⓘ |
| T1 separation axiom | indiscrete topology on a set with more than one point via predicate surface "failsIn" ⓘ |
| Green’s conjecture | hyperelliptic curves in its naive form via predicate surface "failsFor" ⓘ |
| Robinson unification algorithm | occurs check detects cyclic substitution ⓘ |
| Robinson unification algorithm | function symbols at same position differ ⓘ |
| Maschke’s theorem | field characteristic divides the group order ⓘ |
| Mythic+ dungeons | keystone depletes if not timed via predicate surface "failureCondition" ⓘ |
| Mythic+ dungeons | no keystone upgrade if timer not met via predicate surface "failureCondition" ⓘ |