Algorithms and Complexity Group
  • People
  • Research
  • Courses
  • Talks
  • Jobs
  • Contact

qrp2rup

This page provides a link to download an alpha implementation of our algorithm for polynomial-time validation of QCDCL certificates, as described in [1]. The source code will be published at a later time. This binary was used to carry out the experiments described in Section 7 of the paper. In order to use the program, run

$ ./qrp2rup <qrp_file> <qdimacs_file>

This will extract the certificate into <qrp_file>.cert, the RUP proof into <qrp_file>.rup, and will combine the certificate and the original formula into <qrp_file>.cnf (the validation formula). qrp2rup automatically detects whether the input formula is true or false, and whether the given proof is long-distance or not (in fact it always runs the long-distance version of the algorithm, but the results on ordinary Q-resolution proofs are identical). Afterwards, the certificate can be validated by DRAT-trim [2]

$ drat-trim <qrp_file>.cnf <qrp_file>.rup

or by calling a SAT solver on <qrp_file>.cnf. In order to generate deletion information for the RUP proof, pass the command line parameter -d n to qrp2rup, where n is a non-negative integer, 0 meaning to produce no deletion information (default), and a positive value meaning to produce deletion information for all clauses of size greater than n. Since DRAT-trim ignores deletions of unit clauses anyway, deletion information for unit clauses is never generated.

 

Download qrp2rup

 

[1] Peitl, T., Slivovsky F., and Szeider S.,: Polynomial-Time Validation of QCDCL Certificates, to appear at SAT 2018

[2] Wetzler, N., Heule, M.J.H., and Hunt, Jr., W.A.: DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs. In: Theory and Applications of Satisfiability Testing (SAT) Volume 8561 of LNCS, Springer (2014) 422-429

 

 

News

  • Best Paper Award and Honourable Mention at EuroVis 2025

    Best Paper Award and Honourable Mention at EuroVis 2025

    2025-06-13
    Two papers co-authored by our ESPRIT fellow Sara Di Bartolomeo received awards during the EuroVis 2025 conference, held June 2-6 …Read More »
  • Markus Wallinger receives EuroVis PhD Award

    Markus Wallinger receives EuroVis PhD Award

    2025-06-13
    Markus Wallinger, who did his PhD in the Algorithms and Complexity group in 2024, received the EuroVis PhD Award for …Read More »
  • Best Paper Award at SOFSEM 2025

    Best Paper Award at SOFSEM 2025

    2025-01-23
    Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, and Martin Nöllenburg received the Best Paper Award for their paper …Read More »
  • Markus Wallinger receives Award of Excellence for his PhD Thesis

    Markus Wallinger receives Award of Excellence for his PhD Thesis

    2024-12-05
    Our former group member Markus Wallinger won the Award of Excellence by the Federal Ministry for Education, Science and Research. …Read More »
  • Thomas Depian receives State Prize for his Master’s Thesis

    Thomas Depian receives State Prize for his Master’s Thesis

    2024-11-21
    Our group member Thomas Depian won the Appreciation Award given by the Federal Ministry for Education, Science and Research. This …Read More »

News archive

All news for 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023 and 2024.
TU Wien Informatics
Offenlegung (§25 MedienG) Inhaber der Website ist das Institut für Logic and Computation an der Technischen Universität Wien, 1040 Wien. Die TU Wien distanziert sich von den Inhalten aller extern gelinkten Seiten und übernimmt diesbezüglich keine Haftung. – Disclaimer – Datenschutzerklärung
Log in requires cookies.