Benchmark
non-incremental/QF_NRA/20220314-Uncu/Polynomial_Proof_Calls/ProveIneq_ISSAC05_SignPattern_1p_4m_1w_2p_p.smt2
Translated to SMT-Lib by Maple SMTLIB package.
Application:
CAD calls of the Main Algorithm to prove the sign pattern:
+ - - - - * + + => +
in Section 5 of
S. Gerhold and M. Kauers, A Procedure for Proving Special Function Inequalities Involving a Discrete Parameter.
ISSAC '05: Proceedings of the 2005 international symposium on Symbolic and algebraic computationJuly 2005 Pages 156-162.
(https://dl.acm.org/doi/10.1145/1073884.1073907)
| Benchmark |
|---|
| Size | 2851 |
| Compressed Size | 1057 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | industrial |
| First Occurrence | 2022-08-10 |
| Generated By | Ali K. Uncu, Matthew England, and James H. Davenport |
| Generated On | 2022-01-08 00:00:00 |
| Generator | SUMCracker-ProveInequality function by Manuel Kauers ("https://www3.risc.jku.at/research/combinat/software/ergosum/RISC/SumCracker.html") |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | unsat |
| Inferred Status | unsat |
| Size | 2774 |
| Compressed Size | 1045 |
| Max. Term Depth | 8 |
| 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
and | 1 |
= | 2 |
/ | 6 |
+ | 10 |
- | 29 |
* | 165 |
< | 7 |
<= | 2 |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2025
|
0.17 (5/6) |
cvc5 |
cvc5 |
unsat ✅
|
0.77798
|
0.65659
|
| |
SMTInterpol |
SMTInterpol |
unknown ❌
|
0.49373
|
0.52958
|
| |
SMT-RAT |
SMT-RAT |
unsat ✅
|
0.29225
|
0.17473
|
| |
Yices2 |
Yices2 |
unsat ✅
|
0.30117
|
0.17142
|
| |
Z3alpha |
Z3-alpha |
unsat ✅
|
0.60679
|
0.49747
|
| |
Z3 |
Z3-alpha-base |
unsat ✅
|
0.30855
|
0.18769
|
| |
|
z3siri-base |
unsat ✅
|
0.30571
|
0.17538
|