Given facts and single-premise MP only: Fin(4)={0,…,3}, facts=[0], rules=[[0, 1], [1, 2]], where [i,j] means i→j. Facts have depth 0 and each MP adds one. Ordered queries=[0, 101, 2]. Give (goal-type mask, derivability mask, minimum depths or not-derived or ill-typed).
G001 — Given facts and single-premise MP only: Fin(4)={0,…,3}, facts=[0], rules=[[0, 1], [1, 2]], where [i,j] means i→j. Facts have depth 0 and each MP adds one. Ordered queries=[0, 101, 2]. Give (goal-type mask, derivability mask, minimum depths or not-derived or ill-typed).
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.
use only given facts and single-premise MP;not-derived does not mean False
Conditions: none
Atoms use0-based indices and a rule i→j requires an already derived i.A cycle without facts cannot generate conclusions.Not-derived is not False,and this finite check is not general logical completeness.
Step identifiers and dependencies
Rule: given_unary_MP_scope · Uses: G001
S002 · implies
Before
phase=base;given facts=[0]
After
phase=base;active_rules=[0,1]
Conditions: none
Start from all given facts,retaining original rule-row indices.Atoms with no derived premises remain not-derived.
Step identifiers and dependencies
Rule: horn_closure_start · Uses: G001, S001
S003 · implies
Before
phase=base;given fact=0
After
phase=base;derive atom=0;depth=0;basis=given
Conditions: none
A supplied fact has depth0 and needs no MP antecedent;other atoms are not silently made facts.
Step identifiers and dependencies
Rule: horn_given_fact · Uses: G001, S002
S004 · calculation
Before
base MP depth for atom1 := sum(0, 1)
After
base MP depth for atom1 = 1
Conditions: none
One MP application adds1 to the already known antecedent depth.
Every derived atom has a displayed chain of that length.The reached set is closed under every given edge and satisfies the depth bounds,so any shorter chain would force a smaller label.These labels are shortest;null means not-derived in this rule model,not False.
S011 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S010 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S009 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S008 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
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 — Recompute base MP depth for atom2 with exact rational arithmetic, not rounded decimals.
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 — Recompute base MP depth for atom1 with exact rational arithmetic, not rounded decimals.
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
([Yes, No, Yes], [Yes, No, Yes], [0, ill-typed, 2])
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.