One experiment identity
Artifact, configuration, benchmark snapshot, limits, and hardware travel together across every domain.
Loading experiment data
Resolving capability…
Contacting the configured Observatory adapter.
Research in progress
Observatory is preparing and verifying real benchmark data. Public numbers will be released only after that verification is complete. Placeholder and test results stay hidden until then.
Capability architecture
Xolver is organized as a portfolio of reasoning engines with a shared experiment contract and domain-specific evidence.
Seven initial surfaces, one extensible interface system
Logical decision procedures
Satisfiability Modulo Theories
Decision procedures across arithmetic, bit-vectors, arrays, floating point, and combined theories.
Theory-aware optimization
Optimization Modulo Theories
Optimal models, lexicographic and Pareto objectives, and MaxSMT over rich background theories.
Combinatorial search
Constraint Programming
Finite-domain constraints, global propagators, scheduling, routing, and discrete optimization.
Mathematical optimization
Mixed-Integer Linear Programming
Linear relaxations, branch-and-bound, cutting planes, and mixed discrete-continuous models.
Propositional reasoning
Boolean Satisfiability
SAT, weighted and unweighted MaxSAT, pseudo-Boolean optimization, and core extraction.
Quantified reasoning
Quantified Boolean Formulas
Alternating quantifiers, dependency-aware reasoning, expansion, and quantified proof search.
Constructive reasoning
Synthesis and Constrained Horn Clauses
Program synthesis, invariant discovery, Horn-clause solving, and solver-guided repair.
Consistent structure without flattening domain-specific meaning
Artifact, configuration, benchmark snapshot, limits, and hardware travel together across every domain.
SMT reports decisions; optimization reports optimality; CP and MILP preserve bounds and incumbent quality.
Each track selects relevant established solvers instead of forcing one baseline set across unrelated paradigms.
Invalid answers and unverifiable certificates stay visible even when aggregate coverage improves.
Coverage and maturity at a glance
| Domain | Stage | Tracks | Benchmarks | Solved | Coverage | Quality gate |
|---|---|---|---|---|---|---|
SMTSatisfiability Modulo Theories | Stable | 6SMT-LIB logics | 42,680 | 38,914 | 91.2% | Passed |
OMTOptimization Modulo Theories | Beta | 5objective familys | 15,200 | 13,235 | 87.1% | 1 wrong |
CPConstraint Programming | Preview | 5problem familys | 28,600 | 23,892 | 83.5% | Passed |
MILPMixed-Integer Linear Programming | Preview | 5model classs | 18,750 | 15,183 | 81.0% | 2 wrong |
SAT · MaxSATBoolean Satisfiability | Beta | 4competition tracks | 25,000 | 22,784 | 91.1% | Passed |
QBFQuantified Boolean Formulas | Planned | 4quantifier fragments | 11,700 | 8,049 | 68.8% | 1 wrong |
SyGuS · CHCSynthesis and Constrained Horn Clauses | Planned | 4reasoning tasks | 13,000 | 8,570 | 65.9% | Passed |