B1     relations on at most 4 points: 66067
B2     powers (F_j)^m, 1 <= j <= 30, 1 <= m <= 31: 930 cases
B3     K on the window 0..30: 991 pairs; no pair (0, c_n)
B4     Step 3: 30 direct cases; 65536 pairs (tau, sigma) of maps on {1..4} (window 0..10)
B5     Remark 5.3: S(F_j) for 1 <= j <= 30; S_1 variant
B6     Remark 5.4: 4000 random exact cases; 40 values of delta
elapsed 3.8 s
RESULT: all checks of part B passed
