Benchmark
non-incremental/QF_NRA/20220314-Uncu/Rational_Function_Proof_Calls_With_Disjunctive_Denominator_Simplifications/DDC_ProveIneq_ISSAC10_ex1f.smt2
Translated to SMT-Lib by Maple SMTLIB package.
Application: CAD calls of SUMCracker-ProveInequality to prove Example 1 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 by introducing disjunctions with sign conditions:
a/b == c/d --> a d==b c && b<>0 && d<>0
a/b >= c --> a >=b c && b >0 or ( a <= b c && b < 0)
| Benchmark |
|---|
| Size | 3286 |
| Compressed Size | 1138 |
| 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 | None |
| Size | 3258 |
| Compressed Size | 1131 |
| Max. Term Depth | 10 |
| 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
or | 4 |
and | 9 |
+ | 56 |
- | 9 |
* | 154 |
< | 10 |
<= | 16 |
| |