AFTD Auto-Formalizing Theoretical Domains

TwoCounterInstr

inductive

An instruction of a 2-counter machine is either an update by a vector of integers (w₁, w₂), or a zero-test on the first counter or the second counter.

Statement

inductive TwoCounterInstr where
Defined in
arXiv:2610.23495, Section 2
Verified
19 Oct 2026
Axioms
none listed
Used by 12

Read back from the Lean

An inductive type TwoCounterInstr with three constructors: - update (w₁ w₂ : ℤ): takes two integers w₁ and w₂ and produces an instruction, - zeroTest₁: produces an instruction with no arguments, - zeroTest₂: produces an instruction with no arguments. It derives decidable equality (DecidableEq).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- Instructions for a 2-counter machine: vector update or zero-test on either counter. -/
inductive TwoCounterInstr where | update (w₁ w₂ : ℤ) : TwoCounterInstr
  | zeroTest₁ : TwoCounterInstr
  | zeroTest₂ : TwoCounterInstr
  deriving DecidableEq
See it in the graphDiscuss this resultChallenge it