Completeness of irreducible RAF families
Default source: 3 statements, 3 rules, 1 slots
Literal check: {'rafs': 33, 'irreducibles': 4}
Supplied guard family: incomplete
Decoded source witness: {'slot_choices': ['0'], 'axioms': ['0'], 'derivation_stages': [['0'], ['0', '1'], ['0', '1', '2']]}
Independent-statement control: complete after 9 tuples
Overlapping coverage list: incomplete; missing ['b', 'c']
Graph reduction: incomplete; decoded clique [0, 1, 2]
Tuple bounds are combinatorial counts, not measured runtimes. No Lean re-execution claimed.