Benchmark
non-incremental/QF_NRA/20220314-Uncu/Polynomial_Proof_Calls/ProveIneq_ISSAC05_SignPattern_Lemma4c.smt2
Translated to SMT-Lib by Maple SMTLIB package.
Application:
CAD calls of the Main Algorithm to prove the sign pattern:
Sign Pattern Lemma 4
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 | 61251 |
| Compressed Size | 6968 |
| 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 | 61242 |
| Compressed Size | 6975 |
| 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 |
+ | 32 |
- | 610 |
* | 3640 |
< | 30 |
<= | 1 |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2024
|
0.20 (4/5) |
cvc5 |
cvc5 |
unsat ✅
|
927.08011
|
926.84345
|
| |
SMTInterpol |
SMTInterpol |
unknown ❌
|
0.90351
|
2.16280
|
| |
SMT-RAT |
SMT-RAT |
unsat ✅
|
1172.80807
|
1172.63931
|
| |
Yices2 |
Yices2 |
unsat ✅
|
18.04323
|
17.94300
|
| |
Z3alpha |
Z3-alpha |
unsat ✅
|
0.62408
|
0.52449
|