Challenging Benchmarks for Diagrammatic Equivalence of Circuits in TPTP and SMT-LIB

18 pages•Published: October 23, 2026

Julie Cailler, Noé Delorme and Sophie Tourret

Abstract

We introduce a new family of benchmarks for the problem of diagrammatic equivalence between circuits. Three variants of this problem are considered, ranging from basic to challenging, and benchmarks are generated for each variant. We provide first-order encodings in both TPTP and SMT-LIB formats, together with scripts that automatically generate benchmark instances. We evaluate these benchmarks on state-of-the-art automated theorem provers and SMT solvers, highlighting the impact of encoding choices on solver performance.

Keyphrases: benchmarks, circuit equivalences, smt, tptp

In: Erika Ábrahám, Nikolaj Bjørner and Michael Rawson (editors). Proceedings of the 26th Conference on Logic for Programming, Artificial Intelligence, and Reasoning, vol 112, pages 109-126.

Links:	https://easychair.org/publications/paper/vwkf
	https://doi.org/10.29007/72rt

BibTeX entry

@inproceedings{LPAR-26:Challenging_Benchmarks_Diagrammatic_Equivalence,
  author    = {Julie Cailler and Noé Delorme and Sophie Tourret},
  title     = {Challenging Benchmarks for Diagrammatic Equivalence of Circuits in TPTP and SMT-LIB},
  booktitle = {Proceedings of the 26th Conference on Logic for Programming, Artificial Intelligence, and Reasoning},
  editor    = {Erika Ábrahám and Nikolaj Bjørner and Michael Rawson},
  series    = {EPiC Series in Computing},
  volume    = {112},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/vwkf},
  doi       = {10.29007/72rt},
  pages     = {109-126},
  year      = {2026}}

Download PDF Open PDF in browser