Average Error: 0 → 0
Time: 657.0ms
Precision: 64
\[\left(x \cdot 16\right) \cdot x\]
↓
\[\left(x \cdot 16\right) \cdot x\]
\left(x \cdot 16\right) \cdot x
↓
\left(x \cdot 16\right) \cdot x
double f(double x) {
        double r120977 = x;
        double r120978 = 16.0;
        double r120979 = r120977 * r120978;
        double r120980 = r120979 * r120977;
        return r120980;
}
↓
double f(double x) {
        double r120981 = x;
        double r120982 = 16.0;
        double r120983 = r120981 * r120982;
        double r120984 = r120983 * r120981;
        return r120984;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0

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

  2. Final simplification0

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

Reproduce

herbie shell --seed 2019326 +o rules:numerics
(FPCore (x)
  :name "Graphics.Rasterific.CubicBezier:isSufficientlyFlat from Rasterific-0.6.1"
  :precision binary64
  (* (* x 16) x))