Benchmark
non-incremental/QF_NRA/20220314-Uncu/Polynomial_Proof_Calls/ProveIneq_ISSAC05_Bessack_1_0.smt2
Translated to SMT-Lib by Maple SMTLIB package.
Application:
CAD calls of SUMCracker-ProveInequality to prove Bessack Inequality with (a,b)=(1,0) in
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 | 1094 |
| Compressed Size | 657 |
| 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 | 1054 |
| Compressed Size | 653 |
| Max. Term Depth | 3 |
| Asserts | 1 |
| Declared Functions | 0 |
| Declared Constants | 3 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2024
|
|
cvc5 |
cvc5 |
unsat ✅
|
0.24738
|
0.14707
|
| |
SMTInterpol |
SMTInterpol |
unsat ✅
|
0.41872
|
0.42994
|
| |
SMT-RAT |
SMT-RAT |
unsat ✅
|
0.21206
|
0.11232
|
| |
Yices2 |
Yices2 |
unsat ✅
|
0.21062
|
0.11044
|
| |
Z3alpha |
Z3-alpha |
unsat ✅
|
0.26812
|
0.16833
|