PUBS: A Practical Upper Bounds Solver
```
*************************Result (Not yet completed)***********************************
The number of ticks consumed by split is at most:
n + 1.0
where
n is the length of the input

The number of ticks consumed by transpose is at most:
3.0*n*m + 2.0
where
n is the length of the input
m is the length of the elements of the input

The number of ticks consumed by mult is at most:
n + 1.0
where
n is the length of the first component of the input

The number of ticks consumed by mkBase is at most:
n + 1.0
where
n is the length of the input

The number of ticks consumed by makeBase is at most:
n*m + 2.0
where
n is the length of the input
m is the length of the elements of the input

The number of ticks consumed by lineMult is at most:
m*n + 2.0*m + 1.0
where
n is the length of the first component of the input
m is the length of the second component of the input
x is the length of the elements of the second component of the input

The number of ticks consumed by attach is at most:
n + 1.0
where
n is the length of the first component of the input
m is the length of the second component of the input
x is the length of the elements of the second component of the input

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
The number of ticks consumed by transAcc is at most:
n*m + 2.0*n + 1.0
where
n is the length of the first component of the input
m is the length of the elements of the first component of the input
x is the length of the second component of the input
y is the length of the elements of the second component of the input

The number of ticks consumed by transpose' is at most:
2.0*n*m + 2.0*n + 3.0
where
n is the length of the input
m is the length of the elements of the input

```