Benchmark
non-incremental/QF_S/20230329-woorpje-lu/track01/01_track_133.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 | 1102 |
| Compressed Size | 639 |
| 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 | 1093 |
| Compressed Size | 633 |
| 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 2023
|
|
cvc5 |
cvc5-default-2023-05-16-ea045f305_sq |
sat ✅
|
0.04270
|
0.04327
|
| |
|
cvc5-default-2022-07-02-b15e116-wrapped_sq |
sat ✅
|
0.10240
|
0.10247
|
| |
OSTRICH |
OSTRICH 1.3 SMT-COMP fixed_def |
sat ✅
|
4.00396
|
11.24440
|
| |
Z3alpha |
z3alpha_default |
sat ✅
|
23.04620
|
23.03840
|
| |
Z3-Noodler |
Z3-Noodler_default |
sat ✅
|
0.05526
|
0.05521
|
| |
|
Z3-Noodler_default |
sat ✅
|
0.04991
|
0.04987
|
|
SMT-COMP 2024
|
|
cvc5 |
cvc5 |
sat ✅
|
0.23330
|
0.13352
|
| |
OSTRICH |
OSTRICH |
sat ✅
|
3.11275
|
8.19921
|
| |
Z3alpha |
Z3-alpha |
sat ✅
|
367.84357
|
367.72686
|
| |
Z3-Noodler |
Z3-Noodler |
sat ✅
|
0.26052
|
0.16033
|