Average Error: 0.2 → 0.2

Time: 3.1s

Precision: 64

\[\left(x \cdot y\right) \cdot y\]

↓

\[\left(x \cdot y\right) \cdot y\]

\left(x \cdot y\right) \cdot y

↓

\left(x \cdot y\right) \cdot y

double f(double x, double y) {
        double r226795 = x;
        double r226796 = y;
        double r226797 = r226795 * r226796;
        double r226798 = r226797 * r226796;
        return r226798;
}

↓

double f(double x, double y) {
        double r226799 = x;
        double r226800 = y;
        double r226801 = r226799 * r226800;
        double r226802 = r226801 * r226800;
        return r226802;
}

Error

The X axis uses an exponential scale — Bits error versus `x`

Try it out

In
Out

Enter valid numbers for all inputs

Derivation

Initial program 0.2
\[\left(x \cdot y\right) \cdot y\]
Final simplification0.2
\[\leadsto \left(x \cdot y\right) \cdot y\]

Reproduce

herbie shell --seed 2020001 +o rules:numerics
(FPCore (x y)
  :name "Data.HyperLogLog.Config:hll from hyperloglog-0.3.4"
  :precision binary64
  (* (* x y) y))