Yet another version of fake_thm_name. "Full" hashing ensures that there are no collisions
unless theorems differ by sorts alone, which should not matter. Also minor fixes to
standard hashing.
%ID: $Id$
%Author: Jia Meng, NICTA
%const-typed combinator reduction for I, K
clause(
forall([A, B, P, Q],
or( equal(hAPP(hAPP(c_COMBK(A,B),P),Q),P))),
a1 ).
clause(
forall([P, T],
or( equal(hAPP(c_COMBI(T),P),P))),
a3 ).