proposition: Lemma refine_not_CNAME__independent : forall (n : resourceRecord) (R : @IndexedEnsemble resourceRecord), RDataTypeToRRecordType (n!sRDATA) <> CNAME -> refine {b | decides b (forall tup' : IndexedTuple, R tup' -> n!sNAME= (indexedElement tup')!sNAME -> RDataTypeToRRecordType (n!sRDATA) <> CNAME)} (ret true).
proof: Proof. intros; refine pick val true; [ reflexivity | simpl; intros; assumption ]. Qed.
imports: Coq.Vectors.Vector Coq.Strings.Ascii Coq.Bool.Bool Coq.Bool.Bvector Coq.Lists.List Fiat.Computation.ListComputations Fiat.QueryStructure.Automation.AutoDB Fiat.QueryStructure.Implementation.DataStructures.BagADT.BagADT Fiat.QueryStructure.Automation.IndexSelection Fiat.QueryStructure.Specification.SearchTerms.ListPrefix Fiat.QueryStructure.Automation.SearchTerms.FindPrefixSearchTerms Fiat.QueryStructure.Automation.QSImplementation Fiat.Narcissus.Formats.DomainNameOpt Fiat.Narcissus.Examples.DNS.SimpleDnsOpt Fiat.Narcissus.Examples.DNS.SimpleDNSPacket Fiat.Examples.DnsServer.DecomposeSumField Fiat.Computation.FoldComp Fiat.Examples.DnsServer.SimpleAuthoritativeDNSSchema