Automated detection of contextuality proofs with intermediate numbers of observables

<div style=""&gt<font face="arial, helvetica"&gt<span style="font-size: 13px;"&gtQuantum contextuality takes an important place amongst the concepts of quantum computing that bring an advantage over its classical counterpart. For a large class of contextuality </span&gt</font&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtproofs, aka. observable-based proofs of the Kochen-Specker Theorem, we first formulate the</span&gt</div&gt<div style=""&gt<font face="arial, helvetica"&gt<span style="font-size: 13px;"&gtcontextuality property as the absence of solutions to a linear system. Then we explain why </span&gt</font&gt<span style="font-size: 13px; font-family: arial, helvetica…