Benchmark
non-incremental/QF_LIA/20180326-Bromberger/unbd-sage/unbd075v83c/unbd-sage3.smt2
Publications: M. Bromberger. A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems. (Work in progress.)
The benchmarks in this class were randomly generated by a sagemath script and by way of construction they are all satisfiable.
Target solver: CVC4 Mathsat SPASS-IQ YICES Z3
| Benchmark |
|---|
| Size | 66661 |
| Compressed Size | 11398 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | random |
| First Occurrence | 2018-07-14 |
| Generated By | Martin Bromberger |
| Generated On | 2018-01-06 00:00:00 |
| Generator | https://www.mpi-inf.mpg.de/fileadmin/inf/rg1/Documents/RandomUnboundedSageScript.tar.gz |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | sat |
| Inferred Status | None |
| Size | 66654 |
| Compressed Size | 11408 |
| Max. Term Depth | 78 |
| Asserts | 1 |
| Declared Functions | 0 |
| Declared Constants | 75 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
and | 1 |
+ | 3862 |
- | 2034 |
* | 3945 |
<= | 83 |
| | | | | |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2018
|
0.88 (1/8) |
Ctrl-Ergo |
Ctrl-Ergo-SMTComp-2018_default |
sat ✅
|
50.41990
|
200.33000
|
| |
CVC4 |
master-2018-06-10-b19c840-competition-default_default |
unknown ❌
|
1200.05000
|
1200.01000
|
| |
MathSAT |
mathsat-5.5.2-linux-x86_64-Main_default |
unknown ❌
|
1200.05000
|
1199.94000
|
| |
SMTInterpol |
SMTInterpol-2.5-19-g0d39cdee_default |
unknown ❌
|
1200.12000
|
1221.92000
|
| |
SMT-RAT |
SMTRAT-Rat-final_default |
unknown ❌
|
1200.02000
|
1199.89000
|
| |
veriT |
veriT_default |
unknown ❌
|
3.73853
|
3.73815
|
| |
Yices2 |
Yices 2.6.0_default |
unknown ❌
|
1200.01000
|
1199.95000
|
| |
Z3 |
z3-4.7.1_default |
unknown ❌
|
1200.03000
|
1200.05000
|