Why is this answer wrong [0 6 1 2] for the given example?


#1

The qn states:
A[A1] + A[B1] = A[C1] + A[D1]
A1 < B1, C1 < D1
A1 < C1, B1 != D1, B1 != C1
and in this case [0 6 1 2] – 0<6, 0<1, 1<2, 6!=1, 6!=2
There is no condition stating B1<C1


#2

I think it’s because of the lexicographically ordered clause, also I think we are not using the right algorithm because if we where we would have the right ordering right away.

P.S. I have the same problem