-
Notifications
You must be signed in to change notification settings - Fork 6
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
to_int
: axioms for number equations
#124
Conversation
Results from
on all benchmarks:
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Looks good!
for(int i = 0; i < val; i++) { | ||
if(re == nullptr) { | ||
re = m_util_s.re.mk_full_char(nullptr); | ||
} else { | ||
re = m_util_s.re.mk_concat(re, m_util_s.re.mk_full_char(nullptr)); | ||
} | ||
} |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
this could be also mk_loop
, right?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Loop is imo <=. For equality we need exactly n.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
But you can put mk_loop(str, val, val)
no? Or is there no minimum?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Ok, you are right.
@jurajsic Just let me know if you are happy with the changes and I can merge it then. |
Yeah i think you can |
This PR introduces optimizations generating axioms for length (in)equations and constant conversions.