Skip to content
Home / Catalog / Max-3-SAT Solver Optimization

Max-3-SAT Solver Optimization

  • Task ID: computer_science.max3sat_assignment_optimization
  • Domain: computer_science
  • Subdomain: combinatorial_optimization
  • Status: final
  • Benchmark set: seed42 (60 tasks)
  • Tags: maxsat, max_3_sat, combinatorial_optimization, solver_construction, hidden_instance, local_search, clause_weighting, dimacs, boolean_optimization

Runtime and requirements

  • Estimated time: 120-240 minutes
  • Python: >=3.11
  • Packages: numpy>=1.24
  • GPU required: no
  • Network required: no

Public input and output contract

Outputs

  • solver.py (code): Reusable hidden-instance Max-3-SAT solver entry point.

Public repository files

View this task in ASI-Bench

Formal benchmark task directories in the public repository are metadata-only. Versioned prompts and inputs are distributed through the pinned benchmark dataset.

Provenance

This task is included in the current seed42 benchmark set at dataset revision f11a199f71fb4b854ac43a1bf548d5df519141a9.

This page is generated only from files tracked in the public ASI-Bench repository at commit c9c1ba960854. Submission bundles, run logs, private scoring configuration, and private reference answers are not read by this page generator.