Ok. So, is there agreement, contention, or conflict?

Another logic evaluator gave these results:

Ludwig 0.6.4 - Truth Table Constructor
(c)2002-2003 Diego Padula
{ -, &, /, %, >, =, ! }
e.g. 1: ((p&-p)>q)
e.g. 2: ((-a&-b)=(a!b))

Formula: a/b

(a/b)
1. FFF
2. FFT
3. TFF
4. TTT

[Elapsed total 0.0000]

Formula: a%b

(a%b)
1. FTF
2. FFT
3. TFF
4. TTT

[Elapsed total 0.0000]

Formula: a&b

(a&b)
1. FFF
2. FTT
3. TTF
4. TTT

[Elapsed total 0.0000]

Formula: a>b

(a>b)
1. FFF
2. FTT
3. TFF
4. TFT

[Elapsed total 0.0000]

(Unfortunately the above author's website has disappeared, and the program is not readily available. It was written in C. )

So, examining the above results, how would you define the operators by their symbols, and compare the evaluation of the "ludwig" system with "Logical Formula evaluator"?

"Logical Formula evaluator" is currently available at SourceForge.net

There are other logic evaluators from the past (in DOS) namely, "Bertie" and "Twootie". Which also serve as tutors.