An anvil problem reminds me of a cotrap in a petri net context. A petri net is a kind of diagram that looks like a graph, with little tokens moving around between nodes of the graph according to certain tiles. A cotrap is a graph node that, once a token leaves that node, it can never renter. (There are also traps, which are nodes that tokens can’t leave once they enter.) My analogy: “having at least one anvil” is a cotrap, because once you leave that state, you can’t get back into it. So if you’re looking for a new term, cotrap is what I would suggest.
An anvil problem reminds me of a cotrap in a petri net context. A petri net is a kind of diagram that looks like a graph, with little tokens moving around between nodes of the graph according to certain tiles. A cotrap is a graph node that, once a token leaves that node, it can never renter. (There are also traps, which are nodes that tokens can’t leave once they enter.) My analogy: “having at least one anvil” is a cotrap, because once you leave that state, you can’t get back into it. So if you’re looking for a new term, cotrap is what I would suggest.