Skip to content

Latest commit

 

History

History
9 lines (6 loc) · 468 Bytes

README.md

File metadata and controls

9 lines (6 loc) · 468 Bytes

Work in progress on converting known results on the minimal superpermutation problem into computer-verifiable proofs checkable with Coq. Main results proven so far are in Bounds.v.

Tested in Coq 8.5.0 through 8.8.2. May require changes to work in future versions.

ListTheorems.v and NumPermutations.v must be compiled for the results in Bounds.v to go through:

coqc ListTheorems.v
coqc NumPermutations.v