## MathCheck

swMATH ID: | 13642 |

Software Authors: | Bright, Curtis; Ganesh, Vijay; Heinle, Albert; Kotsireas, Ilias; Nejati, Saeed; Czarnecki, Krzysztof; Zulkoski, Edward |

Description: | MathCheck: a math assistant via a combination of computer algebra systems and SAT solvers. We present a method and an associated system, called MathCheck, that embeds the functionality of a computer algebra system (CAS) within the inner loop of a conflict-driven clause-learning SAT solver. SAT+CAS systems, a la MathCheck, can be used as an assistant by mathematicians to either counterexample or finitely verify open universal conjectures on any mathematical topic (e.g., graph and number theory, algebra, geometry, etc.) supported by the underlying CAS system. Such a SAT+CAS system combines the efficient search routines of modern SAT solvers, with the expressive power of CAS, thus complementing both. The key insight behind the power of the SAT+CAS combination is that the CAS system can help cut down the search-space of the SAT solver, by providing learned clauses that encode theory-specific lemmas, as it searches for a counterexample to the input conjecture (just like the T in DPLL(T)). In addition, the combination enables a more efficient encoding of problems than a pure Boolean representation.{par}In this paper, we leverage the graph-theoretic capabilities of an open-source CAS, called SAGE. As case studies, we look at two long-standing open mathematical conjectures from graph theory regarding properties of hypercubes: the first conjecture states that any matching of any d-dimensional hypercube can be extended to a Hamiltonian cycle; and the second states that given an edge-antipodal coloring of a hypercube, there always exists a monochromatic path between two antipodal vertices. Previous results have shown the conjectures true up to certain low-dimensional hypercubes, and attempts to extend them have failed until now. Using our SAT+CAS system, MathCheck, we extend these two conjectures to higher-dimensional hypercubes. We provide detailed performance analysis and show an exponential reduction in search space via the SAT+CAS combination relative to finite brute-force search. (new: MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures) |

Homepage: | https://uwaterloo.ca/mathcheck/ |

Related Software: | Lynx; Maple; FFTW; nsoks; Mathematica; SageMath; z3; veriT; Chaff; MiniSat; SMT-LIB; GitHub; DRAT-trim; tawSolver; STP; sharpSAT; Hadamard; CVC4; CPGraph; Magma |

Referenced in: | 13 Publications |

Further Publications: | https://uwaterloo.ca/mathcheck/publications |

### Standard Articles

all
top 5

### Referenced by 24 Authors

all
top 5

### Referenced in 7 Serials

all
top 5

### Referenced in 6 Fields

11 | Combinatorics (05-XX) |

11 | Computer science (68-XX) |

3 | Information and communication theory, circuits (94-XX) |

2 | Number theory (11-XX) |

1 | Geometry (51-XX) |

1 | Quantum theory (81-XX) |