Douvras Labs datasets and models
Collection
Synthetic Douvras Labs artifacts. Cards list license, splits, baseline and limits. M01 weights and D20 stay unpublished. • 342 items • Updated
candidate_correction stringclasses 6
values | compiler_error stringclasses 6
values | error_label stringclasses 6
values | failed_code stringclasses 6
values | goal stringclasses 6
values | id stringlengths 16 22 | language stringclasses 1
value | mathlib_version stringclasses 1
value | proof_status stringclasses 1
value | repair_reason stringclasses 6
values | source_artifact stringclasses 1
value | split stringclasses 1
value | synthetic bool 1
class | task_id stringlengths 16 22 | theorem_context stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
prova aceita pelo compilador | no error | completed | theorem reflexiva (x : Nat) : x = x := by rfl | Nat) : x = x := by rfl | LPR-COMPLETED-01 | pt | synthetic-not-run | NOT_EXECUTED | prova concluída | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-COMPLETED-01 | teorema sintético em aritmética elementar |
prova aceita pelo compilador | no error | completed | theorem reflexiva (x : Nat) : x = x := by rfl | Nat) : x = x := by rfl | LPR-COMPLETED-02 | pt | synthetic-not-run | NOT_EXECUTED | prova concluída | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-COMPLETED-02 | teorema sintético em aritmética elementar |
prova aceita pelo compilador | no error | completed | theorem reflexiva (x : Nat) : x = x := by rfl | Nat) : x = x := by rfl | LPR-COMPLETED-03 | pt | synthetic-not-run | NOT_EXECUTED | prova concluída | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-COMPLETED-03 | teorema sintético em aritmética elementar |
prova aceita pelo compilador | no error | completed | theorem reflexiva (x : Nat) : x = x := by rfl | Nat) : x = x := by rfl | LPR-COMPLETED-04 | pt | synthetic-not-run | NOT_EXECUTED | prova concluída | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-COMPLETED-04 | teorema sintético em aritmética elementar |
by rfl | did not find instance of the pattern | invalid_rewrite | theorem dup (x : Nat) : x = x := by rw [Nat.add_comm] | Nat) : x = x := by rw [Nat.add_comm] | LPR-INVALID_REWRITE-01 | pt | synthetic-not-run | NOT_EXECUTED | reescrita não aplicável | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-INVALID_REWRITE-01 | teorema sintético em aritmética elementar |
by rfl | did not find instance of the pattern | invalid_rewrite | theorem dup (x : Nat) : x = x := by rw [Nat.add_comm] | Nat) : x = x := by rw [Nat.add_comm] | LPR-INVALID_REWRITE-02 | pt | synthetic-not-run | NOT_EXECUTED | reescrita não aplicável | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-INVALID_REWRITE-02 | teorema sintético em aritmética elementar |
by rfl | did not find instance of the pattern | invalid_rewrite | theorem dup (x : Nat) : x = x := by rw [Nat.add_comm] | Nat) : x = x := by rw [Nat.add_comm] | LPR-INVALID_REWRITE-03 | pt | synthetic-not-run | NOT_EXECUTED | reescrita não aplicável | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-INVALID_REWRITE-03 | teorema sintético em aritmética elementar |
by rfl | did not find instance of the pattern | invalid_rewrite | theorem dup (x : Nat) : x = x := by rw [Nat.add_comm] | Nat) : x = x := by rw [Nat.add_comm] | LPR-INVALID_REWRITE-04 | pt | synthetic-not-run | NOT_EXECUTED | reescrita não aplicável | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-INVALID_REWRITE-04 | teorema sintético em aritmética elementar |
import Mathlib | unknown identifier `simp` | missing_import | theorem soma_zero (n : Nat) : n + 0 = n := by simp | Nat) : n + 0 = n := by simp | LPR-MISSING_IMPORT-01 | pt | synthetic-not-run | NOT_EXECUTED | importação ausente | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-MISSING_IMPORT-01 | teorema sintético em aritmética elementar |
import Mathlib | unknown identifier `simp` | missing_import | theorem soma_zero (n : Nat) : n + 0 = n := by simp | Nat) : n + 0 = n := by simp | LPR-MISSING_IMPORT-02 | pt | synthetic-not-run | NOT_EXECUTED | importação ausente | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-MISSING_IMPORT-02 | teorema sintético em aritmética elementar |
import Mathlib | unknown identifier `simp` | missing_import | theorem soma_zero (n : Nat) : n + 0 = n := by simp | Nat) : n + 0 = n := by simp | LPR-MISSING_IMPORT-03 | pt | synthetic-not-run | NOT_EXECUTED | importação ausente | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-MISSING_IMPORT-03 | teorema sintético em aritmética elementar |
import Mathlib | unknown identifier `simp` | missing_import | theorem soma_zero (n : Nat) : n + 0 = n := by simp | Nat) : n + 0 = n := by simp | LPR-MISSING_IMPORT-04 | pt | synthetic-not-run | NOT_EXECUTED | importação ausente | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-MISSING_IMPORT-04 | teorema sintético em aritmética elementar |
by omega ou by simpa [Nat.add_comm] | tactic `rfl` failed | tactic_failure | theorem comutativa (a b : Nat) : a + b = b + a := by exact rfl | Nat) : a + b = b + a := by exact rfl | LPR-TACTIC_FAILURE-01 | pt | synthetic-not-run | NOT_EXECUTED | tática não prova a meta | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-TACTIC_FAILURE-01 | teorema sintético em aritmética elementar |
by omega ou by simpa [Nat.add_comm] | tactic `rfl` failed | tactic_failure | theorem comutativa (a b : Nat) : a + b = b + a := by exact rfl | Nat) : a + b = b + a := by exact rfl | LPR-TACTIC_FAILURE-02 | pt | synthetic-not-run | NOT_EXECUTED | tática não prova a meta | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-TACTIC_FAILURE-02 | teorema sintético em aritmética elementar |
by omega ou by simpa [Nat.add_comm] | tactic `rfl` failed | tactic_failure | theorem comutativa (a b : Nat) : a + b = b + a := by exact rfl | Nat) : a + b = b + a := by exact rfl | LPR-TACTIC_FAILURE-03 | pt | synthetic-not-run | NOT_EXECUTED | tática não prova a meta | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-TACTIC_FAILURE-03 | teorema sintético em aritmética elementar |
by omega ou by simpa [Nat.add_comm] | tactic `rfl` failed | tactic_failure | theorem comutativa (a b : Nat) : a + b = b + a := by exact rfl | Nat) : a + b = b + a := by exact rfl | LPR-TACTIC_FAILURE-04 | pt | synthetic-not-run | NOT_EXECUTED | tática não prova a meta | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-TACTIC_FAILURE-04 | teorema sintético em aritmética elementar |
theorem deve declarar o mesmo tipo | type mismatch: Nat is not Int | type_mismatch | theorem identidade (n : Nat) : n = (n : Int) := by rfl | Nat) : n = (n : Int) := by rfl | LPR-TYPE_MISMATCH-01 | pt | synthetic-not-run | NOT_EXECUTED | tipos incompatíveis | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-TYPE_MISMATCH-01 | teorema sintético em aritmética elementar |
theorem deve declarar o mesmo tipo | type mismatch: Nat is not Int | type_mismatch | theorem identidade (n : Nat) : n = (n : Int) := by rfl | Nat) : n = (n : Int) := by rfl | LPR-TYPE_MISMATCH-02 | pt | synthetic-not-run | NOT_EXECUTED | tipos incompatíveis | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-TYPE_MISMATCH-02 | teorema sintético em aritmética elementar |
theorem deve declarar o mesmo tipo | type mismatch: Nat is not Int | type_mismatch | theorem identidade (n : Nat) : n = (n : Int) := by rfl | Nat) : n = (n : Int) := by rfl | LPR-TYPE_MISMATCH-03 | pt | synthetic-not-run | NOT_EXECUTED | tipos incompatíveis | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-TYPE_MISMATCH-03 | teorema sintético em aritmética elementar |
theorem deve declarar o mesmo tipo | type mismatch: Nat is not Int | type_mismatch | theorem identidade (n : Nat) : n = (n : Int) := by rfl | Nat) : n = (n : Int) := by rfl | LPR-TYPE_MISMATCH-04 | pt | synthetic-not-run | NOT_EXECUTED | tipos incompatíveis | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-TYPE_MISMATCH-04 | teorema sintético em aritmética elementar |
by omega | unsolved goals | unsolved_goal | theorem sucessor (n : Nat) : n < n + 1 := by simp? | Nat) : n < n + 1 := by simp? | LPR-UNSOLVED_GOAL-01 | pt | synthetic-not-run | NOT_EXECUTED | meta permanece aberta | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-UNSOLVED_GOAL-01 | teorema sintético em aritmética elementar |
by omega | unsolved goals | unsolved_goal | theorem sucessor (n : Nat) : n < n + 1 := by simp? | Nat) : n < n + 1 := by simp? | LPR-UNSOLVED_GOAL-02 | pt | synthetic-not-run | NOT_EXECUTED | meta permanece aberta | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-UNSOLVED_GOAL-02 | teorema sintético em aritmética elementar |
by omega | unsolved goals | unsolved_goal | theorem sucessor (n : Nat) : n < n + 1 := by simp? | Nat) : n < n + 1 := by simp? | LPR-UNSOLVED_GOAL-03 | pt | synthetic-not-run | NOT_EXECUTED | meta permanece aberta | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-UNSOLVED_GOAL-03 | teorema sintético em aritmética elementar |
by omega | unsolved goals | unsolved_goal | theorem sucessor (n : Nat) : n < n + 1 := by simp? | Nat) : n < n + 1 := by simp? | LPR-UNSOLVED_GOAL-04 | pt | synthetic-not-run | NOT_EXECUTED | meta permanece aberta | 04_FORMAL_RESEARCH_LAB/05_FORMAL/lean | train | true | LPR-UNSOLVED_GOAL-04 | teorema sintético em aritmética elementar |
Exemplos sintéticos de erros comuns de reparo em Lean: importação ausente, incompatibilidade de
tipos, falha de tática, meta não resolvida, reescrita inválida e prova reflexiva. Os snippets não
foram executados no compilador (proof_status: NOT_EXECUTED); portanto o corpus não prova nenhum
teorema e não substitui validação com uma versão específica do Mathlib.