Rounding a number up to the nearest multiple of a power of 2
Function interface

First of all, it is good that you used a function to contain the code solving the problem!

However, there are some shortcomings:


It is very confusing that the function parameter representing \$n\$ from the problem description is named x, and the one representing \$x\$ is named y. 
The function is badly named, as it doesn't multiply the two arguments. A better name would be smallest_multiple or similar.
The function lacks a docstring which describes what it does. It is therefore hard to check if it is implemented correctly. The first sentence of the problem description would make a good docstring (replacing "print out" with "return").


Bug

The function returns the wrong result if both arguments are the same, for example:

&gt;&gt;&gt; multiply(8, 8)
16


But the smallest multiple of 8 which is greater than or equal to 8 should be 8, not 16.

(Maybe you thought that 8 is not considered a multiple of 8?)

The bug is fixed by removing the res != x condition.

Loop exit condition

Let's ignore everything that doesn't affect the max_multiple_try variable:

max_multiple_try = 0
while max_multiple_try != float("inf"):
    …
    if …:
        …
    else:
        max_multiple_try += 1


We can see that it is always an integer (which has unlimited size in Python). Therefore it can never be equal to the special float('inf') value, and the loop could as well have been written using while True: ….

However, as max_multiple_try simply counts the loop iterations, this pattern would be better written as a for loop using itertools.count (and using a simpler and more descriptive name):

from itertools import count
…
for factor in count():  # factor = 0, 1, 2, …
    res = x * factor
    if res &gt;= y:
        return res


Top-level code

Congratulations on using if __name__ == '__main__' and using with to open a file!

Here are some improvements:


Iterate directly over data instead of using readlines.
Use tuple assignment:

x, n = line.rstrip().split(",")
print(multiply(int(n), int(x)))



Alternative algorithm

The problem states that the value of \$n\$ is constrained to powers of two. While your solution actually solves the more general problem for any value of \$n\$, this description probably aims for a different algorithm which makes use of the constraint.

Hint: What does the binary representation of powers of two look like? How could you solve the problem if \$n\$ were constrained to powers of ten?