Running ../bin/automata through test files g0 to g20.
Format 2.2
#testing g0
Format 2.2
Format 2.2
	# The language of WA is non-empty.
	# M(0) = the diagonal of WA.
	# Automata pass axiom checks.
#testing g1
Format 2.2
Format 2.2
	# The language of WA is non-empty.
	# M(0) = the diagonal of WA.
	# M(a) is transpose to M(A).
	# M(a*A) = M(0).
	# M(A*a) = M(0).
	# Automata pass axiom checks.
#testing g2
Format 2.2
Format 2.2
	# The language of WA is non-empty.
	# M(0) = the diagonal of WA.
	# M(a) is transpose to M(a).
	# M(a*a) = M(0).
	# Automata pass axiom checks.
#testing g3
Format 2.2
Format 2.2
	# The language of WA is non-empty.
	# M(0) = the diagonal of WA.
	# M(a) is transpose to M(a).
	# M(a*a) = M(0).
	# Automata pass axiom checks.
#testing g4
Format 2.2
Format 2.2
	# The language of WA is non-empty.
	# M(0) = the diagonal of WA.
	# Automata pass axiom checks.
#testing g5
Format 2.2
Format 2.2
	# The language of WA is non-empty.
	# M(0) = the diagonal of WA.
	# M(a) is transpose to M(A).
	# M(b) is transpose to M(B).
	# M(c) is transpose to M(C).
	# M(a*A) = M(0).
	# M(b*B) = M(0).
	# M(c*C) = M(0).
	# M(A*a) = M(0).
	# M(B*b) = M(0).
	# M(C*c) = M(0).
	# M(a*b*A) is  M(b*b), so  M(a*b*A*B*B) = M(0).
	# M(b*c*B) is  M(c*c), so  M(b*c*B*C*C) = M(0).
	# M(c*a*C) is  M(a*a), so  M(c*a*C*A*A) = M(0).
	# Automata pass axiom checks.
#testing g6
Format 2.2
Format 2.2
	# The language of WA is non-empty.
	# M(0) = the diagonal of WA.
	# M(a) is transpose to M(A).
	# M(b) is transpose to M(B).
	# M(d) is transpose to M(D).
	# M(a*A) = M(0).
	# M(b*B) = M(0).
	# M(d*D) = M(0).
	# M(A*a) = M(0).
	# M(B*b) = M(0).
	# M(D*d) = M(0).
	# M(a*b) is  M(d), so  M(a*b*D) = M(0).
	# Automata pass axiom checks.
#testing g7
Format 2.2
Format 2.2
	# The language of WA is non-empty.
	# M(0) = the diagonal of WA.
	# M(a) is transpose to M(a^-1).
	# M(a*a^-1) = M(0).
	# M(a^-1*a) = M(0).
	# M(a*a*a*a*a*a) is  M(a^-1*a^-1*a^-1*a^-1*a^-1), so  M(a*a*a*a*a*a*a*a*a*a*a) = M(0).
	# Automata pass axiom checks.
#testing g8
Format 2.2
Format 2.2
	# The language of WA is non-empty.
	# M(0) = the diagonal of WA.
	# M(a) is transpose to M(a).
	# M(b) is transpose to M(B).
	# M(a*a) = M(0).
	# M(b*B) = M(0).
	# M(B*b) = M(0).
	# M(b*b) is  M(B), so  M(b*b*b) = M(0).
	# M(a*b*a*b*a) is  M(B*a*B*a*B), so  M(a*b*a*b*a*b*a*b*a*b) = M(0).
	# Automata pass axiom checks.
#testing g9
Format 2.2
Format 2.2
	# The language of WA is non-empty.
	# M(0) = the diagonal of WA.
	# M(a) is transpose to M(A).
	# M(b) is transpose to M(B).
	# M(a*A) = M(0).
	# M(A*a) = M(0).
	# M(b*B) = M(0).
	# M(B*b) = M(0).
	# M(a*b) is  M(b*a), so  M(a*b*A*B) = M(0).
	# Automata pass axiom checks.
#testing g10
Format 2.2
Format 2.2
	# The language of WA is non-empty.
	# M(0) = the diagonal of WA.
	# M(a) is transpose to M(A).
	# M(b) is transpose to M(B).
	# M(a*A) = M(0).
	# M(b*B) = M(0).
	# M(A*a) = M(0).
	# M(B*b) = M(0).
	# M(a*b) is  M(b*a), so  M(a*b*A*B) = M(0).
	# Automata pass axiom checks.
#testing g11
Format 2.2
Format 2.2
	# The language of WA is non-empty.
	# M(0) = the diagonal of WA.
	# M(a) is transpose to M(a).
	# M(b) is transpose to M(b).
	# M(a*a) = M(0).
	# M(b*b) = M(0).
	# Automata pass axiom checks.
#testing g12
Format 2.2
Format 2.2
	# The language of WA is non-empty.
	# M(0) = the diagonal of WA.
	# M(a) is transpose to M(A).
	# M(b) is transpose to M(B).
	# M(a*A) = M(0).
	# M(A*a) = M(0).
	# M(b*B) = M(0).
	# M(B*b) = M(0).
	# M(b*a*b) is  M(a*b*a), so  M(b*a*b*A*B*A) = M(0).
	# Automata pass axiom checks.
#testing g13
Format 2.2
#Equality automaton was not diagonal - doubling KBtreesize
#diff1 file was unchanged - doubling KBtreesize again
#diff1 file was unchanged - doubling KBtreesize again
#g13.diff1 g13.diff1o differ: char 138, line 4
Format 2.2
	# The language of WA is non-empty.
	# M(0) = the diagonal of WA.
	# M(a) is transpose to M(A).
	# M(b) is transpose to M(B).
	# M(a*A) = M(0).
	# M(A*a) = M(0).
	# M(b*B) = M(0).
	# M(B*b) = M(0).
	# M(a*a) is  M(A), so  M(a*a*a) = M(0).
	# M(a*b) is  M(B*A), so  M(a*b*a*b) = M(0).
	# M(b*b*b*b) is  M(B*B*B), so  M(b*b*b*b*b*b*b) = M(0).
	# Automata pass axiom checks.
#testing g14
Format 2.2
Format 2.2
	# The language of WA is non-empty.
	# M(0) = the diagonal of WA.
	# M(a) is transpose to M(A).
	# M(b) is transpose to M(B).
	# M(x) is transpose to M(X).
	# M(a*A) = M(0).
	# M(A*a) = M(0).
	# M(b*B) = M(0).
	# M(B*b) = M(0).
	# M(x*X) = M(0).
	# M(X*x) = M(0).
	# M(a*b*A) is  M(X*X*b), so  M(a*b*A*B*x*x) = M(0).
	# Automata pass axiom checks.
#testing g15
Format 2.2
#done a copy
Format 2.2
	# The language of WA is non-empty.
	# M(0) = the diagonal of WA.
	# M(a) is transpose to M(A).
	# M(b) is transpose to M(B).
	# M(z) is transpose to M(z).
	# M(a*A) = M(0).
	# M(A*a) = M(0).
	# M(b*B) = M(0).
	# M(B*b) = M(0).
	# M(z*z) = M(0).
	# M(a*B) is  M(b*A), so  M(a*B*a*B) = M(0).
	# M(a*z) is  M(z*A), so  M(a*z*a*z) = M(0).
	# M(b*z) is  M(z*B), so  M(b*z*b*z) = M(0).
	# M(a*b*z*a) is  M(b*b*A), so  M(a*b*z*a*a*B*B) = M(0).
	# Automata pass axiom checks.
#testing g16
Format 2.2
#done a copy
#done a copy
Format 2.2
	# The language of WA is non-empty.
	# M(0) = the diagonal of WA.
	# M(z) is transpose to M(z).
	# M(a) is transpose to M(A).
	# M(b) is transpose to M(B).
	# M(z*z) = M(0).
	# M(a*A) = M(0).
	# M(A*a) = M(0).
	# M(b*B) = M(0).
	# M(B*b) = M(0).
	# M(a*z) is  M(z*A), so  M(a*z*a*z) = M(0).
	# M(a*B) is  M(b*A), so  M(a*B*a*B) = M(0).
	# M(b*z) is  M(z*B), so  M(b*z*b*z) = M(0).
	# M(a*b*z*a) is  M(b*b*A), so  M(a*b*z*a*a*B*B) = M(0).
	# Automata pass axiom checks.
#testing g17
Format 2.2
#done a copy
Format 2.2
	# The language of WA is non-empty.
	# M(0) = the diagonal of WA.
	# M(a) is transpose to M(A).
	# M(b) is transpose to M(B).
	# M(z) is transpose to M(z).
	# M(a*A) = M(0).
	# M(A*a) = M(0).
	# M(b*B) = M(0).
	# M(B*b) = M(0).
	# M(z*z) = M(0).
	# M(a*B) is  M(b*A), so  M(a*B*a*B) = M(0).
	# M(a*z) is  M(z*A), so  M(a*z*a*z) = M(0).
	# M(b*z) is  M(z*B), so  M(b*z*b*z) = M(0).
	# M(a*a*B*B) is  M(b*b*A*A), so  M(a*a*B*B*a*a*B*B) = M(0).
	# M(a*a*b*z*a) is  M(b*a*b*A*A), so  M(a*a*b*z*a*a*a*B*A*B) = M(0).
	# Automata pass axiom checks.
#testing g18
Format 2.2
#Equality automaton was not diagonal - doubling KBtreesize
#diff1 file was unchanged - doubling KBtreesize again
#g18.diff1 g18.diff1o differ: char 111, line 3
Format 2.2
	# The language of WA is non-empty.
	# M(0) = the diagonal of WA.
	# M(a) is transpose to M(A).
	# M(b) is transpose to M(B).
	# M(z) is transpose to M(z).
	# M(a*A) = M(0).
	# M(A*a) = M(0).
	# M(b*B) = M(0).
	# M(B*b) = M(0).
	# M(z*z) = M(0).
	# M(a*B) is  M(b*A), so  M(a*B*a*B) = M(0).
	# M(a*z) is  M(z*A), so  M(a*z*a*z) = M(0).
	# M(b*z) is  M(z*B), so  M(b*z*b*z) = M(0).
	# M(a*a*B*B) is  M(b*b*A*A), so  M(a*a*B*B*a*a*B*B) = M(0).
	# M(a*a*a*B*B*B) is  M(b*a*b*A*A*A), so  M(a*a*a*B*B*B*a*a*a*B*A*B) = M(0).
	# M(a*a*a*b*z*a*a) is  M(b*a*a*b*A*A), so  M(a*a*a*b*z*a*a*a*a*B*A*A*B) = M(0).
	# Automata pass axiom checks.
#testing g19
Format 2.2
#done a copy
#done a copy
Format 2.2
	# The language of WA is non-empty.
	# M(0) = the diagonal of WA.
	# M(d) is transpose to M(D).
	# M(f) is transpose to M(F).
	# M(d*D) = M(0).
	# M(D*d) = M(0).
	# M(f*F) = M(0).
	# M(F*f) = M(0).
	# M(f*d*F*d*f) is  M(d*f*D*f*d), so  M(f*d*F*d*f*D*F*d*F*D) = M(0).
	# Automata pass axiom checks.
#testing g20
Format 2.2
Format 2.2
	# The language of WA is non-empty.
	# M(0) = the diagonal of WA.
	# M(a) is transpose to M(a).
	# M(b) is transpose to M(b).
	# M(c) is transpose to M(c).
	# M(d) is transpose to M(d).
	# M(a*a) = M(0).
	# M(b*b) = M(0).
	# M(c*c) = M(0).
	# M(d*d) = M(0).
	# M(a*c) is  M(c*a), so  M(a*c*a*c) = M(0).
	# M(a*d) is  M(d*a), so  M(a*d*a*d) = M(0).
	# M(b*d) is  M(d*b), so  M(b*d*b*d) = M(0).
	# M(b*c*b) is  M(c*b*c), so  M(b*c*b*c*b*c) = M(0).
	# M(a*b*a*b*a) is  M(b*a*b*a*b), so  M(a*b*a*b*a*b*a*b*a*b) = M(0).
	# M(c*d*c*d*c) is  M(d*c*d*c*d), so  M(c*d*c*d*c*d*c*d*c*d) = M(0).
	# Automata pass axiom checks.
