fact: Hypothesis (HR0 : forall st, out_code (fst st) P -> R st) (HR1 : forall st1, (forall Q st2, Q <sc P -> Q // st1 -+> st2 -> R st2) -> R st1).
imports: List Arith Lia Undecidability.Shared.Libs.DLW(Utils.utils Code.subcode)