AFTD Auto-Formalizing Theoretical Domains

pmms3c_cost

def

Integer costs of three agents for nine chores: agent 0 (21,38,28,24,20,35,29,41,18), agent 1 (15,41,27,25,23,26,28,35,21), agent 2 (16,41,38,26,21,29,39,40,20). They are 101 minus the values in the three-agent, nine-good instance of Table 2 of arXiv:2609.10493.

Statement

def pmms3c_cost : Fin 3 → Fin 9 → ℕ
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 4
  • pmms3c_cost_natThe cost to agent i of the set of chores {g : P g}, as a natural number.
  • pmms3c_verify_soundIf the certificate check accepts w for allocation σ, then σ is not PMMS for agent w mod 3.
  • pmms_chores_three_agents_may_not_existPMMS allocations of chores need not exist already for three agents: there are strictly positive additive costs of three agents for nine…
  • pmms3c_cost_nat_eqThe fold computing agent i's cost of the chores selected by P agrees with the additive cost of that set.

Lean source view module on GitHub

/-- Costs of the three-agent, nine-chore instance: 101 minus the values of the goods instance in Table 2 of arXiv:2609.10493. -/
def pmms3c_cost : Fin 3 → Fin 9 → ℕ :=
  ![![21, 38, 28, 24, 20, 35, 29, 41, 18],
    ![15, 41, 27, 25, 23, 26, 28, 35, 21],
    ![16, 41, 38, 26, 21, 29, 39, 40, 20]]
See it in the graphDiscuss this resultChallenge it