deduxit 0.5.0

A collection of logic suites: decides, checks, proves step by step and exports sequents of linear logic and of classical, intuitionistic and minimal propositional logic, with checked proofs, Kripke countermodels and Rocq certificates.
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
// deduxit © Fabian Lukas Grubmüller 2026
// Licensed under the EUPL

//! The instance table of a first-order proof: what the proof's members
//! past the forest's length stand for.
//!
//! An occurrence under binders is a formula with loose bound variables.
//! A sequent inside the proof holds such an occurrence together with a
//! *frame*: the terms its binders were opened with. The table gives each
//! pair of an occurrence and a frame its own member number.
//!
//! A frame holds closed terms of the sequent, or terms of the proof's
//! own. These extend the sequent's term arena past its end: the
//! witnesses of `∃` steps and the eigenvariables of `∀` steps.

use crate::Error;
use crate::hash::HashMap;
use crate::limits::Space;
use crate::linear::occurrences::{Forest, Member, OccId};
use crate::linear::proofs::Node;
use crate::linear::sequents::fo::FirstOrder;
use crate::linear::sequents::{Args, Eigen, FoTerm, FoTermId, Symbol};
use std::fmt::{Result as FmtResult, Write};

/// The index of a frame in a proof's instance table. A frame is a term
/// pushed onto a parent frame, so the innermost binder's term comes
/// first. Frames are linked lists, so the members under nested binders
/// share the tails of their frames.
#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, PartialOrd, Ord)]
pub struct FrameId(u32);

impl FrameId {
    /// Wraps a raw table index.
    pub const fn new(index: u32) -> Self {
        Self(index)
    }

    /// Returns the raw table index.
    pub const fn get(self) -> u32 {
        self.0
    }

    /// Returns the index as a `usize`, for indexing the table.
    pub const fn index(self) -> usize {
        self.0 as usize
    }
}

/// The instance table of a first-order proof: what the proof's members
/// past its forest's length stand for.
///
/// It holds:
///
/// - each member: an occurrence under `n` binders, with a frame of `n`
///   terms, the innermost binder's first;
/// - the frames, each a term pushed onto a parent frame;
/// - the proof's own terms: the witnesses and eigenvariables the frames
///   hold, numbered on from the sequent's own terms and argument lists.
///
/// Build a table for one forest with [`new`](Self::new), then hand it to
/// [`Proof::with_instances`](crate::linear::Proof::with_instances). That
/// checks it and makes it canonical: equal terms, frames and members
/// become one entry each, so the checker can compare instances by their
/// numbers.
///
/// # Examples
///
#[cfg_attr(feature = "parse", doc = "```")]
#[cfg_attr(not(feature = "parse"), doc = "```ignore")]
/// use deduxit::linear::{Eigen, Forest, Instances, Member, Mode, Node, NodeId, OccId, Proof, Sequent};
///
/// // ⊢ ∀x. (~p(x) ⅋ p(x)): occurrence 0 is the binder, 1 the `⅋`, 2 and
/// // 3 the literals.
/// let sequent: Sequent = "|- forall x. p(x) -o p(x)".parse()?;
/// let forest = Forest::new(&sequent)?;
/// let mut instances = Instances::new(&forest);
/// let a = instances.eigen(Eigen::new(0));
/// let frame = instances.frame(None, a);
/// let [par, l, r] = [1, 2, 3].map(|o| instances.member(OccId::new(o), frame));
/// let nodes = vec![
///     Node::Ax(l, r),
///     Node::Par(par, NodeId::new(0)),
///     Node::Forall(Member::new(0), Eigen::new(0), NodeId::new(1)),
/// ];
/// let proof = Proof::with_instances(forest, instances, nodes, NodeId::new(2))?;
/// proof.check(Mode::CLASSICAL)?;
/// # Ok::<(), Box<dyn std::error::Error>>(())
/// ```
#[derive(Clone, Debug, Default, PartialEq, Eq)]
pub struct Instances {
    /// The forest's length, which is the first member the table numbers.
    pub(crate) occurrences: u32,
    /// The number of terms in the sequent's arena, which is the id of the
    /// extension's first term.
    pub(crate) base_terms: u32,
    /// The number of argument lists of the sequent, which is the id of the
    /// extension's first list.
    pub(crate) base_lists: u32,
    /// Per member past the forest, its occurrence and frame.
    pub(crate) members: Vec<(OccId, FrameId)>,
    /// Per frame, its parent and the term it pushes.
    pub(crate) frames: Vec<(Option<FrameId>, FoTermId)>,
    /// The extension of the term arena, each term referring only to terms
    /// before it. In a canonical table every term is closed.
    pub(crate) terms: Vec<FoTerm>,
    /// The arguments of every list of the extension, one after the other.
    pub(crate) args: Vec<FoTermId>,
    /// The extension's argument lists, each a start and a length into
    /// `args`.
    pub(crate) lists: Vec<(u32, u32)>,
}

impl Instances {
    /// Returns the empty table of a proof over `forest`.
    pub fn new(forest: &Forest) -> Self {
        let fo = &forest.sequent().fo;
        Self {
            // These fit a `u32`: a forest has fewer than 2³² occurrences,
            // and a sequent's arenas have no more entries than its text or
            // document.
            occurrences: forest.len() as u32,
            base_terms: fo.terms.len() as u32,
            base_lists: fo.lists.len() as u32,
            ..Self::default()
        }
    }

    /// Adds the term of the eigenvariable `a` to the table and returns its
    /// id.
    pub fn eigen(&mut self, a: Eigen) -> FoTermId {
        self.push_term(FoTerm::Eigen(a))
    }

    /// Adds the term `symbol(args…)` and its argument list to the table
    /// and returns its id. `args` are terms of the sequent or of the
    /// table.
    pub fn apply(&mut self, symbol: Symbol, args: &[FoTermId]) -> FoTermId {
        // The ids saturate. A table with more ids than a `u32` counts is
        // refused when a proof takes it (`canonical`), before any id is
        // read.
        let start = saturated(self.args.len());
        self.args.extend_from_slice(args);
        self.lists.push((start, saturated(args.len())));
        let list = Args::new(
            self.base_lists
                .saturating_add(saturated(self.lists.len() - 1)),
        );
        self.push_term(FoTerm::App(symbol, list))
    }

    /// Adds the frame that pushes `term` onto `parent` and returns it.
    /// `parent` is the frame of the binders further out, or `None` for an
    /// outermost binder.
    pub fn frame(&mut self, parent: Option<FrameId>, term: FoTermId) -> FrameId {
        self.frames.push((parent, term));
        FrameId::new(saturated(self.frames.len() - 1))
    }

    /// Adds the member that stands for `occurrence` under `frame` and
    /// returns it. `frame` must hold a term for every binder above the
    /// occurrence.
    pub fn member(&mut self, occurrence: OccId, frame: FrameId) -> Member {
        self.members.push((occurrence, frame));
        Member::new(
            self.occurrences
                .saturating_add(saturated(self.members.len() - 1)),
        )
    }

    /// Returns the number of members the table numbers.
    pub fn len(&self) -> usize {
        self.members.len()
    }

    /// Returns whether the table numbers no member.
    pub fn is_empty(&self) -> bool {
        self.members.is_empty()
    }

    /// Returns the occurrence and frame `member` stands for, or `None` for
    /// a member that is an occurrence of the forest or that the table does
    /// not number.
    pub fn instance(&self, member: Member) -> Option<(OccId, FrameId)> {
        let at = member.get().checked_sub(self.occurrences)?;
        self.members.get(at as usize).copied()
    }

    /// Returns the parent frame and the term of `frame`.
    ///
    /// # Panics
    ///
    /// For a frame the table does not hold.
    pub fn frame_parts(&self, frame: FrameId) -> (Option<FrameId>, FoTermId) {
        self.frames[frame.index()]
    }

    /// Returns the terms of `frame`, the innermost binder's first.
    ///
    /// # Panics
    ///
    /// For a frame the table does not hold.
    pub fn frame_terms(&self, frame: FrameId) -> Vec<FoTermId> {
        let mut terms = Vec::new();
        let mut next = Some(frame);
        while let Some(f) = next {
            let (parent, term) = self.frames[f.index()];
            terms.push(term);
            next = parent;
        }
        terms
    }

    /// Returns the table's own terms, whose ids follow the sequent's.
    pub fn terms(&self) -> &[FoTerm] {
        &self.terms
    }

    /// Returns the id of the table's first term, which is the number of
    /// the sequent's own terms.
    pub fn first_term(&self) -> FoTermId {
        FoTermId::new(self.base_terms)
    }

    /// Returns the eigenvariables among the table's terms, ascending and
    /// each once.
    pub fn eigenvariables(&self) -> Vec<Eigen> {
        let mut eigens: Vec<Eigen> = self
            .terms
            .iter()
            .filter_map(|t| match *t {
                FoTerm::Eigen(a) => Some(a),
                FoTerm::Bound(_) | FoTerm::App(..) | FoTerm::Meta(_) => None,
            })
            .collect();
        eigens.sort_unstable();
        eigens.dedup();
        eigens
    }

    /// Adds `term` to the table and returns its id.
    pub(crate) fn push_term(&mut self, term: FoTerm) -> FoTermId {
        self.terms.push(term);
        FoTermId::new(
            self.base_terms
                .saturating_add(saturated(self.terms.len() - 1)),
        )
    }
}

/// Returns `n` as a `u32`, or `u32::MAX` where `n` is larger.
fn saturated(n: usize) -> u32 {
    u32::try_from(n).unwrap_or(u32::MAX)
}

/// The terms of a proof: its sequent's arena and the proof's extension of
/// it, under one range of ids.
#[derive(Clone, Copy, Debug)]
pub(crate) struct Terms<'a> {
    /// The sequent's tables.
    pub(crate) fo: &'a FirstOrder,
    /// The proof's table.
    pub(crate) table: &'a Instances,
}

impl Terms<'_> {
    /// Returns the number of terms of both arenas.
    pub(crate) fn len(&self) -> usize {
        self.fo.terms.len() + self.table.terms.len()
    }

    /// Returns the term `id`.
    pub(crate) fn term(&self, id: FoTermId) -> FoTerm {
        match id.index().checked_sub(self.fo.terms.len()) {
            None => self.fo.terms[id.index()],
            Some(at) => self.table.terms[at],
        }
    }

    /// Returns the terms of the argument list `args`.
    pub(crate) fn list(&self, args: Args) -> &[FoTermId] {
        match args.index().checked_sub(self.fo.lists.len()) {
            None => self.fo.list(args),
            Some(at) => {
                let (start, len) = self.table.lists[at];
                &self.table.args[start as usize..(start + len) as usize]
            }
        }
    }

    /// Returns the number of argument lists of both tables.
    fn lists(&self) -> usize {
        self.fo.lists.len() + self.table.lists.len()
    }
}

/// The key [`Hashcons`] numbers a term by: its tag and its children's
/// numbers.
#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
enum Key {
    /// A bound variable.
    Bound(u32),
    /// A symbol applied to the argument list of that number.
    App(Symbol, u64),
    /// An eigenvariable.
    Eigen(Eigen),
}

/// Numbers first-order terms and argument lists so that equal ones get the
/// same number. A term is numbered by its symbol and its arguments'
/// numbers, and a list by its items' numbers.
///
/// A number is the count of distinct terms or lists numbered before it,
/// each held in a table. So a `u64` cannot overflow: no memory holds 2⁶⁴
/// entries.
#[derive(Default)]
pub(crate) struct Hashcons {
    /// Every term numbered, by its key.
    terms: HashMap<Key, u64>,
    /// Every list numbered, by its items.
    lists: HashMap<Box<[u64]>, u64>,
}

impl Hashcons {
    /// Returns the number of a term and whether it is new.
    fn term(&mut self, key: Key) -> (u64, bool) {
        let next = self.terms.len() as u64;
        match self.terms.entry(key) {
            std::collections::hash_map::Entry::Occupied(e) => (*e.get(), false),
            std::collections::hash_map::Entry::Vacant(e) => (*e.insert(next), true),
        }
    }

    /// Returns the number of a list of term numbers and whether it is new.
    fn list(&mut self, items: &[u64]) -> (u64, bool) {
        if let Some(&n) = self.lists.get(items) {
            return (n, false);
        }
        let n = self.lists.len() as u64;
        self.lists.insert(items.into(), n);
        (n, true)
    }
}

/// The numbers of a proof's terms, and the means to number the instances
/// of its atoms. The checker compares an axiom's two literals by these
/// numbers.
pub(crate) struct Numbering<'a> {
    /// The proof's terms.
    terms: Terms<'a>,
    /// The hash-consing.
    cons: Hashcons,
    /// Per term of both arenas, its number.
    numbers: Vec<u64>,
    /// Per term, one more than its largest loose bound index, or `0` for a
    /// closed term.
    loose: Vec<u32>,
    /// Per argument list, its number once computed.
    list_numbers: Vec<Option<u64>>,
}

impl<'a> Numbering<'a> {
    /// Numbers every term of both arenas, in one pass, since every term
    /// comes after its arguments.
    pub(crate) fn new(terms: Terms<'a>) -> Self {
        let mut this = Self {
            terms,
            cons: Hashcons::default(),
            numbers: Vec::with_capacity(terms.len()),
            loose: Vec::with_capacity(terms.len()),
            list_numbers: vec![None; terms.lists()],
        };
        for id in 0..terms.len() {
            let id = FoTermId::new(id as u32);
            let (key, loose) = match terms.term(id) {
                FoTerm::Bound(i) => (Key::Bound(i), i.saturating_add(1)),
                FoTerm::Eigen(a) => (Key::Eigen(a), 0),
                // `canonical` refuses a table with a metavariable before
                // it numbers the terms.
                FoTerm::Meta(_) => unreachable!("a proof's table holds no metavariable"),
                FoTerm::App(f, args) => {
                    let loose = terms
                        .list(args)
                        .iter()
                        .map(|t| this.loose[t.index()])
                        .max()
                        .unwrap_or(0);
                    (Key::App(f, this.list_number(args)), loose)
                }
            };
            this.numbers.push(this.cons.term(key).0);
            this.loose.push(loose);
        }
        this
    }

    /// Returns the number of the argument list `args`, whose items must
    /// already be numbered.
    fn list_number(&mut self, args: Args) -> u64 {
        if let Some(n) = self.list_numbers[args.index()] {
            return n;
        }
        let items: Vec<u64> = self
            .terms
            .list(args)
            .iter()
            .map(|t| self.numbers[t.index()])
            .collect();
        let n = self.cons.list(&items).0;
        self.list_numbers[args.index()] = Some(n);
        n
    }

    /// Returns the terms numbered.
    pub(crate) fn terms(&self) -> Terms<'a> {
        self.terms
    }

    /// Returns the number of the term `id`.
    pub(crate) fn number(&self, id: FoTermId) -> u64 {
        self.numbers[id.index()]
    }

    /// Returns whether the term `id` is closed: it has no loose bound
    /// variable.
    pub(crate) fn is_closed(&self, id: FoTermId) -> bool {
        self.loose[id.index()] == 0
    }

    /// Returns the number of the argument list `args` with every loose
    /// bound variable `i` replaced by the term numbered `frame[i]`: the
    /// arguments of an atom's instance. Each shared subterm is visited
    /// once, on an explicit stack, so deep terms cannot overflow the call
    /// stack.
    pub(crate) fn instance(&mut self, args: Args, frame: &[u64]) -> u64 {
        let mut memo: HashMap<FoTermId, u64> = HashMap::default();
        let terms = self.terms;
        let list = terms.list(args);
        let mut items = Vec::with_capacity(list.len());
        for &t in list {
            items.push(self.substitute(t, frame, &mut memo));
        }
        self.cons.list(&items).0
    }

    /// Returns the number of the term `t` under `frame`, as
    /// [`instance`](Self::instance) takes its arguments.
    fn substitute(&mut self, t: FoTermId, frame: &[u64], memo: &mut HashMap<FoTermId, u64>) -> u64 {
        if self.loose[t.index()] == 0 {
            return self.numbers[t.index()];
        }
        let mut stack = vec![(t, false)];
        while let Some((u, expanded)) = stack.pop() {
            if memo.contains_key(&u) {
                continue;
            }
            match self.terms.term(u) {
                // The sequent's check keeps every bound index of an atom
                // below the number of its occurrence's binders, and the
                // frame has a term for each binder.
                FoTerm::Bound(i) => {
                    memo.insert(u, frame[i as usize]);
                }
                FoTerm::App(f, args) if expanded => {
                    let items: Vec<u64> = self
                        .terms
                        .list(args)
                        .iter()
                        .map(|&c| {
                            if self.loose[c.index()] == 0 {
                                self.numbers[c.index()]
                            } else {
                                memo[&c]
                            }
                        })
                        .collect();
                    let list = self.cons.list(&items).0;
                    memo.insert(u, self.cons.term(Key::App(f, list)).0);
                }
                FoTerm::App(_, args) => {
                    stack.push((u, true));
                    for &c in self.terms.list(args) {
                        if self.loose[c.index()] > 0 && !memo.contains_key(&c) {
                            stack.push((c, false));
                        }
                    }
                }
                // An eigenvariable is closed, so the check at the top
                // returned its number.
                FoTerm::Eigen(_) => unreachable!("an eigenvariable is a closed term"),
                // `canonical` refuses a table with a metavariable before
                // it numbers the terms.
                FoTerm::Meta(_) => unreachable!("a proof's table holds no metavariable"),
            }
        }
        memo[&t]
    }
}

/// Returns, per occurrence of `forest`, how many binders stand above it.
pub(crate) fn binders(forest: &Forest) -> Vec<u32> {
    let mut depth = vec![0u32; forest.len()];
    for o in forest.ids() {
        if let Some(p) = forest.parent(o) {
            // At most one binder per ancestor, so the depth stays below the
            // forest's length and cannot overflow.
            depth[o.index()] = depth[p.index()] + u32::from(forest.kind(p).is_binder());
        }
    }
    depth
}

/// Returns the error of a malformed instance table.
fn malformed(message: String) -> Error {
    Error::Json {
        form: "instance table",
        message,
    }
}

/// Checks `table` against `forest` and the proof's `nodes`, whose
/// indices are already within bounds. Returns the table in canonical
/// form, with the nodes' members and witnesses renumbered into it.
///
/// In canonical form:
///
/// - equal terms, lists, frames and members are one entry each;
/// - the sequent's own terms keep their ids;
/// - every member the checker derives from a member a node names has a
///   number: the subformulas of a named member under its frame, the body
///   of a `∀` or `∃` step under its frame with the eigenvariable or
///   witness pushed, and the dual of a cut's member. So every member a
///   check or a derivation of the proof uses is in the table.
///
/// # Errors
///
/// [`Error::Json`] (form `instance table`) for:
///
/// - a table made for another forest;
/// - an index out of range, or an entry that refers to a later one;
/// - a table term that is a bound variable or a metavariable;
/// - a symbol applied to the wrong number of arguments, or a predicate
///   applied as a function;
/// - a frame term with a loose bound variable;
/// - a member whose frame does not have one term for each binder above
///   its occurrence;
/// - a witness out of range or with a loose bound variable.
///
/// [`Error::IndexOutOfBounds`] for a member past the table, and
/// [`Refusal::Index`](crate::Refusal::Index) for a table whose ids would
/// not fit a `u32`.
pub(crate) fn canonical(
    forest: &Forest,
    table: &Instances,
    nodes: &mut [Node],
) -> Result<Instances, Error> {
    let fo = &forest.sequent().fo;
    let made_for = Instances::new(forest);
    if (table.occurrences, table.base_terms, table.base_lists)
        != (
            made_for.occurrences,
            made_for.base_terms,
            made_for.base_lists,
        )
    {
        return Err(malformed("the table was made for another sequent".into()));
    }
    // Every id of the table made must fit a `u32`, counting the members,
    // frames and terms that the derived members add: at most three
    // members, one frame and one term per node. Past that the table is
    // refused.
    let count = nodes.len() as u64;
    let most = u64::from(u32::MAX);
    let ids = [
        (
            Space::Member,
            u64::from(table.occurrences) + table.members.len() as u64 + 3 * count,
        ),
        (
            Space::Term,
            u64::from(table.base_terms) + table.terms.len() as u64 + count,
        ),
        (
            Space::Term,
            u64::from(table.base_lists) + table.lists.len() as u64 + count,
        ),
        (Space::Term, table.args.len() as u64),
        (Space::Term, table.frames.len() as u64 + count),
    ];
    if let Some(&(what, count)) = ids.iter().find(|&&(_, count)| count > most) {
        return Err(Error::Refused(crate::limits::Refusal::Index {
            what,
            count,
            most,
        }));
    }
    let terms = Terms { fo, table };
    let all_terms = terms.len();
    let all_lists = terms.lists();
    let mut predicate = vec![false; fo.symbols.len()];
    for &(p, _) in &fo.atoms {
        predicate[p.index()] = true;
    }
    for (&(start, len), n) in table.lists.iter().zip(0..) {
        if (start as usize).saturating_add(len as usize) > table.args.len() {
            return Err(malformed(format!("list {n} runs past the arguments")));
        }
    }
    for (i, &term) in table.terms.iter().enumerate() {
        let id = fo.terms.len() + i;
        match term {
            FoTerm::Bound(_) => {
                return Err(malformed(format!("term {id} is a bound variable")));
            }
            FoTerm::Meta(_) => {
                return Err(malformed(format!(
                    "term {id} is an open witness, which a proof cannot hold"
                )));
            }
            FoTerm::Eigen(_) => {}
            FoTerm::App(f, args) => {
                let Some(&(_, arity)) = fo.symbols.get(f.index()) else {
                    return Err(malformed(format!("term {id} applies no symbol")));
                };
                if predicate[f.index()] {
                    return Err(malformed(format!("term {id} applies a predicate")));
                }
                if args.index() >= all_lists {
                    return Err(malformed(format!("term {id} has no argument list")));
                }
                let list = terms.list(args);
                if list.len() != arity as usize {
                    return Err(malformed(format!(
                        "term {id} applies a symbol of {arity} arguments to {}",
                        list.len()
                    )));
                }
                if list.iter().any(|t| t.index() >= id) {
                    return Err(malformed(format!("term {id} refers to a later term")));
                }
            }
        }
    }
    let numbering = Numbering::new(terms);
    // A table term is never a bound variable itself, but its arguments may
    // be open terms of the sequent. So the frames' terms and the witnesses
    // are checked for loose bound variables through the numbering.
    let mut lengths: Vec<u32> = Vec::with_capacity(table.frames.len());
    for (n, &(parent, term)) in table.frames.iter().enumerate() {
        if term.index() >= all_terms || !numbering.is_closed(term) {
            return Err(malformed(format!("frame {n} adds no closed term")));
        }
        let length = match parent {
            None => 1,
            Some(p) if p.index() < n => lengths[p.index()] + 1,
            Some(_) => return Err(malformed(format!("frame {n} refers to a later frame"))),
        };
        lengths.push(length);
    }
    let depth = binders(forest);
    for (n, &(o, frame)) in table.members.iter().enumerate() {
        let member = u64::from(table.occurrences) + n as u64;
        if o.index() >= forest.len() || frame.index() >= table.frames.len() {
            return Err(malformed(format!("member {member} names no instance")));
        }
        if lengths[frame.index()] != depth[o.index()] {
            return Err(malformed(format!(
                "member {member} stands under {} binders with a frame of {} terms",
                depth[o.index()],
                lengths[frame.index()]
            )));
        }
    }
    for node in nodes.iter() {
        if let Node::Exists(_, w, _) = *node {
            if w.index() >= all_terms {
                return Err(malformed(format!(
                    "the witness {} is past the {all_terms} terms",
                    w.get()
                )));
            }
            if !numbering.is_closed(w) {
                return Err(malformed(format!(
                    "the witness {} holds a loose bound variable",
                    w.get()
                )));
            }
        }
    }
    Canonical::new(forest, table, numbering).finish(nodes)
}

/// The canonical table that [`canonical`] builds, while it builds it.
struct Canonical<'a> {
    /// The forest.
    forest: &'a Forest,
    /// The table read.
    table: &'a Instances,
    /// The numbers of the read table's terms.
    numbering: Numbering<'a>,
    /// The table made.
    out: Instances,
    /// Per term number, its id in the table made.
    term_at: HashMap<u64, FoTermId>,
    /// Per list number, its id in the table made.
    list_at: HashMap<u64, Args>,
    /// The frames of the table made, by their parent and term.
    frame_at: HashMap<(Option<FrameId>, FoTermId), FrameId>,
    /// Per frame of the table read, its frame in the table made, once
    /// made. So a chain of frames is made once, not once per member.
    made: Vec<Option<FrameId>>,
    /// The members of the table made, by their occurrence and frame.
    member_at: HashMap<(OccId, FrameId), Member>,
}

impl<'a> Canonical<'a> {
    /// Returns the empty table, with the sequent's terms and lists in
    /// place.
    fn new(forest: &'a Forest, table: &'a Instances, numbering: Numbering<'a>) -> Self {
        let fo = &forest.sequent().fo;
        let mut this = Self {
            forest,
            table,
            numbering,
            out: Instances::new(forest),
            term_at: HashMap::default(),
            list_at: HashMap::default(),
            frame_at: HashMap::default(),
            made: vec![None; table.frames.len()],
            member_at: HashMap::default(),
        };
        for id in 0..fo.terms.len() {
            let id = FoTermId::new(id as u32);
            this.term_at.entry(this.numbering.number(id)).or_insert(id);
        }
        for args in 0..fo.lists.len() {
            let args = Args::new(args as u32);
            let n = this.numbering.list_number(args);
            this.list_at.entry(n).or_insert(args);
        }
        this
    }

    /// Returns the id in the table made of the closed term `id` of the
    /// table read, adding it and its arguments where they are new. It
    /// walks the term on a stack of its own, arguments first, since a
    /// search's witness may be nested as deep as its bindings go.
    fn term(&mut self, id: FoTermId) -> FoTermId {
        let mut walk = vec![(id, false)];
        while let Some((t, expanded)) = walk.pop() {
            let n = self.numbering.number(t);
            if self.term_at.contains_key(&n) {
                continue;
            }
            // Not among the terms made so far, so a table term, whose
            // arguments come before it.
            let term = match self.numbering.terms.term(t) {
                FoTerm::App(f, args) => {
                    let ln = self.numbering.list_number(args);
                    let list = match self.list_at.get(&ln) {
                        Some(&list) => list,
                        None if !expanded => {
                            walk.push((t, true));
                            walk.extend(
                                self.numbering.terms.list(args).iter().map(|&a| (a, false)),
                            );
                            continue;
                        }
                        None => {
                            let items: Vec<FoTermId> = self
                                .numbering
                                .terms
                                .list(args)
                                .iter()
                                .map(|&a| self.term_at[&self.numbering.number(a)])
                                .collect();
                            let start = self.out.args.len() as u32;
                            self.out.args.extend_from_slice(&items);
                            self.out.lists.push((start, items.len() as u32));
                            let list =
                                Args::new(self.out.base_lists + self.out.lists.len() as u32 - 1);
                            self.list_at.insert(ln, list);
                            list
                        }
                    };
                    FoTerm::App(f, list)
                }
                other @ (FoTerm::Eigen(_) | FoTerm::Bound(_) | FoTerm::Meta(_)) => other,
            };
            let at = self.out.push_term(term);
            self.term_at.insert(n, at);
        }
        self.term_at[&self.numbering.number(id)]
    }

    /// Returns the id in the table made of the eigenvariable `a`'s term.
    fn eigen(&mut self, a: Eigen) -> FoTermId {
        let (n, _) = self.numbering.cons.term(Key::Eigen(a));
        if let Some(&at) = self.term_at.get(&n) {
            return at;
        }
        let at = self.out.push_term(FoTerm::Eigen(a));
        self.term_at.insert(n, at);
        at
    }

    /// Returns the frame of the table made that pushes `term`, an id of
    /// the table made, onto `parent`.
    fn push(&mut self, parent: Option<FrameId>, term: FoTermId) -> FrameId {
        *self.frame_at.entry((parent, term)).or_insert_with(|| {
            self.out.frames.push((parent, term));
            // Fits a `u32`: `canonical` checked the bound first.
            FrameId::new(self.out.frames.len() as u32 - 1)
        })
    }

    /// Returns the frame of the table made for the frame `f` of the table
    /// read.
    fn frame(&mut self, f: FrameId) -> FrameId {
        // Collect the frames out to the first one already made, then make
        // them from the outermost in.
        let mut chain = Vec::new();
        let mut next = Some(f);
        let mut below = None;
        while let Some(f) = next {
            if let Some(made) = self.made[f.index()] {
                below = Some(made);
                break;
            }
            chain.push(f);
            next = self.table.frames[f.index()].0;
        }
        for f in chain.into_iter().rev() {
            let term = self.term(self.table.frames[f.index()].1);
            let made = self.push(below, term);
            self.made[f.index()] = Some(made);
            below = Some(made);
        }
        below.expect("a frame holds a term")
    }

    /// Returns the member of the table made for `o` under `frame`, a frame
    /// of the table made, or the occurrence itself when there is no frame.
    fn member(&mut self, o: OccId, frame: Option<FrameId>) -> Member {
        let Some(frame) = frame else {
            return Member::from(o);
        };
        *self.member_at.entry((o, frame)).or_insert_with(|| {
            self.out.members.push((o, frame));
            Member::new(self.out.occurrences + self.out.members.len() as u32 - 1)
        })
    }

    /// Returns the occurrence and frame of a member of the table made.
    fn resolve(&self, m: Member) -> (OccId, Option<FrameId>) {
        match self.out.instance(m) {
            Some((o, f)) => (o, Some(f)),
            None => (m.occ(), None),
        }
    }

    /// Renumbers the nodes' members and witnesses into the table made, adds
    /// the members the checker derives from them, and returns the table.
    fn finish(mut self, nodes: &mut [Node]) -> Result<Instances, Error> {
        let read: Vec<Member> = (0..self.table.members.len())
            .map(|n| {
                let (o, f) = self.table.members[n];
                let f = self.frame(f);
                self.member(o, Some(f))
            })
            .collect();
        let occurrences = self.table.occurrences;
        let renumber = |m: Member| -> Result<Member, Error> {
            match m.get().checked_sub(occurrences) {
                None => Ok(m),
                Some(at) => read
                    .get(at as usize)
                    .copied()
                    .ok_or(Error::IndexOutOfBounds {
                        space: Space::Member,
                        index: m.index(),
                        len: occurrences as usize + read.len(),
                    }),
            }
        };
        for node in nodes.iter_mut() {
            *node = node.renamed(renumber)?;
            if let Node::Exists(m, w, p) = *node {
                *node = Node::Exists(m, self.term(w), p);
            }
        }
        let forest = self.forest;
        for node in nodes.iter() {
            for m in node.members() {
                let (o, frame) = self.resolve(m);
                if frame.is_some() && !forest.kind(o).is_binder() {
                    for c in forest.children(o) {
                        self.member(c, frame);
                    }
                }
            }
            match *node {
                Node::Forall(m, a, _) => {
                    let (o, frame) = self.resolve(m);
                    if forest.kind(o).is_binder() {
                        let term = self.eigen(a);
                        let frame = self.push(frame, term);
                        self.member(OccId::new(o.get() + 1), Some(frame));
                    }
                }
                Node::Exists(m, w, _) => {
                    let (o, frame) = self.resolve(m);
                    if forest.kind(o).is_binder() {
                        let frame = self.push(frame, w);
                        self.member(OccId::new(o.get() + 1), Some(frame));
                    }
                }
                Node::Cut(m, ..) => {
                    let (o, frame) = self.resolve(m);
                    if let Some(dual) = forest.dual(o) {
                        self.member(dual, frame);
                    }
                }
                Node::Ax(..)
                | Node::Tensor(..)
                | Node::Par(..)
                | Node::One(_)
                | Node::Bot(..)
                | Node::With(..)
                | Node::Plus(..)
                | Node::Top(_)
                | Node::Bang(..)
                | Node::Quest(..)
                | Node::Copy(..)
                | Node::Weaken(..)
                | Node::Mix(..) => {}
            }
        }
        Ok(self.out)
    }
}

/// Returns the names the eigenvariables `eigens` are written with: `a`,
/// `b`, … `z`, then `a_1`, `b_1`, …. Names of the sequent's symbols are
/// skipped, so a sequent of a derivation reads as a sequent with those
/// eigenvariables as new constants.
pub(crate) fn eigen_names(fo: &FirstOrder, eigens: &[Eigen]) -> HashMap<Eigen, String> {
    let taken: std::collections::HashSet<&str> =
        fo.symbols.iter().map(|(s, _)| s.as_str()).collect();
    let mut names = HashMap::default();
    let mut candidates = (0u64..).map(|n| {
        let letter = char::from(b'a' + (n % 26) as u8);
        match n / 26 {
            0 => letter.to_string(),
            k => format!("{letter}_{k}"),
        }
    });
    for &a in eigens {
        let name = candidates
            .by_ref()
            .find(|c| !taken.contains(c.as_str()))
            .expect("the candidates never end");
        names.insert(a, name);
    }
    names
}

/// Returns the name an open witness is written with: the metavariable `k`
/// of an interactive session, written `$1` for the first. No reader of
/// either syntax accepts a `$`, so the name cannot be mistaken for a
/// formula, term or symbol, or for a renamed variable such as `x_1`. A
/// `?` would not do: `?1` reads as the formula `?(1)`.
pub(crate) fn meta_name(k: u32) -> String {
    format!("${}", u64::from(k) + 1)
}

/// What a printer needs to write a proof's instances: the table, the
/// terms of both arenas and the eigenvariables' names.
#[derive(Clone, Debug)]
pub(crate) struct Framing<'a> {
    /// The proof's table.
    pub(crate) table: &'a Instances,
    /// The terms of both arenas.
    terms: Terms<'a>,
    /// The name of every eigenvariable the table holds.
    names: HashMap<Eigen, String>,
}

impl<'a> Framing<'a> {
    /// Returns the framing of `table`, a proof's table over a sequent
    /// whose first-order tables are `fo`.
    pub(crate) fn new(fo: &'a FirstOrder, table: &'a Instances) -> Self {
        Self {
            table,
            terms: Terms { fo, table },
            names: eigen_names(fo, &table.eigenvariables()),
        }
    }

    /// Returns the occurrence `m` stands for.
    pub(crate) fn occurrence(&self, m: Member) -> OccId {
        self.table.instance(m).map_or(m.occ(), |(o, _)| o)
    }

    /// Returns the terms of both arenas.
    #[cfg(feature = "rocq")]
    pub(crate) const fn terms(&self) -> Terms<'a> {
        self.terms
    }

    /// Returns the terms of the argument list `args` of either arena.
    #[cfg(feature = "rocq")]
    pub(crate) fn list(&self, args: Args) -> &[FoTermId] {
        self.terms.list(args)
    }

    /// Returns the eigenvariables' names.
    pub(crate) fn names(&self) -> impl Iterator<Item = &str> {
        self.names.values().map(String::as_str)
    }

    /// Returns the name eigenvariable `a` is written with, or `?` for one
    /// the table does not hold.
    pub(crate) fn name(&self, a: Eigen) -> &str {
        self.names.get(&a).map_or("?", String::as_str)
    }

    /// Writes the closed term `term` as `f(t, …)`, writing every symbol's
    /// and eigenvariable's name through `atom`. It uses an explicit stack,
    /// so deep terms cannot overflow the call stack.
    pub(crate) fn write_term<W: Write + ?Sized>(
        &self,
        out: &mut W,
        term: FoTermId,
        atom: &mut impl FnMut(&mut W, &str) -> FmtResult,
    ) -> FmtResult {
        let mut open: Vec<(Args, u32)> = Vec::new();
        let mut next = Some(term);
        loop {
            if let Some(t) = next.take() {
                match self.terms.term(t) {
                    FoTerm::App(f, args) => {
                        atom(out, &self.terms.fo.symbols[f.index()].0)?;
                        if !self.terms.list(args).is_empty() {
                            out.write_char('(')?;
                            open.push((args, 0));
                        }
                    }
                    FoTerm::Eigen(a) => atom(out, self.name(a))?,
                    FoTerm::Meta(k) => atom(out, &meta_name(k))?,
                    // Frames and witnesses hold closed terms, so this is
                    // only a fallback.
                    FoTerm::Bound(index) => write!(out, "#{index}")?,
                }
            }
            let Some(&mut (args, ref mut i)) = open.last_mut() else {
                return Ok(());
            };
            let list = self.terms.list(args);
            if (*i as usize) < list.len() {
                if *i > 0 {
                    out.write_str(", ")?;
                }
                next = Some(list[*i as usize]);
                *i += 1;
            } else {
                out.write_char(')')?;
                open.pop();
            }
        }
    }
}