-- Mar 8 In-Class Exercise
m = 6 and n = 3
Generating Formula,
C = (a, b, c),(a, b, c),(a, b, c),(a, b, c),(a, b, c),(a, b, c)
C = (a, -c, a),(-c, a, -b), (-a, -c, -b),(-b, c, -c), (-b, a, b), (-b, -c, b)
C = {a, -c},{-c, a, -b},{-a, -c, -b},{T}, {T}, {T}
Assignments,
F[0] = {a, -c},{-c, a, -b},{-a, -c, -b},{T}, {T}, {T}
F[1] = {1, -c},{-c, 1, -b},{0, -c, -b},{T}, {T}, {T}
F[2] = {1, 0},{0, 1, -b},{0, 0, -b},{T}, {T}, {T}
F[3] = {1, 0},{0, 1, 1},{0, 0, 1},{T}, {T}, {T}
This formula is satisfiable since all clauses has atleast one value as 1.
m = 6 and n = 3
Generating Formula,
C = (a, b, c),(a, b, c),(a, b, c),(a, b, c),(a, b, c),(a, b, c)
C = (a, -c, a),(-c, a, -b), (-a, -c, -b),(-b, c, -c), (-b, a, b), (-b, -c, b)
C = {a, -c},{-c, a, -b},{-a, -c, -b},{T}, {T}, {T}
Assignments,
F[0] = {a, -c},{-c, a, -b},{-a, -c, -b},{T}, {T}, {T}
F[1] = {1, -c},{-c, 1, -b},{0, -c, -b},{T}, {T}, {T}
F[2] = {1, 0},{0, 1, -b},{0, 0, -b},{T}, {T}, {T}
F[3] = {1, 0},{0, 1, 1},{0, 0, 1},{T}, {T}, {T}
This formula is satisfiable since all clauses has atleast one value as 1.