Jaap already gave the answer, here is a complement.
Indeed, the problem is ...
... solvable.
If my small program is correct, the smallest possible sizes are:
(4, 4, 5), (4, 5, 6), (2, 5, 8), (2, 5, 12), ...
plus those you get trivially by extending it with 2x2x2 cubes. Jaap nailed the smallest.
You might have fun solving the (2, 5, 8) and (2, 5, 12) cases. Solution in the next spoiler block.
The following picture represents the two superposed layers of the 2x5x8 case.
The delimited shapes can easily be filled with tetracubes.
Next is the 2x5x12 case showing how it extends but non-trivially:
And a followup when 2x2x2 cuboids are forbidden.
Incidentally this constraint removes the triviality of the all-even cases. So these cases become intersting again.
Here are the number of possibilities I found for sizes up to 200 cubes.
(4, 4, 5): 8 solutions
(4, 4, 6): 8 solutions
(4, 5, 6): 80 solutions
(4, 6, 6): 136 solutions
(4, 4, 7): 24 solutions
(4, 6, 7): 640 solutions
(4, 4, 8): 48 solutions
(2, 5, 8): 8 solutions
(2, 6, 8): 32 solutions
(2, 7, 8): 8 solutions
(2, 8, 8): 224 solutions
It seems the 4x4x5 case has a unique solution up to symmetry.
The 2x5x8 case has 2 related solutions. They can be found
easily by deduction.
The no-2x2x2-cuboid solution for the 2x5x8 problem is given by the following image. Just fill the paths with tetracubes.
And the solution to the 4x4x5 one is below:
A A N N A M M N C H M L B H H I B B I I
A P P N C P M O C C L L D H G L B G G I
R P S O Q Q O O E Q K T D D K K D F G J
R R S S R Q S T E E T T E F K J F F J J