Maximum Independent Set
Given a graph, find the largest set of vertices such that no two selected vertices share an edge.
The number of possible selections grows combinatorially. QOBLIB uses unweighted MIS as one of its external optimization benchmark classes.
This tests whether CREAIM can produce valid benchmark solutions under an external problem definition and checker, rather than only on an internal demo.