Skip to content

docs: verify reduction #841 — NAESatisfiability → SetSplitting#977

Closed
zazabap wants to merge 2 commits intomainfrom
verify-naesatisfiability-setsplitting
Closed

docs: verify reduction #841 — NAESatisfiability → SetSplitting#977
zazabap wants to merge 2 commits intomainfrom
verify-naesatisfiability-setsplitting

Conversation

@zazabap
Copy link
Copy Markdown
Collaborator

@zazabap zazabap commented Apr 1, 2026

Summary

Mathematical verification of the NAESatisfiability → SetSplitting reduction (#841) using the /verify-reduction skill.

Typst proof: docs/paper/proposed-reductions-841.typ

  • Construction: universe (2n elements) + complementarity subsets + clause subsets
  • Correctness: ⟹ (NAE assignment → partition) + ⟸ (partition → NAE assignment)
  • Extraction: read positive element's partition side
  • Overhead: universe_size = 2*num_vars, num_subsets = num_vars + num_clauses
  • Example: 3 vars, 2 clauses, fully worked

Python verification: docs/paper/verify-reductions/verify_naesatisfiability_setsplitting.py

  • 12,132 checks, 0 failures
  • Forward + backward exhaustive n ≤ 4
  • Solution extraction verified with complementarity check

Lean lemmas: docs/paper/verify-reductions/lean/ReductionProofs/NaesatSetsplitting.lean

  • 2 overhead lemmas proved

Test plan

  • python3 docs/paper/verify-reductions/verify_naesatisfiability_setsplitting.py passes (12,132/0)
  • PDF compiles without errors
  • Lean builds (trivial rfl lemmas)

🤖 Generated with Claude Code

zazabap and others added 2 commits March 31, 2026 16:13
Covers 9 reductions: 2 NP-hardness chain extensions (#973, #198),
4 Tier 1a blocked issues (#379, #380, #888, #822), and
3 Tier 1b blocked issues (#892, #894, #890).

Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>
Typst proof: Construction (universe + complementarity + clause subsets),
Correctness (⟹/⟸), Extraction (partition side → assignment),
Overhead (2n universe, n+m subsets), Example (3 vars, 2 clauses)

Python: 12,132 checks, 0 failures (exhaustive n≤4, extraction, overhead)
Lean: 2 overhead lemmas (rfl)

Bugs found: none
Iterations: 1 round

Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>
@codecov
Copy link
Copy Markdown

codecov bot commented Apr 1, 2026

Codecov Report

✅ All modified and coverable lines are covered by tests.
✅ Project coverage is 98.03%. Comparing base (423506c) to head (a469322).

Additional details and impacted files
@@           Coverage Diff           @@
##             main     #977   +/-   ##
=======================================
  Coverage   98.03%   98.03%           
=======================================
  Files         784      784           
  Lines       82310    82310           
=======================================
  Hits        80695    80695           
  Misses       1615     1615           

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

🚀 New features to boost your workflow:
  • ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.

@zazabap
Copy link
Copy Markdown
Collaborator Author

zazabap commented Apr 1, 2026

Closing: does not meet the stricter verify-reduction skill requirements. Will redo with the updated skill.

@zazabap zazabap closed this Apr 1, 2026
@zazabap zazabap mentioned this pull request Apr 1, 2026
3 tasks
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant