Ordinary logic on ILTP, 2026-11-14
The ILTP library's 274 propositional problems (v1.1.2, nix build .#iltp), decided in classical, intuitionistic and minimal logic by each
method of ordinary logic, and in intuitionistic
logic by deduxit's default beside intuit and intuitR, the SAT-based
provers whose algorithm deduxit's SAT solver follows.
The methods
The rows are bench/defaults/sat-default.csv, written by one release
build of deduxit-bench from 18:13 to 18:24: deduxit-bench run --tptp bench/iltp/Problems --logics classical,intuitionistic,minimal --engines embedding,ljt,sat,auto --jobs 1 --copies none --timeout 2 --repeat 3 --repeat-under 1, in two shards pinned to the performance cores 2 and
3 of an Intel Core Ultra X9 388H, by day, with a single verification
process on cores 7 to 9 beside them. auto is the library's default. A run under a
second ran three times, and its time is the median. Each method's time
includes its checks: the SAT solver's derivation, clausal proof or
countermodel, LJT's derivation, and for the default the embedding's
derivation of LK. The embedding's own rows check its derivation outside
the time, so they count a linear proof whose derivation is past the
64 MiB bound as decided, which the default does not.
| logic | the embedding | LJT | the SAT solver | the default | the default's time on the problems all decide |
|---|---|---|---|---|---|
| classical | 157 | – | 254 | 124 | 346 ms (124 problems) |
| intuitionistic | 188 | 200 | 252 | 252 | 50 ms (186 problems) |
| minimal | 188 | 200 | 253 | 252 | 47 ms (186 problems) |
No verdict differs between the methods or from ILTP's status. On the 186 problems all four decide in intuitionistic logic the SAT solver takes 26 ms in all, LJT 313 ms and the embedding 11.6 s. In this build the default of classical logic was the embedding, for its derivations of LK; the SAT solver decides 254 there with a checked clausal proof.
The classical default
The rows are bench/defaults/sat-classical.csv, written by one release
build from 21:17 to 21:20 the same day, with the same command as above
but --logics classical --engines embedding,sat,auto, on cores 2 and 3,
with other work on other cores. Here the default is the SAT solver,
followed by at most 2²⁰ units of the embedding's work, whose derivation
or refutation replaces the solver's answer where it gives one.
| the embedding | the SAT solver | the default | |
|---|---|---|---|
| decided | 157 | 254 | 254 |
| with the embedding's derivation of LK or refutation | 124 | – | 124 |
| time on the 124 | – | – | 348 ms |
The default decides the problems the SAT solver decides, and for each of the 124 the earlier default answered with the embedding's evidence (123 derivations of LK and one refutation) it gives that evidence again, in 348 ms in all against the earlier default's 346 ms. On the other 130 its answer is the solver's. Asking the embedding first costs a median of 16 ms per problem, more than 100 ms on 18 problems and at most 0.7 s (SYJ206+1.020 and SYJ212+1.020), where the embedding works on a large first sequent before it checks its bound. No verdict differs between the methods or from ILTP's status.
Beside intuit and intuitR
The rows are bench/comparison/2026-11-14-iltp/runs.csv, with
ranking.md and each stream's env.json beside them, written from
18:24 to 18:29 by deduxit-bench run --tools deduxit-default,intuit,intuitr --tptp bench/iltp/Problems --logics intuitionistic --timeout 10 --memory-limit 4294967296, in two shards on cores 2 and 3, each run
measured by BenchExec's runexec 3.35 as the
comparison measures every tool: 10 s and 4 GiB, the
time the whole process's, its start included. deduxit was built from the
commit zurrvuwo; intuit and intuitR are at the commits the flake pins,
intuitR with its default, weak clausification.
| tool | solved | proved | not valid | not solved | time on the 254 all solve | median time |
|---|---|---|---|---|---|---|
| deduxit's default | 254 | 119 | 135 | 20 | 13.0 s | 3.6 ms |
| intuit | 263 | 128 | 135 | 11 | 2.4 s | 5.1 ms |
| intuitR | 263 | 128 | 135 | 11 | 1.6 s | 5.4 ms |
deduxit's default answers most problems sooner than intuit and intuitR: it is faster than intuitR on 218 of the 254 problems all three solve, and its median time is 3.6 ms against intuitR's 5.4 ms. It solves nine fewer, all of them valid: Cook's pigeonhole formulas SYJ202 at sizes 4 to 9 and the three largest sizes of SYJ206, which intuit and intuitR solve within 10 s. The larger sizes of SYJ206 also take most of its time on the problems all three solve, 11.7 s of the 13.0 s. For every valid problem deduxit also builds and checks a derivation of LJ, which intuit and intuitR do not make. No answer contradicts another or ILTP's status.