Average Error: 0 → 0
Time: 511.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 r124860 = x;
        double r124861 = 16.0;
        double r124862 = r124860 * r124861;
        double r124863 = r124862 * r124860;
        return r124863;
}
↓
double f(double x) {
        double r124864 = x;
        double r124865 = 16.0;
        double r124866 = r124864 * r124865;
        double r124867 = r124866 * r124864;
        return r124867;
}

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