summaryrefslogtreecommitdiff
path: root/src/theory/strings/extf_solver.h
diff options
context:
space:
mode:
authorAndrew Reynolds <andrew.j.reynolds@gmail.com>2020-08-16 07:17:53 -0500
committerGitHub <noreply@github.com>2020-08-16 07:17:53 -0500
commitb4ae9cc5fd26ecbb51870020d05c427fc97c7103 (patch)
treeddc520a2be8d099aa395b87ca0184e5149e34dfa /src/theory/strings/extf_solver.h
parentf4f7f148082535c23e24a0b92cdf2612f0598072 (diff)
Add non-emptiness to conclusion of positive RE star unfolding. (#4899)
A recent commit (77e9881) simplified the form of the conclusion in regular expression star unfolding for the sake of uniformity in our internal proof calculus. However, this led to a noticeable drop in performance on a few specific RE benchmarks (the Norn set). This preserves the old behavior by extending the core rule for RE unfolding. It also makes one minor change to the strings proof checker carried over from the proof-new branch.
Diffstat (limited to 'src/theory/strings/extf_solver.h')
0 files changed, 0 insertions, 0 deletions
generated by cgit on debian on lair
contact matthew@masot.net with questions or feedback