check-referenced-state…
Validate externally referenced theorems by querying arXiv theorem search first and Codex's…
Propose multiple subgoal decomposition plans for the current theorem using the information already gathered. Use when enough information has been collected from examples, counterexamples, search results, and previous failures to break the problem into several materially
$ npx -y skills add frenzymath/Danus --skill propose-subgoal-decomposition-plans --agent claude-codeHow it fires
How this skill gets triggered: by you, by Claude, or both.
/propose-subgoal-decomposition-plansContext preview
The summary Claude sees to decide when to auto-load this skill.
Propose multiple subgoal decomposition plans for the current theorem using the information already gathered. Use when enough information has been collected from examples, counterexamples, search results, and previous failures to break the problem into several materially
name: propose-subgoal-decomposition-plans description: Propose multiple subgoal decomposition plans for the current theorem using the information already gathered. Use when enough information has been collected from examples, counterexamples, search results, and previous failures to break the problem into several materially different plans.
Use this skill when the agent has enough context to propose several viable decomposition plans.
Read:
1. Gather the current information that materially constrains the problem: useful examples, failed claims, known obstructions, and relevant search results. 2. Propose materially different decomposition plans. 3. For each plan, state:
4. Hand each plan to `$direct-proving` for a quick screening pass.
Publish one plan per decomposition to global memory with `gm_add` (kind `plan`, a judgment — `verifiable=false`): `claim` = the plan's goal + summary, `evidence` = its motivation, plus these fields:
{
"plan_id": "...",
"record_type": "decomposition_plan",
"goal": "...",
"plan_summary": "...",
"subgoals": ["..."],
"motivation": ["..."],
"uses_information_from": {
"examples": ["..."],
"counterexamples": ["..."],
"key_failures": ["..."],
"search_results": ["..."]
},
"status": "proposed|screening|screened|selected|failed|solved",
"branch_id": "optional"
}Also note the new plan set in your local memory (`events`).
If the agent cannot yet propose meaningful decomposition plans, append an `events` record with:
🚀✨ News: This branch is the version that solved YTD. 🎉 Danus orchestrates mathematical reasoning agents with fact-graph memory.
Validate externally referenced theorems by querying arXiv theorem search first and Codex's…
Aggregate all detected errors and gaps into the final verification report, apply strict…
Verify a markdown proof in the order it is written. Use when the task is to check local…
Construct candidate counterexamples to test a proposed conjecture, lemma, or intermediate…
Generate and analyze simpler examples that satisfy both the assumptions and the conclusion of…
Screen a decomposition plan by first trying to prove all of its subgoals directly, then…