Average Error: 0.0 → 0.0
Time: 898.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r181411 = x;
        double r181412 = r181411 * r181411;
        double r181413 = 1.0;
        double r181414 = r181412 + r181413;
        return r181414;
}
↓
double f(double x) {
        double r181415 = x;
        double r181416 = r181415 * r181415;
        double r181417 = 1.0;
        double r181418 = r181416 + r181417;
        return r181418;
}

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