diff options
| author | ajreynol <andrew.j.reynolds@gmail.com> | 2016-03-10 17:49:13 -0600 |
|---|---|---|
| committer | ajreynol <andrew.j.reynolds@gmail.com> | 2016-03-10 17:49:13 -0600 |
| commit | d0df704a60696d7f824eb01781b413d91a0e4202 (patch) | |
| tree | 501058c359ff029cad024a3a715efdf33968c426 /src/theory/quantifiers/quant_conflict_find.h | |
| parent | 346c85d145f6938ce7dce74e7e7cb855d5a6025a (diff) | |
Faster conditional rewriting for and/or beneath quantifiers. Improvements to sort inference, related to constants. Add several quantifiers options, minor refactoring.
Diffstat (limited to 'src/theory/quantifiers/quant_conflict_find.h')
| -rw-r--r-- | src/theory/quantifiers/quant_conflict_find.h | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/theory/quantifiers/quant_conflict_find.h b/src/theory/quantifiers/quant_conflict_find.h index 11299b532..4bcc59bde 100644 --- a/src/theory/quantifiers/quant_conflict_find.h +++ b/src/theory/quantifiers/quant_conflict_find.h @@ -98,7 +98,7 @@ public: // is this term treated as UF application? static bool isHandledBoolConnective( TNode n ); static bool isHandledUfTerm( TNode n ); - static Node getOperator( QuantConflictFind * p, Node n ); + static Node getMatchOperator( QuantConflictFind * p, Node n ); //can this node be handled by the algorithm static bool isHandled( TNode n ); }; |