-
Notifications
You must be signed in to change notification settings - Fork 62
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
write_cnf predictable variable mapping #1210
Comments
From the following experiments I've gained confidence that SAW's
I'm unable to try
|
The |
And now PR #1320 incorporates a Haskell implementation of AIG and CNF creation, for which we can control variable ordering. |
It sounds like the code that inspired the original report has been removed; is there anything left to do here? |
Indeed, I think we've done all we can do here with the information shown above. If there are further issues with SAW's |
It would be nice to have a CNF generation process that used a predictable mapping. Does
write_cnf
have a predictable mapping of CNF variables to predicate inputs? For example:It looks like the cnf file is being generated via abc's
&write_cnf
command. This command states:From this I deduce that
x == [5, 6, 7]
andy == [8, 9, 10]
. Is that right?I'm not sure this is correct -- I have generated some larger CNF that claim in the header to have, for example 8000 variables, yet the larger variable number showing in the CNF is around 6000.
The text was updated successfully, but these errors were encountered: