From the examples i was able to arrive at this code. What is missing is the step ??? from computing the inequalities to populating the inequalities section of the polytop. So how is this step done correctly?

Code: Select all

```
$p = new Polytope(POINTS=>[[1,-1,-1],[1,1,-1],[1,-1,1],[1,1,1],[1,0,0]]);
???? (print $p->FACETS; - this does not populate the inequalities section)
$A = new Matrix<Integer>($p->INEQUALITIES->minor(All, ~[0]));
print totally_unimodular($A);
```