Complicated Logic Proof involving Tautology and Law of Excluded Middle I'm having great difficulty solving the following problem, and even figuring out where to start with the proof.
$$
\neg A\lor\neg(\neg B\land(\neg A\lor B))
$$
Please see the following examples of how to do proofs, I would appreciate it if you could attempt to give me guidance using the tools and the line numbers that it cites similar to those below:
This is a sample proof:

This is another sample proof (law of excluded middles):


Here is a proof using a Fitch-style proof checker. 

Assume the negation of what one is trying to prove on line 1 to attempt to derive a contradiction.
From lines 2 to 9, use De Morgan rule (DeM), conjunction elimination (∧E), double negative elimination (DNE) and disjunctive syllogism (DS) to simplify so one can arrive at two lines, 4 and 9, which are contradictory. That contradiction allows one to derive the goal on line 11 using indirect proof (IP).
Links to the proof checker and associated text are below.

Kevin Klement's JavaScript/PHP Fitch-style natural deduction proof editor and checker http://proofs.openlogicproject.org/
P. D. Magnus, Tim Button with additions by J. Robert Loftis remixed and revised by Aaron Thomas-Bolduc, Richard Zach, forallx Calgary Remix: An Introduction to Formal Logic, Fall 2019. http://forallx.openlogicproject.org/forallxyyc.pdf
