Average Error: 0.0 → 0.0
Time: 3.9s
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r109240 = x;
        double r109241 = r109240 * r109240;
        double r109242 = 1.0;
        double r109243 = r109241 + r109242;
        return r109243;
}
↓
double f(double x) {
        double r109244 = x;
        double r109245 = r109244 * r109244;
        double r109246 = 1.0;
        double r109247 = r109245 + r109246;
        return r109247;
}

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