[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 78 from proof acyclic-rem-not-reachable (previous step)

ce.nxt = H[H[r0].nxt].nxt, path(ce.nxt ' + x2 + r0 ', H), H[r0].nxt ∈ H, r0 ∈ H, path(r ' + x1 + H[r0].nxt ', H), path(r ' + x1 + H[r0].nxt ' + (ce.nxt ' + x2) + r0 ', H), ∀ r1. ¬ reachable(H[r1].nxt, r1, H) ⊦ H[r0].nxt = null, r = H[r0].nxt, r0 = r, r0 = H[r0].nxt, r = ce.nxt, r0 = ce.nxt, H[r0].nxt = ce.nxt, r0 ∈ x1, r ∈ x1, H[r0].nxt ∈ x1, r ∈ x2, r0 ∈ x2, H[r0].nxt ∈ x2, ce.nxt ∈ x1, ce.nxt ∈ x2, dups(x1 + x2), dups(x1), dups(x2), ∃ x. path(ce.nxt ' + x, H) ∧ (ce.nxt ' + x).last = H[r0].nxt

User applied rule exists right

And obtained the following new goals

Proof step 79:
ce.nxt = H[H[r0].nxt].nxt, path(ce.nxt ' + x2 + r0 ', H), H[r0].nxt ∈ H, r0 ∈ H, path(r ' + x1 + H[r0].nxt ', H), path(r ' + x1 + H[r0].nxt ' + (ce.nxt ' + x2) + r0 ', H), ∀ r1. ¬ reachable(H[r1].nxt, r1, H) ⊦ H[r0].nxt = null, r = H[r0].nxt, r0 = r, r0 = H[r0].nxt, r = ce.nxt, r0 = ce.nxt, H[r0].nxt = ce.nxt, r0 ∈ x1, r ∈ x1, H[r0].nxt ∈ x1, r ∈ x2, r0 ∈ x2, H[r0].nxt ∈ x2, ce.nxt ∈ x1, ce.nxt ∈ x2, dups(x1 + x2), dups(x1), dups(x2), path(ce.nxt ' + x2 + (r0 ' + H[r0].nxt), H) ∧ (ce.nxt ' + x2 + (r0 ' + H[r0].nxt)).last = H[r0].nxt

Rule argument

pos: right 19 terms: x2 + (r0 ' + H[r0].nxt) abort: F discard: T computed: F

Additional information

Used terms: x2 + (r0 ' + H[r0].nxt)