Require a deterministic Z3 budget (SMTT("rN")) in the proof prompts - #87
Merged
Conversation
tangruize
marked this pull request as draft
July 30, 2026 08:50
Qian-Cheng-nju
self-requested a review
July 30, 2026 11:00
Qian-Cheng-nju
marked this pull request as ready for review
July 30, 2026 16:37
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
What
Add one constraint to the two agentic proof prompts
(
proof-completion.txt,proof-from-scratch.txt): proofs must bound theSMT/Z3 backend with a deterministic budget
SMTT("rN")(capped at"r30"),not the wall-clock forms
SMT/SMTT(n).Why
Wall-clock SMT timeouts make a proof's pass/fail depend on CPU speed and load,
so the same proof can close on one machine and time out on another — a source of
non-reproducible grading. tlapm's
SMTT("rN")(tlaplus/tlapm#283) bounds Z3 bya deterministic resource count instead, so the outcome is identical across
machines and reruns for a fixed Z3 build. Capping at
"r30"and requiringdecomposition beyond it keeps per-obligation cost bounded and pushes toward
finer-grained proofs.
Scope / notes
single tool-free response doesn't iterate on or tune backend timeouts.
rlimitbudget viaSMTT("rN")tlaplus/tlapm#283. The1.6.0-prerollingpre-release the Docker image pulls was rebuilt from
mainright after #283merged, so it already carries
SMTT("rN").