| err0 = ESUCCESS, remove-refsize0(gstore1) = gstore1, elems nx ∩ jro = ∅, dom remove-refsize0(gstore2) ∩ jro = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro, fi2.inos < pmaxino, fi1.inos < jmaxino, p_os < pmaxino, jro2 < jmaxino, inv(gstore1), inv(gstore2 \ jro), refsize-cons(gstore1, range fi2), refsize-cons(gstore2, range fi1), ri-inj(fi2), ri-inj(fi1), pmaxino ≤ jmaxino, fi1.lebs ⊆ dom remove-refsize0(gstore2), fi2.lebs ⊆ dom gstore1, fi1.lebs ⊆ dom gstore2, jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪jro := ?⟫ ( jro2 < jmaxino ∧ jmaxino ≤ jmaxino ∧ fi1.inos < jmaxino ∧ jmaxino ≠ 0 ∧ (jvalid1 ∧ [] ≠ [] → valid-journal-head([], remove-refsize0(gstore2), ∅)) ∧ fi1.lebs ⊆ dom remove-refsize0(gstore2) ∧ fi1.lebs ⊆ dom remove-refsize0(gstore2) ∧ refsize-cons(remove-refsize0(gstore2), range fi1) ∧ refsize-cons(remove-refsize0(gstore2), range fi1) ∧ inv(remove-refsize0(gstore2) \ ∅) ∧ inv(remove-refsize0(gstore2)) ∧ elems [] ∩ ∅ = ∅ ∧ ¬ dups([]) ∧ dom remove-refsize0(gstore2) ∪ elems [] = dom remove-refsize0(gstore2) ∪ ∅ ∧ remove-refsize0(remove-refsize0(gstore2)) = remove-refsize0(gstore2) ∧ ri-inj(fi1)), jmaxino = 0, pmaxino = 0, dups(nx) |
Used simplifier rules: ⊦ ¬ ⌊ESUCCESS⌋ ; (s)% ⊦ ns < n ∧ n ≤ m → (ns < m ↔ true); (ss)% ⊦ m ≤ m; (s)%⊦ refsize-cons(gstore, as) → refsize-cons(remove-refsize0(gstore), as); (ss)% ⊦ gstore \ ∅ = gstore; (s)%int-a: ⊦ (ns ∩ ns0) ∩ ns1 = ns ∩ ns0 ∩ ns1; from specification set-union[nat-set]%int-c: ⊦ ns ∩ ns0 = ns0 ∩ ns; from specification set-union[nat-set]%⊦ inv(gstore \ ns) ∧ dom remove-refsize0(gstore) ∩ ns = ∅ → inv(remove-refsize0(gstore)); (ss)% ⊦ elems [] = ∅; (s)% ⊦ ns ∩ ∅ = ∅; (s)% ⊦ ¬ dups([]); (s)% ⊦ ns ∪ ∅ = ns; (s)%una: ⊦ (ns ∪ ns0) ∪ ns1 = ns ∪ ns0 ∪ ns1; from specification set-union[nat-set]%unc: ⊦ ns ∪ ns0 = ns0 ∪ ns; from specification set-union[nat-set]% ⊦ remove-refsize0(remove-refsize0(gstore)) = remove-refsize0(gstore); (s)