Average Error: 0.0 → 0.0
Time: 321.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r190410 = x;
        double r190411 = r190410 * r190410;
        double r190412 = 1.0;
        double r190413 = r190411 + r190412;
        return r190413;
}
↓
double f(double x) {
        double r190414 = x;
        double r190415 = r190414 * r190414;
        double r190416 = 1.0;
        double r190417 = r190415 + r190416;
        return r190417;
}

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