Assertion list for term "contain at most two cycles".
Results from Ascent++: 1
connected graph (subgroup of graph) → CapableOf → contain at most two cycles 0.84