(self)
return [-(level.decision) for level in self.levels[1:]]
Build a clause representing the fact that at least one decision made
        so far is wrong.

        Examples
        ========

        >>> from sympy.logic.algorithms.dpll2 import SATSolver
        >>> l = SATSolver([set([2, -3]), set([1]), set([3, -3]), set([2, -2]),
        ... set([3, -2])], set([1, 2, 3]), set([]))
        >>> l._find_model()
        True
        >>> l._simple_compute_conflict()
        [3]
Build a clause representing the fact that at least one decision made
        so far is wrong.
Build a clause representing the fact that at least one decision made so far is wrong .
def _simple_compute_conflict(self):
        """ Build a clause representing the fact that at least one decision made
        so far is wrong.

        Examples
        ========

        >>> from sympy.logic.algorithms.dpll2 import SATSolver
        >>> l = SATSolver([set([2, -3]), set([1]), set([3, -3]), set([2, -2]),
        ... set([3, -2])], set([1, 2, 3]), set([]))
        >>> l._find_model()
        True
        >>> l._simple_compute_conflict()
        [3]
        """
        return [-(level.decision) for level in self.levels[1:]]
def _simple_compute_conflict ( self ) : return [ - ( level . decision ) for level in self . levels [ 1 : ] ]