用 Codex 或 Claude 帮你安装 复制这段 Prompt,粘贴到 Codex、Claude 或其他助手里,让它检查 Skill 页面并帮你完成安装。
直接命令不会经过审查 Prompt;运行前请先检查来源。
npx skills add https://github.com/brycewang-stanford/Auto-Empirical-Research-Skills --skill lean-theorem-proving-guide命令会保持在同一行。复制前请横向滚动并检查完整内容。
想先保存到本地?可下载 SkillsMP 当前能够提供的文件。
Route empirical-research requests through the Auto-Empirical Research Skills catalog when this whole repository is installed as one skill in Codex, CodeBuddy, Claude Code, or another IDE. Use to choose and load the right vendored AERS skill for causal inference, econometrics, replication, data acquisition, manuscript writing, peer review and referee responses, citation checking, de-AIGC editing, or full empirical-paper workflows without reading the entire repository at once.
中英双语学术降 AIGC / bilingual academic de-AIGC skill. Removes AI-generated writing signatures from empirical papers in economics, management, and the social sciences — in both English and Chinese. Covers Turnitin AI, GPTZero, Originality.ai on the English side and 知网 AMLC, 万方, 维普 on the Chinese side. Uses a six-step loop (intake → audit → claim-evidence check → differentiated rewrite → five-dimension self-score → cold-reader recheck) with two pattern libraries (22 English + 17 Chinese patterns), section-by-section strategies for empirical papers, and hard protections that keep every number, coefficient, and citation intact.
Use when a research task needs reproducible Kaggle discovery, metadata inspection, bounded public-data downloads, competition or kernel discovery, model discovery, or an explicitly approved Kaggle write/delete operation through the official CLI.
基于 SOC 职业分类
正在显示 SKILL.md
| name | lean-theorem-proving-guide |
| description | LLM agent for formal theorem proving in Lean 4 |
| metadata | {"openclaw":{"emoji":"📐","category":"domains","subcategory":"math","keywords":["Lean 4","theorem proving","formal verification","LLM math","proof assistant","LeanAgent"],"source":"https://github.com/lean-dojo/LeanAgent"}} |
LeanAgent is an LLM-based agent for automated theorem proving in Lean 4, a modern proof assistant. It combines LLM reasoning with formal verification — proposing proof steps that are verified by Lean's type checker. Can prove novel theorems, not just benchmarks, by exploring proof strategies, backtracking on failures, and learning from successful proofs.
Theorem Statement (Lean 4)
↓
Goal Analysis Agent (understand proof obligations)
↓
Tactic Suggestion Agent (propose proof steps)
↓
Lean 4 Verification (check tactic correctness)
↓
Backtracking (if tactic fails, try alternatives)
↓
Proof or timeout
from lean_agent import LeanAgent
agent = LeanAgent(
llm_provider="anthropic",
lean_path="/path/to/lean4",
)
# Prove a theorem
result = agent.prove(
theorem="""
theorem add_comm (m n : Nat) : m + n = n + m := by
sorry
""",
max_attempts=50,
timeout=120,
)
if result.proved:
print("Proof found!")
print(result.proof)
else:
print(f"Failed. Best attempt:\n{result.best_attempt}")
print(f"Remaining goals: {result.remaining_goals}")
# Configure search strategy
agent = LeanAgent(
search_config={
"strategy": "best_first", # best_first, bfs, dfs
"max_depth": 20, # Max proof steps
"beam_width": 5, # Tactics to try per step
"temperature": 0.7, # LLM sampling temp
"backtrack_on_fail": True,
},
)
# Interactive proof mode
session = agent.interactive_prove(
theorem="theorem my_thm : ∀ n : Nat, n + 0 = n := by"
)
while not session.done:
print(f"Current goals:\n{session.goals}")
tactics = session.suggest_tactics(k=5)
for i, t in enumerate(tactics):
print(f" {i}: {t.tactic} (confidence: {t.score:.2f})")
# Agent automatically picks best tactic
session.step()
-- Common tactics LeanAgent uses:
-- intro, apply, exact, rfl, simp, omega
-- induction, cases, constructor, ext
-- rw, calc, have, let, show
-- Example theorem + proof
theorem list_append_nil (l : List α) : l ++ [] = l := by
induction l with
| nil => simp
| cons h t ih => simp [ih]
# Prove multiple theorems
theorems = [
"theorem t1 : 1 + 1 = 2 := by sorry",
"theorem t2 (n : Nat) : n + 0 = n := by sorry",
"theorem t3 (n m : Nat) : n + m = m + n := by sorry",
]
results = agent.prove_batch(
theorems=theorems,
parallel=True,
timeout_per=60,
)
for thm, result in zip(theorems, results):
status = "PROVED" if result.proved else "FAILED"
print(f"[{status}] {thm[:50]}...")