diff options
| author | Andrew Reynolds <andrew.j.reynolds@gmail.com> | 2013-10-02 14:22:36 -0500 |
|---|---|---|
| committer | Tianyi Liang <tianyi-liang@uiowa.edu> | 2013-10-03 10:55:14 -0500 |
| commit | b663c658c80cee918afe37222e62dd1e5db33f5c (patch) | |
| tree | 0d440c65b6454b03a4e1f4820ed3e34623edc870 /src/smt | |
| parent | 8f29e55e2d508872234fe811bccf68ffc235d5a4 (diff) | |
Added support for converting unsorted problems to multi-sorted problems via sort inference and monotonicity. Minor cleanup.
Diffstat (limited to 'src/smt')
| -rw-r--r-- | src/smt/options | 2 | ||||
| -rw-r--r-- | src/smt/smt_engine.cpp | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/src/smt/options b/src/smt/options index 7a72881b4..d2455b520 100644 --- a/src/smt/options +++ b/src/smt/options @@ -49,7 +49,7 @@ option repeatSimp --repeat-simp bool :read-write make multiple passes with nonclausal simplifier option sortInference --sort-inference bool :read-write :default false - apply sort inference to input problem + calculate sort inference of input problem, convert the input based on monotonic sorts common-option incrementalSolving incremental -i --incremental bool enable incremental solving diff --git a/src/smt/smt_engine.cpp b/src/smt/smt_engine.cpp index 1d080ea6a..85a245a09 100644 --- a/src/smt/smt_engine.cpp +++ b/src/smt/smt_engine.cpp @@ -1979,7 +1979,7 @@ bool SmtEnginePrivate::nonClausalSimplify() { } d_nonClausalLearnedLiterals.clear(); - + for (pos = constantPropagations.begin(); pos != constantPropagations.end(); ++pos) { Node cProp = (*pos).first.eqNode((*pos).second); Assert(d_topLevelSubstitutions.apply(cProp) == cProp); |