state_floor
Compute the minimum number of states a system must distinguish to answer a question about its past, then optionally prove a given budget cannot meet that floor. Use to verify state-budget constraints.
Instructions
How many states must a system distinguish to answer a question about its past? An exact count over an enumerated situation space. Optionally proves a state budget cannot meet it. Requires floorgen.
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"variables": "<variables>",
"answers": "<answers>"
},
"name": "state_floor"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| answers | Yes | rows of {when: {...}, answer: ...} | |
| default | No | answer for unmatched situations | |
| variables | Yes | each variable to its finite domain (a list) | |
| has_default | No | ||
| budget_states | No | if given, also test this budget for impossibility |