The terminal set existence conjecture

Let $G$ be a graph. A terminal set is a set of vertices that is in general position and cannot be enlarged by adding another vertex while remaining in general position.

Terminal set existence conjecture. Every graph has a terminal set.

Terminal sets are used in the study of lower general position sets. The claim has been verified computationally for all graphs of order at most eleven, but remains open for arbitrary graphs.