Benchmark

non-incremental/BV/2017-Preiner-tptp/ARI591=1.smt2

These benchmarks are translations from the TPTP Library (Thousands of
Problems for Theorem Provers), see http://www.cs.miami.edu/~tptp/

The TPTP is maintained by Geoff Sutcliffe, and he contributed this
selection of benchmarks to SMT-LIB.

Translated to BV by Mathias Preiner.
Benchmark
Size633
Compressed Size415
License Creative Commons Attribution 4.0 International (CC-BY-4.0)
Categoryindustrial
First Occurrence2017-07-23
Generated By
Generated On
Generator
Dolmen OK1
strict Dolmen OK1
check-sat calls1
Query 1
Status unsat
Inferred Status unsat
Size 625
Compressed Size408
Max. Term Depth6
Asserts 1
Declared Functions0
Declared Constants0
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2 and1 =1 forall1
exists1 BitVec2 bvslt2

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2017 Boolector Boolector SMT17 final boolector unsat ✅ 0.01111 0.01146
CVC4 CVC4-smtcomp2017-main default unsat ✅ 0.02070 0.01384
Q3B Q3B default unsat ✅ 0.05620 0.05593
Z3 z3-4.5.0 default unsat ✅ 0.03776 0.03692
SMT-COMP 2018 Boolector Boolector_default unsat ✅ 0.02056 0.03719
CVC4 master-2018-06-10-b19c840-competition-default_default unsat ✅ 0.01627 0.01643
Q3B Q3B_default unsat ✅ 0.02508 0.04230
Z3 z3-4.7.1_default unsat ✅ 0.04013 0.04008