Average Error: 0.0 → 0.0
Time: 301.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r175814 = x;
        double r175815 = r175814 * r175814;
        double r175816 = 1.0;
        double r175817 = r175815 + r175816;
        return r175817;
}
↓
double f(double x) {
        double r175818 = x;
        double r175819 = r175818 * r175818;
        double r175820 = 1.0;
        double r175821 = r175819 + r175820;
        return r175821;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x \cdot x + 1\]

  2. Final simplification0.0

    \[\leadsto x \cdot x + 1\]

Reproduce

herbie shell --seed 2020062 +o rules:numerics
(FPCore (x)
  :name "Graphics.Rasterific.Shading:$sradialGradientWithFocusShader from Rasterific-0.6.1, A"
  :precision binary64
  (+ (* x x) 1))