#???Underload, 1349 Bytes
Probably another easy oneWhen I first looked at Underload for this challenge I was struggling to crackcome up with a way to suitably obscure it. Parthesis Hell seem like a good red herring, but the example Hello World didn't seem to nest deep enough. Parethetic was the next choice and had a nice set of parenthesis.
I copied the Hello World example for Parthetic, made sure it didn't output Hello, World! and embedded the Underload commands into it, with a lot of chaff that just gets left in the stack.
I thought this would be cracked and was just hoping it lasted longer than it took me to put it together :) Pleasantly surprised that it lasted the distance.
Here's a simplified version of it, with a bit of an explantion. From characters 503 through to 709 in the program.
(((-)((-))^((-))^([))^(((.)((H))^)^((e)((l)(l))^)^(((o))^(,)( )(W)()(o)()()(r)(l)(d)(!))^)^)^(((*)^((*)^)^((*)^)^(*)^)^(((*)^(()^)^)^((*)^((*)^(*)^)^)^(((*)^)^(*)^(*)^(*)^()^(*)^(*)^(*)^(S)^(<)^($)(_))^)^)^
Which essentially simplifies down to the following due to the ^'s. They put the top element of the stack back into the program repeatedly.
(-)(-)(-)([)(.)(H)(e)(l)(l)(o)(,)( )(W)()(o)()()(r)(l)(d)(!)***************S<($)(_)
From there we end up with a stack of
!:d:l:r:::o::W: :,:o:l:l:e:H:.:[:-:-:-:
The *'s concatenate the top element to the second element repeatedly and the S outputs it.
The < causes the program to stop.
The following are left on the stack. Of course the main program leaves a lot more.
.:[:-:-:-:
Tested here quite a bit:)
