#include "expr/node_manager.h" // for VarNameAttr
#include "expr/command.h"
#include "theory/substitutions.h"
-#include "smt/boolean_terms.h"
+#include "smt/smt_engine.h"
#include "theory/model.h"
#include <iostream>
}
TypeNode tn = n.getType();
out << n << " : ";
- /* Boolean terms functionality needs to be merged in
- if(n.hasAttribute(smt::BooleanTermAttr())) {
- out << "*** ";
- }
- */
if( tn.isFunction() || tn.isPredicate() ){
out << "(";
for( size_t i=0; i<tn.getNumChildren()-1; i++ ){
}else{
out << tn;
}
- out << " = " << tm.getValue(n.toExpr()) << ";" << std::endl;
+ out << " = " << Node::fromExpr(tm.getSmtEngine()->getValue(n.toExpr())) << ";" << std::endl;
/*
//for table format (work in progress)
#include "util/node_visitor.h"
#include "theory/substitutions.h"
#include "util/language.h"
+#include "smt/smt_engine.h"
#include "theory/model.h"
// don't print out internal stuff
return;
}
- Node val = tm.getValue( n );
+ Node val = Node::fromExpr(tm.getSmtEngine()->getValue(n.toExpr()));
if(val.getKind() == kind::LAMBDA) {
out << "(define-fun " << n << " " << val[0]
<< " " << n.getType().getRangeType()