User blog comment:Deedlit11/Bignum Bakeoff appetizer/@comment-5150073-20140915191941

I know that (a+b)[n] = a+(b[n]) isn't generally true for ordinals, but for this program they will be always in CNF.

H(a,n) = n (if a = 0) 15 H(a+1,n) = H(a,n+1) 17 H(a,n) = H(a[n],n) (if a <> b+1) 26 (a+b)[n] = a+(b[n]) 17 w^0 = 1 5 w^^0 = 1 6 (w^(a+1))[0] = 0 14 (w^(a+1))[n+1] = w^a+(w^(a+1))[n] 31 (w^a)[n] = w^(a[n]) 17 w^^(a+1) = w^(w^^a) 17 N = w^^99 7

As I counted, 172 characters.