Lemma 3: pairs (s,t) tested for m<=8: 87380; violations: 0
Lemma 4: words tested (k<=5, |tau|<=2, n in (-2, -1, 1, 2)): 3368420; trivial: 754; trivial without trivial proper prefix P_i: 0
Lemma Z: configurations tested (k<=5, d<= {1: 6, 2: 5, 3: 4, 4: 3, 5: 2, 6: 1}, n_j in +-1,+-2, n_k in -2..2): 72530; non-zero spaces: 0
Lemma Z controls (hypothesis n_j != 0 for j<k violated, or satisfied for (1,2,1),[1,-1,0]): [((1, 1), [0, 0], 1), ((2, 2), [0, 1], 0), ((1, 1, 1, 1), [1, 0, -1, 0], 1), ((1, 2, 1), [1, -1, 0], 0), ((1, 1, 1, 1), [0, 1, 0, -1], 1), ((2, 1, 1), [0, 0, 0], 1)]
Lemma 1(a)/B, m=2: Catalan=1 rank{T_q}=1 dim I_m(mod p upper bound)=1 T_q invariant=True; Lemma B: pairings=1 with dim != 1: 0
Lemma 1(a)/B, m=4: Catalan=2 rank{T_q}=2 dim I_m(mod p upper bound)=2 T_q invariant=True; Lemma B: pairings=2 with dim != 1: 0
Lemma 1(a)/B, m=6: Catalan=5 rank{T_q}=5 dim I_m(mod p upper bound)=5 T_q invariant=True; Lemma B: pairings=5 with dim != 1: 0
Lemma 1(a)/B, m=8: Catalan=14 rank{T_q}=14 dim I_m(mod p upper bound)=14 T_q invariant=True; Lemma B: pairings=14 with dim != 1: 0
Lemma 1(a)/B, m=10: Catalan=42 rank{T_q}=42 dim I_m(mod p upper bound)=42 T_q invariant=True; Lemma B: pairings=42 with dim != 1: 0
[5.5s]
