Closed Jean-Luc-Picard-2021 closed 4 months ago
Can confirm. The equality reasoner appears to get stuck in step 4350.
Howdy? Ever managed to prove this (Pelletier 53):
(∃X∃Y(¬ (X = Y) ∧ ∀Z(Z = X ∨ Z = Y)) → (∃T∀U(∃V∀W(f(U, W) ↔ W = V) ↔ U = T) ↔ ∃V∀W(∃T∀U(f(U, W) ↔ U = T) ↔ W = V)))
Its not sending the prover to nirvana, but somehow I have the feeling it is more busy with counter model finding than proving.
Right. If I turn off the model search, it still runs up to step 335,000 at which point my computer runs out of memory.
I tried this here:
But it gets very quickly into a state where stop buttion doesn't work anymore.
Bug or feature?