Average Error: 0 → 0
Time: 310.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 r163686 = x;
        double r163687 = 16.0;
        double r163688 = r163686 * r163687;
        double r163689 = r163688 * r163686;
        return r163689;
}
↓
double f(double x) {
        double r163690 = x;
        double r163691 = 16.0;
        double r163692 = r163690 * r163691;
        double r163693 = r163692 * r163690;
        return r163693;
}

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