ProbXiv
Explorersign in
Problem archiveProblem record

Statement

How should proof-search algorithms be compared, and is there an optimal way to search for propositional proofs; why is searching in stronger proof systems apparently unhelpful; and how can practical SAT and automated-theorem-proving algorithms perform well on very long formulas despite exponential lower bounds for associated proof systems?

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.