SyMT: finding symmetries in SMT formulas - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

SyMT: finding symmetries in SMT formulas


The QF UF category of the SMT-LIB test set contains many formulas with symmetries, and breaking these symmetries results in an important speedup [8]. This paper presents SyMT, a tool to nd and report symmetries in SMT formulas. SyMT is based on the reduction of the problem of detecting symmetries in formulas to nding automorphisms in a graph representation of these formulas. The output of SyMT may be used to improve SMT formulas to enforce the SMT solver to examine only one assignment out of many symmetric ones. We show that the classic propositional symmetry breaking technique can be lifted to SMT and yields a generic technique to break the symmetries found by SyMT. Experiments on a large part of the SMT-LIB show that symmetries are pervasive in most categories.
No file

Dates and versions

hal-00867816 , version 1 (30-09-2013)


  • HAL Id : hal-00867816 , version 1


Carlos Areces, David Déharbe, Pascal Fontaine, Orbe Ezequiel. SyMT: finding symmetries in SMT formulas. 11th International Workshop on Satisfiability Modulo Theories - SMT, Jul 2013, Helsinki, Finland. ⟨hal-00867816⟩
132 View
0 Download


Gmail Facebook X LinkedIn More