Benchmark
non-incremental/LIA/20250213-Frobenius/fcp_2_3_5.smt2
Instances of the Frobenius coin problem with three coins involving multiple
quantifier alternations that seem difficult for modern SMT solvers.
| Benchmark |
|---|
| Size | 805 |
| Compressed Size | 470 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | crafted |
| First Occurrence | 2025-08-11 |
| Generated By | Vojtěch Havlena, Michal Hečko, Lukáš Holík, Ondřej Lengál |
| Generated On | 2025-02-13 00:00:00 |
| Generator | — |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | sat |
| Inferred Status | sat |
| Size | 797 |
| Compressed Size | 465 |
| Max. Term Depth | 9 |
| Asserts | 1 |
| Declared Functions | 0 |
| Declared Constants | 1 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
not | 2 |
and | 3 |
=> | 3 |
= | 2 |
forall | 3 |
Int | 7 |
+ | 2 |
* | 6 |
<= | 8 |
| | | | | |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2025
|
0.50 (4/8) |
Amaya |
Amaya |
sat ✅
|
1.15554
|
1.02610
|
| |
cvc5 |
cvc5 |
sat ✅
|
0.28713
|
0.16806
|
| |
iProver |
iProver v3.9.3 |
unknown ❌
|
1201.80986
|
4767.94364
|
| |
SMTInterpol |
SMTInterpol |
unknown ❌
|
0.56208
|
0.79797
|
| |
UltimateEliminator |
UltimateEliminator+MathSAT |
unknown ❌
|
1.76700
|
4.00806
|
| |
YicesQS |
YicesQS |
unknown ❌
|
1201.79060
|
1201.05762
|
| |
Z3alpha |
Z3-alpha |
sat ✅
|
0.38175
|
0.33874
|
| |
Z3 |
Z3-alpha-base |
sat ✅
|
0.31960
|
0.19950
|