[ty] detect cycles in binary comparison inference (#20446)

## Summary

Catch infinite recursion in binary-compare inference.

Fixes the stack overflow in `graphql-core` in mypy-primer.

## Test Plan

Added two tests that stack-overflowed before this PR.

crates/ty_python_semantic/resources/mdtest/comparison/tuples.md

@@ -392,3 +392,16 @@ class A:
 # error: [unsupported-bool-conversion]
 (A(),) == (A(),)
 ```
+
+## Recursive NamedTuple
+
+```py
+from __future__ import annotations
+from typing import NamedTuple
+
+class Node(NamedTuple):
+    parent: Node | None
+
+def _(n: Node):
+    reveal_type(n.parent is n)  # revealed: bool
+```

crates/ty_python_semantic/resources/mdtest/pep695_type_aliases.md

@@ -351,3 +351,12 @@ def f(x: A):
     for item in x:
         reveal_type(item)  # revealed: list[A | str | None] | str | None
 ```
+
+### Tuple comparison
+
+```py
+type X = tuple[X, int]
+
+def _(x: X):
+    reveal_type(x is x)  # revealed: bool
+```