The House of Santa Claus
Note: This is the first challenge that I have attempted to set. It has been through the Sandbox however if you find something wrong with it please do not just downvote but leave a comment so that I can improve it.
There is a old childrens puzzle where the challenge is to draw a box with a roof and a cross through the middle without lifting your pen from the paper or going over any line twice.
In Germany it is known as "das Haus des Nikolaus" or "The House of Santa Claus". I honestly can't remember what we used to call it. For anyone who is not familiar with the puzzle, full details are available here.
Here is an ASCII art representation of the house.
/\ /__\ |\/| |/\| ----
Write a program or function to draw the House of Santa Claus in any language of your choice.
Sounds too easy? Well here's the catch. It must also output each stage of the drawing and comply with the rules of the puzzle. Your program is not required to take any input. The finished house must look exactly as shown above.
According to the site above there are 44 possible solutions. You may use any one of them. This is an ASCII art challenge so you are not required to calculate the solution but only to draw it.
An example of the required output from one of the 44 solutions is shown below:
---- \ \ ---- __ \ \ ---- \ __\ \ \ ---- /\ /__\ \ \ ---- /\ /__\ |\ | \ ---- /\ /__\ |\/ |/\ ---- /\ /__\ |\/| |/\| ----
- I have added 1 extra newline between each expected output to try to make the requirements clearer. This is optional. Any number of blank lines between each output is allowed.
- Your output must consist only of the characters /,\,-,_, and space as shown above. Trailing spaces are allowed.
- Each line in your drawing must continue from the end of the previous line and you may not repeat any line.
- Standard loopholes prohibited.
- You are not required to output the rhyme mentioned in the above link.
- This is code golf so the shortest answer in bytes will be the winner.
Some great answers and thanks and respect to all who posted. I did say lowest byte count but I have marked as top answer not just for that but also for the great explanation of the code. Nice one @Dennis.