ZUSE Automat Agent: Empirical Law Discovery in Elementary Cellular Automata

Version v1.13 integrates Fase 42: ROBDD audit of the dense T=15 causal-cone circuit. Fase 41 showed that the 25-cell, 12-step causal cone has no sparse local-table shortcut: the induced tables are dense, all 8 ordinary ECA entries are used, and all 25 initial cone inputs are required at the support level. Fase 42 verifies this at the Boolean-function level using reduced ordered binary decision diagrams (ROBDDs). Under the natural left-to-right cone variable order, the active localized output functions still depend on all 25 inputs in every representative. Results: - active-output ROBDD reachable nodes: 17,141..36,966;- full 25-bit vector ROBDD reachable nodes: 51,539..53,901;- active-output support: 25/25 inputs in every representative;- full-vector support: 25/25 inputs in every representative;- verdict: BDD_NO_INPUT_REDUCTION. This rules out Boolean input elimination as a symbolic shortcut. It does not claim globally minimal BDD size over all possible variable orders; the remaining symbolic task is expression or BDD-size reduction of a dense function that genuinely depends on all 25 inputs. All results are reproducible from deterministic scripts. Repository:https://github.com/conchaestradamiguelangel-droid/zuse-automat-agent