
theorem
for n being Nat
 ex R being finite RelStr st stability# R = 2 & cliquecover# R > n
proof
 let n be Nat;
 set R = Mycielskian n;
  n+1+1 > n+1 & n+1 > n by NAT_1:13;
  then n+2 > n by XXREAL_0:2;
 then A1: clique# R = 2 & chromatic# R > n by Th50;
 take S = ComplRelStr R;
 thus stability# S = 2 by A1,Th23;
 thus cliquecover# S > n by A1,Th29;
end;
