c0617da18d
... while at it also call `trivial` to close goals that can be trivially closed. --------- Co-authored-by: Siddharth <siddu.druid@gmail.com> Co-authored-by: Henrik Böving <hargonix@gmail.com>
25 lines
766 B
Text
25 lines
766 B
Text
import Std.Tactic.BVDecide
|
|
|
|
open BitVec
|
|
|
|
set_option bv.ac_nf false
|
|
|
|
/--
|
|
error: The SAT solver timed out while solving the problem.
|
|
Consider increasing the timeout with `set_option sat.timeout <sec>`
|
|
-/
|
|
#guard_msgs in
|
|
set_option sat.timeout 1 in
|
|
theorem timeout (x y z : BitVec 1024) : x - (y + z) = x - y - z := by
|
|
bv_decide
|
|
|
|
/--
|
|
error: None of the hypotheses are in the supported BitVec fragment.
|
|
There are two potential fixes for this:
|
|
1. If you are using custom BitVec constructs simplify them to built-in ones.
|
|
2. If your problem is using only built-in ones it might currently be out of reach.
|
|
Consider expressing it in terms of different operations that are better supported.
|
|
-/
|
|
#guard_msgs in
|
|
theorem no_hyps (x y : Nat) : x * y = y * x := by
|
|
bv_decide
|