Benchmark
non-incremental/QF_NRA/20220314-Uncu/Rational_Function_Proof_Calls_With_Basic_Denominator_Simplifications/BDC_ProveIneq_Mitrinovic_3_31.smt2
Translated to SMT-Lib by Maple SMTLIB package.
Application: Automated proof of (3.31) in
D.S. Mitrinovic, Elementary Inequalities, P. Noordhoff ltd - Groningen, (1964)
("https://www.isinj.com/mt-usamo/Elementary%20Inequalities%20-%20Mitrinovic,%20et.%20al.%20(1964,%20Noordhoff).pdf")
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 | 1530 |
| Compressed Size | 804 |
| 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-02-01 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 | 1516 |
| Compressed Size | 799 |
| Max. Term Depth | 8 |
| 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
not | 4 |
and | 1 |
= | 4 |
+ | 22 |
* | 37 |
< | 1 |
<= | 5 |
| |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2025
|
0.17 (5/6) |
cvc5 |
cvc5 |
unsat ✅
|
0.32324
|
0.19941
|
| |
SMTInterpol |
SMTInterpol |
unknown ❌
|
0.46261
|
0.46248
|
| |
SMT-RAT |
SMT-RAT |
unsat ✅
|
0.29514
|
0.16466
|
| |
Yices2 |
Yices2 |
unsat ✅
|
0.26999
|
0.14907
|
| |
Z3alpha |
Z3-alpha |
unsat ✅
|
0.60327
|
0.49414
|
| |
Z3 |
Z3-alpha-base |
unsat ✅
|
0.30706
|
0.18673
|
| |
|
z3siri-base |
unsat ✅
|
0.26423
|
0.14880
|