Average Error: 0.0 → 0.0
Time: 487.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r144711 = x;
        double r144712 = r144711 * r144711;
        double r144713 = 1.0;
        double r144714 = r144712 + r144713;
        return r144714;
}
↓
double f(double x) {
        double r144715 = x;
        double r144716 = r144715 * r144715;
        double r144717 = 1.0;
        double r144718 = r144716 + r144717;
        return r144718;
}

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