triz_rule_set
Validates a named rewrite-rule subset and proves termination via strictly decreasing lexicographic box/wire counts; does not infer global confluence or critical-pair completeness.
Instructions
Validate a named rule subset and establish termination when every successful application strictly decreases lexicographic box/wire counts. No global confluence or critical-pair completeness is inferred.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| rules | Yes |