An old challenge

[Zaevod]

This is a challenge I posted in some places before. There are infinite solutions, but they aren't really trivial.

You are in a locked chamber with 3 identical doors. You have a single key, which is disintegrated immediately after you unlock any of the three doors. The doors are indestructible, and it's impossible to figure out what's behind them without opening them first or asking a magical computer.

One door leads to an awesome place, while the other 2 lead to an incredibly boring place.

In this chamber, there is also a magical computer which possesses all the information that can be obtained about existence. It has a few peculiarities:

1- When you input an answerable statement, it only answers with either "true" or "false";

2- It only has enough energy left for one answer;

3- It has a bug that causes the answers to be inverted (true becomes false, and vice-versa) 50% of the time. It can also predict exactly when this bug will occur, but can't avoid it. The bug inverts only the final answers, without affecting the values used to calculate the answers.

4 (EDIT)- The computer cannot receive orders to give answers in specific situations (the input has to be a statement, not an order or a question). Statements MUST include actual things (concepts, objects) with verifiable values, but these things cannot be hypothetical things with values directly attributed by the person, they must depend on the thing itself.

5- You can attribute labels and concepts to each door and use these labels in your final statement, but you must specify which label refers to which door (e.g. 'labeling the left, center and right doors with x,y and z, respectively, statement about x, y and z and the doors they represent.');

6- The computer is very smart and can understand any statement exactly as you intend it to (but you need to have an actually meaningful statement that you can understand). This just means that words will be interpreted in the correct context and language;

7- The computer cannot be hacked through any means.

How can you figure out the door that takes you to the good place, with 100% certainty?

I have a possible solution I'll post if nobody finds an answer.

Edit: someone already found a solution here: http://www.flashflashrevolution.com/...1&postcount=55