Added in combinator reduction axioms for B' C' and S'. Also split the original reduction axioms into separate files: I+K, B+C, S, B'+C', S'.
%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 ).