Benchmark
non-incremental/QF_S/20230329-woorpje-lu/track01/01_track_22.smt2
Publications: Day, J. D., Ehlers, T., Kulczynski, M., Manea, F., Nowotka, D., & Poulsen, D. B. (2019). On solving word equations using SAT. In RP 2019
Description: Produced by generating random strings, and replacing factors with variables at random, in a coherent fashion. This guarantees the existence of a solution. The generated word equations have at most 15 variables, 10 letters, and length 300.
| Benchmark |
| Size | 973 |
| Compressed Size | 566 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | random |
| First Occurrence | 2023-07-06 |
| Generated By | Joel Day, Thorsten Ehlers, Mitja Kulczynski, Federico Mora, Florin Manea, Dirk Nowotka, Danny Poulsen, Zhengyang Lu |
| Generated On | — |
| Generator | — |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | sat |
| Inferred Status | sat |
| Size | 964 |
| Compressed Size | 564 |
| Max. Term Depth | 2 |
| Asserts | 1 |
| Declared Functions | 0 |
| Declared Constants | 4 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2024
|
|
cvc5 |
cvc5 |
sat ✅
|
0.26020
|
0.16068
|
| |
OSTRICH |
OSTRICH |
sat ✅
|
2.08362
|
4.63277
|
| |
Z3alpha |
Z3-alpha |
sat ✅
|
0.26887
|
0.16922
|
| |
Z3-Noodler |
Z3-Noodler |
sat ✅
|
0.24485
|
0.14488
|
|
SMT-COMP 2025
|
|
cvc5 |
cvc5 |
sat ✅
|
0.30895
|
0.17861
|
| |
OSTRICH |
OSTRICH |
sat ✅
|
2.80893
|
7.36736
|
| |
Z3alpha |
Z3-alpha |
sat ✅
|
0.39760
|
0.28263
|
| |
Z3 |
Z3-alpha-base |
sat ✅
|
0.28547
|
0.16420
|
| |
|
Z3-Noodler-base |
sat ✅
|
0.28068
|
0.15307
|
| |
Z3-Noodler |
Z3-Noodler |
sat ✅
|
0.29842
|
0.17340
|
| |
|
Z3-Noodler-Mocha-base |
sat ✅
|
0.30265
|
0.17538
|
| |
Z3-Noodler-Mocha |
Z3-Noodler-Mocha |
sat ✅
|
0.26709
|
0.14605
|