The FRDCSA is by design a complex, high-information system, and so the acronym is complex and high-information. The chief theoretical result of the project is that the capabilities of a weak artificial intelligence system (running on a Turing-equivalent machine) are constrained by the size of the system.
The FRDCSA started out as two separate projects, the FRD which stands for Formalized Research Database, and CSA which stands for Cluster Study and Apply.
FRD was a project to unify all theorem provers and their axioms, to create the most comprehensive library of knowledge in formal logic, because Algorithmic Information Theory suggests this is an expedient way to create more capable theorem provers.
The CSA project collected all useful software in general, and was meant to expedite the process of creating the FRD.
However, the projects became unified into the FRDCSA when it became apparent that the class of software and theorem provers are coextensive, via the Curry-Howard Isomorphism and Emil Post's observations.