On the Subject of Wire Sequences
JavaScript (ES6),  75 74  67 bytes
Expects a list of [color, label] pairs, using 0-2 for both. Returns a binary array describing which wires must be cut.
a=&gt;a.map(([c,w])=&gt;(m[c]/=8)&gt;&gt;w&amp;1,m=[334844576,228136272,611931512])

Try it online!
63 bytes
We can save a few bytes by taking A=1, B=2, C=4 and returning a list of zero / non-zero values.
a=&gt;a.map(([c,w])=&gt;w&amp;=m[c]/=8,m=[334844576,228136272,611931512])

Try it online!
How?
Each color is encoded as a bit mask describing the wire labels for the 1st to the 9th appearance.
 #     |  9   8   7   6   5   4   3   2   1  (0)
 Label | CBA CBA CBA CBA CBA CBA CBA CBA CBA ---
-------+-----------------------------------------
 Red   | 010 011 111 101 010 101 001 010 100 000 -&gt; 334844576
 Blue  | 001 101 100 110 010 001 010 101 010 000 -&gt; 228136272
 Black | 100 100 011 110 010 101 010 101 111 000 -&gt; 611931512

Whenever a color appears, we right-shift the corresponding bit mask by 3 positions (by dividing it by 8) and we test the bit 0, 1 or 2 according to the label.