c This is a test input for the MAX-CSP solver c What is the maximum number of constraints that can be satisfied? c give a proof of your claim. c The first relation is or(a b) c the second relation is or(!a !b) c The rank is 2 p 6 9 14 : 1 2 0 14 : 3 4 0 14 : 5 6 0 7 : 1 3 0 7 : 1 5 0 7 : 3 5 0 7 : 2 4 0 7 : 2 6 0 7 : 4 6 0