[Imprint][Data Privacy Statement][E-Mail]

View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 134 from proof refine-gc (previous step)

# ax0 = # referenced-adrs(ax3, ri), # lax = # gndx0, gstore2[n1] = groupblock(gndx0, lax, m0), abs-log(nx0, gstore ↓) = abs-log(nx, gstore2 ↓) + ax0, nodes(gstore ↓, jro) = nodes(gstore2 ↓, jro0)[ax0, nodes(gstore2 ↓, jro0)[referenced-adrs(ax3, ri)]], remove-refsize0(gstore1) = gstore1, elems nx ∩ jro0 = ∅, (nx0.toSet \ nx.toSet) ∩ dom gstore2 = ∅, elems nx0 ∩ jro = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro0, dom gstore1 ∪ elems nx0 = dom gstore ∪ jro, jro1.keys.inodes?, p_os.keys.inodes?, fi1.inos < pmaxino, ri.inos < jmaxino, p_os < pmaxino, jro1 < jmaxino, ri[nodes(gstore2 ↓, jro0)[referenced-adrs(ax3, ri)].keys, ax0].inos < jmaxino0, jro1 < jmaxino0, inv(gstore2 \ jro0), inv(gstore1), inv(groupblock(gndx0, lax, m0)), inv(gstore \ jro), log-cons(abs-log(nx, gstore2 ↓), nodes(gstore2 ↓, jro0)), new(ax0, nodes(gstore2 ↓, jro0)), refsize-cons(gstore, range ri[nodes(gstore2 ↓, jro0)[referenced-adrs(ax3, ri)].keys, ax0]), refsize-cons(gstore1, range fi1), refsize-cons(gstore2, range ri), ri-cons(ri, nodes(gstore2 ↓, jro0)), ri-inj(fi1), ri-inj(ri), ri-inj(ri[nodes(gstore2 ↓, jro0)[referenced-adrs(ax3, ri)].keys, ax0]), n1 ∈ gstore2, n1 ∈ gstore1, pmaxino ≤ jmaxino, jmaxino ≤ jmaxino0, pmaxino ≤ jmaxino0, ri[nodes(gstore2 ↓, jro0)[referenced-adrs(ax3, ri)].keys, ax0].lebs ⊆ dom gstore, ri.lebs ⊆ dom gstore, range ri ⊆ dom nodes(gstore2 ↓, jro0), fi1.lebs ⊆ dom gstore1, ri.lebs ⊆ dom gstore2, dom gstore2 ⊆ dom gstore, ⌊err⌋ , jvalid3 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro0), jvalid5 → jvalid4, jvalid0 ∧ nx0 ≠ [] → valid-journal-head(nx0, gstore, jro), ∃ lax0, lax1. lax = lax0 + lax1 ∧ ax3 = lax0.to-adr(n1) ∧ ax2 = lax1.to-adr(n1) ⊦ ∃ kx, ax. ¬ dups(kx) ∧ ¬ dups(ax) ∧ new(ax, nodes(gstore2 ↓, jro0)) ∧ kx.toSet ⊆ dom ri ∧ # kx = # ax ∧ ax.toSet ∩ abs-log(nx, gstore2 ↓).toSet = ∅ ∧ ⟨fs := nodes(gstore2 ↓, jro0)[ax, nodes(gstore2 ↓, jro0)[ri[kx]]], log := abs-log(nx, gstore2 ↓) + ax; ri0 := ri[kx, ax]; aubifs_core_gc_drop#(ri0, log; fs); jvalid := ?⟩ ( ri[nodes(gstore2 ↓, jro0)[referenced-adrs(ax3, ri)].keys, ax0] = ri0 ∧ log = abs-log(nx0, gstore ↓) ∧ fs = nodes(gstore ↓, jro) ∧ (jvalid → jvalid1)), jmaxino = 0, jmaxino0 = 0, m0 = 0, pmaxino = 0, dups(nx), dups(nx0), dups(ax0), dups(nodes(gstore2 ↓, jro0)[referenced-adrs(ax3, ri)].keys + nodes(gstore2 ↓, jro0)[referenced-adrs(ax2, ri)].keys), dups(nodes(gstore2 ↓, jro0)[referenced-adrs(ax3, ri)].keys), dups(nodes(gstore2 ↓, jro0)[referenced-adrs(ax2, ri)].keys), n1 ∈ nx, n1 ∈ jro0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 135:
# ax0 = # referenced-adrs(lax1.to-adr(n1), ri), # lax1 + # lax0 = # gndx0, gstore2[n1] = groupblock(gndx0, lax1 + lax0, m0), abs-log(nx0, gstore ↓) = abs-log(nx, gstore2 ↓) + ax0, nodes(gstore ↓, jro) = nodes(gstore2 ↓, jro0)[ax0, nodes(gstore2 ↓, jro0)[referenced-adrs(lax1.to-adr(n1), ri)]], remove-refsize0(gstore1) = gstore1, elems nx0 ∩ jro = ∅, (nx0.toSet \ nx.toSet) ∩ dom gstore2 = ∅, elems nx ∩ jro0 = ∅, dom gstore1 ∪ elems nx0 = dom gstore ∪ jro, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro0, jmaxino ≠ 0, jmaxino0 ≠ 0, m0 ≠ 0, pmaxino ≠ 0, p_os.keys.inodes?, jro1.keys.inodes?, jro1 < jmaxino0, ri[nodes(gstore2 ↓, jro0)[referenced-adrs(lax1.to-adr(n1), ri)].keys, ax0].inos < jmaxino0, jro1 < jmaxino, p_os < pmaxino, ri.inos < jmaxino, fi1.inos < pmaxino, inv(gstore \ jro), inv(gstore1), inv(gstore2 \ jro0), inv(groupblock(gndx0, lax1 + lax0, m0)), log-cons(abs-log(nx, gstore2 ↓), nodes(gstore2 ↓, jro0)), new(ax0, nodes(gstore2 ↓, jro0)), refsize-cons(gstore2, range ri), refsize-cons(gstore1, range fi1), refsize-cons(gstore, range ri[nodes(gstore2 ↓, jro0)[referenced-adrs(lax1.to-adr(n1), ri)].keys, ax0]), ri-cons(ri, nodes(gstore2 ↓, jro0)), ri-inj(ri[nodes(gstore2 ↓, jro0)[referenced-adrs(lax1.to-adr(n1), ri)].keys, ax0]), ri-inj(ri), ri-inj(fi1), n1 ∈ gstore1, n1 ∈ gstore2, pmaxino ≤ jmaxino0, jmaxino ≤ jmaxino0, pmaxino ≤ jmaxino, dom gstore2 ⊆ dom gstore, ri.lebs ⊆ dom gstore2, fi1.lebs ⊆ dom gstore1, range ri ⊆ dom nodes(gstore2 ↓, jro0), ri.lebs ⊆ dom gstore, ri[nodes(gstore2 ↓, jro0)[referenced-adrs(lax1.to-adr(n1), ri)].keys, ax0].lebs ⊆ dom gstore, ⌊err⌋ , ¬ dups(nodes(gstore2 ↓, jro0)[referenced-adrs(lax1.to-adr(n1), ri)].keys + nodes(gstore2 ↓, jro0)[referenced-adrs(lax0.to-adr(n1), ri)].keys), ¬ dups(ax0), ¬ dups(nx0), ¬ dups(nx), ¬ dups(nodes(gstore2 ↓, jro0)[referenced-adrs(lax1.to-adr(n1), ri)].keys), ¬ dups(nodes(gstore2 ↓, jro0)[referenced-adrs(lax0.to-adr(n1), ri)].keys), ¬ n1 ∈ jro0, ¬ n1 ∈ nx, jvalid0 ∧ nx0 ≠ [] → valid-journal-head(nx0, gstore, jro), jvalid5 → jvalid4, jvalid3 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro0) ⊦ ∃ kx, ax. ¬ dups(kx) ∧ ¬ dups(ax) ∧ new(ax, nodes(gstore2 ↓, jro0)) ∧ kx.toSet ⊆ dom ri ∧ # kx = # ax ∧ ax.toSet ∩ abs-log(nx, gstore2 ↓).toSet = ∅ ∧ ⟨fs := nodes(gstore2 ↓, jro0)[ax, nodes(gstore2 ↓, jro0)[ri[kx]]], log := abs-log(nx, gstore2 ↓) + ax; ri0 := ri[kx, ax]; aubifs_core_gc_drop#(ri0, log; fs); jvalid := ?⟩ ( ri[nodes(gstore2 ↓, jro0)[referenced-adrs(lax1.to-adr(n1), ri)].keys, ax0] = ri0 ∧ log = abs-log(nx0, gstore ↓) ∧ fs = nodes(gstore ↓, jro) ∧ (jvalid → jvalid1))

Rule argument

Additional information

Used simplifier rules: a: ⊦ (kx + kx0) + kx1 = kx + kx0 + kx1; from specification list[key-list-set]%a: ⊦ ¬ dups(kx + kx0) → ¬ dups(kx) ∧ ¬ dups(kx0); (forward) from specification list-dup[key-list-set]%fwd-inv-gblock-rem: ⊦ inv(gstore \ ginval) ∧ n ∈ gstore ∧ ¬ n ∈ ginval ∧ gstore[n] = gblock → inv(gblock); (forward) from specification apersistence-base%a: ⊦ (lax + lax0) + lax1 = lax + lax0 + lax1; from specification list[laddress-list]% ⊦ #(lax + lax0) = # lax + # lax0; (s)