AFTD Auto-Formalizing Theoretical Domains

Pmms3cTree

inductive

A ternary tree with natural-number leaves, used to store one certificate per allocation of nine items to three agents (the allocation read as a path of nine branch choices).

Statement

inductive Pmms3cTree
Source
step towards pmms_chores_three_agents_may_not_exist (three-agent chores PMMS, not posed in arXiv:2609.10493) (violation-certificate machinery and instance data)
Verified
26 Oct 2026
Axioms
none listed
Used by 2
  • pmms3c_certA table giving, for every one of the 3^9 = 19683 allocations of the nine chores to the three agents, an agent i, another agent j and a…
  • pmms3c_tree_getLookup in the ternary tree: follow branch d_1, then d_2, and so on, and return the leaf reached.

Lean source view module on GitHub

/-- A ternary trie of natural numbers, indexed by sequences in Fin 3. -/
inductive Pmms3cTree | leaf (w : ℕ)
  | node (t0 t1 t2 : Pmms3cTree)
See it in the graphDiscuss this resultChallenge it