(symbols, unknown_clauses)
return None, None
Same as find_pure_symbol, but arguments are expected
    to be in integer representation

    >>> from sympy.logic.algorithms.dpll import find_pure_symbol_int_repr
    >>> find_pure_symbol_int_repr(set([1,2,3]),
    ...     [set([1, -2]), set([-2, -3]), set([3, 1])])
    (1, True)
Same as find_pure_symbol, but arguments are expected
    to be in integer representation
Same as find_pure_symbol but arguments are expected to be in integer representation
def find_pure_symbol_int_repr(symbols, unknown_clauses):
    """
    Same as find_pure_symbol, but arguments are expected
    to be in integer representation

    >>> from sympy.logic.algorithms.dpll import find_pure_symbol_int_repr
    >>> find_pure_symbol_int_repr(set([1,2,3]),
    ...     [set([1, -2]), set([-2, -3]), set([3, 1])])
    (1, True)

    """
    all_symbols = reduce(set.union, unknown_clauses, set())
    found_pos = all_symbols.intersection(symbols)
    found_neg = all_symbols.intersection([-s for s in symbols])
    for p in found_pos:
        if -p not in found_neg:
            return p, True
    for p in found_neg:
        if -p not in found_pos:
            return -p, False
    return None, None
def find_pure_symbol_int_repr ( symbols , unknown_clauses ) : all_symbols = reduce ( set . union , unknown_clauses , set ( ) ) found_pos = all_symbols . intersection ( symbols ) found_neg = all_symbols . intersection ( [ - s for s in symbols ] ) for p in found_pos : if - p not in found_neg : return p , True for p in found_neg : if - p not in found_pos : return - p , False return None , None