extended smt parser for the finite relations

fixed typing rules for relational terms
added a benchmark example for the theory of finite relations

1 files changed, 8 insertions, 0 deletions

diff --git a/src/printer/smt2/smt2_printer.cpp b/src/printer/smt2/smt2_printer.cpp
index ece4e9177..7afbf4e40 100644
--- a/src/printer/smt2/smt2_printer.cpp
+++ b/src/printer/smt2/smt2_printer.cpp
@@ -506,6 +506,10 @@ void Smt2Printer::toStream(std::ostream& out, TNode n,
   case kind::SUBSET:
   case kind::MEMBER:
   case kind::SET_TYPE:
+  case kind::TRANSCLOSURE:
+  case kind::TRANSPOSE:
+  case kind::JOIN:
+  case kind::PRODUCT:
   case kind::SINGLETON: out << smtKindString(k) << " "; break;
 
     // fp theory
@@ -784,6 +788,10 @@ static string smtKindString(Kind k) throw() {
   case kind::SET_TYPE: return "Set";
   case kind::SINGLETON: return "singleton";
   case kind::INSERT: return "insert";
+  case kind::TRANSCLOSURE: return "transclosure";
+  case kind::TRANSPOSE: return "transpose";
+  case kind::PRODUCT: return "product";
+  case kind::JOIN: return "join";
 
     // fp theory
   case kind::FLOATINGPOINT_FP: return "fp";