Average Error: 0.2 → 0.2
Time: 3.6s
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 r286109 = x;
        double r286110 = y;
        double r286111 = r286109 * r286110;
        double r286112 = r286111 * r286110;
        return r286112;
}
↓
double f(double x, double y) {
        double r286113 = x;
        double r286114 = y;
        double r286115 = r286113 * r286114;
        double r286116 = r286115 * r286114;
        return r286116;
}

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