Benchmark
non-incremental/QF_S/20230329-woorpje-lu/track02/02_track_8.smt2
Publications: [1] 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: based on the idea in Proposition 1 of [2]. The word equation is shown to have a minimal solution of exponential length w.r.t. the length of the equation.
[2] Day, J. D., Manea, F., & Nowotka, D. (2017). The hardness of solving simple word equations. arXiv preprint arXiv:1702.07922.
| Benchmark |
|---|
| Size | 965 |
| Compressed Size | 581 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | crafted |
| 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 | unknown |
| Inferred Status | sat |
| Size | 956 |
| Compressed Size | 576 |
| Max. Term Depth | 2 |
| Asserts | 1 |
| Declared Functions | 0 |
| Declared Constants | 2 |
| 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.23806
|
0.13789
|
| |
OSTRICH |
OSTRICH |
sat ✅
|
2.10382
|
4.45695
|
| |
Z3alpha |
Z3-alpha |
sat ✅
|
0.27614
|
0.17680
|
| |
Z3-Noodler |
Z3-Noodler |
sat ✅
|
0.24323
|
0.14333
|