Benchmark

non-incremental/QF_S/20230329-woorpje-lu/track01/01_track_56.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
Size1059
Compressed Size594
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 1050
Compressed Size588
Max. Term Depth2
Asserts 1
Declared Functions0
Declared Constants2
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 2023 cvc5 cvc5-default-2023-05-16-ea045f305_sq sat ✅ 0.02758 0.02803
cvc5-default-2022-07-02-b15e116-wrapped_sq sat ✅ 0.04649 0.04692
OSTRICH OSTRICH 1.3 SMT-COMP fixed_def sat ✅ 3.67991 9.57790
Z3alpha z3alpha_default sat ✅ 0.09572 0.09582
Z3-Noodler Z3-Noodler_default sat ✅ 0.03828 0.03825
Z3-Noodler_default sat ✅ 0.03678 0.03674