Bitwuzla 2025 submission.

[mpreiner]

No description provided.

[github-actions]

Summary of modified submissions

Bitwuzla

• 2 authors
• website: https://bitwuzla.github.io/
• Participations
  • UnsatCore
    • Bitvec
      • all
    • Equality+MachineArith
      • ABV
      • ABVFP
      • ABVFPLRA
      • AUFBV
      • AUFBVFP
      • UFBV
      • UFBVFP
    • FPArith
      • all
    • QF_Bitvec
      • all
    • QF_Equality+Bitvec
      • QF_UFBVDT
    • QF_FPArith
      • QF_UFFPDTNIRA
  • SingleQuery
    • Bitvec
      • all
    • Equality+MachineArith
      • ABV
      • ABVFP
      • ABVFPLRA
      • AUFBV
      • AUFBVFP
      • UFBV
      • UFBVFP
    • FPArith
      • all
    • QF_Bitvec
      • all
    • QF_Equality+Bitvec
      • QF_UFBVDT
    • QF_FPArith
      • QF_UFFPDTNIRA
  • ModelValidation
    • QF_ADT+BitVec
      • QF_UFBVDT
    • QF_Bitvec
      • all
    • QF_Equality+Bitvec
      • all
    • QF_FPArith
      • QF_UFFPDTNIRA
  • Incremental
    • Bitvec
      • all
    • Equality+MachineArith
      • all
    • FPArith
      • all
    • QF_Bitvec
      • all
    • QF_Equality+Bitvec
      • all
    • QF_FPArith
      • all
  • Parallel
    • Bitvec
      • all
    • Equality+MachineArith
      • ABV
      • ABVFP
      • ABVFPLRA
      • AUFBV
      • AUFBVFP
      • UFBV
      • UFBVFP
    • FPArith
      • all
    • QF_Bitvec
      • all
    • QF_Equality+Bitvec
      • QF_UFBVDT
    • QF_FPArith
      • QF_UFFPDTNIRA

[martinjonas]

@mpreiner Thanks for submitting Bitwuzla to this year's SMT-COMP!

We have executed your solver on a small number of benchmarks from each logic it should compete in (except for the parallel track). You can find the results here:

• Single Query Track: https://www.fi.muni.cz/~xjonas/smtcomp/tables/bitwuzla.table.html#/table
• Incremental Track: https://www.fi.muni.cz/~xjonas/smtcomp/tables/bitwuzla_inc.table.html#/table
• Unsat Core Track: https://www.fi.muni.cz/~xjonas/smtcomp/tables/bitwuzla_unsatcore.table.html#/table
• Model Validation Track: https://www.fi.muni.cz/~xjonas/smtcomp/tables/bitwuzla_model.table.html#/table

We have not seen any incorrect results returned by your solver (compared to the expected status of the benchmarks).

You can check whether all the results we have obtained are expected. If not, please let us know here.

Some notes:

• We have used less resources than will be used in the final runs.
• The benchmarks are scrambled by the official scrambler with seed 1.
• The column status shows whether your solver decided the benchmark as sat (true) or unsat (false).
• For the incremental track, the column status also shows the number of correct answers.
• The purpose of the evaluation is just to perform a technical sanity check, whether your solver works fine on our infrastructure. We have therefore not checked the returned unsat cores and models. The status column for unsat core and model validation tracks just shows the satisfiability of the input formula, not validity of the returned unsat core/model.
• You can click on the value in the status column to see the output of your solver on that benchmark.

If you upload a new version of the solver and want to have another test run, let me know. We still have some time for that.

Happy rest of the competition!
Martin

[martinjonas]

@mpreiner We also executed test runs of the Parallel track. Again, we used significantly less resources (1 minute of wall time, 8 CPU cores, 8 GiB of RAM). You can find the results here:

• https://www.fi.muni.cz/~xjonas/smtcomp/tables/bitwuzla_parallel.table.html#/table

Please let me know if anything in the results surprises you.

[mpreiner]

Thanks @martinjonas! All looks good.