Update: with 1.12.0beta2, the current performance using OMEdit is
| n | Time backend (s) | Memory matching and sorting (MB) | Memory total(MB) | 
|---|
| 1000 | 1.4 | 97 | 400 | 
| 2000 | 3.1 | 376 | 650 | 
| 3000 | 5.7 | 819 | 850 | 
| 4000 | 10.4 | 1451 | 2250 | 
Matching and sorting takes the lion's share of memory allocation. Above n = 4000 the memory consumption blows up and the PC just hangs.
Good news: scaling in terms of time is now definitely better than O(N3.5), and it is possible to get up to n = 4000
Bad news: the memory allocation by the matching and sorting algorithm grows as O(N2) and is really huge. Why should over 1GB be spent to analyze a system with 4000 equations?