Touist.ParseSourceParse a TouIST string into an Abstract Syntaxic Tree (AST).
After this step, the AST (its type is Types.Ast.t) can go through different functions:
Eval.eval for type-checking and evaluation of the expressions (bigor, bigand, variables...):Cnf.ast_to_cnf and then SatSolve.minisat_clauses_of_cnf to transform the AST into a clause ready to use by MinisatSmt.to_smt2 to transform the AST into LIB-SMT2Qbf.prenex to transform the CNF AST into QDIMACSSatSolve.minisat_clauses_of_cnf and SatSolve.solve_clauses to solve the SAT problem