Average Error: 0.0 → 0.0
Time: 7.2s
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r174909 = x;
        double r174910 = r174909 * r174909;
        double r174911 = 1.0;
        double r174912 = r174910 + r174911;
        return r174912;
}
↓
double f(double x) {
        double r174913 = x;
        double r174914 = r174913 * r174913;
        double r174915 = 1.0;
        double r174916 = r174914 + r174915;
        return r174916;
}

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 2019303 
(FPCore (x)
  :name "Graphics.Rasterific.Shading:$sradialGradientWithFocusShader from Rasterific-0.6.1, A"
  :precision binary64
  (+ (* x x) 1))