Hi,
with the .mod and .dat you sent me, the script I gave you works fine:
execute {
writeln();
writeln();
var expanded = ct6[1][4][2]._expandable.expand;
for (var i = 0; i < expanded.length; i++) {
writeln("-> " + expanded[i].print);
}
}
gives
-> u[<1,4>][2] != 0 => (x[<1,4>][2] == 1)+((0 == 1+1)+(0 == 1+1)+(0 == 1+1)+(0 == 1+1)+(0 == 1+1)+(0 == 1+1)+(0 == 1+1)+(0 == 1+1)+(0 == 1+1)+(0 == 1+1)+(0 == 1+1)+(0 == 1+1)+(0 == 1+1)+(0 == 1+1)+(0 == 1+1)+(0 == 1+1)+(0 == 1+1)+(0 == 1+1)+(0 == 1+1)+(0 == 1+1)+(0 == 1+1)+(0 == 1+1)+(0 == 1+1)+(0 == 1+1)+(0 == 2+1)+(0 == 2+1)+(0 == 2+1)+(0 == 2+1)+(0 == 2+1)+(0 == 2+1)+(0 == 2+1)+(0 == 2+1)+(0 == 2+1)+(0 == 2+1)+(0 == 2+1)+(0 == 2+1)+(0 == 2+1)+(0 == 2+1)+(0 == 2+1)+(0 == 2+1)+(0 == 2+1)+(0 == 2+1)+(0 == 2+1)+(0 == 2+1)+(0 == 2+1)+(0 == 2+1)+(0 == 2+1)+(0 == 2+1)+(0 == 3+1)+(0 == 3+1)+(0 == 3+1)+(0 == 3+1)+(0 == 3+1)+(0 == 3+1)+(0 == 3+1)+(0 == 3+1)+(0 == 3+1)+(0 == 3+1)+(0 == 3+1)+(0 == 3+1)+(0 == 3+1)+(0 == 3+1)+(0 == 3+1)+(0 == 3+1)+(0 == 3+1)+(0 == 3+1)+(0 == 3+1)+(0 == 3+1)+(0 == 3+1)+(0 == 3+1)+(0 == 3+1)+(0 == 3+1)+(0 == 4+1)+(0 == 4+1)+(0 == 4+1)+(0 == 4+1)+(0 == 4+1)+(0 == 4+1)+(0 == 4+1)+(0 == 4+1)+(0 == 4+1)+(0 == 4+1)+(0 == 4+1)+(0 == 4+1)+(0 == 4+1)+(0 == 4+1)+(0 == 4+1)+(0 == 4+1)+(0 == 4+1)+(0 == 4+1)+(0 == 4+1)+(0 == 4+1)+(0 == 4+1)+(0 == 4+1)+(0 == 4+1)+(0 == 4+1)) == 1
And you can also see this when you put your mouse in the problem browser
regards
#DecisionOptimization#OPLusingCPLEXOptimizer