| Vol-4116 urn:nbn:de:0074-4116-x Copyright © 2025 for the individual papers by the papers' authors. Copyright © 2025 for the volume as a collection by its editors. This volume and its papers are published under the Creative Commons License Attribution 4.0 International (CC BY 4.0).

# SC-Square 2025
Satisfiability Checking and Symbolic Computation 2025

### Proceedings of the 10th International Workshop on Satisfiability Checking and Symbolic Computation (SC-Square 2025)
Collocated with The 30th International Conference on Automated Deduction (CADE 2025)

### Stuttgart, Germany, August 2, 2025.

### Website: SC2 2025

Edited by

### Mădălina Erașcu 1
Mikoláš Janota 2

1 West University of Timisoara, Faculty of Informatics, 4 Vasile Pârvan Blvd., 300223 Timișoara, Romania
2 CIIRC, CTU Prague, Jugoslávských partyzánů 1580/3, 160 00 Prague 6, Prague, Czech Republic

## Table of Contents

- Preface
  Summary: There were 6 papers submitted for peer-review to this workshop (including 2 invited papers) and all were accepted. Out of these, 4 are regular papers and 2 short papers.

### Invited Papers

- SAT Modulo Symmetries: A Survey 1-11
  Stefan Szeider
- Boosting Vampire with Neural Networks 12-18
  Martin Suda, Filip Bártek

### Contributed Papers

- A Variant of Non-uniform Cylindrical Algebraic Decomposition for Real Quantifier Elimination 19-34
  Jasper Nalbach, Erika Ábrahám
- Recycling Algebraic Proof Certificates 35-40
  Daniela Kaufmann, Clemens Hofstadler
- Projective Delineability for Single Cell Construction 41-54
  Jasper Nalbach, Lucas Michel, Erika Ábrahám, Christopher W. Brown, James H. Davenport, Matthew England, Pierre Mathonet, Naïm Zénaïdi
- Symbolic Sets for Proving Bounds on Rado Numbers 55-75
  Tanbir Ahmed, Lamina Zaman, Curtis Bright

2025-11-28: submitted by Mikoláš Janota, metadata incl. bibliographic data published under Creative Commons CC0
2025-12-02: published on CEUR Workshop Proceedings (CEUR-WS.org, ISSN 1613-0073) |valid HTML5|