Average Error: 0 → 0
Time: 322.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 r152759 = x;
        double r152760 = 16.0;
        double r152761 = r152759 * r152760;
        double r152762 = r152761 * r152759;
        return r152762;
}
↓
double f(double x) {
        double r152763 = x;
        double r152764 = 16.0;
        double r152765 = r152763 * r152764;
        double r152766 = r152765 * r152763;
        return r152766;
}

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 2020047 +o rules:numerics
(FPCore (x)
  :name "Graphics.Rasterific.CubicBezier:isSufficientlyFlat from Rasterific-0.6.1"
  :precision binary64
  (* (* x 16) x))