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 r219863 = x;
        double r219864 = y;
        double r219865 = r219863 * r219864;
        double r219866 = r219865 * r219864;
        return r219866;
}

↓

double f(double x, double y) {
        double r219867 = x;
        double r219868 = y;
        double r219869 = r219867 * r219868;
        double r219870 = r219869 * r219868;
        return r219870;
}

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 2020047 +o rules:numerics
(FPCore (x y)
  :name "Data.HyperLogLog.Config:hll from hyperloglog-0.3.4"
  :precision binary64
  (* (* x y) y))