Question: The satisfiability problem determines whether or not a formula can be evaluated to true or not. In this assignment, you will write a program that performs this process.

P.S. If you use resolution you will be given bonus points but you can also use a brute-force solution.

Input:
The input will begin with a number, N, denoting the number of test cases that follow. This is followed by a blank line.

Each test case begins with a number, M, telling you how many variables are used for the test case. A number of clauses follow this number. A negative number represents the complement of that variable Numbers on the same line are ORed together and each line is ANDed together. For example:

1 -2 3
2 -1 -3
-1 -2 -3

translates to:

(1 OR not 2 OR 3) AND (2 OR not 1 OR not 3) AND (not 1 OR not 2 OR not 3)

Output:

You will output the correct variables that make the expression evaluate to true. If no solution is possible print out   Edit