Satisfiability of elementary, square, and uniform Diophantine constraints H10C_SAT, H10SQC_SAT, and H10UC_SAT
Require Import List.
Inductive h10c : Set :=
| h10c_one : nat -> h10c
| h10c_plus : nat -> nat -> nat -> h10c
| h10c_mult : nat -> nat -> nat -> h10c.
Definition h10c_sem c φ :=
match c with
| h10c_one x => φ x = 1
| h10c_plus x y z => φ x + φ y = φ z
| h10c_mult x y z => φ x * φ y = φ z
end.
Definition H10C_SAT (cs: list h10c) := exists (φ: nat -> nat), forall c, In c cs -> h10c_sem c φ.
Inductive h10sqc : Set :=
| h10sqc_one : nat -> h10sqc
| h10sqc_plus : nat -> nat -> nat -> h10sqc
| h10sqc_sq : nat -> nat -> h10sqc.
Definition h10sqc_sem φ c :=
match c with
| h10sqc_one x => φ x = 1
| h10sqc_plus x y z => φ x + φ y = φ z
| h10sqc_sq x y => φ x * φ x = φ y
end.
Definition H10SQC_SAT (cs: list h10sqc) := exists (φ: nat -> nat), forall c, In c cs -> h10sqc_sem φ c.
Definition h10uc := (nat * nat * nat)%type.
Definition h10uc_sem φ (c : h10uc) :=
match c with
| (x, y, z) => 1 + φ x + φ y * φ y = φ z
end.
Definition H10UC_SAT (cs: list h10uc) := exists (φ: nat -> nat), forall c, In c cs -> h10uc_sem φ c.
Definition h10upc := ((nat * nat) * (nat * nat))%type.
Direct semantics of h10upc_sem
Definition h10upc_sem_direct (c : h10upc) :=
match c with
| ((x, y), (z1, z2)) =>
1 + x + y = z1 /\ y * (1 + y) = z2 + z2
end.
Definition h10upc_sem φ (c : h10upc) :=
match c with
| ((x, y), (z1, z2)) => h10upc_sem_direct (φ x, φ y, (φ z1, φ z2))
end.
Definition H10UPC_SAT (cs: list h10upc) :=
exists (φ: nat -> nat), forall c, In c cs -> h10upc_sem φ c.
match c with
| ((x, y), (z1, z2)) =>
1 + x + y = z1 /\ y * (1 + y) = z2 + z2
end.
Definition h10upc_sem φ (c : h10upc) :=
match c with
| ((x, y), (z1, z2)) => h10upc_sem_direct (φ x, φ y, (φ z1, φ z2))
end.
Definition H10UPC_SAT (cs: list h10upc) :=
exists (φ: nat -> nat), forall c, In c cs -> h10upc_sem φ c.