For this problem F = {N, A, O, X, D, R, I, M} (representing, respectively: NOT, AND, OR, XOR, NAND, NOR, IF, and Majority, the first being a function of one argument, the second through fifth are functions of two arguments, and the last two are functions of three arguments), and T = {c, b, a, u, 1, 2, 3}. The rule table (2⁷ = 128 fitness cases) is shown in Table 5 and the fitness was evaluated by equation (4.2). Thus, f_max = 128.

Three different solutions were discovered in one experiment:

0123456789012345678901234567890123456789012345
MA3OOAMOAuOMRa1cc3cubcc2cu11ba2aacb331ua122uu1
X3RRMIMODIAIAAI3cauuc313bub2uc33ca12u233c22bcb
MMOIOcXOMa3AXAu3cc112ucbb3331uac3cu3auubuu2ab1

Careful analysis of these programs shows that the GP rule is, like the GKL rule, a function of five arguments: c, a, u, 1, and 3.