We have three rules for SN DLS of order 17

1 2 3 4 5 6 7 16 8 0 9 10 11 12 13 14 15
1 2 3 16 5 6 7 12 8 4 9 10 11 0 13 14 15
1 16 3 14 5 12 7 10 8 6 9 4 11 2 13 0 15

1 0 3 2 5 4 7 6 8 10 9 12 11 14 13 16 15
1 0 3 2 5 4 7 6 8 10 9 12 11 14 15 16 13
1 0 3 2 5 4 7 6 8 10 9 12 11 15 16 13 14
1 0 3 2 5 4 7 6 8 10 9 12 11 15 16 14 13
1 0 3 2 5 4 7 6 8 10 9 12 13 11 15 16 14
1 0 3 2 5 4 7 6 8 10 9 12 13 14 15 16 11
1 0 3 2 5 4 7 6 8 10 9 12 13 15 11 16 14
1 0 3 2 5 4 7 6 8 10 9 12 13 15 16 11 14
1 0 3 2 5 4 7 6 8 10 9 12 13 15 16 14 11
1 0 3 2 5 4 7 6 8 10 9 13 14 15 16 11 12
1 0 3 2 5 4 7 6 8 10 9 13 14 15 16 12 11
1 0 3 2 5 4 7 6 8 10 9 13 15 11 16 12 14
1 0 3 2 5 4 7 6 8 10 9 13 15 11 16 14 12
1 0 3 2 5 4 7 6 8 10 9 13 15 12 16 14 11
1 0 3 2 5 4 7 6 8 10 9 13 15 16 12 14 11

Can you make the program remove duplicate CFs?

sort -u <input.txt

JHep946hdpmD3PbVe64oR1i2JacXn5EZhBapLW1bdkDY4JdXfnDizzcaKLehQmyCFnBMwusRtF4PEhke4
JVUesFePXAN1rG8UWDrmYhv7h3UUqSqVraVEBWcofey2tPsEJpepgvNg8vu32qL8dazxSPiVu1Ttj29tL
JZavs7uAV4CURwBtFMoJPcLBijAc1hE3FotZHERYCMPtfJ1PMTFPDqmULKieXppg11yArjb6WbfYS3zYz2
J39x3jjhxnHszoQpfcDrAzx27ZgCpvYW9JZU9nm4EozssVGc6mUYnCWuV7HzfwhWK2hEtntURM2pDGa9ins

You did not answer the question

How much RAM is required for the program?

If I understand correctly, cache files will help quickly canonicalize DLS (?)

in: JQiBJzfpi4cDA7gjVeqHYS9v66FyyHaywfvhUvgBXnkJa2PbDv7UgMAgKYZupiCsckFX7b8kMdaEFFREt4gbPtRSf2
cf: JHep946hdpmD3PbVe64oR1i2JacXn5EZhBapLW1bdkDY4JdXfnDizzcaKLehQmyCFnBMwusRtF4PEhke4
num_dtrans: 204995269

0 2 C E 7 B 8 6 F 4 D 3 A 9 G 5 1                             
5 1 3 B D G A 8 E C 4 9 0 F 6 2 7                                                                                                   
B 6 2 4 A C F 9 D 5 0 1 E 7 3 G 8                                 
6 A 7 3 5 9 B E C 1 2 D G 4 F 8 0                             
2 7 9 G 4 6 0 A B 3 C F 5 E 8 1 D       
4 3 G 0 F 5 7 1 A B E 6 D 8 2 C 9       
A 5 4 F 1 E 6 G 9 D 7 C 8 3 B 0 2                    
C 9 6 5 E 2 D 7 0 G B 8 4 A 1 3 F                                                                                                   
D C B A 9 0 1 2 8 E F G 7 6 5 4 3       
1 D F 6 C 8 5 0 G 9 3 E 2 B A 7 4                           
E G 5 D 8 4 9 3 7 0 A 2 F 1 C B 6       
7 4 E 8 3 A 2 5 6 F 9 B 1 G 0 D C                                 
3 F 8 2 B 1 4 D 5 6 G A C 0 7 9 E                             
G 8 1 C 0 3 E F 4 2 5 7 B D 9 6 A 
8 0 D 9 2 F G B 3 7 1 4 6 C E A 5 
9 E A 1 G 7 C 4 2 8 6 0 3 5 D F B 
F B 0 7 6 D 3 C 1 A 8 5 9 2 4 E G 

Code of square

DW71H14GBTJeK6fE1RcSBVdKdAhrHJYM

dlkconv.exe: (input-spec) [input] [(output-spec) [output]
** Diagonal Latin Square converter and normalizer **
input-spec: Endoded/compressed (e), Alphanumeric (a), stdin (s) File (f).
 Encoded input can be passed immediately on command line.
 Othervise a NxN matrix of decimal numbers, or Alphanumeric (a) must be
 passed via stdin or file. Multiple orders (N) may be mixed on input.
 Empty lines and (one) trailing spaces are ignored.
output-spec: (e)(a)(f), stdout (s), Compact (c), Diagonal (d)
 LS normalized on first row are written to stdout by default.
 Space between output squares are ommited in Compact (c) mode.
 With (d), output matrix is normalized on main diagonal.
Example dlkconv.exe e 7yPG4 dc -- decode 7yPG4 and normalize diagonal
Author: Tomas Brada (GPL)

ortogonb.exe: [-co] (Input) >output
** Search for Orthogonal mates of Diagonal Latin Square **
 -c print number of transverses and exit
 -o output orthogonal mates like they are found
Input: encoded diagonal latin square (see dlkconv.exe)
Output: metadata and orthogonal squares in encoded format
Returns 0 if orthogonal mates found, 1 if not. Multi Thread.
Example ortogonb.exe BJMzz45jMmo1FfZtCjN
Author: Tomas Brada (GPL)

ortogonbw.exe: (Input) (Path) >output
** Search for Orthogonal mates of Diagonal Latin Square **
Input: encoded diagonal latin square (see dlkconv.exe)
Output: metadata and orthogonal squares in encoded format
Prints to output immediately as square is found. Single thread.
Path: sequence of space-separated numbers narrowing the problem space
Explanation: L(level) c(column) choosen-row / count-rows
Specify number as Path from 1 up to count-rows to narrow down the Search,
specify multiple numbers to narrow down further.
Example: ortogonbw.exe DeGkNZGc43qaHWnNUsjfvuQNbREDKc4 3 120
Author: Tomas Brada (GPL)

kanonb.exe: <input >output
** Diagonal Latin Square Kanonizer **
Input and Output in Encoded form (see dlkconv)
Uses cache files kanonb_cache_NN.dat in the current directory.

ortowalk.exe: FileName
** Explore the full graph of DLK orthogonality **
Insert the initial CF-DLK into FileName.todo
then run "ortowalk.exe FileName" (without the .todo)
Author: Tomas Brada (GPL)

rules.exe: (N) >output
** Diagonal Latin Square Rule Enumerator **
Enumerates all rules of CF-DLK of order N
Uses cache files kanonb_cache_NN.dat in the current directory.
Author: Tomas Brada (GPL)

Credit badges doesnt seem to work for me :(