brando/Coq-Gym-Data-Set

Proverbot Scrapes

Here we include a dump of proofs in coq-gym using the proverbot9001 tool.

Dataset Structure:

• relevant_lemmas: A list of lemmas that are relevant to the proof. Each lemma is accompanied by its formal statement and registration in the proof context.
• prev_tactics: The tactics used in the previous steps of the proof (The first tactic being the lemma definition itself). This can help in understanding the sequence of operations leading to the current state.
• context: The current proof context, including background goals (bg_goals), foreground goals (fg_goals), given up goals (given_up_goals), and shelved goals (shelved_goals).
  • fg_goals: The primary goal(s) being addressed at the current step, along with any hypotheses that have been introduced.
• tactic: The tactic being applied in the current proof step.

Example Entry:

{
  'relevant_lemmas': [
    'Axiomatization2SequentCalculus_cpSC :  ClassicalPropositionalSequentCalculus L GammaD.',
    'reg_Axiomatization2SequentCalculus_cpSC :  RegisterClass P2D_reg (fun cpSC: unit => @Axiomatization2SequentCalculus_cpSC) 5.',
    ...
  ],
  'prev_tactics': [
    '\n\nLemma contrapositiveNP: forall (x y: expr),\n  |-- (~~ y --> x) --> (~~ x --> y).\n'
  ],
  'context': {
    'bg_goals': [],
    'fg_goals': [
      {
        'goal': 'forall x y : expr, provable (impp (impp (negp y) x) (impp (negp x) y))',
        'hypotheses': [
          'cpAX : ClassicalPropositionalLogic L Gamma',
          ...
        ]
      }
    ],
    'given_up_goals': [],
    'shelved_goals': []
  },
  'tactic': '\nProof.\n',
}