A Circuit Chasing Technique in a Distance-regular Graph with Triangles

We give an example of circuit chasing on a distance-regular graph which has triangle. In particular, we show that the number of columns (ci, ai, bi) = (2, 2a, e) in the intersection array of a distance-regular graph is at most 1, if all the preceding columns are (1, a, b).