Benchmark
non-incremental/BV/2017-Preiner-scholl-smt08/RNDPRE/RNDPRE_3_19.smt2
Scholl, Christoph; Disch, Stefan; Pigorsch, Florian and Kupferschmid,
Stefan; Using an SMT Solver and Craig Interpolation to Detect and Remove
Redundant Linear Constraints in Representations of Non-Convex Polyhedra.
Proceedings of 6th International Workshop on Satisfiability Modulo
Theories, Princeton, USA, July 2008.
<http://abs.informatik.uni-freiburg.de/smtbench/>
Translated to BV by Mathias Preiner.
| Benchmark |
|---|
| Size | 2390 |
| Compressed Size | 869 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | random |
| First Occurrence | 2017-07-23 |
| Generated By | — |
| Generated On | — |
| Generator | — |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | sat |
| Inferred Status | sat |
| Size | 2382 |
| Compressed Size | 879 |
| Max. Term Depth | 14 |
| 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 | 5 |
or | 8 |
and | 6 |
= | 10 |
forall | 1 |
exists | 2 |
BitVec | 3 |
bvneg | 24 |
bvadd | 20 |
bvmul | 35 |
bvsgt | 4 |
bvsge | 1 |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2017
|
|
Boolector |
Boolector SMT17 final boolector |
sat ✅
|
1.81332
|
1.85949
|
| |
CVC4 |
CVC4-smtcomp2017-main default |
sat ✅
|
0.40118
|
0.39652
|
| |
Q3B |
Q3B default |
sat ✅
|
16.12940
|
47.89000
|
| |
Z3 |
z3-4.5.0 default |
sat ✅
|
0.03750
|
0.03692
|
|
SMT-COMP 2018
|
|
Boolector |
Boolector_default |
sat ✅
|
0.06848
|
0.11624
|
| |
CVC4 |
master-2018-06-10-b19c840-competition-default_default |
sat ✅
|
0.81665
|
0.81670
|
| |
Q3B |
Q3B_default |
sat ✅
|
0.04037
|
0.07066
|
| |
Z3 |
z3-4.7.1_default |
sat ✅
|
0.04067
|
0.04038
|