check-referenced-state…
Validate externally referenced theorems by querying arXiv theorem search first and Codex's…
Construct candidate counterexamples to test a proposed conjecture, lemma, or intermediate claim by keeping the assumptions true while making the claimed conclusion fail. Use when a proposed conjecture/claim feels fragile or unproved, or when you are stuck in reasoning and want
$ npx -y skills add frenzymath/Danus --skill construct-counterexamples --agent claude-codeHow it fires
How this skill gets triggered: by you, by Claude, or both.
/construct-counterexamplesContext preview
The summary Claude sees to decide when to auto-load this skill.
Construct candidate counterexamples to test a proposed conjecture, lemma, or intermediate claim by keeping the assumptions true while making the claimed conclusion fail. Use when a proposed conjecture/claim feels fragile or unproved, or when you are stuck in reasoning and want
name: construct-counterexamples description: Construct candidate counterexamples to test a proposed conjecture, lemma, or intermediate claim by keeping the assumptions true while making the claimed conclusion fail. Use when a proposed conjecture/claim feels fragile or unproved, or when you are stuck in reasoning and want to see where the assumptions take effect and gain intuition.
Actively falsify proposed conjectures or intermediate claims by finding examples that satisfy the assumptions but violate the claimed conclusion.
Read:
1. Identify the assumptions that must hold and the conclusion to fail. 2. Use reasoning, decomposition, and retrieval to search for standard obstructions, pathological constructions, or previously known counterexamples. 3. Decide status:
4. If the search produces a concrete example that is informative but is not actually a counterexample, save that example as well in `toy_examples`. 5. If refuted, store the counterexample for reuse against future claims and mark impacted branches/lemmas as invalid. 6. If no counterexample is found, treat that only as evidence that the claim may be correct, not as a proof.
Publish to global memory with `gm_add` (kind `counterexample`): `claim` = what is refuted/tested, `evidence` = the candidate construction, plus these fields:
{
"target_claim": "...",
"candidate_counterexample": "...",
"status": "refuted|not_refuted|inconclusive",
"assumptions_satisfied": ["..."],
"failed_conclusion": "...",
"impact": "...",
"branch_id": "optional",
"subgoal_id": "optional"
}If `status="refuted"` and it kills a branch, also publish a `dead_end` finding (`gm_add`, kind `dead_end`) so siblings skip that branch.
If the search produced a concrete non-refuting example, also publish an `example` finding (`gm_add`, kind `example`):
{
"example": "...",
"why_relevant": "constructed while testing the claim ...",
"assumptions_satisfied": ["..."],
"conclusion_verified": true,
"where_assumptions_take_effect": "...",
"observed_pattern": "...",
"supports_branch_ids": ["optional"],
"subgoal_id": "optional"
}Do this whenever the constructed example is useful enough to test future claims or clarify the current branch, even if it did not refute the target claim.
If no meaningful counterexample space is identified, append:
🚀✨ 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…
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…
Synthesize the common stuck points across failed decomposition plans. Use when the current…