Average Error: 0.2 → 0.2
Time: 2.8s
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 r216014 = x;
        double r216015 = y;
        double r216016 = r216014 * r216015;
        double r216017 = r216016 * r216015;
        return r216017;
}
↓
double f(double x, double y) {
        double r216018 = x;
        double r216019 = y;
        double r216020 = r216018 * r216019;
        double r216021 = r216020 * r216019;
        return r216021;
}

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