o
    "ôj°K  ã                   @   sæ   d Z ddlmZmZmZ ddlmZmZmZ ddl	m
Z
 ddlmZ ddlmZmZmZmZmZmZ ddlmZ ddlmZ dd	lmZmZmZ G d
d„ dƒZeƒ Zdd„ Zdefdd„Zdd„ Z dd„ Z!dd„ Z"ddl#m$Z$m%Z% dS )z4Module for querying SymPy objects about assumptions.é    )Úglobal_assumptionsÚ	PredicateÚAppliedPredicate)ÚCNFÚ
EncodedCNFÚLiteral)Úsympify)ÚBooleanKind)ÚEqÚNeÚGtÚLtÚGeÚLe)Úsatisfiable)Úmemoize_property)Úsympy_deprecation_warningÚSymPyDeprecationWarningÚignore_warningsc                   @   s°  e Zd ZdZedd„ ƒZedd„ ƒZedd„ ƒZedd	„ ƒZed
d„ ƒZ	edd„ ƒZ
edd„ ƒZedd„ ƒZedd„ ƒZedd„ ƒZedd„ ƒZedd„ ƒZedd„ ƒZedd„ ƒZedd„ ƒZed d!„ ƒZed"d#„ ƒZed$d%„ ƒZed&d'„ ƒZed(d)„ ƒZed*d+„ ƒZed,d-„ ƒZed.d/„ ƒZed0d1„ ƒZed2d3„ ƒZed4d5„ ƒZed6d7„ ƒZed8d9„ ƒZ ed:d;„ ƒZ!ed<d=„ ƒZ"ed>d?„ ƒZ#ed@dA„ ƒZ$edBdC„ ƒZ%edDdE„ ƒZ&edFdG„ ƒZ'edHdI„ ƒZ(edJdK„ ƒZ)edLdM„ ƒZ*edNdO„ ƒZ+edPdQ„ ƒZ,edRdS„ ƒZ-edTdU„ ƒZ.edVdW„ ƒZ/edXdY„ ƒZ0edZd[„ ƒZ1ed\d]„ ƒZ2ed^d_„ ƒZ3ed`da„ ƒZ4edbdc„ ƒZ5eddde„ ƒZ6edfdg„ ƒZ7edhdi„ ƒZ8edjdk„ ƒZ9edldm„ ƒZ:edndo„ ƒZ;edpdq„ ƒZ<drS )sÚAssumptionKeyszy
    This class contains all the supported keys by ``ask``.
    It should be accessed via the instance ``sympy.Q``.

    c                 C   ó   ddl m} |ƒ S )Né   )ÚHermitianPredicate)Úhandlers.setsr   )Úselfr   © r   úh/var/www/html/academy/tools/voices/clone/cosy-venv/lib/python3.10/site-packages/sympy/assumptions/ask.pyÚ	hermitian    ó   zAssumptionKeys.hermitianc                 C   r   )Nr   )ÚAntihermitianPredicate)r   r   )r   r   r   r   r   Úantihermitian%   r   zAssumptionKeys.antihermitianc                 C   r   )Nr   )ÚRealPredicate)r   r!   )r   r!   r   r   r   Úreal*   r   zAssumptionKeys.realc                 C   r   )Nr   )ÚExtendedRealPredicate)r   r#   )r   r#   r   r   r   Úextended_real/   r   zAssumptionKeys.extended_realc                 C   r   )Nr   )ÚImaginaryPredicate)r   r%   )r   r%   r   r   r   Ú	imaginary4   r   zAssumptionKeys.imaginaryc                 C   r   )Nr   )ÚComplexPredicate)r   r'   )r   r'   r   r   r   Úcomplex9   r   zAssumptionKeys.complexc                 C   r   )Nr   )ÚAlgebraicPredicate)r   r)   )r   r)   r   r   r   Ú	algebraic>   r   zAssumptionKeys.algebraicc                 C   r   )Nr   )ÚTranscendentalPredicate)Úpredicates.setsr+   )r   r+   r   r   r   ÚtranscendentalC   r   zAssumptionKeys.transcendentalc                 C   r   )Nr   )ÚIntegerPredicate)r   r.   )r   r.   r   r   r   ÚintegerH   r   zAssumptionKeys.integerc                 C   r   )Nr   )ÚNonIntegerPredicate)r,   r0   )r   r0   r   r   r   Ú
nonintegerM   r   zAssumptionKeys.nonintegerc                 C   r   )Nr   )ÚRationalPredicate)r   r2   )r   r2   r   r   r   ÚrationalR   r   zAssumptionKeys.rationalc                 C   r   )Nr   )ÚIrrationalPredicate)r   r4   )r   r4   r   r   r   Ú
irrationalW   r   zAssumptionKeys.irrationalc                 C   r   )Nr   )ÚFinitePredicate)Úhandlers.calculusr6   )r   r6   r   r   r   Úfinite\   r   zAssumptionKeys.finitec                 C   r   )Nr   )ÚInfinitePredicate)r7   r9   )r   r9   r   r   r   Úinfinitea   r   zAssumptionKeys.infinitec                 C   r   )Nr   )ÚPositiveInfinitePredicate)r7   r;   )r   r;   r   r   r   Úpositive_infinitef   r   z AssumptionKeys.positive_infinitec                 C   r   )Nr   )ÚNegativeInfinitePredicate)r7   r=   )r   r=   r   r   r   Únegative_infinitek   r   z AssumptionKeys.negative_infinitec                 C   r   )Nr   )ÚPositivePredicate)Úhandlers.orderr?   )r   r?   r   r   r   Úpositivep   r   zAssumptionKeys.positivec                 C   r   )Nr   )ÚNegativePredicate)r@   rB   )r   rB   r   r   r   Únegativeu   r   zAssumptionKeys.negativec                 C   r   )Nr   )ÚZeroPredicate)r@   rD   )r   rD   r   r   r   Úzeroz   r   zAssumptionKeys.zeroc                 C   r   )Nr   )ÚExtendedPositivePredicate)r@   rF   )r   rF   r   r   r   Úextended_positive   r   z AssumptionKeys.extended_positivec                 C   r   )Nr   )ÚExtendedNegativePredicate)r@   rH   )r   rH   r   r   r   Úextended_negative„   r   z AssumptionKeys.extended_negativec                 C   r   )Nr   )ÚNonZeroPredicate)r@   rJ   )r   rJ   r   r   r   Únonzero‰   r   zAssumptionKeys.nonzeroc                 C   r   )Nr   )ÚNonPositivePredicate)r@   rL   )r   rL   r   r   r   ÚnonpositiveŽ   r   zAssumptionKeys.nonpositivec                 C   r   )Nr   )ÚNonNegativePredicate)r@   rN   )r   rN   r   r   r   Únonnegative“   r   zAssumptionKeys.nonnegativec                 C   r   )Nr   )ÚExtendedNonZeroPredicate)r@   rP   )r   rP   r   r   r   Úextended_nonzero˜   r   zAssumptionKeys.extended_nonzeroc                 C   r   )Nr   )ÚExtendedNonPositivePredicate)r@   rR   )r   rR   r   r   r   Úextended_nonpositive�   r   z#AssumptionKeys.extended_nonpositivec                 C   r   )Nr   )ÚExtendedNonNegativePredicate)r@   rT   )r   rT   r   r   r   Úextended_nonnegative¢   r   z#AssumptionKeys.extended_nonnegativec                 C   r   )Nr   )ÚEvenPredicate)Úhandlers.ntheoryrV   )r   rV   r   r   r   Úeven§   r   zAssumptionKeys.evenc                 C   r   )Nr   )ÚOddPredicate)rW   rY   )r   rY   r   r   r   Úodd¬   r   zAssumptionKeys.oddc                 C   r   )Nr   )ÚPrimePredicate)rW   r[   )r   r[   r   r   r   Úprime±   r   zAssumptionKeys.primec                 C   r   )Nr   )ÚCompositePredicate)rW   r]   )r   r]   r   r   r   Ú	composite¶   r   zAssumptionKeys.compositec                 C   r   )Nr   )ÚCommutativePredicate)Úhandlers.commonr_   )r   r_   r   r   r   Úcommutative»   r   zAssumptionKeys.commutativec                 C   r   )Nr   )ÚIsTruePredicate)r`   rb   )r   rb   r   r   r   Úis_trueÀ   r   zAssumptionKeys.is_truec                 C   r   )Nr   )ÚSymmetricPredicate)Úhandlers.matricesrd   )r   rd   r   r   r   Ú	symmetricÅ   r   zAssumptionKeys.symmetricc                 C   r   )Nr   )ÚInvertiblePredicate)re   rg   )r   rg   r   r   r   Ú
invertibleÊ   r   zAssumptionKeys.invertiblec                 C   r   )Nr   )ÚOrthogonalPredicate)re   ri   )r   ri   r   r   r   Ú
orthogonalÏ   r   zAssumptionKeys.orthogonalc                 C   r   )Nr   )ÚUnitaryPredicate)re   rk   )r   rk   r   r   r   ÚunitaryÔ   r   zAssumptionKeys.unitaryc                 C   r   )Nr   )ÚPositiveDefinitePredicate)re   rm   )r   rm   r   r   r   Úpositive_definiteÙ   r   z AssumptionKeys.positive_definitec                 C   r   )Nr   )ÚUpperTriangularPredicate)re   ro   )r   ro   r   r   r   Úupper_triangularÞ   r   zAssumptionKeys.upper_triangularc                 C   r   )Nr   )ÚLowerTriangularPredicate)re   rq   )r   rq   r   r   r   Úlower_triangularã   r   zAssumptionKeys.lower_triangularc                 C   r   )Nr   )ÚDiagonalPredicate)re   rs   )r   rs   r   r   r   Údiagonalè   r   zAssumptionKeys.diagonalc                 C   r   )Nr   )ÚFullRankPredicate)re   ru   )r   ru   r   r   r   Úfullrankí   r   zAssumptionKeys.fullrankc                 C   r   )Nr   )ÚSquarePredicate)re   rw   )r   rw   r   r   r   Úsquareò   r   zAssumptionKeys.squarec                 C   r   )Nr   )ÚIntegerElementsPredicate)re   ry   )r   ry   r   r   r   Úinteger_elements÷   r   zAssumptionKeys.integer_elementsc                 C   r   )Nr   )ÚRealElementsPredicate)re   r{   )r   r{   r   r   r   Úreal_elementsü   r   zAssumptionKeys.real_elementsc                 C   r   )Nr   )ÚComplexElementsPredicate)re   r}   )r   r}   r   r   r   Úcomplex_elements  r   zAssumptionKeys.complex_elementsc                 C   r   )Nr   )ÚSingularPredicate)Úpredicates.matricesr   )r   r   r   r   r   Úsingular  r   zAssumptionKeys.singularc                 C   r   )Nr   )ÚNormalPredicate)r€   r‚   )r   r‚   r   r   r   Únormal  r   zAssumptionKeys.normalc                 C   r   )Nr   )ÚTriangularPredicate)r€   r„   )r   r„   r   r   r   Ú
triangular  r   zAssumptionKeys.triangularc                 C   r   )Nr   )ÚUnitTriangularPredicate)r€   r†   )r   r†   r   r   r   Úunit_triangular  r   zAssumptionKeys.unit_triangularc                 C   r   )Nr   )ÚEqualityPredicate)Úrelation.equalityrˆ   )r   rˆ   r   r   r   Úeq  r   zAssumptionKeys.eqc                 C   r   )Nr   )ÚUnequalityPredicate)r‰   r‹   )r   r‹   r   r   r   Úne  r   zAssumptionKeys.nec                 C   r   )Nr   )ÚStrictGreaterThanPredicate)r‰   r�   )r   r�   r   r   r   Úgt$  r   zAssumptionKeys.gtc                 C   r   )Nr   )ÚGreaterThanPredicate)r‰   r�   )r   r�   r   r   r   Úge)  r   zAssumptionKeys.gec                 C   r   )Nr   )ÚStrictLessThanPredicate)r‰   r‘   )r   r‘   r   r   r   Últ.  r   zAssumptionKeys.ltc                 C   r   )Nr   )ÚLessThanPredicate)r‰   r“   )r   r“   r   r   r   Úle3  r   zAssumptionKeys.leN)=Ú__name__Ú
__module__Ú__qualname__Ú__doc__r   r   r    r"   r$   r&   r(   r*   r-   r/   r1   r3   r5   r8   r:   r<   r>   rA   rC   rE   rG   rI   rK   rM   rO   rQ   rS   rU   rX   rZ   r\   r^   ra   rc   rf   rh   rj   rl   rn   rp   rr   rt   rv   rx   rz   r|   r~   r�   rƒ   r…   r‡   rŠ   rŒ   rŽ   r�   r’   r”   r   r   r   r   r      sä    























































r   c                 C   s€   t ƒ }| jD ]5}g }|D ]%}t|jtƒr0t|jjƒdkr0|jj|v r.| t	|jj
|jƒ¡ q n n	|r;| t|ƒ¡ qt|ƒS )aƒ  
    Extract all relevant assumptions from *assump* with respect to given *exprs*.

    Parameters
    ==========

    assump : sympy.assumptions.cnf.CNF

    exprs : tuple of expressions

    Returns
    =======

    sympy.assumptions.cnf.CNF

    Examples
    ========

    >>> from sympy import Q
    >>> from sympy.assumptions.cnf import CNF
    >>> from sympy.assumptions.ask import _extract_all_facts
    >>> from sympy.abc import x, y
    >>> assump = CNF.from_prop(Q.positive(x) & Q.integer(y))
    >>> exprs = (x,)
    >>> cnf = _extract_all_facts(assump, exprs)
    >>> cnf.clauses
    {frozenset({Literal(Q.positive, False)})}

    r   )ÚsetÚclausesÚ
isinstanceÚlitr   ÚlenÚ	argumentsÚargÚappendr   ÚfunctionÚis_NotÚaddÚ	frozensetr   )ZassumpÚexprsÚfactsÚclauseÚargsÚliteralr   r   r   Ú_extract_all_facts;  s   
€rª   Tc                 C   s´  ddl m} ddlm} ddlm} t| ƒ} t|ƒ}t| tƒs$| j	t
ur(tdƒ‚t|tƒs2|j	t
ur6tdƒ‚ttjttjttjttjttjttji}t| tƒrW| j| j}}n| j|v rg|t| ƒ | j}}ntj| f}}t  !|¡}	|	 "|¡ t#|	|ƒ}
t$ƒ }t%ƒ }| &t |ƒ¡ | '|
¡ |
j(ržt)|ƒdu ržt*d| ƒ‚t+||
ƒ}|d	ur©|S ||Ž  ,|¡}|d	ur¸t-|ƒS || ||d
�}|d	urÅ|S z
|| ||d
�}W |S  |yÙ   Y d	S w )ay	  
    Function to evaluate the proposition with assumptions.

    Explanation
    ===========

    This function evaluates the proposition to ``True`` or ``False`` if
    the truth value can be determined. If not, it returns ``None``.

    It should be discerned from :func:`~.refine` which, when applied to a
    proposition, simplifies the argument to symbolic ``Boolean`` instead of
    Python built-in ``True``, ``False`` or ``None``.

    **Syntax**

        * ask(proposition)
            Evaluate the *proposition* in global assumption context.

        * ask(proposition, assumptions)
            Evaluate the *proposition* with respect to *assumptions* in
            global assumption context.

    Parameters
    ==========

    proposition : Boolean
        Proposition which will be evaluated to boolean value. If this is
        not ``AppliedPredicate``, it will be wrapped by ``Q.is_true``.

    assumptions : Boolean, optional
        Local assumptions to evaluate the *proposition*.

    context : AssumptionsContext, optional
        Default assumptions to evaluate the *proposition*. By default,
        this is ``sympy.assumptions.global_assumptions`` variable.

    Returns
    =======

    ``True``, ``False``, or ``None``

    Raises
    ======

    TypeError : *proposition* or *assumptions* is not valid logical expression.

    ValueError : assumptions are inconsistent.

    Examples
    ========

    >>> from sympy import ask, Q, pi
    >>> from sympy.abc import x, y
    >>> ask(Q.rational(pi))
    False
    >>> ask(Q.even(x*y), Q.even(x) & Q.integer(y))
    True
    >>> ask(Q.prime(4*x), Q.integer(x))
    False

    If the truth value cannot be determined, ``None`` will be returned.

    >>> print(ask(Q.odd(3*x))) # cannot determine unless we know x
    None

    ``ValueError`` is raised if assumptions are inconsistent.

    >>> ask(Q.integer(x), Q.even(x) & Q.odd(x))
    Traceback (most recent call last):
      ...
    ValueError: inconsistent assumptions Q.even(x) & Q.odd(x)

    Notes
    =====

    Relations in assumptions are not implemented (yet), so the following
    will not give a meaningful result.

    >>> ask(Q.positive(x), x > 0)

    It is however a work in progress.

    See Also
    ========

    sympy.assumptions.refine.refine : Simplification using assumptions.
        Proposition is not reduced to ``None`` if the truth value cannot
        be determined.
    r   )Úsatask)Ú
lra_satask)ÚUnhandledInputz.proposition must be a valid logical expressionz.assumptions must be a valid logical expressionFzinconsistent assumptions %sN)ÚassumptionsÚcontext).Zsympy.assumptions.sataskr«   Zsympy.assumptions.lra_sataskr¬   Z!sympy.logic.algorithms.lra_theoryr­   r   r›   r   Úkindr	   Ú	TypeErrorr
   ÚQrŠ   r   rŒ   r   rŽ   r   r’   r   r�   r   r”   r   r¡   rž   ÚfuncÚtyper¨   rc   r   Z	from_propÚextendrª   Úget_all_known_factsr   Zfrom_cnfZadd_from_cnfrš   r   Ú
ValueErrorÚ_ask_single_factÚ	_eval_askÚbool)Zpropositionr®   r¯   r«   r¬   r­   ZbinrelpredsÚkeyr¨   Z
assump_cnfÚlocal_factsZknown_facts_cnfZenc_cnfÚresr   r   r   Úasko  sN   Z(






ýÿr¾   c           	      C   sÒ   |j rgtƒ }t|j ƒdkr5|j \}t|ƒdkr5|\}| | d¡}|dur(|d ntƒ }|jr5|j|v r5dS |j D ].}t|ƒdkrf|\}|jsM| |jd¡nd}|du rTq8|\}}| |v r_ dS | |v rf dS q8dS )aÕ  
    Compute the truth value of single predicate using assumptions.

    Parameters
    ==========

    key : sympy.assumptions.assume.Predicate
        Proposition predicate.

    local_facts : sympy.assumptions.cnf.CNF
        Local assumption in CNF form.

    Returns
    =======

    ``True``, ``False`` or ``None``

    Examples
    ========

    >>> from sympy import Q
    >>> from sympy.assumptions.cnf import CNF
    >>> from sympy.assumptions.ask import _ask_single_fact

    If prerequisite of proposition is rejected by the assumption,
    return ``False``.

    >>> key, assump = Q.zero, ~Q.zero
    >>> local_facts = CNF.from_prop(assump)
    >>> _ask_single_fact(key, local_facts)
    False
    >>> key, assump = Q.zero, ~Q.even
    >>> local_facts = CNF.from_prop(assump)
    >>> _ask_single_fact(key, local_facts)
    False

    If assumption implies the proposition, return ``True``.

    >>> key, assump = Q.even, Q.zero
    >>> local_facts = CNF.from_prop(assump)
    >>> _ask_single_fact(key, local_facts)
    True

    If proposition rejects the assumption, return ``False``.

    >>> key, assump = Q.even, Q.odd
    >>> local_facts = CNF.from_prop(assump)
    >>> _ask_single_fact(key, local_facts)
    False
    r   Nr   FT)rš   Úget_known_facts_dictr�   Úgetr™   r¢   rŸ   )	r»   r¼   Zknown_facts_dictÚclÚfZ
prop_factsZprop_reqr§   Zprop_rejr   r   r   r¸     s.   3
€r¸   c                 C   s\   t dddd� t| tƒr| jj} tt| dƒ}|dur!| |¡ dS tt| t| |gd�ƒ dS )zÙ
    Register a handler in the ask system. key must be a string and handler a
    class inheriting from AskHandler.

    .. deprecated:: 1.8.
        Use multipledispatch handler instead. See :obj:`~.Predicate`.

    z¡
        The AskHandler system is deprecated. The register_handler() function
        should be replaced with the multipledispatch handler of Predicate.
        ú1.8údeprecated-askhandler©Údeprecated_since_versionÚactive_deprecations_targetN)Úhandlers)r   r›   r   ÚnameÚgetattrr²   Úadd_handlerÚsetattr)r»   ÚhandlerZQkeyr   r   r   Úregister_handlerY  s   	ú
rÎ   c                 C   s^   t dddd� t| tƒr| jj} ttƒ� tt| ƒ |¡ W d  ƒ dS 1 s(w   Y  dS )z‘
    Removes a handler from the ask system.

    .. deprecated:: 1.8.
        Use multipledispatch handler instead. See :obj:`~.Predicate`.

    zŸ
        The AskHandler system is deprecated. The remove_handler() function
        should be replaced with the multipledispatch handler of Predicate.
        rÃ   rÄ   rÅ   N)	r   r›   r   rÉ   r   r   rÊ   r²   Úremove_handler)r»   rÍ   r   r   r   rÏ   s  s   ú

"ÿrÏ   )r¶   r¿   N)&r˜   Zsympy.assumptions.assumer   r   r   Zsympy.assumptions.cnfr   r   r   Ú
sympy.corer   Zsympy.core.kindr	   Úsympy.core.relationalr
   r   r   r   r   r   Úsympy.logic.inferencer   Úsympy.utilities.decoratorr   Úsympy.utilities.exceptionsr   r   r   r   r²   rª   r¾   r¸   rÎ   rÏ   Zsympy.assumptions.ask_generatedr¶   r¿   r   r   r   r   Ú<module>   s(     
  &4 S