diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2020-11-13 10:29:31 -0800 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2020-11-13 10:29:31 -0800 |
| commit | 22388f901a88dddfe629dd3c1406b06fafa9675d (patch) | |
| tree | 8e99ba4a2e90fd84468738af7ef26dd971f67848 /src/proof/cec/cec.h | |
| parent | 38d72c43435f70eb8703dc922f3c0630132bffcc (diff) | |
| download | abc-22388f901a88dddfe629dd3c1406b06fafa9675d.tar.gz abc-22388f901a88dddfe629dd3c1406b06fafa9675d.tar.bz2 abc-22388f901a88dddfe629dd3c1406b06fafa9675d.zip | |
Adding and integrating new SAT solver APIs.
Diffstat (limited to 'src/proof/cec/cec.h')
| -rw-r--r-- | src/proof/cec/cec.h | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/src/proof/cec/cec.h b/src/proof/cec/cec.h index c5c5dbb7..3414842c 100644 --- a/src/proof/cec/cec.h +++ b/src/proof/cec/cec.h @@ -95,6 +95,7 @@ struct Cec_ParSmf_t_ typedef struct Cec_ParFra_t_ Cec_ParFra_t; struct Cec_ParFra_t_ { + int jType; // solver type int nWords; // the number of simulation words int nRounds; // the number of simulation rounds int nItersMax; // the maximum number of iterations of SAT sweeping |