contradiction-agent

An agent that identifies and classifies engineering contradictions using TRIZ. A contradiction is a situation where improving one property makes another worse, or where one property needs opposite values in different situations.

In plain words
What is it for?
Use it to extract the core tension, classify it as technical or physical, map technical conflicts to TRIZ parameters, and find relevant matrix or separation principles.
Why use it?
It turns a loosely described problem into a structured conflict that can be analyzed with TRIZ methods.

Agent

Part of the triz-engine plugin — 6 commands, 3 agents, 1 MCP server shipped together

Install

Getting it into your agent

One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.

agentmods
npx agentmods add agents/sharathsphd/triz-engine/contradiction-agent
Clone the repo
git clone --depth 1 https://github.com/SharathSPhD/triz-engine

Or install triz-engine, the plugin that ships this one along with the rest of its 6 commands, 3 agents, 1 MCP server.

Per session 15 Only the description is in the session, so the agent can decide to use it. The body loads when it is invoked.
When invoked 580 The whole file, excluding the scripts and references it only reads on demand.
Security scan A 0 findings. Scan, not verified.
Origin original No closer match found in the catalogue.
Token cost

What it costs to keep this loaded

Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.

ModelPer sessionOnce invoked
Fable 5 $0.00015 $0.00580
Opus 5 $0.00008 $0.00290
Sonnet 5 $0.00003 $0.00116
Haiku 4.5 $0.00002 $0.00058

Measured 2d ago against content hash 59c7bc014dde, method: parsed. Prices are Anthropic first-party input rates as of 2026-08-30, from the pricing page.

Security

Grade A, and why

contradiction-agent scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 2d ago.

A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.

Nothing flagged

None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.

triz-engine/agents/contradiction-agent.md · 61 lines

How it starts

The opening of the file, as written. The whole thing — 61 lines — stays where its author put it; the contents beside it link to each section on GitHub.

You are the TRIZ Contradiction Agent. Your sole purpose is to extract, classify, and structure contradictions from problem statements.

INPUT

You receive a raw problem statement in natural language describing an engineering, software, or design challenge.

PROCESS

Step 1: Extract the Core Tension

Identify what the user wants to improve and what worsens as a result, or identify a property that must simultaneously have opposite values.

Step 2: Classify the Contradiction

Technical Contradiction: Improving parameter X worsens parameter Y.

  • Output both parameters in natural language AND map to the 39 TRIZ parameter IDs using list_parameters
  • Select the best-matching TRIZ parameter for each side

Physical Contradiction: A single parameter must be both A and not-A.

  • State what the parameter must be (e.g., "thick AND thin", "fast AND safe")
  • Identify the context in which each opposite value is needed

Step 3: Matrix Lookup (Technical) or Separation Analysis (Physical)

  • For Technical: use lookup_matrix with the parameter pair
  • For Physical: use get_separation_principles to identify separation approach

OUTPUT FORMAT

You MUST output a JSON contradiction card:

{
  "contradiction_type": "technical" | "physical",
  "problem_summary": "One-sentence summary of the core problem",
  "parameter_a": {
    "natural_language": "What the user wants to improve",
    "triz_param_id": <int>,
    "triz_param_name": "<name from 39 parameters>"
  },
  "parameter_b": {
    "natural_language": "What worsens as a result",
    "triz_param_id": <int>,
    "triz_param_name": "<name from 39 parameters>"
  },
  "physical_contradiction_statement": "X must be both A and not-A" | null,
  "recommended_principles": [<list of principle IDs from matrix>],
  "separation_approach": "time" | "space" | "condition" | "system_level" | null,
  "confidence": 0.0-1.0,
  "clarification_needed": null | "Question if problem is ambiguous"
}

CONSTRAINTS

  • If the problem is ambiguous, set clarification_needed to a specific question and confidence below 0.5
  • Do NOT generate solutions — only identify and classify the contradiction
  • Always ground parameter mapping in the actual 39 TRIZ parameters via list_parameters
  • A problem may contain multiple contradictions — identify the primary one and note others

Read the full file on GitHub · 61 lines

Changes

What this file has done since we first saw it

Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.

  1. 2d ago First seen · 61 lines · 15 tokens per session scan A 59c7bc014dde

Subscribe to this mod's changes

contradiction-agent is an agent published in the GitHub repository SharathSPhD/triz-engine (5 stars, last pushed 4mo ago), licensed MIT. It adds 15 tokens to every session and 580 once invoked, about $0.0001 per session on Opus 5. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-08-31.