Benchmark
incremental/QF_S/20250411-hornstr/two_token_pass_lstar_incre_equiv_init_0.smt2
Benchmarks are extracted by running HornStr https://arg-git.informatik.uni-kl.de/pub/string-chc-lib on all benchmarks
provided in the repository and gathering the string queries sent to the string solvers.
| Benchmark |
|---|
| Size | 4869 |
| Compressed Size | 1232 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | industrial |
| First Occurrence | — |
| Generated By | Hongjian Jiang, Oliver Markgraf, Daniel Stan, Anthony W. Lin, Philipp Ruemmer |
| Generated On | 2025-04-11 00:00:00 |
| Generator | — |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 5 |
| Status | unknown |
| Inferred Status | None |
| Size | 1298 |
| Compressed Size | 638 |
| Max. Term Depth | 7 |
| Asserts | 4 |
| Declared Functions | 0 |
| Declared Constants | 5 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
not | 1 |
and | 1 |
= | 1 |
let | 3 |
re.none | 1 |
str.to_re | 8 |
re.* | 3 |
re.++ | 1 |
re.union | 4 |
str.in_re | 4 |
| | | |
| Status | unknown |
| Inferred Status | None |
| Size | 3023 |
| Compressed Size | 973 |
| Max. Term Depth | 17 |
| Asserts | 4 |
| Declared Functions | 0 |
| Declared Constants | 5 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
not | 1 |
and | 1 |
= | 1 |
let | 14 |
str.to_re | 38 |
re.* | 16 |
re.++ | 42 |
re.union | 23 |
str.in_re | 4 |
| | | | | |
| Status | unknown |
| Inferred Status | None |
| Size | 2098 |
| Compressed Size | 800 |
| Max. Term Depth | 10 |
| Asserts | 4 |
| Declared Functions | 0 |
| Declared Constants | 5 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
not | 1 |
and | 1 |
= | 1 |
let | 7 |
str.to_re | 27 |
re.* | 11 |
re.++ | 16 |
re.union | 10 |
str.in_re | 4 |
| | | | | |
| Status | unknown |
| Inferred Status | None |
| Size | 2011 |
| Compressed Size | 773 |
| Max. Term Depth | 10 |
| Asserts | 4 |
| Declared Functions | 0 |
| Declared Constants | 5 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
not | 1 |
and | 1 |
= | 1 |
let | 7 |
str.to_re | 26 |
re.* | 8 |
re.++ | 14 |
re.union | 9 |
str.in_re | 4 |
| | | | | |
| Status | unknown |
| Inferred Status | None |
| Size | 1265 |
| Compressed Size | 631 |
| Max. Term Depth | 7 |
| Asserts | 3 |
| Declared Functions | 0 |
| Declared Constants | 5 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
not | 1 |
and | 1 |
= | 1 |
let | 3 |
str.to_re | 8 |
re.* | 3 |
re.++ | 1 |
re.union | 4 |
str.in_re | 3 |
| | | | | |