@@ -1408,39 +1408,12 @@ namespace lp {
1408
1408
sorted_changed_terms.push_back (j);
1409
1409
}
1410
1410
1411
- bool sort_by_weight = true ;
1412
- if (sort_by_weight)
1413
- // Sort by term_weight descending
1414
- std::sort (sorted_changed_terms.begin (), sorted_changed_terms.end (),
1415
- [this ](unsigned j1 , unsigned j2) {
1416
- return term_weight (lra.get_term (j1 )) > term_weight (lra.get_term (j2) );
1417
- });
1418
- else {
1419
- std::sort (sorted_changed_terms.begin (), sorted_changed_terms.end (),
1420
- [this ](unsigned j1 , unsigned j2) {
1421
- // First check if both columns are boxed
1422
- bool j1_is_boxed = lia.is_boxed (j1 );
1423
- bool j2_is_boxed = lia.is_boxed (j2);
1424
-
1425
- // If one is boxed and the other isn't, prefer the boxed one
1426
- if (j1_is_boxed && !j2_is_boxed)
1427
- return true ;
1428
- if (!j1_is_boxed && j2_is_boxed)
1429
- return false ;
1430
-
1431
- // If both are boxed, compare spans (prefer smaller spans)
1432
- if (j1_is_boxed && j2_is_boxed) {
1433
- mpq span1 = lra.bound_span_x (j1 );
1434
- mpq span2 = lra.bound_span_x (j2);
1435
- if (span1 != span2)
1436
- return span1 < span2;
1437
- }
1411
+ // Sort by term_weight descending
1412
+ std::sort (sorted_changed_terms.begin (), sorted_changed_terms.end (),
1413
+ [this ](unsigned j1 , unsigned j2) {
1414
+ return term_weight (lra.get_term (j1 )) > term_weight (lra.get_term (j2) );
1415
+ });
1438
1416
1439
- // Fall back to weight comparison
1440
- return term_weight (lra.get_term (j1 )) > term_weight (lra.get_term (j2));
1441
- });
1442
- }
1443
-
1444
1417
lia_move r = lia_move::undef;
1445
1418
// Process sorted terms
1446
1419
TRACE (" dio" ,
0 commit comments