The explicitly finite integer domain is U=[-10, -1, 0, 1, 10] and P(x) means x=1. Give (elements satisfying P, elements not satisfying P), each sorted increasingly.
G001 — The explicitly finite integer domain is U=[-10, -1, 0, 1, 10] and P(x) means x=1. Give (elements satisfying P, elements not satisfying P), each sorted increasingly.
Definition and scope
Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate.
universal on empty domain=True;existential on empty domain=False
Conditions: none
Enumerate only the declared finite domain;empty-domain universals are true and existentials false.Complete finite enumeration does not extend to an infinite domain.
Step identifiers and dependencies
Rule: finite_quantifier_scope · Uses: G001
S002 · implies
Before
x=-10;predicate=eq 1
After
P(x)=No
Conditions: none
Evaluate the declared decidable integer predicate for each element,retaining both true and false cases.
Step identifiers and dependencies
Rule: finite_predicate_row · Uses: G001, S001
S003 · implies
Before
x=-1;predicate=eq 1
After
P(x)=No
Conditions: none
Evaluate the declared decidable integer predicate for each element,retaining both true and false cases.
Step identifiers and dependencies
Rule: finite_predicate_row · Uses: G001, S002
S004 · implies
Before
x=0;predicate=eq 1
After
P(x)=No
Conditions: none
Evaluate the declared decidable integer predicate for each element,retaining both true and false cases.
Step identifiers and dependencies
Rule: finite_predicate_row · Uses: G001, S003
S005 · implies
Before
x=1;predicate=eq 1
After
P(x)=Yes
Conditions: none
Evaluate the declared decidable integer predicate for each element,retaining both true and false cases.
Step identifiers and dependencies
Rule: finite_predicate_row · Uses: G001, S004
S006 · implies
Before
x=10;predicate=eq 1
After
P(x)=No
Conditions: none
Evaluate the declared decidable integer predicate for each element,retaining both true and false cases.
The true and false parts are disjoint and cover the deduplicated domain;unlisted integers are not counterexamples.
Step identifiers and dependencies
Rule: complete_truth_partition · Uses: G001, S006
Reverse checks
S007 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S006 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S005 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S004 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S003 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S002 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S001 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
Result
([1], [-10, -1, 0, 10])
The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.
This question review and source binding
Review date: 2026-10-26
Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof.