úÎ!åW      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVSafeµWXYZ[\]^SafeRSolveySpecifies how to handle the negations. For the finite and enumerable solutions, we can return its supplmentary set.Safe=?@ACSX_˜Safe  Safe4_ fRSolve;normalized WWF, where '[NF a]' the disjunctive normal form.RSolve0Atom formula, should be specified by the problemRSolveAndRSolveOr RSolve Implication#RSolveKUse a propositinal logic formula to build logic equations incrementally.$RSolve7Produced a list of disjunctions of conjunctive clauses. !"#$ "!#$5353 3Safe@A-,RSolve Give a atom formula and solve it+,+,None$%@AP_³!-.10/236547>=<9;:8?@AJKLMNOPQRSTU!?7>=<9;:8@23654-.10/ALKJMNOPQRSTU:6;6_      !"#$%&'()*+,-./012344567889:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abc%RSolve-2.0.0.0-1FWmLIkfZyO4NjctuFwTYP RSolve.LogicRSolve.MapLikeRSolve.MultiStateRSolve.PropLogic RSolve.Solver RSolve.HM Paths_RSolveAtomFnotAMapLikelookup!insertadjustmemberupdate $fMapLike[]kv$fMapLikeMapkvMSrunMSgetMSputMSgetsMSmodifyMS$fAlternativeMS $fMonadMS $fMonadFailMS$fApplicativeMS $fFunctorMSNFAtomN:&&:||WFFAtomNot:&&::||::=>:normalassertNFassertunionEquations $fFunctorWFF$fEqWFF$fOrdWFF $fFunctorNF$fEqNF$fOrdNF CtxSolversolveTCEnv_noms_tvars_neqsUniflhsrhsneqTTVarTFresh:->:*TForallTAppTNomFix deConsTOp emptyTCEnv$fShowT $fAtomFUnif $fShowUnif$fEqT$fOrdT$fEqUnif $fOrdUnif $fShowTCEnvneqsnomstvarsnewTVarnewTNomloadTVaroccurInfreepruneaddNEqunify$fCtxSolverTCEnvUnifversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName