Benchmark

non-incremental/QF_S/20230329-woorpje-lu/track01/01_track_67.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
Size1022
Compressed Size599
License Creative Commons Attribution 4.0 International (CC-BY-4.0)
Categoryrandom
First Occurrence2023-07-06
Generated ByJoel Day, Thorsten Ehlers, Mitja Kulczynski, Federico Mora, Florin Manea, Dirk Nowotka, Danny Poulsen, Zhengyang Lu
Generated On
Generator
Dolmen OK1
strict Dolmen OK1
check-sat calls1
Query 1
Status sat
Inferred Status sat
Size 1013
Compressed Size596
Max. Term Depth2
Asserts 1
Declared Functions0
Declared Constants3
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

=1 str.++2

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2025 cvc5 cvc5 sat ✅ 0.27130 0.15549
OSTRICH OSTRICH sat ✅ 9.83368 26.71995
Z3alpha Z3-alpha sat ✅ 0.38340 0.29973
Z3 Z3-alpha-base sat ✅ 0.43381 0.31467
Z3-Noodler-base sat ✅ 0.35163 0.23297
Z3-Noodler Z3-Noodler sat ✅ 0.29800 0.17484
Z3-Noodler-Mocha-base sat ✅ 0.26741 0.14946
Z3-Noodler-Mocha Z3-Noodler-Mocha sat ✅ 0.30490 0.17792