This paper reports on the Hybrid Systems Theorem Proving (HSTP) category in ARCH-COMP Friendly Competition 2021. The characteristic features of HSTP cate- gory remain as previous editions [MST+18, MST+19, MMJ+20], it focuses flexi- bility programming languages structuring principles for hybrid systems, unambiguity and precision program semantics, mathematical rigor logical reasoning principles....

We will define the notions of abstract theorem-proving graph, abstract theorem-proving problem g and search strategy E for g. These concepts generalize the usual tree (or graph) searching problem and admit Hart, Nilsson and Raphael (1968) and Pohl (1969) theories of heuristic search. In particular the admissibility and optimality theorems of Hart, Nilsson and Raphael generalize for the classes ...

We present a method for integrating rippling-based rewriting into matrix-based theorem proving as a means for automating inductive specification proofs. The selection of connections in an inductive matrix proof is guided by symmetries between induction hypothesis and induction conclusion. Unification is extended by decision procedures and a rippling/reverse-rippling heuristic. Conditional subst...

This paper presents a new system, called the A-System, performing abductive reasoning within theframework of Abductive Logic Programming. It isbased on a hybrid computational model that imple-ments the abductive search in terms of two tightlycoupled processes: a reduction process of the high-level logical representation to a lower-level con-straint store and a lo...