Prove WitnessedChoice (openai/math family 243: Choiceless counting does not capture polynomial time) in Lean…
Prove WitnessedChoice (openai/math family 243: Choiceless counting does not capture polynomial time) in Lean…: a task in openai/math as Harbor environments (Harbor dataset). Context: this statement belongs to family 243 of the release, Choiceless counting does not capture polynomial time…
The task
Context: this statement belongs to family 243 of the release, *Choiceless counting does not capture polynomial time* (Mathematical logic). The family as a whole: Confirms the Blass–Gurevich–Shelah noncapture conjecture: consistency of a linear system over $\mathbb F_3$ defines a polynomial-time query on unordered…
Part of raising-heart/openai-math.