Keyboard shortcuts

Press ← or → to navigate between chapters

Press S or / to search in the book

Press ? to show this help

Press Esc to hide this help

Beside the other provers, 2026-10-15

One run of deduxit and the other provers of linear logic on the same 4 811 problems (the LLTP library, qcover's coverability problems and deduxit's generated families), on 2026-10-15 on an Intel Core Ultra X9 388H (16 cores, 64 GB, Linux 7.2.9): the sequential tools and deduxit's one-thread column each on one efficiency core (cores 6–11, six streams side by side), deduxit's default on the four low-power cores (12–15), every run under 10 s and 4 GiB, measured by BenchExec 3.27. deduxit was built from commit 60226b2c, every other tool at the version the flake pins. The rows are bench/comparison/2026-10-15/runs.csv (62 543 runs), the tables ranking.md beside them, and bench/TOOLS.md says how each tool was run and discusses every result; the tables below are its own.

Solved within 10 s

toolsolvedprovedunprovablewrongended at the limitout of memorythe tool's bounderroroutside its fragment
deduxit, default (4 low-power cores)4 2043 907297054715900
deduxit, one thread4 1813 899282057105900
Sympli1 6841 43924501 93587600316
Maude, ILL7687422602 9407170016316
APLL, ILL612544681 2962 01520412140316
llprover, ILL4794532603 857019140316
LinearOne694623000004 742
APLL, LL31229127801304 677
Click & coLLecT3123812910004 677
Maude, LL31201108221004 677
linTAP1514103721004 738
lolli14140054352364 679
llprover, LL1110101230004 677

A wrong verdict, a refutation of a problem some tool proved with a checked proof or a verdict against a generated problem's by construction, never counts as solved.

problemsdeduxitdeduxit, defaultMaudellproverSympliAPLLLinearOneClick & coLLecTlinTAPlolli
LLTP intuitionistic, 1 35882985261347987354869 / 69–––
LLTP Petri nets, 3 1373 0723 072155081164––––
LLTP classical, 1717171210–13–152 / 67
qcover, 176 (intuitionistic affine)162162––––––––
generated families, 12310110119 / 1171 / 117–18 / 117–16 / 11713 / 677 / 115

A dash is a set outside the tool's fragment or mode; n / m where the tool covers only m of the set.

The cactus plots

Cactus plot of the intuitionistic problems, every tool, 2026-10-15 Cactus plot of the intuitionistic problems, every tool, 2026-10-15

Intuitionistic problems. For each tool, the problems of the intuitionistic modes (the LLTP library, its Petri nets and qcover) it solved within 10 s, sorted by the time each took, against that time on a logarithmic axis; the legend gives each count. A line further right solves more and a lower one solves faster: both of deduxit's columns solve over 4 000, most of them Petri nets, at a median of 6 ms, and Sympli, the next, 1 684.

Cactus plot of the classical problems, every tool, 2026-10-15 Cactus plot of the classical problems, every tool, 2026-10-15

Classical problems. The same for the classical problems (the LLTP library's classical files and the generated families): deduxit solves 114, the other tools between 11 and 31, which most of them reach at times where deduxit's line is still flat.

The scatter plots

Each plot sets deduxit on one thread against one tool on every problem both cover, a point per problem, the tool's time across and deduxit's up, both logarithmic; a problem not solved is drawn on the dashed line of the 10 s limit. A point below the diagonal is a problem deduxit solved faster. Against every other prover most points lie below it: of the 4 495 problems deduxit and Sympli both cover, deduxit is faster by more than a tenth on 3 294 and slower on 551, Sympli's refutations that deduxit leaves at its limit making the row along the top; against Maude, llprover, linTAP, lolli and LinearOne no point lies above it. Against deduxit's own default, which runs on the slower low-power cores and races a second search, most points lie on the diagonal.

Scatter plot of deduxit on one thread against sympli, 2026-10-15 Scatter plot of deduxit on one thread against sympli, 2026-10-15 Scatter plot of deduxit on one thread against maude-ill, 2026-10-15 Scatter plot of deduxit on one thread against maude-ill, 2026-10-15 Scatter plot of deduxit on one thread against maude-cll, 2026-10-15 Scatter plot of deduxit on one thread against maude-cll, 2026-10-15 Scatter plot of deduxit on one thread against apll-ill, 2026-10-15 Scatter plot of deduxit on one thread against apll-ill, 2026-10-15 Scatter plot of deduxit on one thread against apll-ll, 2026-10-15 Scatter plot of deduxit on one thread against apll-ll, 2026-10-15 Scatter plot of deduxit on one thread against llprover-ill, 2026-10-15 Scatter plot of deduxit on one thread against llprover-ill, 2026-10-15 Scatter plot of deduxit on one thread against llprover-cll, 2026-10-15 Scatter plot of deduxit on one thread against llprover-cll, 2026-10-15 Scatter plot of deduxit on one thread against click-and-collect, 2026-10-15 Scatter plot of deduxit on one thread against click-and-collect, 2026-10-15 Scatter plot of deduxit on one thread against lintap, 2026-10-15 Scatter plot of deduxit on one thread against lintap, 2026-10-15 Scatter plot of deduxit on one thread against lolli, 2026-10-15 Scatter plot of deduxit on one thread against lolli, 2026-10-15 Scatter plot of deduxit on one thread against linearone, 2026-10-15 Scatter plot of deduxit on one thread against linearone, 2026-10-15 Scatter plot of deduxit on one thread against deduxit-default, 2026-10-15 Scatter plot of deduxit on one thread against deduxit-default, 2026-10-15