Benchmark
non-incremental/QF_NRA/20220314-Uncu/Rational_Function_Proof_Calls_With_Basic_Denominator_Simplifications/BDC_ProveIneq_ISSAC10_ex2d.smt2
Translated to SMT-Lib by Maple SMTLIB package.
Application: CAD calls of SUMCracker-ProveInequality to prove Example 2 in
M. Kauers and V. Pillwein, When can we detect that a P-finite sequence is positive?
ISSAC '10: Proceedings of the 2010 International Symposium on Symbolic and Algebraic ComputationJuly 2010 Pages 195–201
(https://doi.org/10.1145/1837934.1837974)
All denominators in the original CAD call got cleared in a simple way:
a/b == c/d --> a d==b c && b<>0 && d<>0
a/b > c/d --> a d^2 >=b^2 c && b<>0 && d<>0
| Benchmark |
|---|
| Size | 1523 |
| Compressed Size | 843 |
| 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-06 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 | 1494 |
| Compressed Size | 846 |
| 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
not | 2 |
and | 1 |
= | 2 |
+ | 16 |
- | 3 |
* | 20 |
< | 1 |
<= | 9 |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2024
|
0.20 (4/5) |
cvc5 |
cvc5 |
unsat ✅
|
0.24226
|
0.14279
|
| |
SMTInterpol |
SMTInterpol |
unknown ❌
|
0.42804
|
0.45158
|
| |
SMT-RAT |
SMT-RAT |
unsat ✅
|
0.25690
|
0.15769
|
| |
Yices2 |
Yices2 |
unsat ✅
|
0.21946
|
0.11982
|
| |
Z3alpha |
Z3-alpha |
unsat ✅
|
0.26944
|
0.16963
|