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
// deduxit © Fabian Lukas Grubmüller 2026
// Licensed under the EUPL
//! The invertible rules, applied by the session itself.
//!
//! A rule is invertible when its premises are provable whenever its
//! conclusion is. Applying it never turns a provable goal into an
//! unprovable one, so a session may take such steps without being asked,
//! as the asynchronous phase of a focused search does.
use super::expand::formula_at;
use super::{GoalId, Interactive, Step, StepError, Witness};
use crate::limits::{Limits, Phase, Refusal};
use crate::linear::occurrences::{Member, OccId};
use crate::linear::proofs::derivation::Inference;
use crate::linear::proofs::multiset::Multiset;
use crate::linear::proofs::{Named, Rule};
use crate::linear::sequents::Kind;
/// Whether a session takes steps of its own: a plain value a front end
/// keeps with its other settings.
///
/// # JSON
///
/// With the feature `serialize`, `{"invertible": false}`. A missing field
/// takes its default, and a misspelt one is refused.
///
/// Needs the cargo feature `interactive` (on by default).
#[non_exhaustive]
#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
#[cfg_attr(
feature = "serialize",
derive(serde::Serialize, serde::Deserialize),
serde(default, deny_unknown_fields)
)]
pub struct Options {
/// Whether a front end applies every invertible rule
/// ([`Interactive::invert`]) to the goals each step opens and to the
/// sequent a session starts from.
pub invertible: bool,
}
impl Options {
/// Off, so that every step a newcomer sees is one they took, until
/// they ask for the invertible rules.
pub const DEFAULT_INVERTIBLE: bool = false;
/// Returns the options with another [`invertible`](Self::invertible).
#[must_use]
pub const fn with_invertible(self, invertible: bool) -> Self {
Self { invertible }
}
}
impl Default for Options {
/// Returns the options with
/// [`DEFAULT_INVERTIBLE`](Self::DEFAULT_INVERTIBLE).
fn default() -> Self {
Self {
invertible: Self::DEFAULT_INVERTIBLE,
}
}
}
/// What [`Interactive::invert`] did.
///
/// Needs the cargo feature `interactive` (on by default).
#[non_exhaustive]
#[derive(Clone, Debug, PartialEq, Eq)]
pub struct Inverted {
/// How many steps it took. Each is an ordinary step of the session,
/// which [`undo`](Interactive::undo) takes back one at a time, the last
/// first.
pub steps: usize,
/// The goals it left open, from left to right: each goal it was given
/// and took no step on, and each goal its steps opened and it took no
/// step on.
pub open: Vec<GoalId>,
/// `Ok` when no invertible rule applies to any goal of
/// [`open`](Self::open). Otherwise the memory bound stopped it, and the
/// steps it took stand.
pub finished: Result<(), Refusal>,
}
impl Interactive {
/// Applies the rules invertible in the session's mode
/// ([`is_invertible`](Self::is_invertible)) to an open goal, and then
/// to every goal those steps open, until none applies.
///
/// On each goal it takes a rule that closes the goal (`⊤`, the axiom,
/// `1`) first, and otherwise the rule on the first formula that has
/// one. Each application is an ordinary step. It always ends, since
/// every premise of these rules has fewer connectives, units and
/// literals than its conclusion. The bytes of the inferences it adds
/// are bounded by `limits.memory_bytes`: at the bound it stops, and
/// the steps it took stand ([`Inverted::finished`]).
///
/// # Errors
///
/// [`StepError::NoGoal`] for a goal that is not open.
pub fn invert(&mut self, goal: GoalId, limits: &Limits) -> Result<Inverted, StepError> {
self.goal(goal)?;
Ok(self.invert_goals(vec![goal], limits))
}
/// Applies the invertible rules to every open goal in turn, as
/// [`invert`](Self::invert) does to one, all within one memory bound.
pub fn invert_all(&mut self, limits: &Limits) -> Inverted {
let goals = self.goals().collect();
self.invert_goals(goals, limits)
}
/// Returns whether a step on a sequent of this session's forest (an
/// open goal, or an inference's conclusion) applies a rule invertible
/// in the session's mode, and is a valid step there.
///
/// The invertible rules are:
/// - in every mode `⅋`, `⊥`, `&` and `⊤`, under any name the
/// intuitionistic or the ordered reading gives them (`⊸R`, `⊗L`,
/// `&R`, `⊕L`, `1L`, `⊤R`, `0L`, `\R`, `/R`), and `∀` (`∀R`, `∃L`);
/// - `!` when every other formula is a `?` formula (`!R` when every
/// hypothesis is a `!`);
/// - `1` alone, the axiom on a literal and its dual alone, and `⊗`
/// alone, with no context to split.
///
/// No `?` rule is among them: dereliction and weakening are not
/// invertible, and contraction is, but applying it never ends.
pub fn is_invertible(&self, sequent: &[Member], step: &Step) -> bool {
let sequent: Vec<OccId> = sequent.iter().map(|&m| self.occurrence(m)).collect();
let Ok(left) = step.left_positions(sequent.len()) else {
return false;
};
let Ok(o) = formula_at(&sequent, step.position) else {
return false;
};
let rule = self.invertible_rule(&sequent, self.non_quests(&sequent), step.position);
if !left.is_empty() || rule != Some(step.rule.rule) {
return false;
}
let reading = self.reading();
let named = Named::applied(step.rule.rule, reading.as_ref(), o);
(step.rule.side.is_none() || step.rule == named)
&& self
.expand(reading.as_ref(), &sequent, step.position, named, &[])
.is_ok()
}
/// Applies the invertible rules to the goals, depth first, within the
/// memory bound.
fn invert_goals(&mut self, goals: Vec<GoalId>, limits: &Limits) -> Inverted {
let mut todo: Vec<GoalId> = goals.into_iter().rev().collect();
let (mut steps, mut open) = (0, Vec::new());
// The bytes of the inferences added: per premise, an inference
// and its sequent's members. The sum saturates, but the bound
// stops the run long before that.
let mut held = 0u64;
while let Some(goal) = todo.pop() {
let Some((position, rule, premises)) = self.invertible_step(goal) else {
open.push(goal);
continue;
};
let needed = premises.iter().fold(0u64, |sum, premise| {
let members = premise.as_slice().len() * size_of::<Member>();
sum.saturating_add((size_of::<Inference>() + members) as u64)
});
if let Some(limit) = limits.memory_bytes
&& held.saturating_add(needed) > limit
{
open.push(goal);
open.extend(todo.into_iter().rev());
return Inverted {
steps,
open,
finished: Err(Refusal::Memory {
phase: Phase::View,
limit_bytes: limit,
needed_bytes: Some(held.saturating_add(needed)),
}),
};
}
held = held.saturating_add(needed);
let premises = if self.fo.is_some() {
match self.framed_premises(goal, position, rule.rule, &[], &Witness::Open) {
Ok(premises) => premises,
// Past the eigenvariables a `u32` numbers, or past
// the session's bound on terms: the goal stays open.
Err(_) => {
open.push(goal);
continue;
}
}
} else {
premises.into_iter().map(Multiset::into_members).collect()
};
let opened = self.record(goal, position, rule, premises);
steps += 1;
todo.extend(opened.into_iter().rev());
}
Inverted {
steps,
open,
finished: Ok(()),
}
}
/// Returns the invertible step to take on an open goal, with its
/// premises, or `None` when no invertible rule applies. A step that
/// closes the goal comes first, and otherwise the first position's.
fn invertible_step(&self, goal: GoalId) -> Option<(usize, Named, Vec<Multiset>)> {
let sequent = self.open(goal).ok()?;
let reading = self.reading();
let closes = |rule: Rule| matches!(rule, Rule::Top | Rule::Ax | Rule::One);
let non_quests = self.non_quests(&sequent);
for closing in [true, false] {
for position in 0..sequent.len() {
let Some(rule) = self.invertible_rule(&sequent, non_quests, position) else {
continue;
};
if closes(rule) != closing {
continue;
}
let named = Named::applied(rule, reading.as_ref(), sequent[position]);
// A first-order axiom closes equal instances only: binding
// an open witness is a choice, not an invertible step.
if rule == Rule::Ax
&& let Some(q) = &self.fo
&& let Ok(&[x, y]) = self.goal(goal)
&& !q.same_atom(&self.forest, x, y)
{
continue;
}
// The reading may still refuse the step: a premise without
// one formula on the right of ⊢, or without an antecedent.
if let Ok(premises) = self.expand(reading.as_ref(), &sequent, position, named, &[])
{
return Some((position, named, premises));
}
}
}
None
}
/// Returns how many formulas of a sequent are not `?` formulas.
fn non_quests(&self, sequent: &[OccId]) -> usize {
(sequent.iter())
.filter(|&&o| self.forest.kind(o) != Kind::Quest)
.count()
}
/// Returns the invertible rule that acts on the formula at a position
/// of a sequent when its condition holds, or `None`. `non_quests` of
/// the sequent's formulas are not `?` formulas. Whether the mode and
/// the reading allow the step is for [`expand`](Self::expand) to say.
fn invertible_rule(
&self,
sequent: &[OccId],
non_quests: usize,
position: usize,
) -> Option<Rule> {
let f = &self.forest;
let o = sequent[position];
let alone = sequent.len() == 1;
match f.kind(o) {
Kind::Par => Some(Rule::Par),
Kind::Bot => Some(Rule::Bot),
Kind::With => Some(Rule::With),
Kind::Top => Some(Rule::Top),
// The `!` itself is the only formula that is not a `?`.
Kind::Bang => (non_quests == 1).then_some(Rule::Promotion),
Kind::One => alone.then_some(Rule::One),
Kind::Tensor => alone.then_some(Rule::Tensor),
Kind::Atom | Kind::DualAtom => match sequent {
&[x, y] if f.dual_literals(x, y) => Some(Rule::Ax),
_ => None,
},
Kind::Forall => Some(Rule::Forall),
Kind::Plus | Kind::Zero | Kind::Quest | Kind::Exists => None,
}
}
}
#[cfg(all(test, feature = "parse"))]
mod tests {
use super::*;
use crate::linear::fragment::Mode;
use crate::linear::search::generate::{self, IllRules, Rng, Rules};
use crate::linear::search::{self, Verdict};
use crate::linear::{Sequent, ViewOptions};
/// Starts a session of `input`, read in the mode's order.
fn start(input: &str, mode: Mode) -> Interactive {
let sequent = Sequent::parse_ordered(input, mode.order(), &Limits::default())
.unwrap_or_else(|e| panic!("{input:?}: {e}"));
Interactive::new(&sequent, mode).unwrap()
}
/// The rules of the steps a session took, in the arena's order.
fn taken(state: &Interactive) -> Vec<String> {
(state.inferences.iter())
.filter(|i| i.rule.rule != Rule::Open)
.map(|i| i.rule.to_string())
.collect()
}
/// Each invertible rule applies under its condition and only then. A
/// rule that closes the goal goes first, each application is a step
/// that undo takes back, and the reading names the rules.
#[test]
fn the_invertible_rules_under_their_conditions() {
let classical = Mode::CLASSICAL;
for (input, mode, rules) in [
("|- a par ~a", classical, &["⅋", "ax"][..]),
("|- bot, 1", classical, &["⊥", "1"]),
("|- a & b, top", classical, &["⊤"]),
("|- (a par ~a) & 1", classical, &["&", "⅋", "1", "ax"]),
("|- !(a par ~a), ?b", classical, &["!", "⅋"]),
("|- 1 * 1", classical, &["⊗", "1", "1"]),
("|- 1, a", classical, &[]),
("|- !a, b", classical, &[]),
("|- a * b, c", classical, &[]),
("|- a, ~a, b", classical.with_affine(), &[]),
("|- a, ?b", classical, &[]),
("|- a + b, ~a", classical.with_mix(), &[]),
("a * b |- b * a", Mode::INTUITIONISTIC, &["⊗L"]),
("!a |- !(a & a)", Mode::INTUITIONISTIC, &["!R", "&R"]),
("|- a -o (b -o a * b)", Mode::INTUITIONISTIC, &["⊸R", "⊸R"]),
("|- 1 * 1", Mode::INTUITIONISTIC, &["⊗R", "1R", "1R"]),
("b |- (a \\ a) \\ b", Mode::LAMBEK, &["\\R"]),
(
"|- (a \\ a) * (b \\ b)",
Mode::LAMBEK.with_empty_antecedents(),
&["⊗R", "\\R", "\\R", "ax", "ax"],
),
(
"|- (a \\ a) * (b \\ b)",
Mode::CYCLIC,
&["⊗", "⅋", "⅋", "ax", "ax"],
),
("a * b |- a * b", Mode::CYCLIC, &["⅋"]),
] {
let mut state = start(input, mode);
let before = state.derivation().unwrap().to_string();
let inverted = state.invert_all(&Limits::default());
assert_eq!(taken(&state), rules, "{input} in {mode}");
assert_eq!(
(inverted.steps, state.steps(), inverted.finished.clone()),
(rules.len(), rules.len(), Ok(())),
"{input} in {mode}"
);
let mut open = inverted.open.clone();
open.sort_unstable();
assert_eq!(open, state.goals().collect::<Vec<_>>());
assert_eq!(state.invert_all(&Limits::default()).steps, 0);
if state.is_complete() {
state.proof(&Limits::default(), |_| false).unwrap();
}
for _ in 0..rules.len() {
state.undo().unwrap();
}
assert_eq!(state.derivation().unwrap().to_string(), before);
}
let mut state = start("|- a par b", classical);
state
.apply(GoalId::new(0), &Step::new(0, Rule::Par))
.unwrap();
assert_eq!(
state.invert(GoalId::new(0), &Limits::default()),
Err(StepError::NoGoal {
goal: GoalId::new(0)
})
);
}
/// Returns how many connectives, units and literals a sequent's
/// formulas have.
fn weight(forest: &crate::linear::Forest, sequent: &[Member]) -> usize {
let mut todo: Vec<OccId> = sequent.iter().map(|m| m.occ()).collect();
let mut weight = 0;
while let Some(o) = todo.pop() {
weight += 1;
todo.extend(forest.left(o));
todo.extend(forest.right(o));
}
weight
}
/// On generated provable sequents of every mode:
/// - the search proves every goal the invertible rules leave;
/// - every premise is lighter than its conclusion, and at the end no
/// invertible rule is left to apply;
/// - the search closing the rest makes a proof the checker accepts.
#[test]
fn inverting_keeps_every_proof_and_ends() {
let mut cases: Vec<(String, Mode)> = Vec::new();
for (i, rules) in Rules::ALL.into_iter().enumerate() {
let mut rng = Rng::new(3800 + i as u64);
let base = if rules.mix {
Mode::CLASSICAL.with_mix()
} else {
Mode::CLASSICAL
};
for _ in 0..8 {
let budget = 2 + rng.below(10);
let text =
generate::sequent(&generate::provable(&mut rng, rules, 3, budget).formulas);
cases.push((text.clone(), base));
cases.push((text, base.with_affine()));
}
}
for (i, rules) in IllRules::ALL.into_iter().enumerate() {
let mut rng = Rng::new(3900 + i as u64);
for _ in 0..8 {
let budget = 2 + rng.below(10);
let ill = generate::ill(&mut rng, rules, 3, budget);
let text = generate::two_sided(&ill.hypotheses, &ill.goal);
cases.push((text.clone(), Mode::INTUITIONISTIC));
cases.push((text, Mode::INTUITIONISTIC.with_affine()));
}
}
let mut rng = Rng::new(3999);
for k in 0..60 {
let star = k % 2 == 1;
let budget = 2 + rng.below(8);
let (hypotheses, goal) = generate::lambek(&mut rng, 3, budget, star);
let text = generate::lambek_text(&hypotheses, &goal);
let lambek = if star {
Mode::LAMBEK.with_empty_antecedents()
} else {
Mode::LAMBEK
};
cases.push((text.clone(), lambek));
cases.push((text, Mode::CYCLIC));
}
let options = search::Options::default();
let limits = Limits::default();
let (mut proved, mut steps) = (0, 0);
let mut used = std::collections::BTreeMap::<String, usize>::new();
for (text, mode) in cases {
let sequent = Sequent::parse_ordered(&text, mode.order(), &limits).unwrap();
let Ok(outcome) = search::prove(&sequent, mode, &options) else {
continue;
};
if !matches!(outcome.verdict, Verdict::Proved(_)) {
continue;
}
proved += 1;
let mut state = Interactive::new(&sequent, mode).unwrap();
let inverted = state.invert_all(&limits);
assert_eq!(inverted.finished, Ok(()), "{text} in {mode}");
assert_eq!(state.invert_all(&limits).steps, 0, "{text} in {mode}");
steps += inverted.steps;
for inference in state
.inferences
.iter()
.filter(|i| i.rule.rule != Rule::Open)
{
*used
.entry(format!("{mode}: {}", inference.rule))
.or_default() += 1;
let conclusion = weight(&state.forest, &inference.sequent);
for premise in &inference.premises {
let premise = &state.inferences[premise.index()].sequent;
assert!(
weight(&state.forest, premise) < conclusion,
"{text} in {mode}"
);
}
}
for goal in inverted.open {
let members = state.goal(goal).unwrap();
let target = search::Goal::new(state.forest(), members).unwrap();
let verdict = search::prove_goal(target, mode, &options, &limits, |_| false)
.unwrap()
.verdict;
assert!(
matches!(verdict, Verdict::Proved(_)),
"{text} in {mode}: goal {} is {verdict:?}",
goal.get()
);
}
for (goal, closed) in
state.close_all(&options, &ViewOptions::default(), &limits, |_| false)
{
let closed = closed.unwrap();
assert!(
closed.grafted.is_ok(),
"{text} in {mode}: goal {}",
goal.get()
);
}
assert!(state.is_complete(), "{text} in {mode}");
state.proof(&limits, |_| false).unwrap();
}
assert!(
proved >= 500 && steps >= 600,
"{proved} proved, {steps} steps"
);
// Every rule fired in every classical mode, and the multiplicatives
// in every other.
for (mode, rules) in [
("classical", &["⅋", "⊥", "&", "⊤", "!", "1", "⊗", "ax"][..]),
(
"classical with Mix",
&["⅋", "⊥", "&", "⊤", "!", "1", "⊗", "ax"],
),
(
"classical affine",
&["⅋", "⊥", "&", "⊤", "!", "1", "⊗", "ax"],
),
(
"intuitionistic",
&["⊸R", "⊗L", "&R", "⊕L", "1L", "⊤R", "0L", "!R", "1R", "ax"],
),
(
"intuitionistic affine",
&["⊸R", "⊗L", "&R", "⊕L", "1L", "⊤R", "0L", "!R", "1R", "ax"],
),
("Lambek", &["\\R", "/R", "⊗L", "ax"]),
("Lambek with empty antecedents", &["\\R", "/R", "⊗L", "ax"]),
("cyclic", &["⅋", "ax"]),
] {
for rule in rules {
assert!(
used.contains_key(&format!("{mode}: {rule}")),
"{mode}: {rule}"
);
}
}
}
/// A run past the memory bound stops there, its steps ordinary ones
/// that undo takes back, and the same run without the bound ends.
#[test]
fn inverting_stops_at_the_memory_bound() {
let input = "|- a & a, a & a, a & a, a & a, a & a, a & a";
let mut state = start(input, Mode::CLASSICAL);
let bounded = Limits::default().with_memory_bytes(Some(4096));
let inverted = state.invert_all(&bounded);
assert!(
matches!(
inverted.finished,
Err(Refusal::Memory {
limit_bytes: 4096,
needed_bytes: Some(needed),
..
}) if needed > 4096
),
"{inverted:?}"
);
assert!(0 < inverted.steps && inverted.steps < 63, "{inverted:?}");
let mut open = inverted.open.clone();
open.sort_unstable();
assert_eq!(open, state.goals().collect::<Vec<_>>());
while state.undo().is_some() {}
let inverted = state.invert_all(&Limits::default().with_memory_bytes(None));
assert_eq!((inverted.steps, inverted.open.len()), (63, 64));
}
}