Average Error: 0.0 → 0.0
Time: 906.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r210396 = x;
        double r210397 = r210396 * r210396;
        double r210398 = 1.0;
        double r210399 = r210397 + r210398;
        return r210399;
}
↓
double f(double x) {
        double r210400 = x;
        double r210401 = r210400 * r210400;
        double r210402 = 1.0;
        double r210403 = r210401 + r210402;
        return r210403;
}

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