GRUNGE: A Grand Unified ATP Challenge

  title={GRUNGE: A Grand Unified ATP Challenge},
  author={C. Brown and T. Gauthier and C. Kaliszyk and G. Sutcliffe and J. Urban},
  • C. Brown, T. Gauthier, +2 authors J. Urban
  • Published in CADE 2019
  • Computer Science
  • This paper describes a large set of related theorem proving problems obtained by translating theorems from the HOL4 standard library into multiple logical formalisms. The formalisms are in higher-order logic (with and without type variables) and first-order logic (possibly with multiple types, and possibly with type variables). The resultant problem sets allow us to run automated theorem provers that support different logical formats on corresponding problems, and compare their performances… CONTINUE READING
    12 Citations
    Extensional Paramodulation for Higher-Order Logic and Its Effective Implementation Leo-III
    • 10
    • PDF
    Evaluation of Axiom Selection Techniques
    • PDF
    Extensional Higher-Order Paramodulation in Leo-III
    • 2
    • PDF
    The Higher-Order Prover Leo-III
    • 41
    • PDF
    Towards Finding Longer Proofs
    • 4
    • PDF
    A Polymorphic Vampire
    • 1
    • PDF


    SMT solvers: new oracles for the HOL theorem prover
    • Tjark Weber
    • Computer Science
    • International Journal on Software Tools for Technology Transfer
    • 2011
    • 29
    • PDF
    Hierarchic Superposition with Weak Abstraction
    • 56
    • PDF
    Hammering towards QED
    • 111
    A Focused Sequent Calculus for Higher-Order Logic
    • 12
    Experimenting with Deduction Modulo
    • 38
    • PDF
    SPASS Version 3.5
    • 251
    • PDF
    Improving automation in interactive theorem provers by efficient encoding of lambda-abstractions
    • 6
    Going Polymorphic - TH1 Reasoning for Leo-III
    • 4
    • PDF