Public articles linked to the same research event.
arXiv The work frames counterexample generation as constrained witness emission against deterministic per-theorem Python verifiers, releases SymCE with 4,707 false conjectures each paired with an executable verifier, and trains Qwen3-4B with the verifier as reward: counterexample-only SFT collapses true-theorem recognition from 0.27 to 0.00, while RLVR with a sparse outcome-only reward repairs and exceeds the base to 0.66, with the collapse replicating across four seeds and on Gemma-3-4B.
The work frames counterexample generation as constrained witness emission against deterministic per-theorem Python verifiers, releases SymCE with 4,707 false conjectures each paired with an executable verifier, and trains Qwen3-4B with the verifier as reward: counterexample-only SFT collapses true-theorem recognition from 0.27 to 0.00, while RLVR with a sparse outcome-only reward repairs and exceeds the base to 0.66, with the collapse replicating across four seeds and on Gemma-3-4B.
The work frames counterexample generation as constrained witness emission against deterministic per-theorem Python verifiers, releases SymCE with 4,707 false conjectures each paired with an executable verifier, and trains Qwen3-4B with the verifier as reward: counterexample-only SFT collapses true-theorem recognition from 0.27 to 0.00, while RLVR with a sparse outcome-only reward repairs and exceeds the base to 0.66, with the collapse replicating across four seeds and on Gemma-3-4B.
The work frames counterexample generation as constrained witness emission against deterministic per-theorem Python verifiers, releases SymCE with 4,707 false conjectures each paired with an executable verifier, and trains Qwen3-4B with the verifier as reward: counterexample-only SFT collapses true-theorem recognition from 0.27 to 0.00, while RLVR with a sparse outcome-only reward repairs and exceeds the base to 0.66, with the collapse replicating across four seeds and on Gemma-3-4B.