┌─┐ ┌─┐ ┌─────┐ ┌─┐ ┌─┐ ┌───┐ A ──┘ └─┘ └─┘ └─┘ └─┘ └─┘ └── ┌───┐ ┌───┐ ┌─┐ ┌─────┐ ┌─┐ ┌─┐ B ┘ └─┘ └─┘ └─┘ └───┘ └─┘ └ ┌─────┐ ┌─┐ ┌─┐ ┌───┐ X ──┘ └───┘ └───┘ └───┘ └────
Your goal is to reproduce it exactly as depicted.
You can either print it or return a multiline string;
Arbitrary number of traling and/or leading newlines are allowed;
Trailing (but not leading !) whitespace is allowed;
If you can not use the extended ASCII box-drawing characters, you may substitute them for the unicode equivalents (at no byte penalty).
This is code-golf so the shortest answer in bytes wins.
For your convenience, binary representation of the diagram above is as follows:
INP A=0101011101010110 INP B=1101101011100101 ___ X=A⊕B=0111001001001100
While working on this question, I've implemented two different bash solutions for it, one is 122 characters/bytes long (as depicted above), and another one is exactly 100 bytes long.
I do not have plans to post them (as I don't normally post answers to my own questions), so that is just for reference.
I also believe that at least some sub-100 byte solutions are possible.