Average Error: 0.2 → 0.2
Time: 3.4s
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 r216023 = x;
        double r216024 = y;
        double r216025 = r216023 * r216024;
        double r216026 = r216025 * r216024;
        return r216026;
}
↓
double f(double x, double y) {
        double r216027 = x;
        double r216028 = y;
        double r216029 = r216027 * r216028;
        double r216030 = r216029 * r216028;
        return r216030;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.2

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

  2. Final simplification0.2

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

Reproduce

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